cstdlib

poj2560

< iostream > #include < cstdio > #include < cstdlib
·2015-11-02 14:16

poj2538

< iostream > #include < cstdio > #include < cstdlib
·2015-11-02 14:14

HDU 3836 No Gambling

如果后手不管先手任他走，那么先手要先一步走到； View Code #include<iostream> #include<cstdio> #include<cstdlib
·2015-11-02 12:39

poj 2234 Matches Game

一道典型的Nim博弈： View Code #include<iostream> #include<cstdio> #include<cstdlib>
·2015-11-02 12:38

poj 2975 Nim

这个题是要你求如果先手能赢，有几种策略； View Code #include<iostream> #include<cstdio> #include<cstdlib
·2015-11-02 12:38

HDOJ1525&POJ2348 Euclid's Game

2倍以上，这时他就可以掌握全局的胜利； View Code #include<iostream> #include<cstdio> #include<cstdlib
·2015-11-02 12:35

HDOJ2897 邂逅明下

1,2*p+2*q]必胜；   View Code #include<iostream> #include<cstdio> #include<cstdlib
·2015-11-02 12:35

AC自动机模板

View Code #include <cstdio> #include <cstdlib> #include <string> #include <
·2015-11-02 11:26

Topcoder SRM 637 (Div.2)

A.GreaterGameDiv2 不能更水 1 #line 7 "GreaterGameDiv2.cpp" 2 #include<cstdio> 3 #include <cstdlib
·2015-11-02 11:50

一个很方便的比较标程数据和自己数据的程序~

1 #include<iostream> 2 #include<cstring> 3 #include<fstream> 4 #include<cstdlib
·2015-11-02 11:36

hdu 3938 Portal离线并查集

article/details/7439187 1 #include<iostream> 2 #include<cstdio> 3 #include<cstdlib
·2015-11-02 11:39

poj1276

多重背包，但由于是bool型，可以使用特殊方法优化效率使得效率与01背包相同 View Code #include <iostream> #include <cstdlib
·2015-11-02 10:40

poj1323

简单题 View Code #include <iostream> #include <cstdlib> #include <cstdio> #include
·2015-11-02 10:39

poj1326

简单题 View Code #include <iostream> #include <cstdlib> #include <cstdio> #include
·2015-11-02 10:38

poj1491

简单题 View Code #include <iostream> #include <cstdlib> #include <cstdio> #include
·2015-11-02 10:37

poj1218

简单题 View Code #include <iostream> #include <cstdlib> #include <cstdio> #include
·2015-11-02 10:37

poj1492

简单题 View Code #include <iostream> #include <cstdio> #include <cstdlib> #include
·2015-11-02 10:36

poj1543

简单题 View Code #include <iostream> #include <cstdlib> #include <cstdio> #include
·2015-11-02 10:35

poj1597

简单题 View Code #include <iostream> #include <cstdio> #include <cstdlib> #include
·2015-11-02 10:34

poj1595

素数筛 View Code #include <iostream> #include <cstdlib> #include <cstdio> #include
·2015-11-02 10:33

poj1135

最短路变形 View Code #include <iostream> #include <cstdlib> #include <cstdio> #
·2015-11-02 10:32

poj1363

栈模拟 View Code #include <iostream> #include <cstdlib> #include <cstdio> #include
·2015-11-02 10:29

poj1477

简单题 View Code #include <iostream> #include <cstdlib> #include <cstdio> #include
·2015-11-02 10:28

poj1476

递推 View Code #include <iostream> #include <cstdio> #include <cstdlib> #include
·2015-11-02 10:28

poj1520

排序 View Code #include <iostream> #include <cstdlib> #include <cstdio> #include
·2015-11-02 10:27

poj2531

< iostream > #include < cstdio > #include < cstdlib
·2015-11-02 10:25

poj2524

< iostream > #include < cstdio > #include < cstdlib
·2015-11-02 10:24

poj2590

< iostream > #include < cstdio > #include < cstdlib
·2015-11-02 10:22

poj2696

< iostream > #include < cstdio > #include < cstdlib
·2015-11-02 10:20

poj2681

< iostream > #include < cstdio > #include < cstdlib
·2015-11-02 10:19

poj2663

< iostream > #include < cstdio > #include < cstdlib
·2015-11-02 10:18

poj2623

< iostream > #include < cstdio > #include < cstdlib
·2015-11-02 10:17

poj2612

< iostream > #include < cstdio > #include < cstdlib
·2015-11-02 10:16

poj2606

View Code #include < iostream > #include < cstdio > #include < cstdlib > #
·2015-11-02 10:15

poj2608

< iostream > #include < cstdio > #include < cstdlib
·2015-11-02 10:15

poj2602

< iostream > #include < cstdio > #include < cstdlib
·2015-11-02 10:14

poj2785

< iostream > #include < cstdio > #include < cstdlib
·2015-11-02 10:13

poj2782

< iostream > #include < cstdio > #include < cstdlib
·2015-11-02 10:12

UVa 567: Risk

iostream> #include <cstdio> #include <cstring> #include <cmath> #include <cstdlib
·2015-11-02 09:03

杭电2055An easy problem

pid=2055 自己的代码甚是脑残，实在没有想出其他方法来，但还是可以AC的： View Code #include <cstdlib> #include <iostream
·2015-11-02 09:34

各种排序算法

#include <iostream> #include <cstdio> #include <cstring> #include <cstdlib>
·2015-11-02 09:51

srand() rand() time(0)

标准库<cstdlib>（被包含于<iostream>中）提供两个帮助生成伪随机数的函数：函数一：int rand(void)；从srand (seed)中指定的
·2015-11-01 16:32

bitset实验

#include <iostream> #include <bitset> #include <cstdio> #include <cstdlib>
·2015-11-01 15:59

POJ 3130 半平面交＋模版改进

View Code 1 #include <cstdio> 2 #include <cstdlib> 3 #include <cstring>
·2015-11-01 14:47

POJ 1830 Gauss

736K 32MS G++ 1411B 2012-06-17 01:01:45 2 #include <cstdio> 3 #include <cstdlib
·2015-11-01 14:46

POJ 1014 我连背包都不会了。。。囧。。。

1014 Accepted 824K 0MS G++ 1387B 2 #include <cstdio> 3 #include <cstdlib
·2015-11-01 14:46

POJ 3761 not(思路＋想法) 题

wizmann 3761 Accepted 8576K 547MS G++ 912B 2 #include <cstdio> 3 #include <cstdlib
·2015-11-01 14:44

ZOJ 3531 模拟＋BFS

View Code 1 #include <cstdio> 2 #include <cstdlib> 3 #include <cstring>
·2015-11-01 14:43

POJ 1027 “暴力”模拟

1027 Accepted 260K 375MS C++ 3250B 2 #include <cstdio> 3 #include <cstdlib
·2015-11-01 14:43

POJ 2345

250MS G++ 1302B 2 #include <cstdio> 3 #include <cstring> 4 #include <cstdlib
·2015-11-01 14:42
上一页 29 30 31 32 33 34 35 36 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他