Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Comparator;
- import java.util.Scanner;
- import java.util.ArrayList;
- public class Dividers {
- public static void main(String[] args) {
- Scanner in = new Scanner(System.in);
- long n = in.nextLong();
- ArrayList<Long> div = new ArrayList<>();
- long i = 1;
- while(i <= Math.sqrt(n)) {
- if (n % i == 0 && n!= 1) {
- if(n/i != i) {
- div.add(i);
- div.add(n /i);
- }
- else div.add(i);
- }
- i++;
- }
- if(n == 1) div.add(n);
- int k = div.size();
- div.sort(Long::compareTo);
- System.out.println("graph {");
- for (long s : div)
- System.out.println(s);
- for(i = 0; i < k; i++){
- for(long j = i + 1; j < k; j++){
- if(div.get((int)j) % div.get((int)i) == 0){
- int flag = 1;
- long t = i + 1;
- while(t < j) {
- if (div.get((int)j) % div.get((int)t) == 0 && div.get((int)t) % div.get((int)i) == 0) {
- flag = 0;
- break;
- }
- t++;
- }
- if(flag == 1){
- System.out.println(div.get((int)j) + " -- " + div.get((int)i));
- }
- }
- }
- }
- System.out.println("}");
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement