上一页 1 ··· 7 8 9 10 11 12 13 14 15 ··· 29 下一页
摘要: 八、密码发生器 在对银行账户等重要权限设置密码的时候,我们常常遇到这样的烦恼:如果为了好记用生日吧,容易被破解,不安全;如果设置不好记的密码,又担心自己也会忘记;如果写在纸上,担心纸张被别人发现或弄丢了... 这个程序的任务就是把一串拼音字母转换为6位数字(密码)。我们可以使用任何好记的... 阅读全文
posted @ 2017-11-03 01:43 lemonsbiscuit 阅读(102) 评论(0) 推荐(0) 编辑
摘要: Washing ClothesTime Limit: 1000MSMemory Limit: 131072KTotal Submissions: 9700Accepted: 3110DescriptionDearboy was so busy recently that now he has pil... 阅读全文
posted @ 2017-11-03 01:43 lemonsbiscuit 阅读(90) 评论(0) 推荐(0) 编辑
摘要: 最大报销额Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 22592 Accepted Submission(s): 6861Prob... 阅读全文
posted @ 2017-11-03 01:43 lemonsbiscuit 阅读(87) 评论(0) 推荐(0) 编辑
摘要: 湫湫系列故事——减肥记ITime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 4694 Accepted Submission(s): 23... 阅读全文
posted @ 2017-11-03 01:43 lemonsbiscuit 阅读(103) 评论(0) 推荐(0) 编辑
摘要: 钱币兑换问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9242 Accepted Submission(s): 5632Prob... 阅读全文
posted @ 2017-11-03 01:43 lemonsbiscuit 阅读(96) 评论(0) 推荐(0) 编辑
摘要: CRB and His BirthdayTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1655 Accepted Submissio... 阅读全文
posted @ 2017-11-03 01:43 lemonsbiscuit 阅读(114) 评论(0) 推荐(0) 编辑
摘要: 悼念512汶川大地震遇难同胞——一定要记住我爱你Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9776 Accepted Submi... 阅读全文
posted @ 2017-11-03 01:43 lemonsbiscuit 阅读(98) 评论(0) 推荐(0) 编辑
摘要: 悼念512汶川大地震遇难同胞——珍惜现在,感恩生活Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25342 Accepted Sub... 阅读全文
posted @ 2017-11-03 01:43 lemonsbiscuit 阅读(142) 评论(0) 推荐(0) 编辑
摘要: 寒冰王座Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15142 Accepted Submission(s): 7801Probl... 阅读全文
posted @ 2017-11-03 01:43 lemonsbiscuit 阅读(136) 评论(0) 推荐(0) 编辑
摘要: 1008 N的阶乘 mod P基准时间限制:1 秒 空间限制:131072 KB 分值: 0 难度:基础题 收藏 关注输入N和P(P为质数),求N! Mod P = ? (Mod 就是求模 %)例如:n = 10, P = 11,10! = 36288003628800 % 11 = 10Input... 阅读全文
posted @ 2017-11-03 01:43 lemonsbiscuit 阅读(69) 评论(0) 推荐(0) 编辑
上一页 1 ··· 7 8 9 10 11 12 13 14 15 ··· 29 下一页