摘要:
Problem StatementCharlie has N pancakes. He wants to serve some of them for breakfast. We will number the pancakes 0 through N-1. For each i, pancake ... 阅读全文
摘要:
A:http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1525题意:前两段都是废话 , 然后给出一个 p( p(a) ) = p(a) 的公式给你 , 符合这个公式的1~n序列属于idempotent , 题目就问有多少个是 non -idempote... 阅读全文
摘要:
题目链接:http://www.kuangbinoj.com:8080/contest.php?cid=1007在ACM交流群的第一场群赛,感觉题目还是不错的。A : 给出一个 1元1次方程 , 求解算是一个模拟题,我做法是将其化成 k1*x + c1 = k2 * x + c2 的形式注意下 。 ... 阅读全文
摘要:
You’ll be Working on the RailroadTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 246Accepted Submi... 阅读全文
摘要:
Distinct SubtreesTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 391Accepted Submission(s): 190Pr... 阅读全文
摘要:
Jimmy’s travel planTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 341Accepted Submission(s): 58P... 阅读全文
摘要:
A。题目:http://acm.timus.ru/problem.aspx?space=1&num=2024题意:求一个包含K个不同字符的集合的最大长度,还有组成这个长度的集合的个数做法:因为求的集合,不需连续 ,直接统计各个字符的出现次数 。 那么答案一就是按出现次数排序再加前K个。 答案二只与K... 阅读全文
摘要:
Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18653Accepted Submission(s): 6129... 阅读全文
摘要:
题目: http://uva.onlinejudge.org/external/128/12849.pdf#include using namespace std;typedef long long LL ;typedef unsigned long long ULL ;typedef pair p... 阅读全文
摘要:
circuitsTime Limit: 30000/15000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 793Accepted Submission(s): 253Problem De... 阅读全文