Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution We will use professor’s rules and transform all grades: – We find how many times (n) is 5 in given grade – if it is divisible without a remainder, we do nothing – it not we round it to neareast […]
Hackerrank – Problem description The problem description – Hackerrank. Solution I created an array of all positive numbers, which satisfy conditions specified in problem statement. This set should contain elements from to . I filter all numbers from the set that are valid for an equation a . The array of positive numbers can be […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution We need to find the highest hurdle. If it is greater than k then substract its height with k and we have the result. Otherwise print 0. I created solution in: Scala Java JavaScript Ruby All solutions are also available […]
ŠARAL 2.0 – Language specification Note: This is the English translation of the original specification document in Slovak. My specification is based on a former Šaral presentation (Slovak). Identifier are composed from lower and uppercase characters, digits and underscores. They can start with a letter or an underscore, such as _?[:letter:]([:digit:][:letter:]_)*. Key words
|
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 |
furt meňak parcela dimenzion pravda ošaľ skoroošaľ logický skutočné neskutočné numeralio písmeno slovo falda inakši bar paľ do baru vrac še z baru vrac stuj keď potom inak zrob s meňakom od do kým rob ciskaj vežmi sluchaj povidz a alebo ne |
Keywords […]
Šaral – The beginning We would like to introduce you with newest top level evolution in information crunching. It is a problem-science-tech-oriented programming language Šaral. The famous šariš-american company IBM have always been trying to create a language, which a computer would understand as good as human understands. It could have been in 2012 when […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution I created solution in: Java All solutions are also available on my GitHub. Java
|
1 2 3 4 5 6 7 8 9 10 11 12 |
import java.util.*; class Solution { public static void main(String [] args) { Scanner sc = new Scanner(System.in); int line = 1; while (sc.hasNextLine()) { System.out.println(line ++ + " " + sc.nextLine()); } sc.close(); } } |
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution I created solution in: Java All solutions are also available on my GitHub. 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 |
import java.util.*; class Solution{ public static void main(String []argh) { Scanner sc = new Scanner(System.in); int t = sc.nextInt(); for(int i = 0; i < t; i++) { try { long x = sc.nextLong(); System.out.println(x + " can be fitted in:"); if(x >= -128 && x <= 127) { System.out.println("* byte"); } if(x >= Short.MIN_VALUE && x <= Short.MAX_VALUE) { System.out.println("* short"); } if(x >= Integer.MIN_VALUE && x <= Integer.MAX_VALUE) { System.out.println("* int"); } if(x >= Long.MIN_VALUE && x <= Long.MAX_VALUE) { System.out.println("* long"); } } catch(Exception e) { System.out.println(sc.next() + " can't be fitted anywhere."); } } } } |
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution I created solution in: Java All solutions are also available on my GitHub. 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 |
import java.util.*; import java.text.*; public class Solution { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); double payment = scanner.nextDouble(); scanner.close(); NumberFormat usFormat = NumberFormat.getCurrencyInstance(Locale.US); NumberFormat cnFormat = NumberFormat.getCurrencyInstance(Locale.CHINA); NumberFormat frFormat = NumberFormat.getCurrencyInstance(Locale.FRANCE); NumberFormat inFormat = NumberFormat.getCurrencyInstance(new Locale("en", "in")); String us = usFormat.format(payment); String india = inFormat.format(payment); String france = frFormat.format(payment); String china = cnFormat.format(payment); System.out.println("US: " + us); System.out.println("India: " + india); System.out.println("China: " + china); System.out.println("France: " + france); } } |
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution I created solution in: Java All solutions are also available on my GitHub. 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 |
import java.util.*; public class Solution { public static void main(String[] args) { Scanner in = new Scanner(System.in); int month = in.nextInt(); int day = in.nextInt(); int year = in.nextInt(); Calendar cal = Calendar.getInstance(); cal.set(Calendar.YEAR, year); cal.set(Calendar.MONTH, month - 1); cal.set(Calendar.DAY_OF_MONTH, day); int weekDay = cal.get(Calendar.DAY_OF_WEEK); String dayName = ""; switch (weekDay) { case Calendar.MONDAY: dayName = "MONDAY"; break; case Calendar.TUESDAY: dayName = "TUESDAY"; break; case Calendar.WEDNESDAY: dayName = "WEDNESDAY"; break; case Calendar.THURSDAY: dayName = "THURSDAY"; break; case Calendar.FRIDAY: dayName = "FRIDAY"; break; case Calendar.SATURDAY: dayName = "SATURDAY"; break; case Calendar.SUNDAY: dayName = "SUNDAY"; break; } System.out.println(dayName); } } |
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution I created solution in: Java All solutions are also available on my GitHub. 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 |
import java.util.*; import java.security.*; public class Solution { public static void main(String[] args) { DoNotTerminate.forbidExit(); try { Scanner in = new Scanner(System.in); int n = in.nextInt(); in.close(); String s = String.valueOf(n); if (n == Integer.parseInt(s)) { System.out.println("Good job"); } else { System.out.println("Wrong answer."); } } catch (DoNotTerminate.ExitTrappedException e) { System.out.println("Unsuccessful Termination!!"); } } } //The following class will prevent you from terminating the code using exit(0)! class DoNotTerminate { public static class ExitTrappedException extends SecurityException { private static final long serialVersionUID = 1; } public static void forbidExit() { final SecurityManager securityManager = new SecurityManager() { @Override public void checkPermission(Permission permission) { if (permission.getName().contains("exitVM")) { throw new ExitTrappedException(); } } }; System.setSecurityManager(securityManager); } } |