----------codeforces/topcoder
mfcheer
他不停地跑啊跑 就为了追上那个曾经被寄予厚望的自己
展开
-
Codeforces Round #296 (Div. 2) B. Error Correct System
题目链接:http://codeforces.com/contest/527/problem/B代码:#include<algorithm>#include<iostream>#include<string>#include<cstdio>#include<cstring>#include<queue>using namespace std;int p[28][28];int n;in原创 2015-06-05 17:16:02 · 391 阅读 · 0 评论 -
Codeforces Round #301 C (Div. 2) 【dfs】
题目链接:http://codeforces.com/contest/540/problem/C(最近 unhappy!)题意:初始时候在一个破碎的冰块上,每次只能走到临近的四个未破碎冰块上。未破碎的冰块被踩后变为破碎。且不能在冰块上停留。踩上破碎的冰块就会掉入此坐标。问 是否可以在掉进给定的坐标。代码:#include <stdio.h>#include <iostream>#include原创 2015-06-05 18:10:17 · 405 阅读 · 0 评论 -
Codeforces Round #267 (Div. 2) A B C
题目链接:http://codeforces.com/contest/467 A 水 代码:#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <string>#include <queue>#include <set>using namespace std;int n原创 2015-06-06 01:41:35 · 442 阅读 · 0 评论 -
Codeforces Round #312 (Div. 2) B. Amr and The Large Array
题目链接:http://codeforces.com/contest/558/problem/B题意:给你一组数字。选择一个尽量短的区间,使其包含 数组中出现次数最多的元素的全部元素,求区间起始位置代码:#include <stdio.h>#include <ctime>#include <math.h>#include <limits.h>#include <complex>#inclu原创 2015-07-26 21:21:25 · 549 阅读 · 0 评论 -
Codeforces Round #312 (Div. 2) C
题目链接:http://codeforces.com/contest/558/problem/C题意: 有n个瓶子,每个瓶子都有相应的水的数量,瓶子的水量可以乘2或者除2,求出最少多少步骤可以使瓶子中的所有水相等。思路: 将所有瓶子可以到达的毫升数及其步数记录起来,得到可以n个瓶子都能到达的毫升数的最小步数。代码:#include <stdio.h>#include <ctime>#inc原创 2015-07-28 11:49:48 · 487 阅读 · 0 评论 -
Codeforces Round #313 (Div. 2) ABC
A http://codeforces.com/contest/560/problem/A 判断给出的数是否能组成所有自然数。水题int a[1010];bool b[1000010];int main(){ int n; while (scanf("%d", &n) != EOF) { memset(b,false,sizeof(b));原创 2015-07-23 01:19:38 · 733 阅读 · 0 评论 -
Codeforces Round #311 (Div. 2) C. Arthur and Table
C. Arthur and Tabletime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputArthur has bought a beautiful big table原创 2015-08-04 10:49:57 · 452 阅读 · 0 评论 -
Codeforces Round #316 (Div. 2)
A http://codeforces.com/contest/570/problem/A 随便搞一下int n, m;long long cnt[1000];struct node{ long long nb; long long sum;}res[1000],ans[1000];bool cmp(node a, node b){ if (a.sum != b.s原创 2015-08-20 00:55:59 · 55 阅读 · 0 评论 -
Codeforces Round #321 (Div. 2) ABC
题目链接:http://codeforces.com/contest/580A 求非递减区间的最大长度,递推即可B 按money值由大到小排序,求#include <iostream>#include <stdio.h>#include <string>#include <algorithm> #include <set> #include <map> #include <stri原创 2015-09-24 10:06:12 · 324 阅读 · 0 评论 -
Codeforces Round #333 (Div. 2) C. The Two Routes
题目链接:http://codeforces.com/contest/602/problem/C题意:给你一个完全图,edge是铁路或公路,火车只走铁路,汽车只公路。求使得火车汽车都从1到达n点所需的最短时间,并且两车途中不得同时到达同一点(除了n点)。解法:由于是完全图,一定有火车或汽车直接由1到n 。求另一车的最短路径即可。代码:#include <iostream>#include <cma原创 2015-11-28 19:58:03 · 429 阅读 · 0 评论 -
Codeforces Round #334 (Div. 2)
http://codeforces.com/contest/604A:#include <stdio.h>#include <iostream>#include <string.h>#include <algorithm>#include <bitset>#include <math.h>#include <ctype.h>#include <time.h>#include <que原创 2015-12-02 20:28:48 · 317 阅读 · 0 评论 -
Codeforces Round #340 (Div. 2) A B C D
http://codeforces.com/contest/617 A 尽量选择数值较大的#include <iostream>#include <stdio.h>#include <string>#include <string.h>#include <cmath>#include <queue>#include <vector>#include <map>#include <原创 2016-01-24 15:22:25 · 419 阅读 · 0 评论 -
Codeforces Round #303 (Div. 2) A B C D
题目链接:http://codeforces.com/contest/545A:水 代码:#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <string>#include <queue>#include <set>using namespace std;int n, a原创 2015-06-05 17:09:33 · 68 阅读 · 0 评论 -
Codeforces Round #306 (Div. 2) A B C
题目链接:http://codeforces.com/contest/550 A 暴力一发。 代码:#include <iostream>#include <stdio.h>#include <math.h>#include <string>#include <string.h>#include <set>#include <map>#include <vector>#incl原创 2015-06-05 15:57:46 · 778 阅读 · 0 评论 -
Good Bye 2014 A B C
A. New Year Transportationtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputNew Year is coming in Line World原创 2014-12-31 04:48:34 · 1419 阅读 · 0 评论 -
Codeforces Round #277.5 (Div. 2) C
题目: http://codeforces.com/contest/489/problem/C原创 2014-11-18 23:48:49 · 473 阅读 · 0 评论 -
Codeforces Round #279 (Div. 2) A B C
http://codeforces.com/contest/490/problem/AA 题 贪心水题A. Team Olympiadtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstand原创 2014-11-25 23:33:30 · 790 阅读 · 0 评论 -
Codeforces Round #277 (Div. 2) A B
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using na原创 2014-11-18 23:57:45 · 578 阅读 · 0 评论 -
Codeforces Round #278 (Div. 2) A B
A. Giga Towertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputGiga Tower is the tallest and deepest building原创 2014-11-22 15:47:13 · 597 阅读 · 0 评论 -
Codeforces Round #280 (Div. 2) A B C
http://codeforces.com/contest/492A 水题A. Vanya and Cubestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output原创 2014-12-02 07:25:52 · 547 阅读 · 0 评论 -
Codeforces Round #281 (Div. 2) A B
http://codeforces.com/contest/493A 第一次结构体开二维数组。。。A. Vasya and Footballtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputs原创 2014-12-04 10:47:08 · 507 阅读 · 0 评论 -
Codeforces Round #283 (Div. 2) A B
http://codeforces.com/contest/496A:#include #include #include #include #include #include using namespace std;int n;int p[110];int main(){ while (scanf("%d",&n)!=EOF) {原创 2014-12-24 11:46:54 · 582 阅读 · 0 评论 -
Codeforces Round #282 (Div. 2) A B
http://codeforces.com/contest/495A. Digital Countertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output原创 2014-12-27 16:26:04 · 946 阅读 · 0 评论 -
Codeforces Round #271 (Div. 2) A B D
http://codeforces.com/contest/474A 水题 枚举每个字符即可A. Keyboardtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outpu原创 2014-12-11 14:02:15 · 837 阅读 · 0 评论 -
Codeforces Round #284 (Div. 2)
http://codeforces.com/contest/499A水 A. Watching a movietime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outp原创 2014-12-26 19:37:27 · 984 阅读 · 0 评论 -
Codeforces Round #266 (Div. 2) C
http://codeforces.com/contest/466/problem/CC. Number of Waystime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard ou原创 2014-12-14 21:18:06 · 546 阅读 · 0 评论 -
Codeforces Round #346 (Div. 2) ABCDE
题目:http://codeforces.com/contest/659/problems A:#include <iostream>#include <string>using namespace std;int n, a, b;int main(){ while (cin >> n >> a >> b) { int ans; ans = (a原创 2016-04-03 17:10:56 · 360 阅读 · 0 评论