-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathariprog.java
51 lines (44 loc) · 1.44 KB
/
ariprog.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
import java.io.*;
import java.util.*;
public class ariprog {
public static void main(String[] args) throws IOException {
BufferedReader f = new BufferedReader(new FileReader("ariprog.in"));
PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("ariprog.out")));
int num = Integer.parseInt(f.readLine());
int limit = Integer.parseInt(f.readLine());
HashSet<Integer> arr = new HashSet<Integer>(generator(limit));
TreeSet<Integer> ar4 = new TreeSet<Integer>(arr);
Integer[] ar2= ar4.toArray(new Integer[arr.size()]);
int e=0;
int z=(ar2[ar2.length-1]/(num-1));
for(int y=1;y<=z;y++){
for (int i=0;i<ar2.length;i++){
int x=0;
for(int r=0; r<num;r++){
if(!arr.contains(ar2[i]+(y*r))){
break;
}else{
x++;
}
}
if(x>=num){
out.println(ar2[i]+" "+y);
e++;
}
}
}
if(e==0){
out.println("NONE");
}
out.close();
}
static HashSet<Integer> generator(int limit){
HashSet<Integer> hset= new HashSet<>();
for (int i=0; i<=limit;i++){
for(int j=0; j<=limit;j++){
hset.add(i*i+j*j);
}
}
return hset;
}
}