摘要： Another Easy ProblemTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64u[Submit] [Go Back] [Status]Descriptionxtt最近学习了高斯消元法解方程组,现在他的问题来了，如果是以下的方程，那么应该如何解呢?C(n1,m1)==0 (mod M)C(n2,m2)==0 (mod M)C(n3,m3)==0 (mod M)................C(nk,mk)==0 (mod M)xtt希望你告诉他满足条件的最大的M其中C(i,j)表示组合数,例如C 阅读全文

摘要： DivisorsTime Limit:1000MSMemory Limit:65536KTotal Submissions:9940Accepted:2924DescriptionYour task in this problem is to determine the number of divisors ofCnk. Just for fun -- or do you need any special reason for such a useful computation?InputThe input consists of several instances. Each instanc 阅读全文

摘要： Happy 2006Time Limit:3000MSMemory Limit:65536KTotal Submissions:9049Accepted:3031DescriptionTwo positive integers are said to be relatively prime to each other if the Great Common Divisor (GCD) is 1. For instance, 1, 3, 5, 7, 9...are all relatively prime to 2006.Now your job is easy: for the given i 阅读全文