Light Oj 1214 大数整除

最新推荐文章于 2021-02-09 19:31:52 发布

转载最新推荐文章于 2021-02-09 19:31:52 发布 · 113 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/codeyuan/p/4254457.html

本文介绍了一种解决大数整除问题的算法，并通过一个具体的编程实例进行演示。该算法能够判断一个大数是否能被另一个较小的整数整除，适用于大数运算场景。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Large Division
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu
Submit

Status

Practice

LightOJ 1214
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 (-10200 ≤ a ≤ 10200) 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
6

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

<span style="color:#6600cc;">/*******************************************
   
     author   :   Grant Yuan
     time     :   2014.8.7
     algorithm:   大数整除
     source   :   Light Oj 1214
     explain  ：  从ans初始化为0，最低位开始ans=(ans+s[i]-'0')%b;
                  计算到最后，如果ans 等于0，可以整除；
                  否则，不可以整除；
                  
**********************************************/

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define INF 0x3fffffff

using namespace std;

char s[2000002];
int b;
long long ans;
int t;

int main()
{
    scanf("%d",&t);
    for(int i=1;i<=t;i++)
    {    memset(s,0,sizeof(s));
        scanf("%s%d",&s,&b);
        if(b<0) b=-b;
        int l=strlen(s);
        ans=0;
        for(int j=0;j<l;j++)
        {
            if(s[j]=='-') continue;
            ans=(ans*10+(s[j]-'0'))%b;
        }
        if(ans==0)
            printf("Case %d: divisible\n",i);
        else
            printf("Case %d: not divisible\n",i);
    }
    return 0;
}
</span>

转载于:https://www.cnblogs.com/codeyuan/p/4254457.html