程序控

IPPP (Institute of Penniless Peasent-Programmer) Fellow
  博客园 :: 首页 :: 新随笔 :: 联系 :: :: 管理 ::

2010年8月10日

UVa OJ 113 - Power of Cryptography (密文的乘方)
摘要： Time limit: 3.000 seconds限时: 3.000秒Background背景Current work in cryptography involves (among other things) large prime numbers and computing powers of numbers modulo functions of these primes. Work in ... 阅读全文
posted @ 2010-08-10 22:22 Devymex 阅读(2029) 评论(2) 推荐(0)

UVa OJ 112 - Tree Summing (树的求和)
摘要： Time limit: 3.000 seconds限时：3.000秒Background背景LISP was one of the earliest high-level programming languages and, with FORTRAN, is one of the oldest languages currently being used. Lists, which are the... 阅读全文
posted @ 2010-08-10 20:31 Devymex 阅读(3115) 评论(0) 推荐(1)

UVa OJ 111 - History Grading (历史成绩评定)
摘要： Time limit: 3.000 secondsBackgroundMany problems in Computer Science involve maximizing some measure according to constraints.Consider a history exam in which students are asked to put several histori... 阅读全文
posted @ 2010-08-10 15:22 Devymex 阅读(1774) 评论(0) 推荐(0)

UVa OJ 110 - Meta-Loopless Sorts (无循环-元排序)
摘要： Time limit: 3.000 seconds限时：3.000秒Background背景Sorting holds an important place in computer science. Analyzing and implementing various sorting algorithms forms an important part of the education of mo... 阅读全文
posted @ 2010-08-10 03:05 Devymex 阅读(1510) 评论(0) 推荐(0)