高精度算法
shuangyueliao
这个作者很懒,什么都没留下…
展开
-
大明A+B
http://acm.hdu.edu.cn/showproblem.php?pid=1753#include#include#includeusing namespace std;int main(){// freopen("C:\\Users\\John\\Desktop\\hi.txt","r",stdin); char a[1000],b[1000],原创 2015-08-10 19:51:12 · 542 阅读 · 0 评论 -
N!
http://acm.hdu.edu.cn/showproblem.php?pid=1042#include#include#includeusing namespace std;int a[8010];int main(){// freopen("C:\\Users\\John\\Desktop\\hi.txt","r",stdin); int n;原创 2015-08-11 10:28:45 · 605 阅读 · 0 评论 -
Integer Inquiry
http://acm.hdu.edu.cn/showproblem.php?pid=1047#include#include#includeusing namespace std;int max1;void turn(int a[],int dig){ int t; for(int i=1;i { t=a[i]; a[i]=a[dig-i原创 2015-08-10 16:41:46 · 330 阅读 · 0 评论 -
Integer Inquiry 大数相加
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=6&page=show_problem&problem=365#include#includeusing namespace std;void sum(char a[],char b[]){ char c[210原创 2015-05-23 16:34:13 · 402 阅读 · 0 评论 -
10106 - Product
The problem is to multiply two integers X, Y . (0 ≤ X,Y InputThe input will consist of a set of pairs of lines. Each line in pair contains one multiplyer.OutputFor each input pair of lines原创 2015-05-23 22:12:25 · 384 阅读 · 0 评论 -
百度之星2016B题java大数
http://bestcoder.hdu.edu.cn/contests/contest_showproblem.php?cid=690&pid=1002import java.util.*;import java.math.*;public class Main {public static BigInteger[]dp=new BigInteger[210];p原创 2016-05-14 19:38:50 · 353 阅读 · 0 评论