摘要:
#1334 : Word Construction #1334 : Word Construction 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 Given N words from the top 100 common words in English (see 阅读全文
摘要:
Maximum Sequence Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1750 Accepted Submission(s): 813 阅读全文
摘要:
Is Derek lying? Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1197 Accepted Submission(s): 648 阅读全文
摘要:
Problem Description Talented Mr.Tang has n strings consisting of only lower case characters. He wants to charge them with Balala Power (he could chang 阅读全文
摘要:
Aeroplane chess Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4033 Accepted Submission(s): 2577 阅读全文
摘要:
/* 题意: 对于每个数字a[i]找到一个数num[i],num[i]的欧拉函数值大于等于a[i], 求找到的所有数的最小和。 */ #include #include #include #include #include #include using namespace std; typedef long long LL; const int N = 1e6 + 10; int a... 阅读全文
摘要:
G=0; for(i=1;i<N;i++) for(j=i+1;j<=N;j++) { G+=gcd(i,j); } SampleInput 10 100 200000 0 SampleOutput 67 13015 143295493160 阅读全文
摘要:
/* 求1到2^64-1之间的数,这个数至少有两个不同数的正整数的幂,按从小到大的顺序输出! 要是两个不同正整数的幂,则它必定是一个正整数的合数幂(这样才可以继续分解出另外一个数的幂形式) */ #include #include #include #include #include #include #include using namespace std; typedef lo... 阅读全文
摘要:
求n^k的前三位以及后三位;后三位可用快速幂求解;求n^k的前三位:n可以写成10^a(a为小数)的形式。n^k=(10^a)^k,即10^(a*k),a*k可以写成x(整数)+y(小数)的形式;函数:fmod(x,1)可以求出x的小数部分,因此用fmod(a*k,1)即可求出y。 阅读全文
摘要:
A. Functions again time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A. Functions again tim 阅读全文