aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Data update

Browse source
This commit is contained in:
Ingy döt Net 2023-09-01 09:35:06 -07:00
parent 61b93a2cd1
commit 5af6d93694
858 changed files with 20572 additions and 2082 deletions
Download patch file Download diff file Expand all files Collapse all files

0
Task/Modular-inverse/Java/modular-inverse.java → Task/Modular-inverse/Java/modular-inverse-1.java
View file

22
Task/Modular-inverse/Java/modular-inverse-2.java Normal file
View file

@ -0,0 +1,22 @@
public final class ModularInverse {
public static void main(String[] aArgs) {
System.out.println(inverseModulus(42, 2017));
}
private static Egcd extendedGCD(int aOne, int aTwo) {
if ( aOne == 0 ) {
return new Egcd(aTwo, 0, 1);
}
Egcd value = extendedGCD(aTwo % aOne, aOne);
return new Egcd(value.aG, value.aY - ( aTwo / aOne ) * value.aX, value.aX);
}
private static int inverseModulus(int aNumber, int aModulus) {
Egcd value = extendedGCD(aNumber, aModulus);
return ( value.aG == 1 ) ? ( value.aX + aModulus ) % aModulus : 0;
}
private static record Egcd(int aG, int aX, int aY) {}
}

2
Task/Modular-inverse/Julia/modular-inverse-2.julia
View file

@ -1,4 +1,4 @@
function modinv{T<:Integer}(a::T, b::T)
function modinv(a::T, b::T) where T <: Integer
b0 = b
x0, x1 = zero(T), one(T)
while a > 1