x_liushi_game-CSDN博客

原创 POJ-1056

IMMEDIATE DECODABILITYTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8644 Accepted: 4103DescriptionAn encoding of a set of symbols is said to be imme

2012-05-18 01:27:49 653

原创 POJ-1032

ParliamentTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14371 Accepted: 6035DescriptionNew convocation of The Fool Land's Parliament consists of N d

2012-05-18 01:27:00 454

原创 POJ-1012

JosephTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 39717 Accepted: 14849DescriptionThe Joseph's problem is notoriously known. For those who are not

2012-05-17 23:08:17 370

原创 POJ-1002

487-3279Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 186067 Accepted: 32076DescriptionBusinesses like to have memorable telephone numbers. One way

2012-05-17 23:07:34 364

原创 POJ-1664

放苹果Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20115 Accepted: 12772Description把M个同样的苹果放在N个同样的盘子里，允许有的盘子空着不放，问共有多少种不同的分法？（用K表示）5，1，1和1，5，1 是同一种分法。

2012-05-17 23:06:33 394

原创 POJ-3176

Cow BowlingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10104 Accepted: 6642DescriptionThe cows don't use actual bowling balls when they go bowling

2012-05-17 23:05:50 351

原创 POJ-1163

The TriangleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 28541 Accepted: 16805Description73 88 1 02 7 4 44 5 2 6 5(Figu

2012-05-17 23:05:02 300

原创 POJ-2301

Beat the Spread!Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15973 Accepted: 7602DescriptionSuperbowl Sunday is nearly here. In order to pass the t

2012-05-17 23:04:04 533

原创 POJ-2499

Binary TreeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4706 Accepted: 2210DescriptionBackground Binary trees are a common data structure in comp

2012-05-17 23:03:15 705

原创 POJ-1316

Self NumbersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 17218 Accepted: 9644DescriptionIn 1949 the Indian mathematician D.R. Kaprekar discovered a

2012-05-17 02:17:00 441

原创 POJ-2388

Who's in the MiddleTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 22897 Accepted: 13144DescriptionFJ is surveying his herd to find the most average c

2012-05-17 02:15:23 316

原创 POJ-2105

IP AddressTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 15901 Accepted: 9134DescriptionSuppose you are reading byte streams from any device, represe

2012-05-17 01:35:25 389

原创 POJ-1552

DoublesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 15794 Accepted: 8967DescriptionAs part of an arithmetic competency program, your students will

2012-05-17 01:06:14 346

原创 POJ-1207

The 3n + 1 problemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 41880 Accepted: 13131DescriptionProblems in Computer Science are often classified as

2012-05-17 00:32:48 440

原创 POJ-1013

Counterfeit DollarTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 32440 Accepted: 10228DescriptionSally Jones has a dozen Voyageur silver dollars. How

2012-05-16 22:14:04 337

原创 POJ-1008

Maya CalendarTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 51979 Accepted: 15939DescriptionDuring his last sabbatical, professor M. A. Ya made a sur

2012-05-16 22:13:21 285

原创 POJ-2000

Gold CoinsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 17545 Accepted: 10946DescriptionThe king pays his loyal knight in gold coins. On the first

2012-05-16 22:12:28 449

原创 POJ-1218

THE DRUNK JAILERTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 18511 Accepted: 11766DescriptionA certain prison contains a long hall of n cells, each

2012-05-16 22:10:54 269

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 420

原创 POJ-1373

L-systemTime Limit: 5000MS Memory Limit: 10000KTotal Submissions: 841 Accepted: 77DescriptionA D0L (Deterministic Lindenmayer system without interaction) system

2012-05-15 01:43:20 659 1

原创 POJ-1601

Pizza Anyone?Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 514 Accepted: 181DescriptionYou are responsible for ordering a large pizza for you and

2012-05-13 04:29:38 483

原创 POJ-2248

Addition ChainsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4019 Accepted: 2245 Special JudgeDescriptionAn addition chain for n is an integer

2012-05-10 03:24:02 724

原创 POJ-1011

SticksTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 95944 Accepted: 21585DescriptionGeorge took sticks of the same length and cut them randomly un

2012-05-10 00:53:00 475

原创 POJ-1419

Graph ColoringTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3035 Accepted: 1341 Special JudgeDescriptionYou are to write a program that tries

2012-05-06 22:29:04 744

原创 POJ-1040

TransportationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2986 Accepted: 1225DescriptionRuratania is just entering capitalism and is establishin

2012-05-06 00:03:41 1277

原创 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 482

原创 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 461

原创 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 444

原创 POJ-2255

#include#includeint 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 314

原创 POJ-22551

#include#includeint 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 233

原创 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 399

原创 POJ-3094

#includemain(){ 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 257

原创 POJ-3006

#include#includeint 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 224

原创 POJ-2262

#include#includeint 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 210

原创 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 588

原创 POJ-2251

#include #include #define MAX 30000char 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 294

原创 POJ-2246

#includeint 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 431

原创 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 242

原创 POJ-2159

#include#include#includeint 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 239

原创 POJ-1932

#include #define MAX 110#define QMAX 1000int 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 378

空空如也

空空如也