PKU 2551. Ones. TLE

21을 예로들면

1 = 1

1 + 10 = 11

1 + 10 + 100 = 105 + 6

1 + 10 + 100 + 1000 = 105 + 21 + 966 + 19

1 + 10 + 100 + 1000 + 10000 = 105 + 21 + 966 + 21 + 9996 + 2

1 + 10 + 100 + 1000 + 10000 + 100000 = 105 + 21 + 966 + 9996 + 21 + 99981

#include <stdio.h> #include <math.h> int main() { int n, count; long long k; while(scanf("%d", &n)!=EOF) { k=0; for(count=0; ; count++) { k+=pow(10, count); k%=n; if(k==0) break; } printf("%d\n", count+1); } return 0; }

오버플로우를 생각 못했네요