蓝桥杯-1205-买不到的数目
作者:
Distefano
,
2022-11-17 21:06:03
,
所有人可见
,
阅读 198
import java.util.*;
import java.io.*;
class Main{
static int n;
static int m;
public static void main(String[] args)throws IOException{
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
String[] res = in.readLine().split(" ");
n = Integer.valueOf(res[0]);
m = Integer.valueOf(res[1]);
int max = 0;
int[] num = new int[1002001];
int k = 0;
for(int i = 0;i<=1000;i++){
for(int j = 0;j<=1000;j++){
if(i == 0&&j == 0) continue;
num[k++] = n*i+m*j;
}
}
Arrays.sort(num);
for(int i = 1001*1001-500000;i>0;i--){
if(num[i] == num[i-1]) continue;
else if(num[i]-num[i-1] == 1) continue;
else if(num[i] - num[i-1]>1){
max = num[i] - 1;
break;
}
}
out.print(max);
out.flush();
}
}