2014年4月9日
hdu 1575 Tr A (二分矩阵)
摘要： Tr ATime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2449Accepted Submission(s): 1819Problem DescriptionA为一个方阵，则Tr A表示A的迹（就是主对角线上各项的和），现要求Tr(A^k)%9973。Input数据的第一行是一个T，表示有T组数据。每组数据的第一行有n(2 8 #include 9 #define N 997310 struct matrix{11 int g[15]... 阅读全文
posted @ 2014-04-09 21:21 heaventouch 阅读(221) 评论(0) 推荐(0) 编辑
hdu 1695 GCD (欧拉函数+容斥原理)
摘要： GCDTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5064Accepted Submission(s): 1818Problem DescriptionGiven 5 integers: a, b, c, d, k, you're to find x in a...b, y in c...d that GCD(x, y) = k. GCD(x, y) means the greatest common divisor of x an 阅读全文
posted @ 2014-04-09 19:57 heaventouch 阅读(271) 评论(0) 推荐(0) 编辑
hdu 2588 GCD (欧拉函数)
摘要： GCDTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 890Accepted Submission(s): 396Problem DescriptionThe greatest common divisor GCD(a,b) of two positive integers a and b,sometimes written (a,b),is the largest divisor common to a and b,For example,( 阅读全文
posted @ 2014-04-09 13:40 heaventouch 阅读(256) 评论(0) 推荐(0) 编辑