Ultraviolet A 202-repeating decimals

Question: The cycle section for calculating scores.

Analysis: number theory, combination.

The remainder of n divided by m can only be 0 ~ On the basis of the drawer principle, when m + 1 is calculated, at least one remainder is the same,

It is a cyclic section. It stores the remainder and divisor and outputs the result.

Note: (⊙ _ ⊙ ).

#include <iostream>#include <cstdlib>#include <cstring>#include <cstdio>using namespace std;int r[3003],u[3003],s[3003];int main(){int n,m,t;while (cin >> n >> m) {t = n;memset(r, 0, sizeof(r));memset(u, 0, sizeof(u));int count = 0;r[count ++] = n/m;n = n%m;while (!u[n] && n) {u[n] = count;s[count] = n;r[count ++] = 10*n/m;n = 10*n%m;}printf("%d/%d = %d",t,m,r[0]);printf(".");for (int i = 1 ; i < count && i <= 50 ; ++ i) {if (n && s[i] == n) printf("(");printf("%d",r[i]);}if (!n) printf("(0");if (count > 50) printf("...");printf(")\n");printf("   %d = number of digits in repeating cycle\n\n",!n?1:count-u[n]);}return 0;}

Ultraviolet A 202-repeating decimals