随笔分类 -  组合数学——抽屉原理

find a multiple
摘要：DescriptionThe input contains N natural (i.e. positive integer) numbers ( N #define M 10001int a[M], mod[M];int main(){ int n, i, sum, begin, end; while(scanf("%d", &n) != EOF){ sum = 0; for(i = 1; i 0) ... 阅读全文
posted @ 2013-08-08 20:37 心中的阿哲 阅读(307) 评论(0) 推荐(0)