### uva 10127: Ones

Given any integer 0 <= n <= 10000 not divisible by 2 or 5, some multiple of n is a number which in decimal notation is a sequence of 1's. How many digits are in the smallest such a multiple of n?

int resolve(int n){
if(n==1) return 1;
int ret=2;
for(int i=11;i%n;ret++) i=(i*10+1)%n;
return ret;
}