短码编程
关注
分享
扫一扫
杨鑫newlfe
算法就是我的灵魂
展开
-
POJ1032 Parliament
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 16685 Accepted: 7038DescriptionNew convocation of The Fool Land's Parliament consists of N delegates. According to原创 2014-06-02 16:46:57 · 950 阅读 · 0 评论 -
poj3062Celebrity jeopardy
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14585 Accepted: 8209DescriptionIt's hard to construct a problem that's so easy that everyone will get it, yet stil原创 2014-05-27 11:07:25 · 852 阅读 · 0 评论 -
poj1218THE DRUNK JAILER
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 22811 Accepted: 14379DescriptionA certain prison contains a long hall of n cells, each right next to each other. E原创 2014-05-27 12:17:15 · 861 阅读 · 0 评论 -
poj2623 Sequence Median
Sequence MedianTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15140 Accepted: 4245DescriptionGiven a sequence of N nonnegative integers. Let's define t原创 2014-05-29 00:44:44 · 1169 阅读 · 0 评论 -
poj2140Herd Sums
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15569 Accepted: 9245DescriptionThe cows in farmer John's herd are numbered and branded with consecutive integers f原创 2014-05-27 22:54:29 · 910 阅读 · 0 评论 -
poj2590Steps
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7541 Accepted: 3488DescriptionOne steps through integer points of the straight line. The length of a step must be原创 2014-05-27 22:44:38 · 979 阅读 · 0 评论 -
POJ2105 IP Address
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 18313 Accepted: 10557DescriptionSuppose you are reading byte streams from any device, representing IP addresses. Y原创 2014-05-29 16:03:49 · 1022 阅读 · 0 评论 -
C语言库函数的使用
在C语言中有很多类似于qsort的库函数，接下来我来大概的介绍一下供大家学习：1.输入：int scanf(const char *foemat,..);可以指定格式，是最常用的万能型输入函数，如果按照format所指定的格式进行正确读入数据，就会转化成为成功的数量。如果失败则会返回-1。char *get(char*s)可以读入一整行字符串（直到遇到还行字符或原创 2014-05-29 15:38:24 · 1293 阅读 · 0 评论 -
POJ2371Questions and answers
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10241 Accepted: 5447DescriptionThe database of the Pentagon contains a top-secret information. We don't know what原创 2014-05-29 15:46:13 · 1266 阅读 · 0 评论 -
POJ 2365Rope
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6306 Accepted: 2252DescriptionPlotters have barberically hammered N nails into an innocent plane shape, so that on原创 2014-06-02 14:13:22 · 1081 阅读 · 0 评论 -
POJ 2190ISBN
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15039 Accepted: 5307DescriptionFarmer John's cows enjoy reading books, and FJ has discovered that his cows produce原创 2014-06-03 12:07:31 · 1068 阅读 · 0 评论 -
POJ2249Binomial Showdown
Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 17617Accepted: 5363DescriptionIn how many ways can you choose k elements out of n elements, not taking order into原创 2014-06-10 10:29:22 · 894 阅读 · 0 评论 -
POJ 3032Card Trick
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3766 Accepted: 2691DescriptionThe magician shuffles a small pack of cards, holds it face down and performs the f原创 2014-06-10 09:39:34 · 878 阅读 · 0 评论 -
POJ 2602Superlong sums
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 22108 Accepted: 6509DescriptionThe creators of a new programming language D++ have found out that whatever limit f原创 2014-06-10 08:44:13 · 891 阅读 · 0 评论 -
POJ1546 Basically Speaking
#include #include #include int main(){char s[99];int a,b;for(;~scanf("%s%d%d",s,&a,&b);){int n=strtol(s,0,a);itoa(n,s,b);printf("%7s\n",strlen(s)>7?"ERROR":strupr(s));}return原创 2014-06-02 10:46:19 · 883 阅读 · 0 评论 -
POJ2305 Basic remains
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4713 Accepted: 1997DescriptionGiven a base b and two non-negative base b integers p and m, compute p mod m and pri原创 2014-06-02 10:22:37 · 994 阅读 · 0 评论 -
POJ Beavergnaw
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6183 Accepted: 4079DescriptionWhen chomping a tree the beaver cuts a very specific shape out of the tree trunk.原创 2014-06-02 13:55:28 · 1194 阅读 · 0 评论 -
POJ2368 Buttons
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2903 Accepted: 734DescriptionAs you surely already know, Yekaterinburg has gotten its right to hold The Summer Oly原创 2014-06-02 14:39:24 · 1098 阅读 · 0 评论 -
poj2309BST
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8322 Accepted: 5028DescriptionConsider an infinite full binary search tree (see the figure below), the numbers in原创 2014-06-03 20:46:58 · 1056 阅读 · 0 评论 -
poj3086Triangular Sums
Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 6286Accepted: 4466DescriptionThe nth Triangular number, T(n) = 1 + … + n, is the sum of the first n integers. I原创 2014-06-03 20:12:37 · 808 阅读 · 0 评论 -
POJ2453An Easy Problem
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7763 Accepted: 4633DescriptionAs we known, data stored in the computers is in binary form. The problem we discuss原创 2014-06-09 22:03:28 · 974 阅读 · 0 评论 -
POJ 2316 SPIN
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6241 Accepted: 3227DescriptionSimulate a locked spinner puzzle. A locked spinner puzzle is a puzzle where you原创 2014-06-09 23:58:40 · 1191 阅读 · 0 评论 -
POJ1658Eva's Problem
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 17152 Accepted: 10476DescriptionEva的家庭作业里有很多数列填空练习。填空练习的要求是：已知数列的前四项，填出第五项。因为已经知道这些数列只可能是等差或等比数列，她决定写一个程序来完成这些练习。原创 2014-06-10 10:00:29 · 1029 阅读 · 0 评论 -
POJ 2141Message Decowding
Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 11684Accepted: 6502DescriptionThe cows are thrilled because they've just learned about encrypting messages. They原创 2014-06-09 21:50:10 · 906 阅读 · 0 评论 -
POJ1298 The Hardest Problem Ever
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 22030 Accepted: 12103DescriptionJulius Caesar lived in a time of danger and intrigue. The hardest situation Caesar原创 2014-06-02 15:04:14 · 997 阅读 · 0 评论