随笔分类 -  ACM-poj

北京大学acm
摘要:Strange Way to Express IntegersTime Limit:1000MS Memory Limit:131072KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2891DescriptionElina is... 阅读全文
posted @ 2015-05-03 00:36 寻找&星空の孩子 阅读(648) 评论(0) 推荐(0)
摘要:C Looooops Description A Compiler Mystery: We are given a C-language style for loop of type for (variable = A; variable != B; variable += C) statement; I.e., a loop which starts by setting variable to value A and while variable is not equal to B, repeats statement followed by increasing the variable by C. We want to know how many times does the statement get executed for particular values of A, B and C, assuming that all arithmetics is calculated in a k-bit unsigned integer type 阅读全文
posted @ 2015-05-02 18:04 寻找&星空の孩子 阅读(336) 评论(0) 推荐(0)
摘要:青蛙的约会Time Limit:1000MSMemory Limit:10000KTotal Submissions:94174Accepted:17412Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西... 阅读全文
posted @ 2015-03-27 19:37 寻找&星空の孩子 阅读(330) 评论(0) 推荐(0)
摘要:BiorhythmsTime Limit:1000MSMemory Limit:10000KTotal Submissions:117973Accepted:37026DescriptionSome people believe that there are three cycles in a pe... 阅读全文
posted @ 2015-03-25 21:54 寻找&星空の孩子 阅读(849) 评论(0) 推荐(0)
摘要:POJ1006: 中国剩余定理的完美演绎问题描述 人自出生起就有体力,情感和智力三个生理周期,分别为23,28和33天。一个周期内有一天为峰值,在这一天,人在对应的方面(体力,情感或智力)表现最好。通常这三个周期的峰值不会是同一天。现在给出三个日期,分别对应于体力,情感,智力出现峰值的日期。然后再给... 阅读全文
posted @ 2015-03-22 22:46 寻找&星空の孩子 阅读(388) 评论(0) 推荐(0)
摘要:生理周期Time Limit:1000MSMemory Limit:10000KTotal Submissions:117861Accepted:36978Description人生来就有三个生理周期,分别为体力、感情和智力周期,它们的周期长度为23天、28天和33天。每一个周期中有一天是高峰。在高... 阅读全文
posted @ 2015-03-20 23:11 寻找&星空の孩子 阅读(216) 评论(0) 推荐(0)
摘要:Training little catsTime Limit:2000MSMemory Limit:65536KTotal Submissions:10737Accepted:2563DescriptionFacer's pet cat just gave birth to a brood of l... 阅读全文
posted @ 2015-03-17 20:10 寻找&星空の孩子 阅读(441) 评论(0) 推荐(0)
摘要:FibonacciTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uDescriptionIn the Fibonacci integer sequence,F0= 0,F1= 1, andFn=Fn− 1+Fn− 2... 阅读全文
posted @ 2015-03-13 19:38 寻找&星空の孩子 阅读(1864) 评论(0) 推荐(0)
摘要:Charlie's ChangeTime Limit:1000MSMemory Limit:30000KTotal Submissions:3176Accepted:913DescriptionCharlie is a driver of Advanced Cargo Movement, Ltd. ... 阅读全文
posted @ 2014-12-17 22:08 寻找&星空の孩子 阅读(470) 评论(0) 推荐(1)
摘要:>>什么是01背包>题目链接#includeusing namespace std;int main(){ int N,V,T; int w[1005]; int c[1005]; int i,j,k; scanf("%d",&T); while(T--) ... 阅读全文
posted @ 2014-12-15 22:59 寻找&星空の孩子 阅读(376) 评论(0) 推荐(0)
摘要:GraveyardTime Limit:2000MSMemory Limit:65536KTotal Submissions:1289Accepted:660Special JudgeDescriptionProgramming contests became so popular in the y... 阅读全文
posted @ 2014-07-25 17:28 寻找&星空の孩子 阅读(371) 评论(0) 推荐(0)
摘要:ZipperTime Limit:1000MSMemory Limit:65536KTotal Submissions:15277Accepted:5393DescriptionGiven three strings, you are to determine whether the third s... 阅读全文
posted @ 2013-12-15 21:47 寻找&星空の孩子 阅读(361) 评论(0) 推荐(0)
摘要:Crossing RiverTime Limit:1000MSMemory Limit:10000KTotal Submissions:9919Accepted:3752DescriptionA group of N people wishes to go across a river with o... 阅读全文
posted @ 2013-11-30 22:56 寻找&星空の孩子 阅读(388) 评论(0) 推荐(0)
摘要:ti放苹果Time Limit:1000MSMemory Limit:10000KTotal Submissions:24392Accepted:15513Description把M个同样的苹果放在N个同样的盘子里,允许有的盘子空着不放,问共有多少种不同的分法?(用K表示)5,1,1和1,5,1 是... 阅读全文
posted @ 2013-11-30 20:53 寻找&星空の孩子 阅读(219) 评论(0) 推荐(0)
摘要:Buy TicketsTime Limit:4000MSMemory Limit:65536KTotal Submissions:11102Accepted:5417DescriptionRailway tickets were difficult to buy around the Lunar N... 阅读全文
posted @ 2013-11-08 19:55 寻找&星空の孩子 阅读(731) 评论(0) 推荐(0)