TOJ
文章平均质量分 71
Salvare219
_:3_
展开
-
TOJ 10008 a^b mod c
题目链接 : TOJ10008 10008 - a^b mod c Time Limit: 1000MS Memory Limit: 65536KB Description The calculation of ab mod c arises in many fields of computer science, this time we brought it原创 2013-05-17 13:41:15 · 468 阅读 · 0 评论 -
TOJ 10009 GCD and LCM
题目链接 : TOJ10009 10009 - GCD and LCM Time Limit: 1000MS Memory Limit: 65536KB Description In mathematics, the greatest common divisor(GCD), sometimes known as the greatest common fa原创 2013-05-17 13:43:15 · 760 阅读 · 0 评论 -
TOJ 10007 The last non-zero digit of n!
题目链接 :TOJ10007 10007 - The last non-zero digit of n! Time Limit: 5000MS Memory Limit: 65535KB Description Given an integer n, please output the last non-zero digit ofn! For exam原创 2013-05-17 13:34:50 · 555 阅读 · 0 评论 -
TOJ 10002 The Tower of Hanoi
题目链接 :TOJ10002 10002 - The Tower of Hanoi Time Limit: 1000MS Memory Limit: 65536KB Description You are given a tower of n disks, initially stacked in decreasing size on one of three peg原创 2013-05-08 22:45:59 · 521 阅读 · 0 评论 -
TOJ 10006 Josephus Problem
题目链接 : TOJ10006 10006 - Josephus Problem Time Limit: 1000MS Memory Limit: 65536KB Description Given a group of n men arranged in a circle under the edict that everymth man will be原创 2013-05-08 22:56:06 · 496 阅读 · 0 评论 -
TOJ 10004 Prime Factorization
题目链接 : TOJ10004 10004 - Prime Factorization Time Limit: 1000MS Memory Limit: 65536KB Description For a given integer, "Prime Factorization" is finding which prime numbers you need原创 2013-05-08 22:51:30 · 526 阅读 · 0 评论