我辈皆愚

//2615529 2011-08-04 21:02:16 Accepted 2812 C 0 160 ylwh!#include #include #include int main(){ char s[256]; int sum, i; whil

//2619230 2011-08-08 13:18:12 Accepted 1914 C++ 130 4720 ylwh!#include #include #include #include #include using namespace std;

Sunny Cup 2003 - Preliminary RoundApril 20th, 12:00 - 17:00 Problem E: QS NetworkIn the planet w-503 of galaxy cgb, there is a kind

ZOJ Problem Set - 2326Tangled in CablesTime Limit: 1 Second      Memory Limit: 32768 KB You are the owner of SmallCableCo and ha

//2605186 2011-07-29 15:33:54 Accepted 1542 C++ 60 416 ylwh!#include #include #include #include #include #include #define N 10

//zoj1203你们什么都没看到。。。下边的都是错觉，是错觉，错觉，嗯、、、、、、

//2627641 2011-08-14 23:54:06 Accepted 1952 C 10 324 ylwh@Unknown#include #include #include #define N 202#define MAX 200000000i

【WA了好多次，不过值了，对于kruskal和prim都有进一步的了解//2622383 2011-08-11 11:11:35 Accepted 3204 C++ 130 240 ylwh！//2622381 2011-08-11 1

果断按自己的思路写~~~BFS~~不过貌似是数据太弱了吧。。。。。。。。。。。。。。。。我只能承认自己狗屎运了。。。。。。。。。。。。。。。。。。//2616209 2011-08-05 15:10:44 Accepted 1082 C++ 0 6

一样的代码，使用函数就1164，全部写进main函数里就160，OMG!。。。。。//2617181 2011-08-06 10:18:13 Accepted 1298 C++ 0 1164 ylwh!//人家用的内存是我的零头啊，有木有~~！有

2623181 2011-08-11 21:41:26 Accepted 2048 C++ 910 3492 ylwh@Unknown#include #include #include #include using namespace st

1372Networking//2621481 2011-08-10 15:18:56 Accepted 1372 C 10 160 ylwh！//2621455 2011-08-10 15:08:34 Wrong Answer 1372

1406//2621190 2011-08-10 10:31:25 Accepted 1406 C++ 0 184 ylwh!#include #include #include #include #include #define N 27

//9105982 ylwh 1142 Accepted 164K 16MS C 573B 2011-08-08 10:16:10//2619082 2011-08-08 10:15:46 Accepted 1133 C 20 160 ylwh!#include

//2603599 2011-07-28 16:26:51 Accepted 2883 C++ 50 180 ylwh!#include #include using namespace std;bool cmp(int a, int b){ retur

//2603529 2011-07-28 15:56:55 Accepted 2892 C 220 160 ylwh!//2603528 2011-07-28 15:56:00 Presentation Error 2892 C 210

//ylwh 2607 Accepted 1356K 1047MS G++ 1520B 2011-08-08 20:22:30【SFPA】#include #include #include #include #include using namespace std;

The Suspects2621134 2011-08-10 09:41:21 Accepted 1789 C 0 160 ylwh!#include #include #define N 30001int main(){ int n, m, k

2623177 2011-08-11 21:39:26 Accepted 3317 C++ 0 180 ylwh@Unknown#include #include #include #include using namespace std;

//2625082 2011-08-13 10:36:36 Accepted 1092 C 20 160 ylwh@Unknown#include #include #define N 32#define M 100int main(){ int n,

样例很淫荡............太弱了》。。。。。。。。//2625493 2011-08-13 14:57:10 Accepted 1333 C++ 0 180 ylwh@Unknown#include #include #include #incl

差分约束什么的不会，所以只能暴力解决了具体思路是如果i<j，就找大于j的，假如是k吧，那么就有i<k;反之亦然//2625748     2011-08-13 16:24:21     Accepted      1589     C++     30     18

//2628803 2011-08-15 19:06:51 Accepted 3321 C 0 160 ylwh@Unknown#include #include int main(){ int n, m, i, j, k, now, map[25][25

//2628809 2011-08-15 19:14:30 Accepted 3498 C 0 160 ylwh@Unknown#include #include int main(){ int n; int cnt, t; scanf("%d",

//2628807 2011-08-15 19:12:44 Accepted 3019 C++ 60 256 ylwh@Unknown#include #include #include #include #include using namespace

//2636041 2011-08-22 12:42:06 Accepted 1108 C++ 0 204 刷媛姐姐刷过的题@Unknown#include #include #include #include #include using namesp

如果一个号码就是另外一个号码的前缀就输出NO注意应该将号码按照长度升序排序。写的很乱，本来这个代码就不是为了这道题写的。我只是测试一下这种建树的方式对不对#include #include #include #include #define _MAX 1000000#define MAXSON 10#define BASE -'0'using namespac

#include //可以证明当几个数可以按相邻的方式交换的话，那么这些数的全排列的所有情况都是等价的，由一种情况可以推出其他任何情况int main(){ int n, t, a, b, i, s[40]; scanf("%d", &t); while(t--) { scanf("%d", &n); for(i=0; i<n;

#include #include #include //直接暴力找出重叠的最多次数int main(){ int t, n, a[201], i, x, y,temp, max; scanf("%d", &t); while(t--) { memset(a, 0, sizeof(a)); max=0; sc

#include #include #include struct __TrieNode{ char value; char * word; struct __TrieNode * next; struct __TrieNode * son;};typedef __TrieNode node;char s[100009][11];node m[1000000];int c

wa了好几次，网上查了一下说是不能对float sort排序...#include #include using namespace std;struct room{ int j, f; //float ave;//去掉}r[1001];int cmp(struct room a, struct room b){ return a.j *

#include #include #include #include #include #include #include #define STOP system("pause")using namespace std;int main(){ string s; int n, m, i, j, sum; int e[100][100]; while(true){

#include #include #include using namespace std;#define PLINE printf("-------------\n")class Rect{ public: int x, y; bool operator ==(Rect&b) { if(x == b.x && y == b.y) return true; re

简单题#1105    烟雾题，其实双行线的图直接按照DFS路线肯定是一个欧拉回路。因此，只需要统计所有边长除以20km/s再除1000m/km就得到小时数。#1681    一个特殊的背包问题，求一个立方数加一个四面体数的背包。其实只需要用一个 set 保存所有的组合即可。假设最大输入是 N，则复杂度为 O(N^2/3)，完全可以胜任。#1713    简单的字符串截取和字符

//2635932 2011-08-22 10:48:57 Accepted 1074 C 0 200 刷媛姐姐刷过的题@Unknown#include #define N 101int n, map[N][N], row_sum[N];void input

//2634394 2011-08-21 00:56:14 Accepted 1940 C++ 0 496 ylwh@Unknown#include #include #include #include #include using namespace

//2634375 2011-08-20 23:33:36 Accepted 1005 C++ 10 23624 ylwh@Unknown#include #include #include #include #include using namespa

//2630234 2011-08-16 20:29:30 Accepted 1093 C++ 0 180 ylwh@Unknown#include #include #include #include #include using namespace

求最大上升子序列//2630318 2011-08-16 21:41:31 Accepted 2136 C 0 168 ylwh@Unknown#include #define N 1001int s[N], d[N];int main(){ int

//2629969 2011-08-16 16:36:14 Accepted 1025 C 10 200 ylwh@Unknown#include #include #include #define N 5001struct node{ int l,