int bigmod(int* a,int m)  //a為高精度陣列，m為除數
{
	for(int i = 1;i<strlen(c);i++)
	{
		if(a[i]<m)
		{
			a[i+1] = 10*a[i] + a[i+1];
			a[i] = 0;
		}
		else
		{
			a[i+1] = 10*(a[i]%m) + a[i+1];
			a[i] /= m;
		}
	}
	return a[strlen(c)]%m;
}

相關推薦