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 […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution If you order the given array ascending – the min sum are first n-1 elements – the max sum are last n-1 elements I created solution in: Scala Java JavaScript Ruby All solutions are also available on my GitHub. Java […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution First find a correct amount of money – (food_sum – index_of_allergic) / 2. Compare if the correct amount is equals with given amount. I created solution in: Scala Java JavaScript Ruby All solutions are also available on my GitHub. Java […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution The length of a given word repeated could be too much to be able to calculate the result before the time limit. We need to simplify our solution. We have a given string – s. Count only “a” characters in […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution For each day calculate how many people like the advertisement. Use the formula from problem description. Then sum all people. I created solution in: Scala Java JavaScript Ruby 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 |
import java.util.*; public class ViralAdvertising { public static void main(String[] args) { Scanner stdin = new Scanner(System.in); int n = Integer.parseInt(stdin.nextLine()); int totalLiked = 0; int dayStartPeople = 5; for(int i = 0; i < n; i++) { int dayLiked = dayStartPeople / 2; int received = dayLiked * 3; totalLiked += dayLiked; dayStartPeople = received; } System.out.println(totalLiked); stdin.close(); } } |
JavaScript
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 |
'use strict'; const processData = input => { const n = parseInt(input) let totalLiked = 0; let dayStartPeople = 5; for(let i = 0; i < n; i++) { const dayLiked = parseInt(dayStartPeople / 2); const received = dayLiked * 3; totalLiked += dayLiked; dayStartPeople = received; } console.log(totalLiked); }; process.stdin.resume(); process.stdin.setEncoding("ascii"); let _input = ""; process.stdin.on("data", input => _input += input); process.stdin.on("end", () => processData(_input)); |
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution You need to calculate how many apples or oranges are within given positions on a line. There is a following condition: I created solution in: Scala Java JavaScript Ruby All solutions are also available on my GitHub. Java […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution Create groups containing same numbers from defined array. The result is length of the array without size of the biggest groups. Explanation: The only way to make a minimum deletion of other numbers from array. If I would delete any […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution I created groups of socks with same color. Then for each of the group I calculated sock pairs – number_of_socks / 2. The result is the count of all pairs. I created solution in: Scala Java JavaScript Ruby All solutions […]