随笔分类 - 数据结构:GCD&&扩展欧几里得&&逆元
摘要:求:3^0 + 3^1 +...+ 3^(N) mod 1000000007 Input Output Input示例 Output示例
阅读全文
摘要:http://acm.hdu.edu.cn/showproblem.php?pid=5976 Detachment Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submis
阅读全文
摘要:A - Getting Difference Time limit : 2sec / Memory limit : 256MB Score : 300 points Problem Statement There is a box containing N balls. The i-th ball
阅读全文
摘要:A. Co-prime Array time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A. Co-prime Array time
阅读全文

浙公网安备 33010602011771号