- 博客(11)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 Codeforces Round #224 (Div. 2)-C. Arithmetic Progression
原题链接 C. Arithmetic Progression time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Everybody knows what an arithmetic progression is. Let us r
2016-11-28 20:50:46
393
原创 Codeforces Round #180 (Div. 2)-B. Sail
原题链接 B. Sail time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output The polar bears are going fishing. They plan to sail from (sx, sy) to (ex, ey
2016-11-28 20:44:22
443
原创 Codeforces Round #180 (Div. 2)-A. Snow Footprintsv
原题链接 A. Snow Footprints time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output There is a straight snowy road, divided into n blocks. The blocks
2016-11-28 20:40:42
332
原创 Codeforces Round #241 (Div. 2)-A. Guess a number!
原题链接 A. Guess a number! time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output A TV show called “Guess a number!” is gathering popularity. The wh
2016-11-28 20:17:32
255
原创 Codeforces Round #281 (Div. 2)-D. Vasya and Chess
原题链接 D. Vasya and Chess time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Vasya decided to learn to play chess. Classic chess doesn’t seem
2016-11-28 20:15:14
343
原创 Codeforces Round #286 (Div. 2)-A. Mr. Kitayuta's Gift
原题链接 A. Mr. Kitayuta’s Gift time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Mr. Kitayuta has kindly given you a string s consisting of low
2016-11-28 19:57:26
322
原创 Codeforces Round #325 (Div. 2)-D. Phillip and Trains
原题链接 D. Phillip and Trains time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output The mobile application store has a new game called “Subway Roll
2016-11-28 19:50:51
766
原创 各排序算法的实现及性能比较
#include <cstdio>#include <cstring>#include <ctime>#include <iostream>using namespace std;const int maxn=100+5;void Display(int a[]){ cout << "排序过后的数组为:" << endl; for(int i=0;i<maxn;i++)
2016-11-27 19:12:23
375
原创 POJ2549-Sumsets【折半搜索】
原题链接 Sumsets Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10698 Accepted: 2919 DescriptionGiven S, a set of integers, find the largest d such that a + b + c = d where a, b
2016-11-01 16:12:34
353
原创 POJ3977-Subset【双向搜索】
原题链接 Subset Time Limit: 30000MS Memory Limit: 65536K Total Submissions: 3360 Accepted: 609 DescriptionGiven a list of N integers with absolute values no larger than 1015, find a non empty s
2016-11-01 14:10:41
415
原创 POJ2785-4 Values whose Sum is 0【折半搜索】
原题链接 4 Values whose Sum is 0 Time Limit: 15000MS Memory Limit: 228000K Total Submissions: 20378 Accepted: 6114 Case Time Limit: 5000MS DescriptionThe SUM problem can be formulated as fo
2016-11-01 14:01:57
298
vega56刷64所需工具及文件修正版
2019-01-08
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人