【lightoj 1214】Large Division (大数除法)
来源:互联网 发布:单片机矩阵键盘原理图 编辑:程序博客网 时间:2024/06/09 13:23
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 is divisible by an integer b if and only if there exists an integer c such that a = b * c.
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.
For each case, print the case number first. Then print 'divisible' if a is divisible by b. Otherwise print 'not divisible'.
6
101 101
0 67
-101 101
7678123668327637674887634 101
11010000000000000000 256
-202202202202000202202202 -101
Case 1: divisible
Case 2: divisible
Case 3: divisible
Case 4: not divisible
Case 5: divisible
Case 6: divisible
#include<cstdio>#include<cstring>typedef __int64 LL;LL b;int t;char a[205];int main(){scanf("%d",&t);int cs=1;while(t--){scanf("%s%lld",a,&b);int l=strlen(a);LL ans=0;for(int i=0;i<l;i++){if(a[i]=='-') continue;ans=(ans*10-(a[i]-'0'))%b;}if(ans==0) printf("Case %d: divisible\n",cs++);else printf("Case %d: not divisible\n",cs++);}return 0;}
- LightOj 1214 Large Division(大数除法)
- 【lightoj 1214】Large Division (大数除法)
- 【技巧-模拟除法】LightOJ Large Division 1214
- lightoj--1214--Large Division(大数取余)
- LightOJ 1214 - Large Division (大数求余)
- LightOJ 1214 - Large Division (大数取余)
- LightOJ 1214 Large Division
- lightOJ 1214 Large Division
- LightOJ 1214 Large Division
- LightOJ 1214Large Division
- LIGHTOJ-1214 - Large Division
- LightOJ 1214 Large Division
- LightOJ 1214 Large Division
- lightoj 1214 - Large Division 大数对小数取余
- lightoj 1214 - Large Division 大数对小数取余
- [LightOJ-1214][Java] Large Division
- lightoj 1214 大数除法
- lightoj1214 - Large Division【大数整除小数判定 模拟除法】
- 简单且广泛运用的模式——单例模式
- 2017.08.21
- JavaScript基础库
- Linux进程内存分析和内存泄漏定位
- 记一次生产故障,数据库报错:WARNING: inbound connection timed out (ORA-3136)
- 【lightoj 1214】Large Division (大数除法)
- reg51 reg52区别
- form表单中enctype属性全解析
- 栈和队列实现停车场(2)
- css复习整理(四):css定位
- HDU 1711 Number Sequence
- linux modules 指定模块编译
- 浅谈Nginx负载均衡与F5的区别
- 使用 Navicat Lite 连接 Oracle 数据库