大整数运算（加法，减法，除法，求余，求最大公约数）

Another lottery

Description

Even in times of an economic crisis, people in Byteland still like to participate in lotteries. With a bit of luck, they might get rid of all their sorrows and become rich.
The most popular lottery in Byteland consists of m rounds. In each round, everyone can purchase as many tickets as he wishes, and among all tickets sold in this round, one ticket is chosen randomly, each one with the same probability. The owner of that ticket wins the prize money of this round. Since people in Byteland like powers of 2, the prize money for the winner of round i amounts to 2^i Bytelandian Dollars.
Can you determine for each participant in the lottery the probability that he will win more money than anybody else?

Input

The input consists of several test cases. Each test case starts with a line containing two integers n and m, the number of participants in the lottery and the number of rounds in the lottery. You may assume that 1 ≤ n ≤ 10000 and 1 ≤ m ≤ 30.
The following n lines contain the description of the tickets bought by the participant. The ith such line contains m non-negative integers c1, ..., cm, where cj (1 ≤ j ≤ m) is the amount of tickets of round j bought by partipant i. The total number of tickets sold in each round is between 1 and 10^30.

Output

For each test case, print n lines of output, where line i contains the probability as a reduced fraction that participant i wins the most money. See the sample output for details.

Sample Input

5 4
3 1 2 3
3 1 2 4
3 1 3 5
4 4 4 0
5 5 0 0
1 1
1

 

Sample Output

1 / 4
1 / 3
5 / 12
0 / 1
0 / 1
1 / 1

我们OJ上的一道从HDU拉过来的题，改了改，把数据范围加大，就成了高精度运算的题目了。

写了好久，而且写好时发现怎么也过不了，用这个高精度的代码去HDU上提交了一下，AC了，

然后就抓出服务器上的数据，对比了下，发现原来是原数据错了>.<,好吧，再出数据，再改题

把10^18次方的数据范围也改到10^30次方了，这下只能高精度计算了，也别想着用__int64

了，嘿嘿~

#include<string.h>
#include<stdio.h>
#include<time.h>
#define M 36
#define L 10008

char str[M];

short total[M];
short gcd[M],div[M],mod[M];
short list[L][M];
int n,m;

void Turn(short n[],char s[])
{//char arr to short arr
	short i,l=strlen(s);
	for(i=0;i<l;i++)n[i]=s[l-i-1]-'0';
	for(;i<M;i++) n[i]=0;
}
void Add(short a[],short b[])
{//a+=b
	short i;
	for(i=0;i<M;i++){
		a[i]+=b[i];
		if(a[i]>9)	a[i+1]++,a[i]-=10;
	}
}
bool Sub(short a[],short b[])
{//if(a<b)return false;
	//else a-=b&&return true;
	short i,j;
	for(i=M-1;i>=0;i--){
		if(a[i]>b[i]) break;
		if(a[i]<b[i]) return false;
	}
	for(j=0;j<=i;j++){
		a[j]-=b[j];
		if(a[j]<0)	a[j]+=10,a[j+1]--;
	}
	for(;j<M;j++) a[j]=0;
	return true;
}
void Div(const short a[],const short b[],short ans[],short mod[])
{//ans=a/b;mod=a%b;
	int la,lb,d;
	short tmp[M];
	memset(ans,0,sizeof(tmp));
	memmove(mod,a,sizeof(tmp));
	for(la=M-1;la>0&&!a[la];la--);
	for(lb=M-1;lb>0&&!b[lb];lb--);
	la++,lb++;
	while(la>=lb){
		d=la-lb;
		memset(tmp,0,sizeof(tmp));
		memmove(tmp+d,b,sizeof(b[0])*lb);
		while(Sub(mod,tmp)) ans[d]++;
		la--;
	}
}
void Print(short a[])
{
	short i;
	for(i=M-1;!a[i]&&i>0;i--);
	for(i;i>=0;i--)
		printf("%d",a[i]);
}
bool Zero(short a[])
{//a==0?;
	short i;
	for(i=0;i<M&&!a[i];i++);
	return i>=M;
}
void GCD(const short a[],const short b[],short ans[])
{//gcd(a,b);
	short r[M],m[M],n[M];
	memmove(m,a,sizeof(m));
	memmove(n,b,sizeof(n));
	do{
		Div(m,n,ans,r);
		memmove(m,n,sizeof(r));
		memmove(n,r,sizeof(r));
	}while(!Zero(r));
	memmove(ans,m,sizeof(r));
}
int main()
{
	int i,j;
	//freopen("data1.in","r",stdin);
	//freopen("out.out","w",stdout);

	while(~scanf("%d%d",&n,&m)){
		memset(total,0,sizeof(total));
		for(i=0;i<n;i++){
			for(j=0;j<m;j++)
				scanf("%s",str);
			Turn(list[i],str);
			Add(total,list[i]);
		}
		for(i=0;i<n;i++){
			GCD(list[i],total,gcd);
			Div(list[i],gcd,div,mod);
			Print(div);printf(" / ");
			Div(total,gcd,div,mod);
			Print(div);puts("");
		}
	}
	return 0;
}