Poj
文章平均质量分 94
PaladinDu
这个作者很懒,什么都没留下…
展开
-
Poj 2969
int i_need_use_5 = 0;int ca_number[10]={0};int fDelMod(int i_mod){ if(ca_number[i_mod]>0) { ca_number[i_mod]--; return 1; }else if(ca_number[3+i_mod]>0) { c原创 2015-11-16 16:23:07 · 354 阅读 · 0 评论 -
1018
#include#include typedef struct SNode{ short int v; short int p;}SNode;typedef struct SLine{ short int len; SNode nodes[400];}SLine;SLine li原创 2016-11-18 14:55:25 · 187 阅读 · 0 评论 -
1019
#include long long int Lv[] = { 0,1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000, 0 };long long int Fix[] = { 0, 9, 189, 2889, 38889, 488889, 5888889, 68888889, 788888889 };原创 2016-11-18 14:56:22 · 126 阅读 · 0 评论 -
1020
#includeint data[10][51] = {{0}};int* c;int* d;int s,n;int f(int a){ int i,j,l,p,q; if (a==n || n - a == c[1]) return 1; for (i=0,l=40;i for (i = p+1,q=原创 2016-11-18 14:56:49 · 170 阅读 · 0 评论 -
1021
#include#include#include#include #include #define MAP_SIZE 102unsigned char map[MAP_SIZE][MAP_SIZE];unsigned char* p_map = (unsigned char*)map;int i_map_x,i_map_y;i原创 2016-11-18 14:57:12 · 157 阅读 · 0 评论 -
1022
#include #include #include int t;int n;typedef struct SPoiter{ char value[4];}SPoiter;typedef struct SCube{ SPoiter s_poiter; int i_identifier; int i_add_identi原创 2016-11-18 14:58:13 · 154 阅读 · 0 评论 -
1023
#includeint main(){ int n,m;//n表示测试数据的个数。m表示位数 int i,k;//i用于循环,k表示向高位的借位 int a[65],b[65],c[65];//a存原本的数。b存每一位的操作。c存需要的到的数 char ch; __int64 number; scanf("%d",&n); for(;n>0;n--) {原创 2016-11-18 14:58:47 · 222 阅读 · 0 评论 -
1025
#include #include #include //电梯每5秒可以让一个人进去。//就实际情况来说逻辑是有问题的,在这里不考究。enum TTaskType{ start,end,wait,stay,out};//位置编号。1楼1室 0101,1楼100 电梯0 外面1typedef struct STask{ TTaskType原创 2016-11-18 14:59:35 · 275 阅读 · 0 评论 -
poj 1026
题目CipherTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21650 Accepted: 5965DescriptionBob and Alice started to use a brand-new encoding scheme. S原创 2016-12-12 10:35:25 · 240 阅读 · 0 评论 -
POJ 1027
题目The Same GameTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5684 Accepted: 2135DescriptionThe game named "Same" is a single person game played原创 2016-12-12 10:50:23 · 401 阅读 · 0 评论 -
poj 1028
题目Web NavigationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 33497 Accepted: 14937DescriptionStandard web browsers contain features to move bac原创 2016-12-12 11:09:10 · 253 阅读 · 0 评论 -
poj 1029
题目False coinTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18579 Accepted: 5226DescriptionThe "Gold Bar"bank received information from reliable s原创 2016-12-12 11:12:09 · 552 阅读 · 0 评论 -
poj 1030
题目RatingTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 1825Accepted: 434DescriptionOne of the participants of both regional contests which took place in S原创 2017-01-21 18:52:57 · 565 阅读 · 0 评论 -
poj 1031
题目FenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3669 Accepted: 1267DescriptionThere is an area bounded by a fence on some flat field. T原创 2017-01-22 10:18:41 · 412 阅读 · 0 评论 -
poj 1032
题目ParliamentTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 18695 Accepted: 7934DescriptionNew convocation of The Fool Land's Parliament consists原创 2017-01-22 11:05:34 · 211 阅读 · 0 评论 -
1024
#include#include#define __I_MAX_W__ 100//标识每一个点是否能向上或向右前进//不得不说一些,墙的信息指两个点不通int i_w,i_h;int i_wall_number;int i_x1,i_x2,i_y1,i_y2;unsigned char map_wa原创 2016-11-18 14:59:09 · 260 阅读 · 0 评论 -
POJ 1009
#include #include typedef struct SNode{ unsigned char value; int len; struct SNode* p_next;}SNode;int width;SNode sa_buf[6000];int i_use_node;SNode* sa_map[5000];SNode* p_line_end;SNode s_out原创 2016-04-23 19:14:57 · 313 阅读 · 0 评论 -
1017
#includeint main(){ int a[7];//存每种规格的盒子的数量 long int n,m;//n为已经使用的打包盒。m为必须使用的打包盒 while(scanf("%d%d%d%d%d%d",&a[1],&a[2],&a[3],&a[4],&a[5],&a[6])&&(a[1]||a[2]||a[3]||a[4]||a[5]||a[6])原创 2016-04-23 19:20:13 · 200 阅读 · 0 评论 -
POJ 1002
487-3279Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 272169 Accepted: 48465DescriptionBusinesses like to have memorable telephone numbe原创 2016-04-17 17:34:03 · 235 阅读 · 0 评论 -
POJ 1003
HangoverTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 115927 Accepted: 56545DescriptionHow far can you make a stack of cards overhang a table? If you have one card, you can create a ma原创 2016-04-17 17:35:49 · 330 阅读 · 0 评论 -
POJ 1004
Financial ManagementTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 172942 Accepted: 64738DescriptionLarry graduated this year and finally has a job. He's making a lot of money, but some原创 2016-04-17 17:36:44 · 408 阅读 · 0 评论 -
POJ 1005
#include int main(void){ double d_half_pi = 1.5707963; double d_tmp = d_half_pi/50; int n,i; scanf("%d",&n); for(i = 1 ; i { double d_x,d_y; scanf(原创 2016-04-17 17:40:05 · 208 阅读 · 0 评论 -
POJ 1006
#include int main(void){ int i,j,k; int a_23_28_index[28]={0,11,22,5,16,27,10,21,4,15,26,9,20,3,14,25,8,19,2,13,24,7,18,1,12,23,6,17}; int a_23_28_33_index[33]={0,2,4,6,8,10,12,14,1原创 2016-04-17 17:40:50 · 215 阅读 · 0 评论 -
POJ 1007
#include #includetypedef struct SNode{ int i_value; char* ca_data;}SNode;char ca_buf[5100];int fCmp(SNode a,SNode b){ return a.i_value }int main(void){ int len,n,原创 2016-04-17 18:00:21 · 186 阅读 · 0 评论 -
1008
#include char ca_list1[][20] = {"pop",//0 "no",//1 "zip",//2 "zotz",//3 "tzec",//4 "xul"原创 2016-04-23 19:14:35 · 266 阅读 · 0 评论 -
1010
#include #includeint values[26];//记录值int value_repeat[26];//记录值重复的情况int number;//值的个数int uses[4];//使用到的值int use_number;//使用到的值的个数#define MIN(a,b) (atypedef struct SResult{ int car原创 2016-04-23 19:15:15 · 237 阅读 · 0 评论 -
1011
#include #include #include #includeint all_stick_lens[65];int stick_use_status[65];int need_number;int stick_number;int total_len;int need_len;/*95 2 1 5 2 1 5 2 141 2 3 4原创 2016-04-23 19:15:34 · 219 阅读 · 0 评论 -
1012
#include typedef struct SFactor{ unsigned char factor; unsigned char n;}SFactor;typedef struct SFactorInfo{ SFactor factors[5];//26以内5个够了 int n;}SFactorInfo;int tmp_m原创 2016-04-23 19:15:50 · 182 阅读 · 0 评论 -
1013
#include#define UNDEFINE 0#define light 1#define heavy 2#define normal 3int main(void){ int n; scanf("%d",&n); while(n-->0) { char tmp_status[12] = {UNDEFINE};原创 2016-04-23 19:16:11 · 203 阅读 · 0 评论 -
1014
/*Collection #1:Can't be divided.Collection #2:Can be divided.*/#include #define CAN_DIVIDED 1#define CANNOT_DIVIDED 0#define MIN(a,b) (aint marble_num[7] = {0};int total_va原创 2016-04-23 19:16:33 · 187 阅读 · 0 评论 -
1015
#include #include #include #includetypedef struct SNode{ unsigned char value_defence;//两个值的差 unsigned char value_total; unsigned char prosecution;//控方的值 unsigned char i原创 2016-04-23 19:16:49 · 242 阅读 · 0 评论 -
1016
#include #include int main(void){ char buf[16][85]; char status; int i,j; char* p; while(scanf("%s",buf[0])&&buf[0][0]!='-') { status = 0; for(i=0原创 2016-04-23 19:19:41 · 221 阅读 · 0 评论 -
poj 1033
题目DefragmentTime Limit: 2000MS Memory Limit: 10000KTotal Submissions: 4450 Accepted: 1557Case Time Limit: 1000MS Special JudgeDescriptionYou are原创 2017-01-22 18:17:09 · 381 阅读 · 0 评论