LIGHTOJ-1078 - Integer Divisibility

阳光穿透心脏的1/2处 2022-08-18 02:07 3阅读 0赞

1078 - Integer Divisibility

<table> 
 <tbody> 
  <tr> 
   <td title="normal judge" style="color:rgb(79,107,114)"><a href="http://www.lightoj.com/volume_submit.php?problem=1078" style="color:rgb(79,107,114)" rel="nofollow"><img src="http://www.lightoj.com/images/submit1.png" alt=""></a></td> 
   <td style="color:rgb(79,107,114)"><a href="http://www.lightoj.com/volume_showproblem.php?problem=1078&amp;language=english&amp;type=pdf" style="color:rgb(79,107,114)" rel="nofollow">PDF (English)</a></td> 
   <td style="color:rgb(79,107,114)"><a href="http://www.lightoj.com/volume_problemstat.php?problem=1078" style="color:rgb(79,107,114)" rel="nofollow">Statistics</a></td> 
   <td style="color:rgb(79,107,114)"><a href="http://www.lightoj.com/forum_showproblem.php?problem=1078" style="color:rgb(79,107,114)" rel="nofollow">Forum</a></td> 
  </tr> 
 </tbody> 
</table>

<table> 
 <tbody> 
  <tr> 
   <td style="color:rgb(121,114,104); background:rgb(245,250,250)">Time Limit:&nbsp;<span style="color:rgb(180,95,4)">2 second(s)</span></td> 
   <td style="color:rgb(121,114,104); background:rgb(245,250,250)">Memory Limit:&nbsp;<span style="color:rgb(180,95,4)">32 MB</span></td> 
  </tr> 
 </tbody> 
</table>

If an integer is not divisible by 2 or 5, some multiple of that number in decimal notation is a sequence of only a digit. Now you are given the number and the only allowable digit, you should report the number of digits of such multiple.

For example you have to find a multiple of 3 which contains only 1's. Then the result is 3 because is 111 (3-digit) divisible by 3. Similarly if you are finding some multiple of 7 which contains only 3's then, the result is 6, because 333333 is divisible by 7.

# Input #

Input starts with an integer **T (≤ 300)**, denoting the number of test cases.

Each case will contain two integers **n (0 < n ≤ 106** and **n** will not be divisible by **2** or **5**) and the allowable digit **(1 ≤ digit ≤ 9)**.

# Output #

For each case, print the case number and the number of digits of such multiple. If several solutions are there; report the minimum one.

<table> 
 <tbody> 
  <tr> 
   <td> <h1 style="color:green">Sample Input</h1> </td> 
   <td> <h1 style="color:green">Output for Sample Input</h1> </td> 
  </tr> 
  <tr> 
   <td> <p>3</p> <p>3 1</p> <p>7 3</p> <p>9901 1</p> </td> 
   <td> <p>Case 1: 3</p> <p>Case 2: 6</p> <p>Case 3: 12</p> 
    <div> 
     <br> 
    </div> </td> 
  </tr> 
 </tbody> 
</table>

求几个一位数能被第一个数整除，模拟两数相除的过程！

#include<cstdio>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    int main()
    {
    	int i,j,k,a,b,m,n,num1,num2,cot=1;;
    	scanf("%d",&n);
    	
    	while(n--)
    	{
    		num1=0;
    		num2=0;
    		scanf("%d%d",&a,&b);
    		int x=a,y=b;
    		while(x>y)
    		{
    			y=y*10+b;
    			num2++;
    		}
    		
    		while(y%x)
    		{
    			y=(y%x)*10+b;
    			num1++;
    		}
    		printf("Case %d: %d\n",cot++,num1+num2+1);
    	}
    	return 0;
    }