hdu1313 Round and Round We Go (大数乘法)
来源:互联网 发布:vivo软件开发待遇 编辑:程序博客网 时间:2024/06/06 14:25
Problem Description
A cyclic number is an integer n digits in length which, when multiplied by any integer from 1 to n, yields a ~{!0~}cycle~{!1~} of the digits of the original number. That is, if you consider the number after the last digit to ~{!0~}wrap around~{!1~} 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
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, ~{!0~}01~{!1~} is a two-digit number, distinct from ~{!0~}1~{!1~} which is a one-digit number.)
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
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, ~{!0~}01~{!1~} is a two-digit number, distinct from ~{!0~}1~{!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~n(它的长度)的任何一个数,所得的结果为这个字符串循环后所得的整数。
思路:因为长度最多只有60,所以直接模拟就行了,附上大数乘法模板。
#include<iostream>#include<stdio.h>#include<stdlib.h>#include<string.h>#include<math.h>#include<vector>#include<map>#include<set>#include<queue>#include<stack>#include<string>#include<algorithm>using namespace std;typedef long long ll;typedef long double ldb;#define inf 99999999#define pi acos(-1.0)#define eps 1e-15#define maxn 200#define Len 3000//大数的长度using namespace std;int len;char a[Len],b[Len],c[Len];void Mul(char a[],char b[],char c[])//大数乘法{ int i,j,alen,blen,clen; for(i=0; i<Len;i++){ c[i]='0'; } c[Len]='\0'; alen=strlen(a); blen=strlen(b); reverse(a,a+alen); reverse(b,b+blen); int sum=0; for(i=0; i<alen; i++){ for(j=0; j<blen; j++){ sum+=c[i+j]-'0'+(a[i]-'0')*(b[j]-'0'); c[i+j]=(sum%10)+'0'; sum/=10; } while(sum){ c[i+j++]+=sum%10; sum/=10; } } clen=len; c[clen]='\0'; reverse(c,c+clen);}char str[700],str1[700],str2[700];struct node{ char s[70];}d[70];bool cmp(node a,node b){ return strcmp(a.s,b.s)<0;}int main(){ int n,m,i,j,tot,alen,blen; while(scanf("%s",str1)!=EOF) { len=strlen(str1); for(i=0;i<len;i++){ str[i]=str1[i]; str[i+len]=str1[i]; } str[2*len]='\0'; for(i=1;i<=len;i++){ tot=i-1; for(j=0;j<len;j++){ d[i].s[j]=str[tot];tot++; } d[i].s[len]='\0'; } sort(d+1,d+1+len,cmp); int flag=1; for(i=2;i<=len;i++){ alen=len; for(j=0;j<len;j++){ a[j]=str[j]; } a[alen]='\0'; int tt=i; blen=0; while(tt){ b[blen++]=tt%10+'0'; tt/=10; } b[blen]='\0'; reverse(b,b+blen); Mul(a,b,c); if(strcmp(c,d[i].s)!=0){ flag=0; } } if(flag)printf("%s is cyclic\n",str1); else printf("%s is not cyclic\n",str1); }}
0 0
- hdu1313 Round and Round We Go (大数乘法)
- UVALive2287 POJ1047 HDU1313 ZOJ1073 Round and Round We Go【大数+数学计算】
- POJ 1047 Round and Round We Go (大数乘法) 水
- POJ Round and Round We Go 大数位乘法
- POJ 1047Round and Round We Go——大数乘法+匹配
- ZOJ 1073 Round and Round We Go(高精度乘法)
- HDU 1313 Round and Round We Go (Java大数)
- POJ 1049 Round and Round We Go 大数模拟
- POJ 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
- Android学习之ListView与SimpleAdapter的使用
- 第1章 Java语言概述与开发环境
- HTML5之Web开发备用设计记录
- linux 分析 ptrace()
- Universal-Image-loader 部分源码讲解 及 如何 配合阿里云 实现图片缓存。
- hdu1313 Round and Round We Go (大数乘法)
- android:eclipse看着很舒服的字体和启动速度很快android模拟器
- 【机房合作】Datagridview汉字表头的设置
- leetcode日志:解题参考引用
- js之事件冒泡和事件捕获详细介绍
- POJ_2406_PowerStrings
- Fresco图片加载框架的简单介绍
- PHP之代码片段收集
- 非托管Dll动态调用