文章分类 - 【FJUT】- ACM
摘要:Dressing Wangpeng has N clothes, M pants and K shoes so theoretically he can have N×M×K different combinations of dressing.One day he wears his pants
阅读全文
摘要:A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 71967 Accepted: 22196 Case Time Limit: 2000MS Description Y
阅读全文
摘要:The kth great number Time Limit: 1000ms Memory Limit: 65768KB 64-bit integer IO format: %I64d Java class name: Main Time Limit: 1000ms Memory Limit: 6
阅读全文
摘要:从头到尾彻底理解KMP 从头到尾彻底理解KMP 作者:July时间:最初写于2011年12月,2014年7月21日晚10点 全部删除重写成此文,随后的半个多月不断反复改进。 原文地址:http://blog.csdn.net/v_july_v/article/details/7041827#t9 看
阅读全文
posted @ 2014-08-22 21:14
Wurq
摘要:Lost Cows Problem Description N (2 <= N <= 8,000) cows have unique brands in the range 1..N. In a spectacular display of poor judgment, they visited t
阅读全文
摘要:A + B for you again Problem Description Generally speaking, there are a lot of problems about strings processing. Now you encounter another such probl
阅读全文
摘要:Babelfish Problem Description You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language
阅读全文
摘要:统计难题 Problem Description Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀). Input 输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10
阅读全文
摘要:Number Sequence Problem Description Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <= N
阅读全文
摘要:Count the string Problem Description It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string
阅读全文
摘要:E. Black Box Time Limit: 1000ms Memory Limit: 10000KB 64-bit integer IO format: %lld Java class name: Main Time Limit: 1000ms Memory Limit: 10000KB Su
阅读全文
摘要:F. Ugly Numbers Time Limit: 3000ms Memory Limit: 131072KB 64-bit integer IO format: %lld Java class name: Main Time Limit: 3000ms Memory Limit: 131072
阅读全文

浙公网安备 33010602011771号