摘要:
#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 阅读全文
摘要:
/* 题意: 对于每个数字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... 阅读全文
摘要:
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 阅读全文