kuangbin - 博客园

HDU 4268 Alice and Bob 第37届ACM/ICPC长春赛区网络赛1002题（贪心+multiset)

摘要： Alice and BobTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 627Accepted Submission(s): 245Problem DescriptionAlice and Bob's game never ends. Today, they introduce a new game. In this game, both of them have N different rectangular cards resp 阅读全文

posted @ 2012-09-10 19:45 kuangbin 阅读(785) 评论(0) 推荐(0) 编辑

HDU 4267 A Simple Problem with Integers 第37届ACM/ICPC长春赛区网络赛1001题（树状数组）

摘要： A Simple Problem with IntegersTime Limit: 5000/1500 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 659Accepted Submission(s): 253Problem DescriptionLet A1, A2, ... , AN be N elements. You need to deal with two kinds of operations. One type of operation is to add a give 阅读全文

posted @ 2012-09-10 17:15 kuangbin 阅读(1293) 评论(0) 推荐(0) 编辑

HDU 4277 USACO ORZ 第37届ACM/ICPC长春赛区网络赛1011题（搜索）

摘要： USACO ORZTime Limit: 5000/1500 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1099Accepted Submission(s): 398Problem DescriptionLike everyone, cows enjoy variety. Their current fancy is new shapes for pastures. The old rectangular shapes are out of favor; new geometrie 阅读全文

posted @ 2012-09-10 17:12 kuangbin 阅读(553) 评论(0) 推荐(0) 编辑

HDU 4282 A very hard mathematic problem 第37届ACM/ICPC长春赛区网络赛1005题（暴力）

摘要： A very hard mathematic problemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 964Accepted Submission(s): 279Problem Description Haoren is very good at solving mathematic problems. Today he is working a problem like this: Find three positive inte... 阅读全文

posted @ 2012-09-10 17:04 kuangbin 阅读(924) 评论(0) 推荐(0) 编辑

HDU 4287 Intelligent IME 第37届ACM/ICPC天津赛区网络赛1010题（水题）

摘要： Intelligent IMETime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 399Accepted Submission(s): 207Problem Description We all use cell phone today. And we must be familiar with the intelligent English input method on the cell phone. To be specific, the . 阅读全文

posted @ 2012-09-10 15:46 kuangbin 阅读(905) 评论(0) 推荐(0) 编辑

HDU 4279 Number 第37届ACM/ICPC天津赛区网络赛1002题（简单规律题）

摘要： NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 640Accepted Submission(s): 207Problem Description Here are two numbers A and B (0 < A <= B). If B cannot be divisible by A, and A and B are not co-prime numbers, we define A as a special n 阅读全文

posted @ 2012-09-10 15:36 kuangbin 阅读(742) 评论(0) 推荐(0) 编辑

HDU 4278 Faulty Odometer 第37届ACM/ICPC天津赛区网络赛1001题（简单水题）

摘要： Faulty OdometerTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 312Accepted Submission(s): 228Problem Description You are given a car odometer which displays the miles traveled as an integer. The odometer has a defect, however: it proceeds from the. 阅读全文

posted @ 2012-09-10 15:11 kuangbin 阅读(1465) 评论(0) 推荐(0) 编辑

HDU 4099 Revenge of Fibonacci（字典树）

摘要： Revenge of FibonacciTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 204800/204800 K (Java/Others)Total Submission(s): 914Accepted Submission(s): 197Problem DescriptionThe well-known Fibonacci sequence is defined as following:Here we regard n as the index of the Fibonacci number F(n).This sequen 阅读全文

posted @ 2012-09-06 17:36 kuangbin 阅读(2160) 评论(1) 推荐(0) 编辑

HDU 3501 Calculation 2(欧拉函数的引申）

摘要： Calculation 2Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1264Accepted Submission(s): 530Problem DescriptionGiven a positive integer N, your task is to calculate the sum of the positive integers less than N which are not coprime to N. A is said 阅读全文

posted @ 2012-09-06 16:38 kuangbin 阅读(384) 评论(0) 推荐(0) 编辑

HDU 2802 F(N)（简单题，找循环解）

摘要： F(N)Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2037Accepted Submission(s): 677Problem DescriptionGiving the N, can you tell me the answer of F(N)?InputEach test case contains a single integer N(1<=N<=10^9). The input is terminated by a s 阅读全文

posted @ 2012-09-06 15:20 kuangbin 阅读(1108) 评论(0) 推荐(0) 编辑