2016年12月2日CUIT ACM 高精度专题题解
jianwei2016
在秃头的边缘试探
展开
-
C++用纯字符串来处理高精度问题代码
#include#include#include#includeusing namespace std;//compare比较函数:相等返回0,大于返回1,小于返回-1int compare(string str1,string str2){ if(str1.length()>str2.length()) return 1; else if(str1.length(原创 2016-12-04 22:20:27 · 533 阅读 · 0 评论 -
CUIT 2016 新生训练题第一周 A - 大菲波数
A - 大菲波数Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescriptionFibonacci数列,定义如下: f(1)=f(2)=1 f(n)=f(n-1)+f(n-2) n>=3。 计算第n项Fibonacci数值。原创 2016-12-04 22:33:32 · 577 阅读 · 2 评论 -
CUIT 2016 新生训练题第一周 C - Bull Math
C - Bull Math Bulls are so much better at math than the cows. They can multiply huge integers together and get perfectly precise answers ... or so they say. Farmer John wonders if their answers原创 2016-12-08 11:17:00 · 255 阅读 · 0 评论 -
CUIT 2016 新生训练题第一周 B - Adding Reversed Numbers
B - Adding Reversed Numbers The Antique Comedians of Malidinesia prefer comedies to tragedies. Unfortunately, most of the ancient plays are tragedies. Therefore the dramatic advisor of ACM h原创 2016-12-08 10:49:19 · 417 阅读 · 0 评论 -
CUIT 2016 新生训练题第一周 E - N!
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, output N! in one line. Sample Input123Sample原创 2016-12-08 13:07:50 · 364 阅读 · 0 评论 -
CUIT 2016 新生训练题第一周 D-Text Reverse
Text ReverseTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 25 Accepted Submission(s) : 13Problem DescriptionIgnatius likes原创 2016-12-08 14:45:39 · 457 阅读 · 0 评论