摘要： Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 100560 Accepted Submission(s): 28014 Problem Desc 阅读全文

摘要： Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 58581 Accepted Submission(s): 23023 Problem Descr 阅读全文

摘要： Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25710 Accepted Submission(s): 10420 Problem Descr 阅读全文

摘要： Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2370 Accepted Submission(s): 780 Problem Descript 阅读全文

摘要： time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Vasiliy likes to rest after a hard work, 阅读全文

摘要： Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 889 Accepted Submission(s): 290 Problem Descripti 阅读全文

摘要： Description You have just moved from a quiet Waterloo neighbourhood to a big, noisy city. Instead of getting to ride your bike to school every day, yo 阅读全文

摘要： Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24840 Accepted Submission(s): 9666 Problem Descri 阅读全文

摘要： s(n)是正整数n的真因子之和，即小于n且整除n的因子和.例如s(12)=1+2+3+4+6=16.如果任何 数m，s(m)都不等于n,则称n为不可摸数. Input包含多组数据，首先输入T,表示有T组数据.每组数据1行给出n(2<=n<=1000)是整数。Output如果n是不可摸数，输出yes， 阅读全文

摘要： 题目描述 过年期间，老家举行了一场盛大的集体婚礼，为了使婚礼进行的丰富一些，司仪临时想出了有一个有意思的节目，叫做“考新郎”，具体的操作是这样的：1. 首先，给每位新娘打扮得几乎一模一样，并盖上大大的红盖头随机坐成一排；2. 然后，让各位新郎寻找自己的新娘。每人只准找一个，并且不允许多人找一个；3. 阅读全文