摘要：
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' | & 阅读全文
摘要：
今天上午九点到下午两点，我们做了山东省第三届ACM原题，整体结果还比较不错，我们队做出了4道题，两道模拟，一道字符串处理，一道高数问题。比赛前期我们配合得不错，比较快速的A出了两道模拟题。但后来状态不太好，主要是我的问题，后来我做的是那道字符串处理的题目，有点麻烦，分割单词，然后在单词中提取数字，数字还不是标准的，做了好长时间，终于测试数据过了，提交了一下，结果果断地返回了一个WA，那种感觉太纠结了，就像当头一棒，千辛万苦弄出来的一个，还是WA，用来队友给我说得考虑空格，两个单词之间可能有一个或多个空格，天哪，我是完全按照一个空格来算的。好吧，机器让给队友，我再修改那个代码。改来改去，反而越. 阅读全文
摘要：
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, 阅读全文
摘要：
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 阅读全文
摘要：
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 阅读全文