mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-12-12 14:06:26 +00:00
55 lines
1.2 KiB
C++
55 lines
1.2 KiB
C++
#include <iostream>
|
|
#include <algorithm>
|
|
#include <limits>
|
|
|
|
using std::cin;
|
|
using std::cout;
|
|
const char endl = '\n';
|
|
|
|
int t;
|
|
long long l;
|
|
|
|
long long euler(long long x) {
|
|
long long r = x;
|
|
for (long long i = 2; i * i <= x; i++) {
|
|
if (x % i == 0) {
|
|
r = r / i * (i - 1);
|
|
while (x % i == 0) x /= i;
|
|
}
|
|
}
|
|
if (x > 1) r = r / x * (x - 1);
|
|
return r;
|
|
}
|
|
|
|
long long binpow(__int128 a, long long b, long long m) {
|
|
a %= m;
|
|
__int128 res = 1;
|
|
while (b > 0) {
|
|
if (b & 1) res = res * a % m;
|
|
a = a * a % m;
|
|
b >>= 1;
|
|
}
|
|
return res;
|
|
}
|
|
|
|
int main() {
|
|
std::ios::sync_with_stdio(false);
|
|
|
|
while (cin >> l, l) {
|
|
long long d = std::__gcd(l, 8ll);
|
|
long long n = euler(9ll * l / d);
|
|
long long ans = std::numeric_limits<long long>::max();
|
|
|
|
for (long long i = 1; i * i <= n; i++) {
|
|
if (n % i == 0) {
|
|
if (binpow(10, i, 9ll * l / d) == 1) ans = std::min(ans, i);
|
|
if (binpow(10, n / i, 9ll * l / d) == 1) ans = std::min(ans, n / i);
|
|
}
|
|
}
|
|
|
|
cout << "Case " << ++t << ": " << (ans == std::numeric_limits<long long>::max() ? 0 : ans) << endl;
|
|
}
|
|
|
|
return 0;
|
|
}
|