cstdio

cf B. Fence

http://codeforces.com/contest/363/problem/B 1 #include <cstdio> 2 #include <cstring&
·2015-11-13 03:42

cf C. Fixing Typos

1 #include <cstdio> 2 #inclu
·2015-11-13 03:42

cf C. Levko and Array Recovery

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 using namespace
·2015-11-13 03:41

cf D. Levko and Array

1 #include <cstdio> 2 #include <cstring> 3 #include
·2015-11-13 03:40

cf B. Levko and Permutation

http://codeforces.com/contest/361/problem/B 1 #include <cstdio> 2 #include <cstring&
·2015-11-13 03:39

cf E. Neatness

1 #include <cstdio> 2 #include <cstring> 3 #include
·2015-11-13 03:39

cf B. Permutation

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 using namespace
·2015-11-13 03:37

cf C. Prime Number

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 #define maxn
·2015-11-13 03:37

cf B. Dima and Text Messages

problem/B 先按照题意说的构造一个字符串s，然后与对比的字符串T比较，看看在字符串T中顺序查找有没有字符串S的所有字符，有输出yes，否则输出no. 1 #include <cstdio
·2015-11-13 03:35

cf C. Dima and Containers

1 #include <cstdio> 2 #include <cstring> 3 #include <queue> 4 #include <
·2015-11-13 03:35

cf D. Xenia and Hamming

1 #include <cstdio>
·2015-11-13 03:34

cf C. Knight Tournament

http://codeforces.com/contest/357/problem/C 1 #include <cstdio> 2 #include <cstring
·2015-11-13 03:33

cf B. Flag Day

http://codeforces.com/contest/357/problem/B   1 #include <cstdio> 2 #include <
·2015-11-13 03:32

cf C. Vasya and Robot

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 using namespace
·2015-11-13 03:32

zoj 3805 Machine

problemId=5337 1 #include <cstdio> 2 #include <cstring> 3 #include <vector>
·2015-11-13 03:31

cf B. Vasya and Public Transport

http://codeforces.com/contest/355/problem/B 1 #include <cstdio> 2 #include <cstring&
·2015-11-13 03:30

cf C. Find Maximum

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 #define maxn
·2015-11-13 03:29

cf D. Queue

http://codeforces.com/contest/353/problem/D 1 #include <cstdio> 2 #include <cstring&
·2015-11-13 03:29

cf B. Two Heaps

1 #include <cstdio> 2
·2015-11-13 03:28

cf B. Jeff and Periods

http://codeforces.com/contest/352/problem/B 1 #include <cstdio> 2 #include <cstring&
·2015-11-13 03:27

cf B. Maximum Absurdity

http://codeforces.com/contest/332/problem/B 1 #include <cstdio> 2 #include <cstring&
·2015-11-13 03:26

cf A. Jeff and Digits

http://codeforces.com/contest/352/problem/A 1 #include <cstdio> 2 #include <cstring&
·2015-11-13 03:25

hdu 1385 Minimum Transport Cost

pid=1385 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm>
·2015-11-13 03:24

cf B. Eight Point Sets

http://codeforces.com/contest/334/problem/B 1 #include <cstdio> 2 #include <cstring&
·2015-11-13 03:24

cf A. Down the Hatch!

http://codeforces.com/contest/332/problem/A 1 #include <cstdio> 2 #include <iostream
·2015-11-13 03:23

cf C. Purification

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 #define maxn
·2015-11-13 03:22

cf B. Road Construction

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 using namespace
·2015-11-13 03:21

hdu Free DIY Tour

pid=1224 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm>
·2015-11-13 03:21

hdu 3371 Connect the Cities

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 #define maxn
·2015-11-13 03:20

cf B. Hungry Sequence

1 #include <cstdio> 2 #include <cstring> 3 #include <iostream> 4 #include <
·2015-11-13 03:19

cf Ping-Pong (Easy Version)

http://codeforces.com/contest/320/problem/B 这道题看了很长时间没看懂, 就是个dfs； 1 #include <cstdio>
·2015-11-13 03:19

cf Magic Numbers

http://codeforces.com/contest/320/problem/A 1 #include <cstdio> 2 #include <cstring&
·2015-11-13 03:18

hdu 1879 继续畅通工程

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 #define maxn
·2015-11-13 03:17

cf Perfect Pair

http://codeforces.com/contest/318/problem/C 1 #include <cstdio> 2 #include <cstring&
·2015-11-13 03:16

hdu 畅通工程

pid=1863 1 #include <cstdio> 2 #include <cstring> 3 #include <iostream>
·2015-11-13 03:15

hdu 畅通工程再续

pid=1875 1 #include <cstdio> 2 #include <cstring> 3 #include <cmath> 4
·2015-11-13 03:15

cf Sereja and Array

http://codeforces.com/contest/315/problem/B 1 #include <cstdio> 2 #include <cstring&
·2015-11-13 03:14

cf Strings of Power

http://codeforces.com/contest/318/problem/B 1 #include <cstdio> 2 #include <cstring&
·2015-11-13 03:13

codeforces Ilya and Matrix

http://codeforces.com/contest/313/problem/C 1 #include <cstdio> 2 #include <cstring&
·2015-11-13 03:13

hdu 1301 Jungle Roads

pid=1301 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm>
·2015-11-13 03:12

hdu 1233 还是畅通工程

pid=1233 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm>
·2015-11-13 03:11

hdu 1198 Farm Irrigation

pid=1198 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm>
·2015-11-13 03:10

hdu 1162 Eddy's picture

pid=1162 1 #include <cstdio> 2 #include <cstring> 3 #include <iostream>
·2015-11-13 03:10

hdu 1102 Constructing Roads

pid=1102 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm>
·2015-11-13 03:09

hdu Largest prime factor

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 #define maxn
·2015-11-13 03:08

hdu Number Sequence

1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 using namespace
·2015-11-13 03:07

hdu Examining the Rooms

a[i][j]=a[i-1][j-1]+(i-1)*a[i-1][j]; 1 #include <cstdio> 2 #include <cstring> 3
·2015-11-13 03:07

hdu Big Number

1 #include <cstdio> 2 #include <cstring> 3 #include <cmath> 4 using namespace
·2015-11-13 03:06

hdu Fibonacci

1 #include <cstdio> 2 #include <cstring> 3 #include <cmath> 4 #include <algorithm
·2015-11-13 03:05

hdu Joseph

  1 #include <cstdio> 2 #include <iostream> 3 #include <algorithm>
·2015-11-13 03:05
上一页 25 26 27 28 29 30 31 32 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他