lightoj 1214 - Large Division 大数对小数取余

最新推荐文章于 2019-07-13 11:45:56 发布

zhaoluwei

最新推荐文章于 2019-07-13 11:45:56 发布

阅读量381

点赞数

分类专栏： light oj 文章标签： light oj

本文链接：https://blog.csdn.net/zhaoluwei/article/details/52451529

版权

light oj 专栏收录该内容

15 篇文章 0 订阅

订阅专栏

Description

Given two integers, a and b, you should check whether a is divisible by b or not. We know that an integer a is divisible by an integer b if and only if there exists an integer c such that a = b * c.

Input

Input starts with an integer T (≤ 525), denoting the number of test cases.

Each case starts with a line containing two integers a (-10²⁰⁰ ≤ a ≤ 10²⁰⁰) and b (|b| > 0, b fits into a 32 bit signed integer). Numbers will not contain leading zeroes.

Output

For each case, print the case number first. Then print 'divisible' if a is divisible by b. Otherwise print 'not divisible'.

Sample Input

101 101

0 67

-101 101

7678123668327637674887634 101

11010000000000000000 256

-202202202202000202202202 -101

Sample Output

Case 1: divisible

Case 2: divisible

Case 3: divisible

Case 4: not divisible

Case 5: divisible

Case 6: divisible

题意：看一个大数能否对一个小数整除；

思路：因为大数无法直接输入，可以用字符串来输，再进行转换，记住32位字节的用 long long型；

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char str[300];
int main()
{
	int t,i,j,h=1,m,k,l;
	scanf("%d",&t);
	while(t--)
	{
		k=0;long long n,d=0;
		scanf("%s%lld",str,&n);
	        l=strlen(str);
	        if(str[0]=='-')
	        k++;
	        for(i=k;i<l;i++)
	        {
	        d=(d*10+str[i]-'0')%n;
		}
	        
	printf("Case %d: ",h++);
	if(d)
	printf("not divisible\n");
	else
	printf("divisible\n");
	}
	return 0;
}