LightOJ 1214 Large Division (数学)

题意：判断a是否能除b。

题解：数学
大数，转字符串，循环取余即可。

注意判断前置符号

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<fstream>
#include<map>
#define ll long long
using namespace std;

char s[222];
ll t, n;
int main() {
	scanf("%lld", &t);
	int kase = 0;
	while (t--) {
		scanf("%s%lld", s, &n);
		int len = strlen(s);
		ll ans = 0;
		for (int i = 0; i < len; i++) {
			if (s[i] == '-') {
				continue;
			}
			ans = (ans * 10 + s[i] - '0') % n;
		}
		if (ans == 0) printf("Case %d: divisible\n", ++kase);
		else printf("Case %d: not divisible\n", ++kase);
	}
	return 0;
}