solution.java

//Q-->Hackerrank, Algorithms-->Implementation

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 {

    
    static int howManyGames(int p, int d, int m, int s) {
        int count=0;  // let this is the answer to be returned
        
          while((s-p)>=0){ //looping until s is greater than p
            System.out.println(p);
            s=s-p;  //decrementing s
            
            count++;
          if((p-d)>=m) 
          p=p-d; 
          else
          p=m; //the least value that p can attain is m
          
            
        }
        return count;
    }

    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();
    }
}