Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package com.deep;
- import java.util.Scanner;
- public class Main {
- public static void main(String[] args) {
- Scanner scanner = new Scanner(System.in);
- int n = scanner.nextInt();
- int x = scanner.nextInt();
- int y = scanner.nextInt();
- int c = scanner.nextInt();
- int w = scanner.nextInt();
- int xDiv = x/n;
- int xRem = x%n;
- int xCount = xDiv + ((xRem!=0)?1:0);
- int yDiv = y/n;
- int yRem = y%n;
- int yCount = yDiv + ((yRem!=0)?1:0);
- int[] intArray = new int[n];
- for(int i=0,p=1;i<n;i++,p++){
- intArray[i]++;
- if(p==x){
- break;
- }
- if(i==(n-1)){
- i=-1;
- }
- }
- for(int i=0,q=1;i<n;i++,q++){
- intArray[i] ++;
- if(q==y){
- break;
- }
- if(i==(n-1)){
- i=-1;
- }
- }
- int count =1;
- for(int i=n-1;i>0;i--){
- if(intArray[i-1] > intArray[i]){
- count++;
- }
- }
- System.out.println("Largest Height Cakes : "+((xCount*c)+(yCount*w)));
- System.out.println("Different Height = "+count);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement