判断两个数是否能整除(含大整数)

22周赛 - Virtual Judge (vjudge.net)

给出两个数 一个是大整数,另一个是小整数判断两个数是否能整除

手动模拟除法

代码

#include<iostream>
#include<cstring>
#include<cmath>
#define ll long long
using namespace std;
int main()
{
	int n;
	cin>>n;
	for(ll j=1;j<=n;j++)
	{
		string a;
		ll b;
		cin>>a>>b;
		b=abs(b);
		ll s=a.size();
		ll ans=0,mod=0;
		for(ll i=0;i<s;i++)
		{
			if(a[i]<'0'||a[i]>'9')continue;
			mod=a[i]-'0';
			ans*=10;
			ans=(ans+mod)%b;
		}
		ll k=1;
		if(ans)cout<<"Case "<<j<<": not divisible\n";
		else cout<<"Case "<<j<<": divisible\n";
	}
	return 0;
}