import java.util.Scanner;
public class ACM_1494 {
public static void main(String[] args){
Scanner s = new Scanner(System.in);
int n = s.nextInt();
int u = s.nextInt();
int d = s.nextInt();
while(n!=0){
int min=0;
int path=0;
while(path<n){
path = path + u;
min = min+1;
if(path >=n)
break;
else{
path = path - d;
min = min+1;
}
}
System.out.println(min);
n = s.nextInt();
u = s.nextInt();
d = s.nextInt();
}
}
}
ACM_1494
最新推荐文章于 2022-04-07 04:00:00 发布