随笔分类 - 数论
摘要:Collision Time Limit: 15000/15000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 846 Accepted Submission(s): 200 Pro
        阅读全文
                
摘要:C. Ray Tracing There are k sensors located in the rectangular room of size n × m meters. The i-th sensor is located at point (xi, yi). All sensors are
        阅读全文
                
摘要:Interviewe Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6689 Accepted Submission(s): 1582 Prob
        阅读全文
                
摘要:Primitive Roots Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 3928 Accepted: 2342 Description We say that integer x, 0 < x < p, is a prim
        阅读全文
                
摘要:Another kind of Fibonacci Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2353 Accepted Submissio
        阅读全文
                
摘要:Robot Accepts: 92 Submissions: 188 Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Robot Accepts: 92 Submissions: 18
        阅读全文
                
摘要:The Luckiest number Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1163 Accepted Submission(s): 
        阅读全文
                
摘要:Description has only two Sentences Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1108 Accepted 
        阅读全文
                
摘要:Brute-force Algorithm Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2740 Accepted Submission(s)
        阅读全文
                
摘要:总时间限制:1000ms内存限制:65536kB描述 给定正整数b,求最大的整数a,满足a*(a+b) 为完全平方数 输入多组数据,第一行T,表示数据数。对于每组数据,一行一个正整数表示b。T <= 10^3, 1 <= b <= 10^9输出对于每组数据,输出最大的整数a,满足a*(a+b)为完全
        阅读全文
                
摘要:Harry Potter and the Hide Story Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2809 Accepted Su
        阅读全文
                
摘要:Special Prime Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 415 Accepted Submission(s): 220 Pro
        阅读全文
                
摘要:Interesting Fibonacci Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1071 Accepted Submission(s)
        阅读全文
                
摘要:非010串 基准时间限制:1 秒 空间限制:131072 KB 分值: 80 如果一个01字符串满足不存在010这样的子串,那么称它为非010串。 求长度为n的非010串的个数。(对1e9+7取模) 如果一个01字符串满足不存在010这样的子串,那么称它为非010串。 求长度为n的非010串的个数。
        阅读全文
                
摘要:GCD is Funny Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 282 Accepted Submission(s): 58 Probl
        阅读全文
                
摘要:1248 - Dice (III) PDF (English) Statistics Forum Time Limit: 1 second(s) Memory Limit: 32 MB Given a dice with n sides, you have to find the expected 
        阅读全文
                
摘要:B. Andrey and Problem time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Andrey needs one m
        阅读全文
                
摘要:Andrew and Jerry are playing a game with Harry as the scorekeeper. The game consists of three rounds. In each round, Andrew and Jerry draw randomly wi
        阅读全文
                
摘要:{p1,..., pk : p1 < p2 <...< pk} is called a prime k -tuple of distance s if p1, p2,..., pk are consecutive prime numbers and pk - p1 = s . For example
        阅读全文
                
摘要:YAPTCHA Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 862 Accepted Submission(s): 452 Problem 
        阅读全文
                
 
                     
                    
                 
                    
                
 
         浙公网安备 33010602011771号
浙公网安备 33010602011771号