题目:https://vjudge.net/problem/UVA-202
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=138
#include#include #include using namespace std;int main(){ int n,d,x,y; int ansx[3003],ansy[3003]; while(scanf("%d%d",&n,&d)!=EOF){ memset(ansx,0,sizeof(ansx)); memset(ansy,0,sizeof(ansy)); x=y=0; ansx[0]=n/d; ansy[0]=n%d; ansx[1]=ansy[0]*10/d; ansy[1]=ansy[0]*10%d;// cout< < < < 50) { for(int i=x;i
思路:
辗转相除,数组存储每一位,前后对照找到两个数字相等并且余数相等的就说明循环节找到了