p3370.cpp

大概POJ上50道比较难的题的代码

#include <iostream>
using namespace std;
const int MAXN = 100010;
int s[MAXN],vi[MAXN];
int main(){
    int c,n,x;
    while(scanf("%d%d",&c,&n) != EOF && c && n){ 
        bool flag(true);
        memset(vi,0,sizeof(vi));
        s[0] = 0;   
        for(int i = 1;i <= n;++i){ 
            scanf("%d",&x);
            s[i] = (s[i-1] + x) % c;
            if(vi[s[i]] && flag){
                for(int j = vi[s[i]]+1;j < i;++j) printf("%d ",j);
                printf("%d\n",i);
                flag = false;
            }
            if(s[i] % c == 0 && flag){
                for(int j = 1;j < i;++j) printf("%d ",j);
                printf("%d\n",i);
                flag = false;
            }
            vi[s[i]] = i;
        }
        if(flag) puts("no sweets");
    }
}