关闭

Light oj 1214 Large Division(同余定理,判断是否整除)

596人阅读 评论(0) 收藏 举报
分类:



Description

Given two integers, a and b, you should check whethera is divisible by b or not. We know that an integera is divisible by an integer b if and only if there exists an integerc 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) andb (|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' ifa 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


这道题网上很多题解都说是同余定理推出来的结论,我也不知道为什么,上网专门搜了同余定理还是不懂,不过通过这个题还是有一个很好记并且很有用的结论的:

初始化 res为0,然后:

res=(res*10+c[i]-'0')%d
若res==0则可整除这个结论

注意 i 是从0 - n不是从n - 0;


#include<cstdio>
#include<cstring>
#include<string>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<utility>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<math.h>
#include<iterator>
#include<stack>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const double eps=1e-8,PI=3.1415926538;
const LL MOD=1000000000+7;
const LL MAXN=4000007;

char c[301];
LL d;
LL res;
int main()
{
    int T,T1;
    scanf("%d",&T);
    T1=T;
    while(T--)
    {
        scanf("%s%lld",c,&d);
        int n=strlen(c);
        res=0;
        d=d>0?d:-d;
        for(int i=0;i<=n-1;i++)
        {
            if(c[i]=='-')continue;
            res=(res*10+c[i]-'0')%d;
        }
        res%=d;
        printf("Case %d: ",T1-T);
        if(res)printf("not divisible\n");
        else printf("divisible\n");
    }
    return 0;
}




0
0
查看评论

LightOJ1214 - Large Division(大数取余)

题解:同余定理,注意b可能爆int代码#include <cstdio> #include <queue> #include <cstring> #include <iostream> #include <cstdlib> #include...
  • qq_21057881
  • qq_21057881
  • 2016-01-18 17:01
  • 357

Light OJ 1214 - Large Division 【同余定理】

1214 - Large Division PDF (English) Statistics Forum Time Limit: 1 second(s) Memory Limit: 32 MB G...
  • liu6886
  • liu6886
  • 2015-12-03 18:02
  • 270

【Lightoj】1214 - 能否整除(同余定理)

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu Submit Status Practice Ligh...
  • wyg1997
  • wyg1997
  • 2016-01-13 13:38
  • 451

LightOJ 1214 - Large Division (大数求余)

1214 - Large Division Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu Submi...
  • helloiamclh
  • helloiamclh
  • 2016-01-13 17:16
  • 651

Light oj 1214 Large Division(同余定理,判断是否整除)

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 ...
  • baidu_35522092
  • baidu_35522092
  • 2016-08-29 14:26
  • 596

LightOJ1214Large Division (大数求余)

题意: 问b是否能整除a 思路: 大数求余,利用同余。 #include #include typedef long long ll; char str[205]; int main() { int T, b; scanf("%d", &T); ...
  • Rain722
  • Rain722
  • 2017-04-20 10:17
  • 201

light oj 1214 Large Division

Large Division Description Given two integers, a and b, you should check whethera is divisible by b or n...
  • qq_38759048
  • qq_38759048
  • 2017-07-12 09:26
  • 69

Lightoj1214——Large Division(同余定理,判断是否整除)

Given two integers, a and b, you should check whether a is divisible by b or not. We know that an integer a...
  • blue_skyrim
  • blue_skyrim
  • 2016-04-18 15:24
  • 275

LightOJ 1214 Large Division

大数取余#include <cstdio> #include <cstring> const int MAXN = 210; char str[MAXN]; char *snum; long long num; bool solve() { int len = str...
  • gyhguoge01234
  • gyhguoge01234
  • 2017-04-17 12:55
  • 100

Large Division (大数取余,有个坑爹的地方)

Large Division Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu Submit...
  • cs_zlg
  • cs_zlg
  • 2012-09-01 21:38
  • 620
    个人资料
    • 访问:6209次
    • 积分:549
    • 等级:
    • 排名:千里之外
    • 原创:50篇
    • 转载:1篇
    • 译文:0篇
    • 评论:0条