Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
25 changes: 25 additions & 0 deletions Perjalanan Ki Adiwidjaja/KiAdi.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,25 @@
import java.util.Scanner;

public class KiAdi {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);

int position_x = scanner.nextInt();
int position_y = scanner.nextInt();

scanner.nextLine();

char[] moves = scanner.nextLine().toCharArray();

for (char move : moves) {
switch (move) {
case 'u': position_x--;break;
case 's':position_x++;break;
case 't':position_y--;break;
case 'b':position_y++;break;
}
}

System.out.println(position_x + " " + position_y);;
}
}
47 changes: 47 additions & 0 deletions Vektor/Vector.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,47 @@
import java.util.*;
public class Vektor {
public static void main(String[] args) {
System.out.println("start");
Scanner in = new Scanner(System.in);
String[] vek = in.nextLine().split("[ ]");
Arrays.sort(vek);
int val = 0;
if(vek.length % 2 == 1){
int n = vek.length-1;
boolean l = false;
if(n+1 > 3){
val -= Integer.valueOf(vek[n]);
val += Integer.valueOf(vek[n-1]);
val += Integer.valueOf(vek[n-2]);
} else{
val += Integer.valueOf(vek[n])/2;
val += Integer.valueOf(vek[n-1])/2;
n += 1;
}
for(int i = 0; i <= n-3; i++){
if(l){
val += Integer.valueOf(vek[i]);
l = false;
} else{
val -= Integer.valueOf(vek[i]);
l = true;
}
}
}
else{
int n = vek.length-1;
boolean l = false;
for(int i = 0; i <= n; i++){
if(l){
val += Integer.valueOf(vek[i]);
l = false;
} else{
val -= Integer.valueOf(vek[i]);
l = true;
}
}
}
if(val == 0) System.out.println("MUNGKIN");
else System.out.println("MUSTAHIL");
}
}