
大数
文章平均质量分 75
ultimater
桃李争辉飒爽英姿斗艳,成功失败总是欢乐伤悲!
展开
-
POJ 1405 Heritage
Description Your rich uncle died recently, and the heritage needs to be divided among your relatives and the church (your uncle insisted in his will that the church must get something). There are N原创 2012-07-19 07:44:45 · 1447 阅读 · 0 评论 -
HDU 1066 Last non-zero Digit in N!
Problem Description The expression N!, read as "N factorial," denotes the product of the first N positive integers, where N is nonnegative. So, for example, N N! 0 1 1 1 2 2 3 6 4 24原创 2012-08-18 22:38:50 · 4119 阅读 · 1 评论 -
HDU 1018 Big Number
Problem Description In many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you ar原创 2012-08-20 09:33:08 · 4019 阅读 · 0 评论 -
HDU 1130 How Many Trees?
Problem Description A binary search tree is a binary tree with root k such that any node v reachable from its left has label (v) label (k). It is a search structure which can find a node with labe原创 2012-08-29 19:37:10 · 2790 阅读 · 0 评论 -
HDU 1002 A + B Problem II
Problem Description I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B. Input The first line of the input contains an integer原创 2012-08-20 08:53:24 · 9836 阅读 · 4 评论 -
HDU 1250 Hat's Fibonacci
Problem Description A Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1. F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n原创 2012-08-28 15:51:01 · 2961 阅读 · 1 评论