poj1047 Round and Round We Go
来源:互联网 发布:15年mac怎么装win10 编辑:程序博客网 时间:2024/06/03 16:33
Round and Round We Go
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12064 Accepted: 5630
Description
A cyclic number is an integer n digits in length which, when multiplied by any integer from 1 to n, yields a"cycle"of the digits of the original number. That is, if you consider the number after the last digit to "wrap around"back to the first digit, the sequence of digits in both numbers will be the same, though they may start at different positions.For example, the number 142857 is cyclic, as illustrated by the following table:
142857 *1 = 142857
142857 *2 = 285714
142857 *3 = 428571
142857 *4 = 571428
142857 *5 = 714285
142857 *6 = 857142
142857 *1 = 142857
142857 *2 = 285714
142857 *3 = 428571
142857 *4 = 571428
142857 *5 = 714285
142857 *6 = 857142
Input
Write a program which will determine whether or not numbers are cyclic. The input file is a list of integers from 2 to 60 digits in length. (Note that preceding zeros should not be removed, they are considered part of the number and count in determining n. Thus, "01"is a two-digit number, distinct from "1" which is a one-digit number.)
Output
For each input integer, write a line in the output indicating whether or not it is cyclic.
Sample Input
142857142856142858010588235294117647
Sample Output
142857 is cyclic142856 is not cyclic142858 is not cyclic01 is not cyclic0588235294117647 is cyclic
题意:给出一个字符串,如果这个字符串分别用1,2,...,len去乘,最终得到的结果还是由这个字符串的字符组成的,那么它是cyclic;
解题思路:给出的数*(len+1)=9...9(len个),那么这个数是cyclic
参考代码:
#include <iostream>#include <string.h>using namespace std;char s[100];int a[100];int main(){while (cin>>s){int len=strlen(s);memset(a,0,sizeof(a));int k=0,left=0;for (int i=len-1;i>=0;i--){int ans=(s[i]-'0')*(len+1)+left;a[k++]=ans%10;left=ans/10;}while (left!=0){a[k++]=left%10;left/=10;}int flag=0;for (int i=0;i<k;i++){if (a[i]!=9){flag=1;break;}}if (flag==1)cout<<s<<" is not cyclic"<<endl;elsecout<<s<<" is cyclic"<<endl;}return 0;}
0 0
- <poj1047>Round and Round We Go
- poj1047 Round and Round We Go
- POJ1047 Round and Round We Go【高精度】
- 高精度乘以单精度 Round and Round We Go poj1047
- UVALive2287 POJ1047 HDU1313 ZOJ1073 Round and Round We Go【大数+数学计算】
- Round and Round We Go
- Round and Round we go
- Round and Round We Go
- zoj1073 Round and Round We Go
- pku1047 Round and Round We Go
- zoj 1073 Round and Round We Go
- Round and Round We Go POJ 1047
- poj 1047 Round and Round We Go
- poj 1047 Round and Round We Go
- ZOJ 1073 Round and Round We Go
- POJ 1047 Round and Round We Go
- ZOJ 1073 Round and Round We Go
- zoj 1073 Round and Round We Go
- Extension Writing Part I: Introduction to PHP and Zend
- 最大公约数
- Extension Writing Part II: Parameters, Arrays, and ZVALs
- 正则表达式语法
- LeetCode – Maximum Gap (Java)
- poj1047 Round and Round We Go
- Extension Writing Part II: Parameters, Arrays, and ZVALs [continued]
- C++学习路线及书籍
- system函数
- STL map demo
- cocos2dx Windows环境配置
- Extension Writing Part III: Resources
- 问题归纳:LINK : fatal error LNK1123: 转换到 COFF 期间失败: 文件无效或损坏
- LINUX学习路线