09 2017 档案
摘要:f(cos(x))=cos(n∗x) holds for all xx. Given two integers nn and mm, you need to calculate the coefficient of x^mxm in f(x)f(x), modulo 9982443539982
阅读全文
摘要:https://www.nowcoder.com/acm/contest/submit/0dff89ad7b8444719df155d507f3e1dd?ACMContestId=3&tagId=4 解析 字符比较 水 AC代码
阅读全文
摘要:VJ 该题 链接 https://vjudge.net/problem/UVA-1584 AC代码 字典序最小输出
阅读全文
摘要:题目链接 http://poj.org/problem?id=3254 转自http://blog.csdn.net/harrypoirot/article/details/23163485
阅读全文
摘要:CS Course Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 593 Accepted Submission(s): 288 Problem
阅读全文
摘要:A Math Problem Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 817 Accepted Submission(s): 344 Pr
阅读全文
摘要:unsigned int 0~4294967295 int -2147483648~2147483647 unsigned long 0~4294967295long -2147483648~2147483647long long的最大值:9223372036854775807long long的最
阅读全文
摘要:AC代码 C. Andryusha and Colored Balloons time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output C
阅读全文

浙公网安备 33010602011771号