Large Division LightOJ
来源:互联网 发布:淘宝申请退款会不退吗 编辑:程序博客网 时间:2024/06/16 04:51
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<stdio.h>#include<string.h>#define N 500int main(){char s[N];long long i,j,k,m,n,t,T,p=0;scanf("%lld",&T);while(T--){p++;scanf("%s%lld",s,&n);int l=strlen(s);k=0;t=0;if(n<0)n=-n;if(s[0]=='-'){for(i=1;i<l;i++){m=s[i]-'0';k=(m+t)%n;t=k*10;}}else{for(i=0;i<l;i++){m=s[i]-'0';k=(m+t)%n;t=k*10;}}//printf("%d\n",k);if(k==0){printf("Case %d: divisible\n",p);}else{printf("Case %d: not divisible\n",p);}}return 0;}
- 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
- Large Division LightOJ
- Large Division LightOJ
- Large Division LightOJ
- [LightOJ-1214][Java] Large Division
- 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(大数除法)
- nyoj 171 聪明的kk
- c/c++ 随机函数rand()和srand()学习笔记
- volatile关键字的作用
- hpuoj【1200】我说你猜【输入输出格式要求】
- VS启动白屏
- Large Division LightOJ
- 程序设计竞赛小技巧
- webserver soap wsdl 整理运用
- 51nod 正整数分组 01背包
- 线性判别分析(Linear discriminant analysis)
- 六、STL的数值计算---数组(向量)运算---数组子集类-slice类和slice_array类模板
- Fy's dota2
- VINS 代码学习(一)--feature_tracker 代码
- 使用Apache中的HttpClient的实例CloseableHttpClient进行http请求