随笔分类 - poj
摘要:The 3n + 1 problem Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 60496 Accepted: 19218 Description Problems in Computer Science are often
阅读全文
摘要:I Think I Need a Houseboat POJ - 1005 解题思路:水题 #include <iostream> #include <cstdio> #include <cmath> using namespace std; int main() { int n; double x
阅读全文
摘要:Financial Management POJ - 1004 解题思路:水题。 #include <iostream> #include <cstdio> #include <iomanip> #include <cmath> using namespace std; int main() { d
阅读全文
摘要:How 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
阅读全文
摘要:迷宫问题 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 21198 Accepted: 12421 Description 定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0,
阅读全文
摘要:Shuffle'm Up Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10766 Accepted: 4976 Description A common pastime for poker players at a poker
阅读全文
摘要:Prime Path Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 20237 Accepted: 11282 Description The ministers of the cabinet were quite upset
阅读全文
摘要:Anniversary party Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8028 Accepted: 4594 Description There is going to be a party to celebrate
阅读全文
摘要:Conscription Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12393 Accepted: 4350 Description Windy has a country, and he wants to build an
阅读全文
摘要:Roadblocks Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 13594 Accepted: 4783 Description Bessie has moved to a small farm and sometimes
阅读全文
摘要:Exponentiation Time Limit: 500MS Memory Limit: 10000K Total Submissions: 162918 Accepted: 39554 Description Problems involving the computation of exac
阅读全文