forked from alexprut/HackerRank
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Solution.java
52 lines (38 loc) · 1.12 KB
/
Solution.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
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
public class Solution {
// Complete the howManyGames function below.
static int howManyGames(int p, int d, int m, int s) {
int counter = 0;
int current = p;
while (s >= current) {
counter++;
s -= current;
if (current - d < m) {
current = m;
} else {
current -= d;
}
}
return counter;
}
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) throws IOException {
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
String[] pdms = scanner.nextLine().split(" ");
int p = Integer.parseInt(pdms[0]);
int d = Integer.parseInt(pdms[1]);
int m = Integer.parseInt(pdms[2]);
int s = Integer.parseInt(pdms[3]);
int answer = howManyGames(p, d, m, s);
bufferedWriter.write(String.valueOf(answer));
bufferedWriter.newLine();
bufferedWriter.close();
scanner.close();
}
}