-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCRT.java
95 lines (70 loc) · 2.1 KB
/
CRT.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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
import java.util.*;
public class CRT {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int size;
System.out.println("Enter the no. of equations: ");
size = input.nextInt();
int[] rem = new int[size];
int[] num = new int[size];
print("Enter "+size+"remainders");
for(int i=0; i<size; i++){
rem[i] = input.nextInt();
}
print("Enter "+size+"numbers");
for(int i=0; i<size; i++){
num[i] = input.nextInt();
}
print("Numbers: "+Arrays.toString(num)+'\n');
print("Remainders: "+Arrays.toString(rem)+'\n');
print("The smallest value of X for following problem is: "+computeMinX(rem,num));
// print("sum = "+sum+"\n");
}
public static int computeMinX(int[] rem, int[] num){
//STEP 1
int product = 1;
for (int i=0; i<num.length; i++ ) {
product *= num[i];
}
print("Product of all numbers is: "+product);
int partialProduct[] = new int[num.length];
int inverse[] = new int[num.length];
int sum = 0;
for (int i=0; i<num.length; i++) {
partialProduct[i] = product/num[i];//floor division
inverse[i] = computeInverse(partialProduct[i],num[i]);
sum += partialProduct[i] * inverse[i] * rem[i];
}
print("Partial product array is: "+Arrays.toString(partialProduct)+"\n");
print("Multiplicative inverse modulo of partial product: "+Arrays.toString(inverse)+"\n");
print("Sum = "+sum+"\n");
return sum % product;
}
public static int computeInverse(int a, int b)
{
int m = b, t, q;
int x = 0, y = 1;
if (b == 1)
return 0;
// Apply extended Euclid Algorithm
while (a > 1)
{
// q is quotient
q = a / b;
t = b;
// m is remainder now, process
// same as euclid's algo
b = a % b;a = t;
t = x;
x = y - q * x;
y = t;
}
// Make x1 positive
if (y < 0)
y += m;
return y;
}
public static void print(String arg){
System.out.println(arg);
}
}