- 博客(69)
- 收藏
- 关注
RSS订阅原创 POJ-1056
IMMEDIATE DECODABILITY Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 8644 Accepted: 4103 Description An encoding of a set of symbols is said to be imme
2012-05-18 01:27:49
711
原创 POJ-1032
Parliament Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 14371 Accepted: 6035 Description New convocation of The Fool Land's Parliament consists of N d
2012-05-18 01:27:00
513
原创 POJ-1012
Joseph Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 39717 Accepted: 14849 Description The Joseph's problem is notoriously known. For those who are not
2012-05-17 23:08:17
432
原创 POJ-1002
487-3279 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 186067 Accepted: 32076 Description Businesses like to have memorable telephone numbers. One way
2012-05-17 23:07:34
390
原创 POJ-1664
放苹果 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 20115 Accepted: 12772 Description 把M个同样的苹果放在N个同样的盘子里，允许有的盘子空着不放，问共有多少种不同的分法？（用K表示）5，1，1和1，5，1 是同一种分法。
2012-05-17 23:06:33
452
原创 POJ-3176
Cow Bowling Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10104 Accepted: 6642 Description The cows don't use actual bowling balls when they go bowling
2012-05-17 23:05:50
385
原创 POJ-1163
The Triangle Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 28541 Accepted: 16805 Description 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 (Figu
2012-05-17 23:05:02
331
原创 POJ-2301
Beat the Spread! Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15973 Accepted: 7602 Description Superbowl Sunday is nearly here. In order to pass the t
2012-05-17 23:04:04
583
原创 POJ-2499
Binary Tree Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4706 Accepted: 2210 Description Background Binary trees are a common data structure in comp
2012-05-17 23:03:15
828
原创 POJ-1316
Self Numbers Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 17218 Accepted: 9644 Description In 1949 the Indian mathematician D.R. Kaprekar discovered a
2012-05-17 02:17:00
482
原创 POJ-2388
Who's in the Middle Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 22897 Accepted: 13144 Description FJ is surveying his herd to find the most average c
2012-05-17 02:15:23
349
原创 POJ-2105
IP Address Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 15901 Accepted: 9134 Description Suppose you are reading byte streams from any device, represe
2012-05-17 01:35:25
437
原创 POJ-1552
Doubles Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 15794 Accepted: 8967 Description As part of an arithmetic competency program, your students will
2012-05-17 01:06:14
376
原创 POJ-1207
The 3n + 1 problem Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 41880 Accepted: 13131 Description Problems in Computer Science are often classified as
2012-05-17 00:32:48
504
原创 POJ-1013
Counterfeit Dollar Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 32440 Accepted: 10228 Description Sally Jones has a dozen Voyageur silver dollars. How
2012-05-16 22:14:04
370
原创 POJ-1008
Maya Calendar Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 51979 Accepted: 15939 Description During his last sabbatical, professor M. A. Ya made a sur
2012-05-16 22:13:21
317
原创 POJ-2000
Gold Coins Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 17545 Accepted: 10946 Description The king pays his loyal knight in gold coins. On the first
2012-05-16 22:12:28
483
原创 POJ-1218
THE DRUNK JAILER Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 18511 Accepted: 11766 Description A certain prison contains a long hall of n cells, each
2012-05-16 22:10:54
309
原创 POJ-2017
Speed LimitTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 13527 Accepted: 9451DescriptionBill and Ted are taking a road trip. But the odometer in their car is broken, so they don't know how
2012-05-16 22:10:03
455
原创 POJ-1373
L-system Time Limit: 5000MS Memory Limit: 10000K Total Submissions: 841 Accepted: 77 Description A D0L (Deterministic Lindenmayer system without interaction) system
2012-05-15 01:43:20
746
原创 POJ-1601
Pizza Anyone? Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 514 Accepted: 181 Description You are responsible for ordering a large pizza for you and
2012-05-13 04:29:38
540
原创 POJ-2248
Addition Chains Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4019 Accepted: 2245 Special Judge Description An addition chain for n is an integer
2012-05-10 03:24:02
766
原创 POJ-1011
Sticks Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 95944 Accepted: 21585 Description George took sticks of the same length and cut them randomly un
2012-05-10 00:53:00
520
原创 POJ-1419
Graph Coloring Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 3035 Accepted: 1341 Special Judge Description You are to write a program that tries
2012-05-06 22:29:04
784
原创 POJ-1040
Transportation Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 2986 Accepted: 1225 Description Ruratania is just entering capitalism and is establishin
2012-05-06 00:03:41
1383
原创 POJ-2258
#include #include int node[25][25]; int rear[25], visit[25]; int edges[25][25]; int max; void dfs(int n, int lenght) { int i; if (lenght > max) max = lenght; for (i = 0
2012-05-05 15:50:49
532
原创 POJ-1315
这样的水题，打出这么烂的代码，我有种想死的冲动 #include char board[4][5]; int n, max; int rookX[10][2], rookY[10][2]; void rookMax(int row, int column, int num) { int i, j, ok, m, next = 0; if (column >=
2012-05-04 16:37:18
497
原创 POJ-1146
#include #include int cmp(const void *a, const void *b) { return *(char *)a - *(char *)b; } int main() { char str[55], min; int i, j, n; while (scanf("%s", str), strcmp(str, "#")) {
2012-04-08 00:08:55
477
原创 POJ-2255
#include #include int next; void find(char *src, char *str, char c, char *parent) { char *temp1, *temp2; if (c == '\0') return; temp2 = strchr(src, c); temp1 = strchr(src, *(str+ne
2012-04-08 00:08:45
334
原创 POJ-22551
#include #include int n; void find(char *src, char *str, char *c, char *left, char *right) { char *cnext; if (left == right) { printf("%c", *c); return; } cnext =
2012-04-07 23:49:15
247
原创 POJ-3195
#include int main() { int toys[1000], top = -1; int size, sum = 0; while (scanf("%d", &size) != EOF) { if (size < 0) toys[++top] = size; else {
2012-04-07 23:48:47
448
原创 POJ-3094
#include main() { char c; int i, sum; i = sum = 0; while ((c = getchar()) != '#') { if (c == '\n') { printf("%d\n", sum); i = sum = 0
2012-04-07 23:48:22
274
原创 POJ-3006
#include #include int prime(long num) { if (num == 1) return 0; int temp = sqrt(num); int i; for (i = 2; i <= temp; i++) { if (num%i == 0) break; } if (i > temp)
2012-04-07 23:47:55
242
原创 POJ-2262
#include #include int prime(long num) { long i; long temp = sqrt(num); for (i = 2; i <= temp; i++) if (num%i == 0) break; if (i > temp) return 1; else return
2012-04-07 23:47:33
235
原创 POJ-2259
#include #include #include typedef struct node *node_pointer; struct node { int value; node_pointer link; }; node_pointer top, rear; node_pointer team[1101] = {0}; short int
2012-04-07 23:47:06
651
原创 POJ-2251
#include #include #define MAX 30000 char dungeon[30][30][30]; int visits[30][30][30]; int queue[MAX], front, rear; int move[6][3] = {{-1, 0, 0}, {0, -1, 0}, {0, 0, 1}, {0, 1, 0}, {0, 0, -1}, {1, 0
2012-04-07 23:46:45
318
原创 POJ-2246
#include int main() { int matrix[26][2] = {0}; int link[26][2] = {0}; int n, top = -1, sum = 0; char c; scanf("%d\n", &n); while (n--) { scanf("%c", &c); s
2012-04-07 23:46:15
463
原创 POJ-2243
#include #include int chessboard[8][8]; char s1[2], s2[2]; int queue[100], top, rear; int position[8][2] = {{-2, 1}, {-1, 2}, {1, 2}, {2, 1}, {2, -1}, {1, -2}, {-1, -2}, {-2, -1}}; void bfs(void)
2012-04-07 23:45:49
272
原创 POJ-2159
#include #include #include int scmp(const void *a, const void *b) { return *(char*)a - *(char*)b; } char a[101], b[101]; main() { char str[101], src[101]; int i, j; scanf("
2012-04-07 23:45:17
268
原创 POJ-1932
#include #define MAX 110 #define QMAX 1000 int energys[MAX][MAX]; int cost[MAX][MAX]; int doors; // 计算有向图的传递闭包 void allcosts(int n) { int i, j, k; for (k = 1; k <= n; k++)
2012-04-07 23:44:48
416
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人