10494 If We Were a Child Again
来源:互联网 发布:昆仑虚魂器进阶数据 编辑:程序博客网 时间:2024/05/21 17:42
这道题目的思路就是用数组将除法模拟一下,一次取出各位进行除法,商一次存储在整型数组中,将余数与下一位结合,此处的用的类型为long long int 以免在余数在与下一位结合的时候造成数据的溢出,至于为什么用long long int 可以防止溢出是因为在与下一位结合的时候其最大位数是 int 型最大位数+1,因此用long long int 可以。最后的余数是整体的余数,数组中的数合起来是商。
#include <stdio.h>#include <string.h>char s1[1000000];long long int a[1000000];int main(){ int i,j,m; char c; long long int s,s2,n; int l; int k,flag; while(scanf("%s %c %lld",s1,&c,&n)!=EOF) { l=strlen(s1); s=0; k=1; flag=0; for(i=0;i<=l-1;i++) { s=s*10+(s1[i]-'0'); s2=s/n; if(s2!=0||(s2==0&&k==0)) { a[flag]=s2; flag+=1; k=0; } s=s%n; } if(c=='%') { printf("%lld\n",s); }else { if(flag==0) { printf("0"); }else { for(i=0;i<=flag-1;i++) { printf("%lld",a[i]); } } printf("\n"); } } return 0;}
- 10494 If We Were a Child Again
- 10494 - If We Were a Child Again
- 10494 - If We Were a Child Again
- 10494 - If We Were a Child Again
- uva10494 - If We Were a Child Again
- 5312 If We Were a Child Again
- If We Were a Child Again
- If We Were a Child Again
- uva10494 if we were a child again
- uva If We Were a Child Again
- uva10494 - If We Were a Child Again
- If We Were a Child Again
- If We Were a Child Again
- UVA10494 If We Were a Child Again
- UVA10494 - If We Were a Child Again
- UVa UVa 10494 - If We Were a Child Again
- 10494 - If We Were a Child Again大总结
- UVaOJ 10494 - If We Were a Child Again
- 数据库设计 Step by Step (4)
- C语言面试小题展博
- 动态页面转静态页面算法
- Hibernate注解使用以及Spring整合
- 托管代码与非托管代码
- 10494 If We Were a Child Again
- C语言中可变参数的使用
- 什么叫程序库
- C++的精英化趋势与两个关键缺陷
- 用 Unix 的设计思想来应对多变的需求
- Ajax+PHP+jQuery图片截图上传
- OpenStack架构预览
- Object Repository相关
- 批处理基础之二:了解@命令