userluoxuan的专栏

前几日看了刘汝佳写的

#include #include #include #define MAX_NUM 205 using namespace std; int main() {     int n, num[MAX_NUM], result[MAX_NUM], ans ;     scanf("%d",&n);     memset(num, 0, sizeof(num));     me

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

解题思路： 就是一般的高精度加法题，唯一需要注意的是输入数据中有些会有前导0

解题思路： 普通的高精度

Description Recall the definition of the Fibonacci numbers:  f1 := 1 f2 := 2 fn := fn-1 + fn-2 (n>=3) Given two numbers a and b, calculate how many Fibonacci numbers are in the range

解题思路： 千万别看到阶层就以为是

Description Problems involving the computation of exact values of very large magnitude and precision are common. For example, the computation of the national debt is a taxing experience for many