POJ 1013 小水题暴力模拟

【POJ 1013 小水题暴力模拟】的更多相关文章

POJ 1013 小水题暴力模拟

Counterfeit Dollar Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 35774 Accepted: 11390 Description Sally Jones has a dozen Voyageur silver dollars. However, only eleven of the coins are true silver dollars; one coin is counterfeit ev…

poj 1005:I Think I Need a Houseboat（水题，模拟）

I Think I Need a Houseboat Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 85149 Accepted: 36857 Description Fred Mapper is considering purchasing some land in Louisiana to build his house on. In the process of investigating the land,…

【转】POJ百道水题列表

以下是poj百道水题,新手可以考虑从这里刷起搜索1002 Fire Net1004 Anagrams by Stack1005 Jugs1008 Gnome Tetravex1091 Knight Moves1101 Gamblers1204 Additive equations 1221 Risk1230 Legendary Pokemon1249 Pushing Boxes 1364 Machine Schedule1368 BOAT1406 Jungle Roads1411 Annive…

hdu 2117:Just a Numble（水题，模拟除法运算）

Just a Numble Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2107 Accepted Submission(s): 987 Problem Description Now give you two integers n m, you just tell me the m-th number after radix…

hdu5007 小水题

题意: 给你一个串,如果出现子串 "Apple", "iPhone", "iPod", "iPad"输出MAI MAI MAI!,如果出现子串Sony 输出SONY DAFA IS GOOD!. 思路: 水题,直接模拟就行了,题目是一组测试数据,说是输入的小于8KB,这个我没有算具体要开多大,为了省事,我直接没开数字,用%c直接累加模拟就行了,有个地方注意下'\n'不能忽略,也就是说Appl\ne !=…

poj 3264 RMQ 水题

题意:找到一段数字里最大值和最小值的差水题 #include<cstdio> #include<iostream> #include<algorithm> #include<cstring> #include<cmath> #include<queue> using namespace std; ; const int INF=0x3f3f3f3f; int n,m,t; ; ],dpMIN[MAXN][]; int mm[MAXN…

Poj 1552 Doubles(水题)

一.Description As part of an arithmetic competency program, your students will be given randomly generated lists of from 2 to 15 unique positive integers and asked to determine how many items in each list are twice some other item in the same list. Yo…