Advertisement
IvaAnd

Exam20200819/02_FlowerWreaths

Oct 19th, 2020
100
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.00 KB | None | 0 0
  1. import java.util.ArrayDeque;
  2. import java.util.Arrays;
  3. import java.util.Scanner;
  4.  
  5. public class FlowerWreaths {
  6. public static void main(String[] args) {
  7.  
  8. Scanner scanner = new Scanner(System.in);
  9.  
  10. int[] line = Arrays.stream(scanner.nextLine().split(", "))
  11. .mapToInt(Integer::parseInt).toArray();
  12.  
  13. ArrayDeque<Integer> stackLilies = new ArrayDeque<>();
  14.  
  15. for (int flower : line) {
  16. stackLilies.push(flower);
  17.  
  18. }
  19.  
  20. line = Arrays.stream(scanner.nextLine().split(", "))
  21. .mapToInt(Integer::parseInt).toArray();
  22.  
  23. ArrayDeque<Integer> queueRoses = new ArrayDeque<>();
  24. for (int flower : line) {
  25. queueRoses.offer(flower);
  26.  
  27. }
  28. int countWreaths = 0;
  29. int storedFlowers = 0;
  30.  
  31. while (stackLilies.size() > 0 && queueRoses.size() > 0) {
  32.  
  33. int liliesCount = stackLilies.peek();
  34. int rosesCont = queueRoses.peek();
  35. int sum = liliesCount + rosesCont;
  36. if (sum == 15) {
  37. countWreaths++;
  38. stackLilies.pop();
  39. queueRoses.poll();
  40. } else if (sum > 15) {
  41. int extraFlowers = sum - 15;
  42. liliesCount = liliesCount - extraFlowers;
  43. countWreaths++;
  44. stackLilies.pop();
  45. queueRoses.poll();
  46.  
  47. }else if (sum < 15){
  48. storedFlowers = storedFlowers+sum;
  49. stackLilies.pop();
  50. queueRoses.poll();
  51. }
  52. }
  53.  
  54. if (storedFlowers >=15){
  55. int addWreaths = storedFlowers/15;
  56. countWreaths= countWreaths+addWreaths;
  57. }
  58.  
  59. if (countWreaths >=5){
  60. System.out.printf("You made it, you are going to the competition with %d wreaths!", countWreaths);
  61. }else {
  62. System.out.printf("You didn't make it, you need %d wreaths more!", 5-countWreaths);
  63. }
  64.  
  65. }
  66. }
  67.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement