算法爱好者

摘要： SumdivTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 10515Accepted: 2477DescriptionConsider two natural numbers A and B. Let S be the sum of all natural divisors of A^B. Determine S modulo 9901 (the rest of the division of S by 9901).InputThe only line contains the two natural numbers A an 阅读全文

摘要： Color the BallTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3081Accepted Submission(s): 762Problem DescriptionThere are infinite balls in a line (numbered 1 2 3 ....), and initially all of them are paint black. Now Jim use a brush paint the balls 阅读全文

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

摘要： Longge's problemTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5880Accepted: 1862DescriptionLongge is good at mathematics and he likes to think about hard mathematical problems which will be solved by some graceful algorithms. Now a problem comes: Given an integer N(1 #include #include 阅读全文

摘要： 1254.异或求和 Time Limit: 1000 MS Memory Limit: 65536 K Total Submissions: 52 (19 users) Accepted: 13 (7 users) Description给你2个区间[A,B]和[C,D],现在只要求你求出区间[A,B]和[C,D]内任意2个整数异或后的和，因为答案可能会很大，你只需将结果%mod即可。For(i:A→B) For(j:C→D) Sum += (i^j);Input输入第一行为T(T=2^（k-1） 的 x 第k位就是1这样只要求出 x某个范围 ，其它就是它的等价类了这... 阅读全文

摘要： Happy 2004Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 673Accepted Submission(s): 481Problem DescriptionConsider a positive integer X,and let S be the sum of all positive integer divisors of 2004^X. Your job is to determine S modulo 29 (the rest 阅读全文

摘要： Play on WordsTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3149Accepted Submission(s): 1002Problem DescriptionSome of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because 阅读全文

摘要： The number of divisors(约数) about Humble NumbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1741Accepted Submission(s): 852Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 阅读全文

摘要： Calculation 2Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1296Accepted Submission(s): 544Problem 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 阅读全文

摘要： SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 897Accepted Submission(s): 259Problem DescriptionXXX is puzzled with the question below: 1, 2, 3, ..., n (1#include #include #include #include #include #include using namespace std;bool h[700];int 阅读全文