摘要：Halloween treatsTime Limit: 2000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u[Submit] [Go Back] [Status] DescriptionEvery year there is the same problem at Halloween: Each neighbour is only willing to give a certain total number of sweets on that day, no matter how many children call o 阅读全文

摘要：Find a multipleTime Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u[Submit] [Go Back] [Status] DescriptionThe input contains N natural (i.e. positive integer) numbers ( N #include const int N = 10001;int a[N],sum[N],visit[N] ;int n;void print(int i,int j){ printf("%d\n&qu 阅读全文