1 2 3 4 5 ··· 24 下一页
摘要: Aggressive cowsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5436Accepted: 2720DescriptionFarmer John has built a new long barn, with N (2 #include #include using namespace std;const int maxn=100002;const int inf=0x7fffffff;int x[maxn];int n,c;bool ok(int m){ int last=0; for(int i=1... 阅读全文
posted @ 2014-04-28 20:47 同学少年 阅读(159) 评论(0) 推荐(0) 编辑
摘要: Cable masterTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 21071Accepted: 4542DescriptionInhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promised to organize the most honest contest ever. It was decided to con 阅读全文
posted @ 2014-04-28 19:31 同学少年 阅读(135) 评论(0) 推荐(0) 编辑
摘要: Constructing Roads In JGShining's KingdomTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14635Accepted Submission(s): 4158Problem DescriptionJGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two 阅读全文
posted @ 2014-04-28 16:36 同学少年 阅读(173) 评论(0) 推荐(0) 编辑
摘要: Pick applesTime Limit: 1000MS Memory limit: 165536K题目描述Once ago, there is a mystery yard which only produces three kinds of apples. The number of each kind is infinite. A girl carrying a big bag comes into the yard. She is so surprised because she has never seen so many apples before. Each kind of a 阅读全文
posted @ 2014-04-28 14:13 同学少年 阅读(217) 评论(0) 推荐(0) 编辑
摘要: sscanf() - 从一个字符串中读进与指定格式相符的数据. 函数原型: Int sscanf( string str, string fmt, mixed var1, mixed var2 ... ); int scanf( const char *format [,argument]... ); 说明: sscanf与scanf类似,都是用于输入的,只是后者以屏幕(stdin)为输入源,前者以固定字符串为输入源。 其中的format可以是一个或多个 {%[*] [width] [{h | l | I64 | L}]type | ' ' | '\t' | & 阅读全文
posted @ 2014-04-27 19:30 同学少年 阅读(288) 评论(0) 推荐(0) 编辑
摘要: 今天上午九点到下午两点,我们做了山东省第三届ACM原题,整体结果还比较不错,我们队做出了4道题,两道模拟,一道字符串处理,一道高数问题。比赛前期我们配合得不错,比较快速的A出了两道模拟题。但后来状态不太好,主要是我的问题,后来我做的是那道字符串处理的题目,有点麻烦,分割单词,然后在单词中提取数字,数字还不是标准的,做了好长时间,终于测试数据过了,提交了一下,结果果断地返回了一个WA,那种感觉太纠结了,就像当头一棒,千辛万苦弄出来的一个,还是WA,用来队友给我说得考虑空格,两个单词之间可能有一个或多个空格,天哪,我是完全按照一个空格来算的。好吧,机器让给队友,我再修改那个代码。改来改去,反而越. 阅读全文
posted @ 2014-04-27 19:21 同学少年 阅读(141) 评论(0) 推荐(0) 编辑
摘要: Fruit Ninja IITime Limit: 5000MS Memory limit: 65536K题目描述Have you ever played a popular game named "Fruit Ninja"?Fruit Ninja (known as Fruit Ninja HD on the iPad and Fruit Ninja THD for Nvidia Tegra 2 based Android devices) is a video game developed by Halfbrick. It was released April 21, 阅读全文
posted @ 2014-04-27 17:25 同学少年 阅读(403) 评论(0) 推荐(0) 编辑
摘要: The Best Seat in ACM ContestTime Limit: 1000ms Memory limit: 65536K有疑问?点这里^_^题目描述Cainiao is a university student who loves ACM contest very much. It is a festival for him once when he attends ACM Asia Regional Contest because he always can find some famous ACMers there.Cainiao attended Asia Regional 阅读全文
posted @ 2014-04-27 16:18 同学少年 阅读(191) 评论(0) 推荐(0) 编辑
摘要: n a^o7 !Time Limit: 1000MS Memory limit: 65536K题目描述All brave and intelligent fighters, next you will step into a distinctive battleground which is full of sweet and happiness. If you want to win the battle, you must do warm-up according to my instructions, which can make you in the best state prepar 阅读全文
posted @ 2014-04-27 15:25 同学少年 阅读(186) 评论(0) 推荐(0) 编辑
摘要: 能量项链Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 55(20 users)Total Accepted: 22(19 users)Rating:Special Judge:NoDescription在Mars星球上,每个Mars人都随身佩带着一串能量项链。在项链上有N颗能量珠。能量珠是一颗有头标记与尾标记的珠子,这些标记对应着某个正整数。并且,对于相邻的两颗珠子,前一颗珠子的尾标记一定等于后一颗珠子的头标记。因为只有这样,通过吸盘(吸盘是Mars人吸收能量的一种器官)的作用,这两颗珠子才能聚合成一颗珠子,同时释放出可以被吸盘吸收 阅读全文
posted @ 2014-04-26 16:20 同学少年 阅读(360) 评论(0) 推荐(0) 编辑
1 2 3 4 5 ··· 24 下一页