✅ [C++] Simple Solution || Easy-Understanding
\n\n\n\nint smallestRepunitDivByK(int k)\n{\n   if(k%2==0 || k%5==0) return -1;\n   int ans=1;\n   int remainder=1;\n   int total=1;\n   while(total%k!=0)\n   {
![image](https://assets.leetcode.com/users/images/60b7c2aa-b775-429e-976d-e8edbd3b9204_1640843996.6726162.jpeg)\n\n\n```\nint smallestRepunitDivByK(int k)\n{\n   if(k%2==0 || k%5==0) return -1;\n   int ans=1;\n   int remainder=1;\n   int total=1;\n   while(total%k!=0)\n   {\n       ans++;\n       remainder=(remainder*10)%k;\n       total=(total+remainder)%k;\n   }\n   return ans;\n}\n```\n\n`Vote plz.. vro :|`
['C']