Light oj--1214(大数整除)
来源:互联网 发布:网络销售策划方案 编辑:程序博客网 时间:2024/04/27 14:47
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
代码如下:
#include<stdio.h>#include<string.h>#include<cmath>int main(){int t,cas,l,b,p;cas=1;char a[250];long long m;scanf("%d",&t);while(t--){scanf("%s%d",a,&b); printf("Case %d: ",cas++); p=0; if(b<0)b=-b; if(a[0]=='-'){ p=1; } l=strlen(a); m=0; for(int i=p;i<l;i++){ m=m*10+a[i]-'0'; if(m>=b) { m=m%b; } } if(m==0) printf("divisible\n"); else printf("not divisible\n");}return 0;}
- Light Oj 1214 大数整除
- Light oj--1214(大数整除)
- 【light-oj】-大数整除(字符串)
- light oj 1214 - Large Division (同于定理--整除运算)
- light oj 1236 【大数分解】
- Light oj 1214 Large Division(同余定理,判断是否整除)
- lightoj 1214 大数的整除
- Light OJ 1214
- 大数整除
- light--oj--1214-- Large Division
- light oj 1214 Large Division
- light oj
- light oj
- Light OJ
- Light OJ
- 大数整除(大数mod)
- 大数被7整除!!
- Light OJ 1214 Large Division 【模拟除法】
- 63岁老人自学单片机,8年做出机器人
- 大斐波那契数杭电1250
- 学习日记--PreferenceFragment测试
- Android设置Settings实现:PreferenceActivity【1】
- php中,获取指定日期的当月天数
- Light oj--1214(大数整除)
- 声明式编程和命令式编程的比较
- 对Android源码中常见的一些flag的运算的理解
- Android Studio系列教程三--快捷键
- VS2008显示代码行号
- 归档model 里面的数据室, 不能归档数值型数据 或者 解归档不出来的解决方法
- 使用Maven构建Web项目的目录结构
- Objective-c 读写文本文件
- MySQL 升级的最佳实践