摘要:        
Leading and Trailing You are given two integers: n and k, your task is to find the most significant three digits, and least significant three digits o    阅读全文
posted @ 2018-03-15 21:34
ACRykl
阅读(153)
评论(0)
推荐(0)
        
            
        
        
摘要:        
Goldbach's Conjecture Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7550 Accepted Submission(s)    阅读全文
posted @ 2018-03-15 20:21
ACRykl
阅读(169)
评论(0)
推荐(0)
        
            
        
        
摘要:        
青蛙的约会 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 123444 Accepted: 26326 Description 两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上    阅读全文
posted @ 2018-03-15 19:54
ACRykl
阅读(83)
评论(0)
推荐(0)
        
 
                    
                     
                    
                 
                    
                
 
 
         浙公网安备 33010602011771号
浙公网安备 33010602011771号