摘要：
Given an integer N(0 ≤ N ≤ 10000), your task is to calculate N! InputOne N in one line, process to the end of file. OutputFor each N, ... 阅读全文
posted @ 2019-01-20 22:29
black_hole6
阅读(171)
评论(0)
推荐(0)
摘要：
There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2). InputInput consists of a sequence of ... 阅读全文
posted @ 2019-01-20 14:03
black_hole6
阅读(140)
评论(0)
推荐(0)
摘要：
In many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of da... 阅读全文
posted @ 2019-01-20 13:44
black_hole6
阅读(213)
评论(0)
推荐(0)
摘要：
The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then th... 阅读全文
posted @ 2019-01-20 13:22
black_hole6
阅读(234)
评论(0)
推荐(0)
浙公网安备 33010602011771号