随笔分类 -  poj

poj水题--ID3299
摘要:不贴题目了,描述的很复杂,其实这个题主要是考察简单的逻辑设计问题吧,看了其他人的答案,有的地方没看懂,还是用麻烦的if else解决的:#include<iostream>#include<iomanip>#include<math.h>using namespace std;int main(){ char a; double t,d,h; while(cin>>a&&a!='E') { if(a=='T') { cin>>t>>a; if(a=='D') 阅读全文

posted @ 2012-10-18 15:14 响^_^ 阅读(205) 评论(0) 推荐(0)

poj ID1003
摘要:Problem:DescriptionHow far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (We're assuming that the cards must be perpendicular to the table.) With two cards you can make the top card overhang the bottom one by half a 阅读全文

posted @ 2012-10-18 10:16 响^_^ 阅读(102) 评论(0) 推荐(0)

poj水题--ID3062
摘要:Problem: Description It's hard to construct a problem that's so easy that everyone will get it, yet still difficult enough to be worthy of some respec... 阅读全文

posted @ 2012-10-10 19:17 响^_^ 阅读(134) 评论(0) 推荐(0)

poj水题--ID3030
摘要:摘要:poj水题-3030,用来找自信滴 阅读全文

posted @ 2012-10-09 20:38 响^_^ 阅读(143) 评论(0) 推荐(0)

一个poj水题--ID 2027
摘要:Problem:InputThe first line contains a single integer n indicating the number of data sets.The following n lines each represent a data set. Each data set will be formatted according to the following description:A single data set consists of a line "X Y", where X is the number of brains the 阅读全文

posted @ 2012-10-09 18:57 响^_^ 阅读(118) 评论(0) 推荐(0)