cstdio

hdu 七夕节

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

hdu 相遇周期

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

hdu 2106 decimal system

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

hdu 找新朋友

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

hdu 1081 To The Max

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

hdu 1559 最大子矩阵

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

ural 1586. Threeprime Numbers

1 #include <cstdio> 2 #include <cstring> 3 #define m 1000000009 4 using namespace std
·2015-11-13 03:00

poj 3792 Area of Polycubes

id=3792 1 #include <cstdio> 2 #include <cstring> 3 #include <cmath> 4 #
·2015-11-13 03:59

ural 1017. Staircases

space=1&num=1017 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm
·2015-11-13 03:58

hdu 2992 Hotel booking

pid=2992 1 #include <cstdio> 2 #include <cstring> 3 #include <map>
·2015-11-13 03:57

ural 1073. Square Country

space=1&num=1073 1 #include <cstdio> 2 #include <cstring> 3 #include <cmath
·2015-11-13 03:57

Poj 3246 Balanced Lineup（线段树基础）

  #include <iostream> #include <algorithm> #include <cmath> #include <cstdio
·2015-11-13 03:42

HDU 3336 Count the string KMP

AC代码：   #include <iostream> #include <cstdio> #include <cstdlib> #
·2015-11-13 03:40

HDU 1060 Leftmost Digit

pid=1060 取对数，然后求小数部分，然后求幂，ok 代码如下：   #include <iostream> #include <cstdio>
·2015-11-13 03:24

HDU 1432 Lining Up （POJ 1118）

#include<cstdio> #include<cstring> #include<string> #include<queue> #include
·2015-11-13 03:38

POJ 1046 Color Me Less

  /* Accepted 176K 0MS C++ 664B 2012-05-04 22:34:22 */ #include<cstdio> #include<
·2015-11-13 03:10

三道水题

水题也要细心 POJ 1004： /*Accepted 180K 0MS C++ 187B 2012-04-26 16:48:20 */ #include<cstdio> double
·2015-11-13 03:09

ACdream OJ 1140 Counting Triangles

#include<cstdio> #include<cstring> #include<cstdlib> #include<iostream> #
·2015-11-13 03:08

POJ 1631 Bridging signals

/*Accepted 296K 125MS C++ 581B 2012-04-22 19:00:19 */ #include<cstdio> #include<cstring&
·2015-11-13 03:07

COJ 1163 寒衣调（校赛D题）

id=1163 a[i - 1]表示i的前缀积，b[i + 1]表示i的后缀积，两者相乘取模就是所需的结果 #include<cstdio> #define MAXN 100005
·2015-11-13 03:05

POJ 2192 Zipper

/*Accepted 220K 0MS C++ 911B 2012-04-22 10:42:42 */ #include<cstdio> #include<cstring>
·2015-11-13 03:05

POJ 3264 Charm Bracelet

/*Accepted 240K 266MS C++ 563B 2012-04-22 09:13:42 */ #include<cstdio> #include<cstdlib>
·2015-11-13 03:04

COJ 1165(校赛F题) Nearest Numbers

  #include<cstdio> #include<cstring> #include<cstdlib> #define MAXD 1000005
·2015-11-13 03:03

一道关于DOTA的模拟题（CSU2012校赛）

#include<cstdio> #include<cstring> #include<cstdlib> const int bk[] = { 0, 200
·2015-11-13 03:02

COJ 1156 Switching bulbs

/*Accepted 2352 kb 292 ms C++ 1013 B 2012-04-14 21:39:44 */ #include<cstdio> #include<cstring
·2015-11-13 03:02

POJ 1258 Agri-Net

  /*Accepted 332K 16MS C++ 987B 2012-07-23 23:03:38 */ #include<cstdio> #include<cstring
·2015-11-13 03:00

POJ 3253 Fence Repair

  /*Accepted 348K 32MS C++ 644B 2012-07-30 16:32:44*/ #include<cstdio>
·2015-11-13 03:00

POJ 1159 Palindrome

  #include<cstdio> #include<cstring> #include<cstdlib> #define MAXN 5005
·2015-11-13 03:59

POJ 2250 Compromise

  /*Accepted 224K 0MS C++ 1186B 2012-04-11 11:19:14 */ #include<cstdio> #include<
·2015-11-13 03:58

POJ 1458 Common Subsequence

0MS C++ 570B 2012-04-11 10:26:03 */ #include<cstdlib> #include<cstring> #include<cstdio
·2015-11-13 03:58

POJ 1163 The Triangle

16MS C++ 601B 2012-04-11 10:12:15 */ #include<cstring> #include<cstdlib> #include<cstdio
·2015-11-13 03:57

POJ 2081 Recaman's Sequence

  #include<cstdio> #include<cstring> #include<cstdlib> bool vis[4000000
·2015-11-13 03:56

POJ 1579 Function Run Fun

  /* Accepted 236K 0MS C++ 717B 2012-04-11 09:39:09 */ #include<cstdio> #include<
·2015-11-13 03:55

POJ 1050 To the Max

  /* Accepted 216K 32MS C++ 775B 2012-04-11 09:05:12 */ #include<cstdio> #include<
·2015-11-13 03:54

POJ 1469 COURSES

#include<cstdio>#include<cstring>#include<cstdlib>#define MAX
·2015-11-13 03:50

hdu 1874 畅通工程续

#include<cstdio>#include<cstring>#include<cstdlib>
·2015-11-13 03:46

UVA 10803 - Thunder Mountain

#include<cstdio>#include<cstring>#include<cstdlib>#include<cmath>const int INF
·2015-11-13 03:44

Section 1.3 milk

/*ID:yucept21LANG:C++TASK:milk*/#include<cstdio>#include<cstdlib>#include<cstring>typedef
·2015-11-13 03:43

UVA 108 - Maximum Sum

#include<cstdio>#include<cstring>#include<cstdlib>#define MAXN 110int n, ans;int mat
·2015-11-13 03:41

UVA

#include<cstdio>#include<cstdlib>#include<cstring>int main(){ int a[10];
·2015-11-13 03:41

UVA 11054 - Wine trading in Gergovia

#include<cstdio>#include<cstdlib>#define MAXN 100010int a[MAXN];long long min, w;int n;int
·2015-11-13 03:40

UVA 10341 - Solve It

#include<cstdio>#include<cstdlib>#include<cmath>const double T = 10e-8;double p,
·2015-11-13 03:39

UVA 10361 - Automatic Poetry

#include<cstdio>#include<cstring>#inclu
·2015-11-13 03:38

UVA 11129 - An antiarithmetic permutation

#include<cstdio>#include<cstri
·2015-11-13 03:38

UVA 10878 - Decode the tape

#include<cstdio>#include<cstdlib>#include<cstring>const int exp[] = { 0, 128, 64, 32
·2015-11-13 03:37

UVA 10010 - Where's Waldorf?

#include<cstdio>#include<cstring>#include<cstdlib&g
·2015-11-13 03:36

UVA 644 - Immediate Decodability

#include<cstdio>#include<cstring>#include<cstdlib>#define
·2015-11-13 03:35

UVA 167 - The Sultan's Successors

#include<cstdio>#include<cstdlib&g
·2015-11-13 03:35

UVA 10815 - Andy's First Dictionary

#include<cstdio>#include<cstring>#include<cstdlib>#include<ctype.h>char word[
·2015-11-13 03:34

Section 1.2 dualpal

/*ID:yucept21LANG:C++TASK:dualpal*/#include<cstdio>#include<cstring>#include<cstdlib>
·2015-11-13 03:33
上一页 26 27 28 29 30 31 32 33 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他