【NOIP】OpenJudge - 15-03：雇佣兵

 1 #include<stdio.h>//雇佣兵
 2 
 3 int main()
 4 {
 5     int M,N,X,n,m,max=0;
 6     scanf("%d%d%d",&M,&N,&X);
 7     n=N;
 8     m=M;
 9     while(1)
10     {
11         M=M%n;
12         N=N+(m/N);
13         if(N>max)
14             max=N;
15         
16         
17         if(X-(m-M)>=0)
18         {
19             X=X-(m-M);
20             M=m;
21         }
22         else break;
23         n=N;
24         m=M;
25         
26         }
27     
28     printf("%d\n",max);
29     return 0;
30 }

 

转载于:https://www.cnblogs.com/QuantumGhost/p/5258988.html