UVA 10127 - Ones UVA • Sep 1, 2020 Problem PDFSolution:#include #include int main() { char a[10000]; long long n,s,k; int i; while(scanf("%lld",&n)==1) { if(n==0) { printf("0\n"); continue; } s=0; for(i=1,k=1;;i++) { s=k%n; if(s==0) { printf("%d\n",i); break; } k=s*10+1; } } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/10127/10127.cpp Tags UVA Competitive Programming Shipu Ahamed Recommended for you UVA UVA 913 - Joana and the Odd Numbers 4 years ago • 1 min read UVA UVA 871 - Counting Cells in a Blob 4 years ago • 3 min read UVA UVA 866 - Intersecting Line Segments 4 years ago • 3 min read