/
Crossover1.java
75 lines (70 loc) · 2.3 KB
/
Crossover1.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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
/*
username: hghbahj7xnsaox
password: CoCD7bo91N
*/
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
class Ideone {
/**
* Complete the function below.
* DONOT MODIFY anything outside this function!
*/
static int[] rearrange(int[] elements) {
int[] binary=new int[elements.length];
for(int i=0;i<elements.length;i++){
int number=elements[i];
int count=0;
while(number!=0){
if((number & 0x1)==1){
count++;
}
number=number>>1;
}
binary[i]=count;
System.out.println("Number:"+elements[i]+" "+binary[i]);
}
for(int i=0;i<elements.length;i++){
for(int j=i+1;j<elements.length;j++){
if(binary[j]<binary[i]){
elements[i]=elements[i]+elements[j];
elements[j]=elements[i]-elements[j];
elements[i]=elements[i]-elements[j];
binary[i]=binary[j]+binary[i];
binary[j]=binary[i]-binary[j];
binary[i]=binary[i]-binary[j];
}
if(binary[i]==binary[j] && elements[j]<elements[i]){
elements[i]=elements[i]+elements[j];
elements[j]=elements[i]-elements[j];
elements[i]=elements[i]-elements[j];
binary[i]=binary[j]+binary[i];
binary[j]=binary[i]-binary[j];
binary[i]=binary[i]-binary[j];
}
}
}
return elements;
}
/**
* DO NOT MODIFY THIS METHOD!
*/
public static void main(String[] args) throws IOException {
Scanner in = new Scanner(System.in);
int n = 0;
n = Integer.parseInt(in.nextLine().trim());
int[] elements = new int[n];
int element;
for (int i = 0; i < n; i++) {
element = Integer.parseInt(in.nextLine().trim());
elements[i] = element;
}
// call rearrange function
int[] results = rearrange(elements);
for (int i = 0; i < results.length; i++) {
System.out.println(String.valueOf(results[i]));
}
}
}