cstdio

HDU 2037 今年暑假不AC

  /*2012-05-07 12:29:59 Accepted 2037 0MS 268K 621 B C++ */ #include<cstdio> #include
·2015-11-13 01:05

POJ 2785 4 Values whose Sum is 0

  /*Accepted 49208K 5188MS C++ 1146B 2012-05-04 23:56:30 */ #include<cstdio> #include
·2015-11-13 01:04

UVA 10596 - Morning Walk

#include<cstdio>#include<cstring>#include<cstdlib>#define MAXN 205int d[MAXN], p[MAXN
·2015-11-13 01:03

POJ 1316 Self Numbers

  /*Accepted 168K 16MS C++ 412B 2012-05-04 22:50:01 */ #include<cstdio> #include<
·2015-11-13 01:03

UVA 784 - Maze Exploration

#include<cstdio>#include<cstring>#include<cstdlib>char a[35][85];char b[100];const
·2015-11-13 01:02

CSUOJ 1010: Water Drinking

与池塘相连 #include<cstdio>#include<cstring>#include<cstdlib>#define MAXN 100005int
·2015-11-13 01:01

CSUOJ 1226: ACM小组的内战

#include<cstdio>#include<cstring>#include<cstdlib>#define SIZE 30
·2015-11-13 01:01

POJ 3620-Avoid The Lakes

/*Accepted 288K 47MS C++ 1080B 2012-07-23 12:20:58*/ #include<cstdio> #inclu
·2015-11-13 01:00

POJ -1753-Flip Game

#include<cstdio>#include<cstring>#include<cstdlib>int map[4][4];int dx[] = { 1, -1,
·2015-11-13 01:59

月赛两道能A的题

#include<cstdio>#include<cstring>#include<cstdlib>int n, m, x1, y1, x2, y2;int dx[]
·2015-11-13 01:58

UVA 10050 - Hartals

#include<cstdio>#include<string.h>const int MAXN = 3657;bool d[MAXN];int main(){ int T
·2015-11-13 01:54

UVA 10041 - Vito's Family

#include<cstdio>#include<stdlib.h>#include<algorithm>#define MAXD 505using namespace
·2015-11-13 01:31

UVA 694-The Collatz Sequence

#include<cstdio>int main(){ long long a, b; int cnt = 0
·2015-11-13 01:18

POJ 1015 Jury Compromise (动态规划)

  #include <cstdio> #include <cstring> #include <cstdlib> #include <algorithm
·2015-11-13 01:24

HDU 1698 Just a Hook（线段树区间覆盖）

线段树基本操作练习，防手生 #include <cstdio> #include <cstring> #include <cstdlib> #define
·2015-11-13 01:22

HDU 2222 Keywords Search (AC自动机模板题)

一组数据： 1 3 sss sss sss sss ans：3   #include <cstdio> #include <cstdlib> #
·2015-11-13 01:20

uva 10548 - Find the Right Changes(拓展欧几里得)

#include <cstdio> #include <cstring> #include <cmath> #include &l
·2015-11-13 00:45

HDU3549+Ford-Fulkerson

Ford-Fulkerson算法 基本没什么技巧 View Code 1 #include<cstdio> 2 #include<cstring> 3 #
·2015-11-13 00:17

HDU3549（2）+EK算法

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<cstdlib> 4
·2015-11-13 00:17

POJ1386+欧拉回路

View Code 1 #include<cstdio> 2 #include<vector> 3 #include<iostream> 4 #include
·2015-11-13 00:15

POJ3616

View Code 1 #include<cstdio> 2 #include<cstdlib> 3 #include<algorithm> 4
·2015-11-13 00:11

POJ1664

View Code 1 #include<cstdio> 2 #include<cstdlib> 3 #define N 12 4 int f[N][N];
·2015-11-13 00:10

POJ3628

  01背包 View Code 1 #include<cstdio> 2 #include<cstdlib> 3 #include<cstring
·2015-11-13 00:10

POJ2109+二分

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<cmath> 4 #define
·2015-11-13 00:09

POJ2965+枚举

View Code 1 #include<cstdio> 2 #include<cstring> 3 #define N 4 4 int map[N+1][N
·2015-11-13 00:08

HDU1253

View Code 1 #include<cstdio> 2 #include<cstdlib> 3 #include<cstring> 4 #include
·2015-11-13 00:06

POJ2251

View Code 1 #include<cstdio> 2 #include<cstring> 3 #include<cstdlib> 4 #include
·2015-11-13 00:02

Poj2786

#include<cstdio> #include<queue> #include<iostream> #include<cstdlib> #include
·2015-11-13 00:00

POJ 1006 Biorhythms 数论-（孙子定理）

代码如下：   #include <iostream> #include <cstdio> #include <cstdlib> #i
·2015-11-13 00:27

HDU 1073

pid=1073 模拟oj判题 随便搞，开始字符串读入的细节地方没处理好，wa了好久 #include <iostream> #include <cstdio>
·2015-11-13 00:54

CF 382C

读完题立刻知道怎么做，然后分类讨论到吐血，写挂了，巨蠢 #include <iostream> #include <algorithm> #include <cstdio
·2015-11-13 00:53

HDU 3378

有已经分出胜负但还在杀的情况出现，所以要每次杀操作前判断是否分出胜负，如果已经分出胜负了就continue，不用接着往下操作 #include <iostream> #include <cstdio
·2015-11-13 00:52

[HNOI2002]营业额统计

id=1588 splay，一种功能超级强大的数据结构，且较易实现，核心操作是旋转 求前驱后继 #include <iostream> #include <cstdio
·2015-11-13 00:50

最长回文字符串

求最长回文字符串： #include<cstdio>#include<cstdlib>#include<cmath>#include<algorithm>
·2015-11-13 00:10

求组合

#include <iostream> #include<cstring> #include<cstdio> #include<cstdlib>
·2015-11-13 00:22

zoj 1586

problemCode=1586     //zoj 1586 #include<iostream> #include<cstdio> using
·2015-11-13 00:09

zoj 1372

problemCode=1372#include<iostream> #include<cstdio> using namespace std; #define N 1005
·2015-11-13 00:08

uva 12284 直接判断

思路：见代码 #include<iostream> #include<cstring> #include<cstdio> #include<algorithm
·2015-11-13 00:28

uva 12549 最大流

#include <cstring> #include <algorithm> #include <vector> #include <cstdio>
·2015-11-13 00:27

uva 12544 无向图最小环

#include<iostream> #include<cstdio> #include<cstring> #include<algo
·2015-11-13 00:27

uva 12587 二分枚举

#include<set> #include<map> #include<cmath> #include<queue> #include<cstdio
·2015-11-13 00:26

poj 3017 单调队列优化动态规划

#include<set> #include<map> #include<cmath> #include<queue> #include<cstdio
·2015-11-13 00:23

hdu 3909 数独扩展

#include<set> #include<map> #include<cmath> #include<queue> #include<cstdio
·2015-11-13 00:22

hdu 3594 仙人掌图

#include<set> #include<map> #include<cmath> #include<queue> #include<cstdio
·2015-11-13 00:21

hdu 4744 最小费用流

#include <cstdio> #include <queue> #include <cstring> #include <cmath> #define
·2015-11-13 00:20

2013 成都网络赛 1003 1004 1007 1008 1010

#include<set> #include<map> #include<cmath> #include<queue> #include<cstdio
·2015-11-13 00:18

hdu 3450 树状数组

#include<set> #include<map> #include<cmath> #include<queue> #include<cstdio
·2015-11-13 00:16

hdu 3111 DLX解数独

#include<set> #include<map> #include<cmath> #include<queue> #include<cstdio
·2015-11-13 00:15

hdu 3663 DLX

#include<set> #include<cmath> #include<queue> #include<cstdio> #include<
·2015-11-13 00:14

hdu 2295 DLX

思路：裸的DLX重复覆盖 #include<set> #include<cmath> #include<queue> #include<cstdio&
·2015-11-13 00:13
上一页 33 34 35 36 37 38 39 40 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他