From 6675803957f18fd46029350bc2f5ccfee6ec44ab Mon Sep 17 00:00:00 2001 From: Aman Mishra Date: Sat, 2 Oct 2021 14:17:16 +0530 Subject: [PATCH] Added solution of some codeforces problems --- CODEFORCES/.gitignore | 29 +++++++ CODEFORCES/pom.xml | 16 ++++ .../fiftytoseventyfive/AmusingJoke.java | 48 +++++++++++ .../fiftytoseventyfive/AntonAndLetters.java | 27 +++++++ .../AntonAndPolyhedrons.java | 27 +++++++ .../fiftytoseventyfive/Boredom.java | 27 +++++++ .../fiftytoseventyfive/BuyAShovel.java | 25 ++++++ .../CandiesAndTwoSisters.java | 21 +++++ .../fiftytoseventyfive/CheapTravel.java | 28 +++++++ .../fiftytoseventyfive/CutRibbon.java | 65 +++++++++++++++ .../DesignTutorialLearnFromMath.java | 45 +++++++++++ .../fiftytoseventyfive/Dragons.java | 75 +++++++++++++++++ .../fiftytoseventyfive/FoxAndSnake.java | 46 +++++++++++ .../fiftytoseventyfive/GameWithSticks.java | 24 ++++++ .../fiftytoseventyfive/Games.java | 40 ++++++++++ .../fiftytoseventyfive/HitTheLottery.java | 27 +++++++ .../fiftytoseventyfive/ILoveUsername.java | 33 ++++++++ .../fiftytoseventyfive/IQTest.java | 29 +++++++ .../fiftytoseventyfive/NewYearAndHurry.java | 26 ++++++ .../fiftytoseventyfive/Pangram.java | 29 +++++++ .../fiftytoseventyfive/PoliceRecruits.java | 37 +++++++++ .../fiftytoseventyfive/RemoveSmallest.java | 40 ++++++++++ .../RestoringThreeNumbers.java | 35 ++++++++ .../fiftytoseventyfive/ShortSubstrings.java | 24 ++++++ .../fiftytoseventyfive/SumOfRoundNumbers.java | 41 ++++++++++ .../fiftytoseventyfive/VasyaTheHipster.java | 21 +++++ .../YetAnotherTwoIntegersProblem.java | 26 ++++++ .../initialtwentyfive/BearAndBigBrother.java | 24 ++++++ .../initialtwentyfive/BeautifulMatrix.java | 29 +++++++ .../initialtwentyfive/BitPlusPlus.java | 27 +++++++ .../initialtwentyfive/BoyOrGirl.java | 27 +++++++ .../initialtwentyfive/ChatRoom.java | 36 +++++++++ .../initialtwentyfive/DominoPiling.java | 19 +++++ .../initialtwentyfive/Elephant.java | 22 +++++ .../initialtwentyfive/Football.java | 31 +++++++ .../initialtwentyfive/HelpfulMaths.java | 31 +++++++ .../initialtwentyfive/LuckyDivision.java | 26 ++++++ .../initialtwentyfive/NearlyLuckyNumber.java | 23 ++++++ .../initialtwentyfive/NextRound.java | 33 ++++++++ .../initialtwentyfive/PetyaAndStrings.java | 24 ++++++ .../initialtwentyfive/SoldierAndBananas.java | 22 +++++ .../initialtwentyfive/StonesOnTheTable.java | 28 +++++++ .../initialtwentyfive/StringTask.java | 27 +++++++ .../problemlevelA/initialtwentyfive/Team.java | 25 ++++++ .../initialtwentyfive/TheatreSquare.java | 26 ++++++ .../problemlevelA/initialtwentyfive/Tram.java | 23 ++++++ .../initialtwentyfive/Watermelon.java | 16 ++++ .../initialtwentyfive/WayTooLongWords.java | 26 ++++++ .../problemlevelA/initialtwentyfive/Word.java | 27 +++++++ .../initialtwentyfive/WordCapitalization.java | 20 +++++ .../initialtwentyfive/WrongSubtraction.java | 21 +++++ .../initialtwentyfive/YoungPhysicist.java | 25 ++++++ .../seventyfivetohundred/Candies.java | 25 ++++++ .../seventyfivetohundred/ChoosingTeams.java | 30 +++++++ .../HolidayOfEquality.java | 32 ++++++++ .../IlyaAndBankAccount.java | 28 +++++++ .../seventyfivetohundred/MinimalSquare.java | 24 ++++++ .../NewYearTransportation.java | 35 ++++++++ .../RequiredRemainder.java | 25 ++++++ .../seventyfivetohundred/TeamOlympiad.java | 53 ++++++++++++ .../TheNewYearMeetingFriends.java | 22 +++++ .../twentyfivetofifty/AntonAndDanik.java | 26 ++++++ .../ArrivalOfTheGeneral.java | 38 +++++++++ .../twentyfivetofifty/BeautifulYear.java | 29 +++++++ .../CalculatingFunction.java | 20 +++++ .../DivisibilityProblem.java | 24 ++++++ .../twentyfivetofifty/Dubstep.java | 18 +++++ .../twentyfivetofifty/EvenOdds.java | 26 ++++++ .../twentyfivetofifty/Expression.java | 25 ++++++ .../GeorgeAndAccommodation.java | 26 ++++++ .../twentyfivetofifty/GravityFlip.java | 47 +++++++++++ .../twentyfivetofifty/HQ9PLUS.java | 24 ++++++ .../problemlevelA/twentyfivetofifty/Hulk.java | 30 +++++++ .../twentyfivetofifty/IWannaBeTheGuy.java | 28 +++++++ .../InSearchOfAnEasyProblem.java | 27 +++++++ .../twentyfivetofifty/InsomniaCure.java | 49 ++++++++++++ .../IsYourHorseshoeOnTheOtherHoof.java | 23 ++++++ .../twentyfivetofifty/KefaAndFirstSteps.java | 30 +++++++ .../twentyfivetofifty/Magnets.java | 26 ++++++ .../twentyfivetofifty/Presents.java | 27 +++++++ .../twentyfivetofifty/Puzzles.java | 30 +++++++ .../twentyfivetofifty/Translation.java | 32 ++++++++ .../twentyfivetofifty/Twins.java | 39 +++++++++ .../UltraFastMathematician.java | 25 ++++++ .../twentyfivetofifty/VanyaAndFence.java | 24 ++++++ .../twentyfivetofifty/cAPSlOCK.java | 37 +++++++++ .../aman/problemlevelB/BalancedArray.java | 32 ++++++++ .../com/mishra/aman/problemlevelB/Drinks.java | 26 ++++++ .../mishra/aman/problemlevelB/EvenArray.java | 35 ++++++++ .../aman/problemlevelB/GiftsFixing.java | 40 ++++++++++ .../aman/problemlevelB/QueueAtTheSchool.java | 27 +++++++ .../mishra/aman/problemlevelB/TPrimes.java | 80 +++++++++++++++++++ .../com/mishra/aman/problemlevelB/Taxi.java | 41 ++++++++++ .../aman/problemlevelB/TwoArraysAndSwaps.java | 56 +++++++++++++ .../aman/problemlevelB/VanyaAndLanterns.java | 36 +++++++++ .../aman/problemlevelB/XeniaAndRingroad.java | 37 +++++++++ .../problemlevelC/RegistrationSystem.java | 29 +++++++ .../mishra/aman/templates/TEMPLATE_ONE.java | 59 ++++++++++++++ CODEFORCES/src/main/resources/Notes.md | 2 + .../src/main/resources/ProblemsTookHelp.md | 5 ++ .../src/main/resources/RegularExpression.md | 5 ++ .../src/main/resources/StackOverflow.md | 2 + 102 files changed, 3065 insertions(+) create mode 100644 CODEFORCES/.gitignore create mode 100644 CODEFORCES/pom.xml create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/AmusingJoke.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/AntonAndLetters.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/AntonAndPolyhedrons.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/Boredom.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/BuyAShovel.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/CandiesAndTwoSisters.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/CheapTravel.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/CutRibbon.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/DesignTutorialLearnFromMath.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/Dragons.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/FoxAndSnake.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/GameWithSticks.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/Games.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/HitTheLottery.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/ILoveUsername.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/IQTest.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/NewYearAndHurry.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/Pangram.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/PoliceRecruits.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/RemoveSmallest.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/RestoringThreeNumbers.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/ShortSubstrings.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/SumOfRoundNumbers.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/VasyaTheHipster.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/YetAnotherTwoIntegersProblem.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/BearAndBigBrother.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/BeautifulMatrix.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/BitPlusPlus.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/BoyOrGirl.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/ChatRoom.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/DominoPiling.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Elephant.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Football.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/HelpfulMaths.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/LuckyDivision.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/NearlyLuckyNumber.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/NextRound.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/PetyaAndStrings.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/SoldierAndBananas.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/StonesOnTheTable.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/StringTask.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Team.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/TheatreSquare.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Tram.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Watermelon.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/WayTooLongWords.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Word.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/WordCapitalization.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/WrongSubtraction.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/YoungPhysicist.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/Candies.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/ChoosingTeams.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/HolidayOfEquality.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/IlyaAndBankAccount.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/MinimalSquare.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/NewYearTransportation.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/RequiredRemainder.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/TeamOlympiad.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/TheNewYearMeetingFriends.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/AntonAndDanik.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/ArrivalOfTheGeneral.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/BeautifulYear.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/CalculatingFunction.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/DivisibilityProblem.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Dubstep.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/EvenOdds.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Expression.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/GeorgeAndAccommodation.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/GravityFlip.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/HQ9PLUS.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Hulk.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/IWannaBeTheGuy.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/InSearchOfAnEasyProblem.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/InsomniaCure.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/IsYourHorseshoeOnTheOtherHoof.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/KefaAndFirstSteps.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Magnets.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Presents.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Puzzles.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Translation.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Twins.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/UltraFastMathematician.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/VanyaAndFence.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/cAPSlOCK.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/BalancedArray.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/Drinks.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/EvenArray.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/GiftsFixing.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/QueueAtTheSchool.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/TPrimes.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/Taxi.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/TwoArraysAndSwaps.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/VanyaAndLanterns.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/XeniaAndRingroad.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/problemlevelC/RegistrationSystem.java create mode 100644 CODEFORCES/src/main/java/com/mishra/aman/templates/TEMPLATE_ONE.java create mode 100644 CODEFORCES/src/main/resources/Notes.md create mode 100644 CODEFORCES/src/main/resources/ProblemsTookHelp.md create mode 100644 CODEFORCES/src/main/resources/RegularExpression.md create mode 100644 CODEFORCES/src/main/resources/StackOverflow.md diff --git a/CODEFORCES/.gitignore b/CODEFORCES/.gitignore new file mode 100644 index 0000000..b53314a --- /dev/null +++ b/CODEFORCES/.gitignore @@ -0,0 +1,29 @@ +# Eclipse +.classpath +.project +.settings/ + +# Intellij +.idea/ +*.iml +*.iws + +# Mac +.DS_Store + +# Maven +log/ +target/ + +# Package Files # +*.jar +*.war +*.ear +*.zip +*.tar.gz +*.rar + +# IntelliJ +/out/ + +**/DO_NOT_MAKE* diff --git a/CODEFORCES/pom.xml b/CODEFORCES/pom.xml new file mode 100644 index 0000000..a997b22 --- /dev/null +++ b/CODEFORCES/pom.xml @@ -0,0 +1,16 @@ + + + 4.0.0 + + org.example + CODEFORCES + 1.0-SNAPSHOT + + + 8 + 8 + + + \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/AmusingJoke.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/AmusingJoke.java new file mode 100644 index 0000000..23f74ab --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/AmusingJoke.java @@ -0,0 +1,48 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.HashMap; + +import static java.lang.System.in; + +public class AmusingJoke { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + char[] aA = br.readLine().toCharArray(); + char[] bA = br.readLine().toCharArray(); + char[] cA = br.readLine().toCharArray(); + HashMap hM = new HashMap<>(); + for(char c : aA){ + if(hM.containsKey(c)){ + hM.put(c,hM.get(c)+1); + }else{ + hM.put(c,1); + } + } + for(char c : bA){ + if(hM.containsKey(c)){ + hM.put(c,hM.get(c)+1); + }else{ + hM.put(c,1); + } + } + for(char c : cA){ + if(hM.containsKey(c)){ + if(hM.get(c) ==1){ + hM.remove(c); + }else{ + hM.put(c,hM.get(c)-1); + } + }else{ + System.out.println("NO"); + return; + } + } + + System.out.println(hM.size()==0 ?"YES" : "NO"); + } +} + +//https://codeforces.com/problemset/problem/141/A diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/AntonAndLetters.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/AntonAndLetters.java new file mode 100644 index 0000000..eb2ed2f --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/AntonAndLetters.java @@ -0,0 +1,27 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.Arrays; +import java.util.HashSet; + +import static java.lang.System.in; + +public class AntonAndLetters { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String a = br.readLine(); + if(a.equals("{}")){ + System.out.println("0"); + return; + } + String[] sA = a.replaceAll("[{}]","").split(", "); + HashSet hs = new HashSet<>(Arrays.asList(sA)); + System.out.println(hs.size()); + } +} + +//https://codeforces.com/problemset/problem/443/A +//https://codeforces.com/problemset/submission/443/9135498 +//https://codeforces.com/problemset/submission/443/71889288 \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/AntonAndPolyhedrons.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/AntonAndPolyhedrons.java new file mode 100644 index 0000000..28e116c --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/AntonAndPolyhedrons.java @@ -0,0 +1,27 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class AntonAndPolyhedrons { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int t = Integer.parseInt(br.readLine()),tetrahedronCount = 0,cubeCount = 0,octahedronCount=0, + dodecahedronCount = 0,icosahedronCount = 0; + while (t-- > 0){ + String temp = br.readLine(); + if(temp.charAt(0) == 'T') tetrahedronCount++; + if(temp.charAt(0) == 'C') cubeCount++; + if(temp.charAt(0) == 'O') octahedronCount++; + if(temp.charAt(0) == 'D') dodecahedronCount++; + if(temp.charAt(0) == 'I') icosahedronCount++; + } + System.out.println(tetrahedronCount*4+cubeCount*6+octahedronCount*8+ + dodecahedronCount*12+icosahedronCount*20); + } +} + +//https://codeforces.com/problemset/problem/785/A diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/Boredom.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/Boredom.java new file mode 100644 index 0000000..8f7b295 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/Boredom.java @@ -0,0 +1,27 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.StringTokenizer; + +import static java.lang.System.in; + +public class Boredom { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()); + StringTokenizer st = new StringTokenizer(br.readLine()); + long[] dp = new long[100001]; + long[] count = new long[100001]; + while (st.hasMoreTokens()){ + count[Integer.parseInt(st.nextToken())]++; + } + dp[0] = 0; + dp[1] = count[1]; + for (int i = 2; i <=100000 ; i++) { + dp[i] = Math.max(dp[i-1],dp[i-2]+i*count[i]); + } + System.out.println(dp[100000]); + } +} diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/BuyAShovel.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/BuyAShovel.java new file mode 100644 index 0000000..83aa986 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/BuyAShovel.java @@ -0,0 +1,25 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class BuyAShovel { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String[] nm = br.readLine().split("\\s+"); + int k = Integer.parseInt(nm[0]); + int l = Integer.parseInt(nm[1]); + int ans = 1,temp = k; + do{ + k = temp * ans; + ans++; + }while(!(k%10 == 0 || k%10 == l)); + System.out.println(ans-1); + } +} + +//https://codeforces.com/problemset/problem/732/A +//https://codeforces.com/problemset/submission/732/31230583 diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/CandiesAndTwoSisters.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/CandiesAndTwoSisters.java new file mode 100644 index 0000000..11691f7 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/CandiesAndTwoSisters.java @@ -0,0 +1,21 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class CandiesAndTwoSisters { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int t = Integer.parseInt(br.readLine()); + while (t-- > 0){ + int n = Integer.parseInt(br.readLine()); + System.out.println((n-1)/2); + } + } +} + +//https://codeforces.com/problemset/problem/1335/A +//https://codeforces.com/problemset/submission/1335/76633824 \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/CheapTravel.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/CheapTravel.java new file mode 100644 index 0000000..87207cb --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/CheapTravel.java @@ -0,0 +1,28 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.StringTokenizer; + +import static java.lang.System.in; + +public class CheapTravel { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + StringTokenizer st = new StringTokenizer(br.readLine()); + int n = Integer.parseInt(st.nextToken()); + int m = Integer.parseInt(st.nextToken()); + int a = Integer.parseInt(st.nextToken()); + int b = Integer.parseInt(st.nextToken()); + System.out.println( + m*a >= b ? + (n/m)*b+( b < (n%m)*a ? b : (n%m)*a) + :n*a + ); + + } +} + +//https://codeforces.com/problemset/problem/466/A +//https://codeforces.com/problemset/submission/466/9272194 \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/CutRibbon.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/CutRibbon.java new file mode 100644 index 0000000..5521392 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/CutRibbon.java @@ -0,0 +1,65 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.Arrays; + +import static java.lang.System.in; + +public class CutRibbon { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String[] nm = br.readLine().split("\\s+"); + int n = Integer.parseInt(nm[0]); + int a = Integer.parseInt(nm[1]); + int b = Integer.parseInt(nm[2]); + int c = Integer.parseInt(nm[3]); + // System.out.println(iterativeSolution(n,a,b,c)); + System.out.println(dpSolution(n,a,b,c)); + } + + private static int dpSolution(int n, int a, int b, int c) { + int[] dp = new int[n+1]; + Arrays.fill(dp,-1); + dp[0] = 0; + for (int i = 0; i <= n; i++) { + if(dp[i] != -1){ + if(i+a<=n){ + dp[i+a] = Math.max(dp[i]+1,dp[i+a]); + } + if(i+b<=n){ + dp[i+b] = Math.max(dp[i]+1,dp[i+b]); + } + if(i+c<=n){ + dp[i+c] = Math.max(dp[i]+1,dp[i+c]); + } + } + } + return dp[n]; + } + + private static int iterativeSolution(int n, int a, int b, int c) { + int ans = 0; + for(int x = 0;x <= 4000;x++){ + for (int y = 0; y <=4000 ; y++) { + int zc = n - (x*a+y*b); + if(zc<0){ + break; + } + double z = (zc/(double)c); + if(z == (int)z){ + ans = Math.max(ans,(int) (x+y+z)); + } + } + } + return ans; + } +} + +/* +https://pythontutor.com/visualize.html#code=%0Aimport%20java.util.*%3B%0A%0Apublic%20class%20GFG%0A%7B%0A%20%20%20%20%0A%20%20%20%20//%20function%20to%20find%20the%20maximum%0A%20%20%20%20//%20number%20of%20segments%0A%20%20%20%20static%20int%20maximumSegments%28int%20n,%20int%20a,%0A%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20int%20b,%20int%20c%29%0A%20%20%20%20%7B%0A%20%20%20%20%20%20%20%20//%20stores%20the%20maximum%20number%20of%0A%20%20%20%20%20%20%20%20//%20segments%20each%20index%20can%20have%0A%20%20%20%20%20%20%20%20int%20dp%5B%5D%20%3D%20new%20int%5Bn%20%2B%2010%5D%3B%0A%0A%20%20%20%20%20%20%20%20//%20initialize%20with%20-1%0A%20%20%20%20%20%20%20%20Arrays.fill%28dp,%20-1%29%3B%0A%0A%20%20%20%20%20%20%20%20//%200th%20index%20will%20have%200%20segments%0A%20%20%20%20%20%20%20%20//%20base%20case%0A%20%20%20%20%20%20%20%20dp%5B0%5D%20%3D%200%3B%0A%0A%20%20%20%20%20%20%20%20//%20traverse%20for%20all%20possible%0A%20%20%20%20%20%20%20%20//%20segments%20till%20n%0A%20%20%20%20%20%20%20%20for%20%28int%20i%20%3D%200%3B%20i%20%3C%20n%3B%20i%2B%2B%29%0A%20%20%20%20%20%20%20%20%7B%0A%20%20%20%20%20%20%20%20%20%20%20%20if%20%28dp%5Bi%5D%20!%3D%20-1%29%0A%20%20%20%20%20%20%20%20%20%20%20%20%7B%0A%0A%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20//%20conditions%0A%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20if%28i%20%2B%20a%20%3C%3D%20n%20%29%20//avoid%20buffer%20overflow%0A%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20dp%5Bi%20%2B%20a%5D%20%3D%20Math.max%28dp%5Bi%5D%20%2B%201,%0A%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20dp%5Bi%20%2B%20a%5D%29%3B%0A%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%0A%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20if%28i%20%2B%20b%20%3C%3D%20n%20%29%20//avoid%20buffer%20overflow%0A%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20dp%5Bi%20%2B%20b%5D%20%3D%20Math.max%28dp%5Bi%5D%20%2B%201,%20%20%20%20%0A%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20dp%5Bi%20%2B%20b%5D%29%3B%0A%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%0A%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20if%28i%20%2B%20c%20%3C%3D%20n%20%29%20//avoid%20buffer%20overflow%0A%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20dp%5Bi%20%2B%20c%5D%20%3D%20Math.max%28dp%5Bi%5D%20%2B%201,%0A%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20dp%5Bi%20%2B%20c%5D%29%3B%0A%20%20%20%20%20%20%20%20%20%20%20%20%7D%0A%20%20%20%20%20%20%20%20%7D%0A%20%20%20%20%20%20%20%20return%20dp%5Bn%5D%3B%0A%20%20%20%20%7D%0A%0A%20%20%20%20//%20Driver%20code%0A%20%20%20%20public%20static%20void%20main%28String%20arg%5B%5D%29%0A%20%20%20%20%7B%0A%20%20%20%20%20%20%20%20int%20n%20%3D%207,%20a%20%3D%205,%20b%20%3D%202,%20c%20%3D%205%3B%0A%20%20%20%20%20%20%20%20System.out.print%28maximumSegments%28n,%20a,%20b,%20c%29%29%3B%0A%20%20%20%20%7D%0A%7D%0A%0A//%20This%20code%20is%20contributed%20by%20Anant%20Agarwal.&cumulative=false&curInstr=57&heapPrimitives=nevernest&mode=display&origin=opt-frontend.js&py=java&rawInputLstJSON=%5B%5D&textReferences=false +https://codeforces.com/problemset/problem/189/A + +https://codeforces.com/problemset/submission/189/71926332 +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/DesignTutorialLearnFromMath.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/DesignTutorialLearnFromMath.java new file mode 100644 index 0000000..c8050df --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/DesignTutorialLearnFromMath.java @@ -0,0 +1,45 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.Arrays; + +import static java.lang.System.in; + +public class DesignTutorialLearnFromMath { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()); + /*boolean[] primalityArray = new boolean[n+1]; + Arrays.fill(primalityArray,true); + sieveofEratosthenes(primalityArray,n+1); + for (int i = 4; i < n; i+=2) { + if(!primalityArray[n-i]){ + System.out.println(i+ " "+ (n-i)); + break; + } + }*/ + solution(n); + } + + private static void solution(int n) { + if(n%2 == 0){ + System.out.println(n-4+" "+4); + }else{ + System.out.println(n-9 +" " + 9); + } + } + + private static void sieveofEratosthenes(boolean[] primalityArray,int n) { + for (int i = 2; i < Math.sqrt(n); i++) { + if(primalityArray[i]){ + for (int j = i*i; j < n; j+=i) { + primalityArray[j] = false; + } + } + } + } +} + +//https://codeforces.com/problemset/problem/472/A diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/Dragons.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/Dragons.java new file mode 100644 index 0000000..5c796bd --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/Dragons.java @@ -0,0 +1,75 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.Arrays; +import java.util.Comparator; + +import static java.lang.System.in; + +public class Dragons { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String[] nl = br.readLine().split("\\s+"); + int s = Integer.parseInt(nl[0]); + int n = Integer.parseInt(nl[1]); + int temp = n; + Pair[] arr = new Pair[n]; + int index = 0; + while(n-- > 0){ + String[] aA = br.readLine().split("\\s+"); + int l = Integer.parseInt(aA[0]); + int g = Integer.parseInt(aA[1]); + arr[index] = new Pair(l,g); + index++; + } + Arrays.sort(arr, Comparator.comparingInt(p -> p.v1)); + /* Arrays.sort(arr, (p1, p2) -> p1.v1 - p2.v1); + Arrays.sort(arr, new Comparator() { + @Override public int compare(Pair p1, Pair p2) + { + return p1.v1 - p2.v1; + } + });*/ + for (int i = 0; i < temp; i++) { + if(arr[i].v1 >= s){ + System.out.println("NO"); + return; + }else{ + s += arr[i].v2; + } + } + System.out.println("YES"); + } + + private static class Pair implements Comparable{ + int v1; + int v2; + public Pair(int x,int y){ + this.v1 = x; + this.v2 = y; + } + + @Override + public String toString() { + return "Pair{" + + "v1=" + v1 + + ", v2=" + v2 + + '}'; + } + + @Override + public int compareTo(Pair o) { + return v1-o.v1; + } + } +} + +/* +https://codeforces.com/problemset/problem/230/A +https://codeforces.com/problemset/submission/230/128413430 +https://codeforces.com/problemset/submission/230/9273875 +https://codeforces.com/problemset/submission/230/9135628 +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/FoxAndSnake.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/FoxAndSnake.java new file mode 100644 index 0000000..97881db --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/FoxAndSnake.java @@ -0,0 +1,46 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class FoxAndSnake { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String[] nm = br.readLine().split("\\s+"); + int n = Integer.parseInt(nm[0]); + int m = Integer.parseInt(nm[1]); + StringBuilder a= new StringBuilder(); + StringBuilder b= new StringBuilder(); + StringBuilder c= new StringBuilder(); + boolean turnLeft = true; + for (int i = 0; i < m; i++) { + a.append("#"); + if(i == m-1){ + b.append("#"); + }else{ + b.append("."); + } + if(i == 0){ + c.append("#"); + }else{ + c.append("."); + } + } + for (int i = 0; i < n; i++) { + if(i%2==0){ + System.out.println(a); + }else if(turnLeft){ + System.out.println(b); + turnLeft = false; + }else{ + System.out.println(c); + turnLeft = true; + } + } + } +} + +//https://codeforces.com/problemset/problem/510/A \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/GameWithSticks.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/GameWithSticks.java new file mode 100644 index 0000000..967d572 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/GameWithSticks.java @@ -0,0 +1,24 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class GameWithSticks { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String[] nm = br.readLine().split("\\s+"); + int n = Integer.parseInt(nm[0]); + int m = Integer.parseInt(nm[1]); + int min = Math.min(n,m); + System.out.println(min % 2 == 0 ? "Malvika" : "Akshat"); + } +} + + +/* +https://codeforces.com/problemset/problem/451/A +https://codeforces.com/problemset/submission/451/9873389 +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/Games.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/Games.java new file mode 100644 index 0000000..ab182b6 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/Games.java @@ -0,0 +1,40 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.HashMap; +import java.util.Map; + +import static java.lang.System.in; + +public class Games { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int t = Integer.parseInt(br.readLine()); + HashMap hCM = new HashMap<>(); + HashMap gCM = new HashMap<>(); + while (t-- >0){ + String[] hg = br.readLine().split("\\s+"); + if(hCM.containsKey(hg[0])){ + hCM.put(hg[0],hCM.get(hg[0])+1); + }else{ + hCM.put(hg[0],1 ); + } + if(gCM.containsKey(hg[1])){ + gCM.put(hg[1],gCM.get(hg[1])+1); + }else{ + gCM.put(hg[1],1 ); + } + } + int ans = 0; + for (Map.Entry mapElement : hCM.entrySet()) { + String key = (String) mapElement.getKey(); + int value = ((int)mapElement.getValue()); + if(gCM.containsKey(key)){ + ans += (value*gCM.get(key)); + } + } + System.out.println(ans); + } +} diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/HitTheLottery.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/HitTheLottery.java new file mode 100644 index 0000000..c2241ae --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/HitTheLottery.java @@ -0,0 +1,27 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class HitTheLottery { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + long t = Long.parseLong(br.readLine()); + long ans = t/100; + long temp = t%100; + ans += temp/20; + temp = temp%20; + ans += temp/10; + temp = temp%10; + ans +=temp/5; + temp = temp%5; + ans += temp; + System.out.println(ans); + } +} + +//https://codeforces.com/problemset/problem/996/A +//https://codeforces.com/problemset/submission/996/45123812 \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/ILoveUsername.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/ILoveUsername.java new file mode 100644 index 0000000..7f6b496 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/ILoveUsername.java @@ -0,0 +1,33 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class ILoveUsername { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader( in)); + int n = Integer.parseInt(br.readLine()); + String[] nA = br.readLine().split("\\s+"); + int[] niA = new int[n]; + for (int i = 0; i < n; i++) { + niA[i] = Integer.parseInt(nA[i]); + } + int max = niA[0],min = niA[0],count = 0; + for (int i = 1; i < n; i++) { + if(niA[i] > max) { + count++; + max = niA[i]; + } + if(niA[i] < min) { + count++; + min = niA[i]; + } + } + System.out.println(count); + } +} + +//https://codeforces.com/problemset/problem/155/A \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/IQTest.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/IQTest.java new file mode 100644 index 0000000..daa2d1d --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/IQTest.java @@ -0,0 +1,29 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class IQTest { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()); + String[] nA = br.readLine().split("\\s+"); + int evenCount = 0,oddCount =0,evenIndex=0,oddIndex=0; + for (int i = 0; i =0){ + count++; + tR -= 5*count; + } + System.out.println(tR == 0 ? Math.min(n,count) : Math.min(n, --count) ); + + } +} + +//https://codeforces.com/problemset/problem/750/A diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/Pangram.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/Pangram.java new file mode 100644 index 0000000..c3b0ce6 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/Pangram.java @@ -0,0 +1,29 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.HashSet; + +import static java.lang.System.in; + +public class Pangram { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int t = Integer.parseInt(br.readLine()); + char[] cA = br.readLine().toUpperCase().toCharArray(); + if(t<26){ + System.out.println("NO"); + return; + } + HashSet hs = new HashSet<>(); + for(char ch : cA){ + hs.add(ch); + } + System.out.println(hs.size()==26 ? "YES" : "NO"); + } +} + +/* +https://codeforces.com/problemset/problem/520/A +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/PoliceRecruits.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/PoliceRecruits.java new file mode 100644 index 0000000..7a3c754 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/PoliceRecruits.java @@ -0,0 +1,37 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class PoliceRecruits { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()); + String[] aA = br.readLine().split("\\s+"); + int recruited = 0,ans =0,cases =0; + for (int i = 0; i < n; i++) { + if(aA[i].equals("-1")){ + cases++; + if(recruited < cases) ans++; + if(recruited >0) { + recruited--; + cases--; + } + }else{ + int recruitedNow = Integer.parseInt(aA[i]); + cases = 0; + if(recruitedNow <= 10){ + recruited += recruitedNow; + } + } + } + System.out.println(ans); + } +} + +/* +https://codeforces.com/problemset/problem/427/A +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/RemoveSmallest.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/RemoveSmallest.java new file mode 100644 index 0000000..6c6a1a5 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/RemoveSmallest.java @@ -0,0 +1,40 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.Arrays; + +import static java.lang.System.in; + +public class RemoveSmallest { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int t = Integer.parseInt(br.readLine()); + while(t-- > 0){ + int n = Integer.parseInt(br.readLine()); + String[] aA = br.readLine().split("\\s+"); + boolean ans = true; + if(n == 1){ + System.out.println("YES"); + }else { + int[] aiA = new int[n]; + for (int i = 0; i < n; i++) { + aiA[i] = Integer.parseInt(aA[i]); + } + Arrays.sort(aiA); + for (int i = 1; i < n; i++) { + if (aiA[i] - aiA[i - 1] > 1) { + ans = false; + break; + } + } + System.out.println(ans ? "YES" : "NO"); + } + } + } +} + +/* + https://codeforces.com/problemset/problem/1399/A + */ \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/RestoringThreeNumbers.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/RestoringThreeNumbers.java new file mode 100644 index 0000000..5d46f07 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/RestoringThreeNumbers.java @@ -0,0 +1,35 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.StringTokenizer; + +import static java.lang.System.in; + +public class RestoringThreeNumbers { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + StringTokenizer sr = new StringTokenizer(br.readLine()); + int x1 = Integer.parseInt(sr.nextToken()); + int x2 = Integer.parseInt(sr.nextToken()); + int x3 = Integer.parseInt(sr.nextToken()); + int x4 = Integer.parseInt(sr.nextToken()); + int[] arr = {x1,x2,x3,x4}; + int max = Integer.MIN_VALUE; + int maxIndex = 0; + for (int i = 0; i < 4; i++) { + if(max < arr[i]){ + max = arr[i]; + maxIndex = i; + } + } + for (int i = 0; i < 4; i++) { + if(i != maxIndex){ + System.out.print(max-arr[i] +" "); + } + } + } +} + +/* https://codeforces.com/problemset/problem/1154/A */ \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/ShortSubstrings.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/ShortSubstrings.java new file mode 100644 index 0000000..ccb52c5 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/ShortSubstrings.java @@ -0,0 +1,24 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class ShortSubstrings { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int t = Integer.parseInt(br.readLine()); + while (t-- >0){ + String s = br.readLine(); + int sl = s.length(); + StringBuilder sb = new StringBuilder(s.substring(0,2)); + for (int i = 3; i < sl; i+=2) { + sb.append(s.charAt(i)); + } + System.out.println(sb); + } + } +} +/* https://codeforces.com/problemset/problem/1367/A */ \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/SumOfRoundNumbers.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/SumOfRoundNumbers.java new file mode 100644 index 0000000..c64fa8c --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/SumOfRoundNumbers.java @@ -0,0 +1,41 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class SumOfRoundNumbers { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int t = Integer.parseInt(br.readLine()); + while(t-- > 0) { + String s = br.readLine(); + int l = s.length(); + if (l == 1) { + System.out.println("1"); + System.out.println(s); + }else{ + int count = 0; + StringBuilder sb = new StringBuilder(); + for (int i = 0; i < l; i++) { + if(s.charAt(i) != '0'){ + count++; + sb.append(s.charAt(i)); + for (int j = i; j < l-1; j++) { + sb.append("0"); + } + sb.append(" "); + } + } + System.out.println(count); + System.out.println(sb); + } + } + } +} + +/* +https://codeforces.com/problemset/problem/1352/A +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/VasyaTheHipster.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/VasyaTheHipster.java new file mode 100644 index 0000000..444e963 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/VasyaTheHipster.java @@ -0,0 +1,21 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class VasyaTheHipster { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String[] nm = br.readLine().split("\\s+"); + int a = Integer.parseInt(nm[0]); + int b = Integer.parseInt(nm[1]); + int max = Math.max(a,b); + int min = Math.min(a,b); + System.out.println(min + " " +((max-min)/2)); + } +} + +/* https://codeforces.com/problemset/problem/581/A */ \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/YetAnotherTwoIntegersProblem.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/YetAnotherTwoIntegersProblem.java new file mode 100644 index 0000000..9a4516a --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/fiftytoseventyfive/YetAnotherTwoIntegersProblem.java @@ -0,0 +1,26 @@ +package com.mishra.aman.problemlevelA.fiftytoseventyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class YetAnotherTwoIntegersProblem { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int t = Integer.parseInt(br.readLine()); + while(t-- > 0){ + String[] ab = br.readLine().split("\\s+"); + int a = Integer.parseInt(ab[0]); + int b = Integer.parseInt(ab[1]); + int diff = Math.abs(a-b); + System.out.println( + diff/10 + (diff%10 !=0 ? 1 : 0) + ); + // (diff+9)/10 + } + } +} + +/* https://codeforces.com/problemset/problem/1409/A */ \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/BearAndBigBrother.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/BearAndBigBrother.java new file mode 100644 index 0000000..e6976ed --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/BearAndBigBrother.java @@ -0,0 +1,24 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class BearAndBigBrother { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String[] s = br.readLine().split("\\s+"); + long k = Integer.parseInt(s[0]), n = Integer.parseInt(s[1]),inc = 0; + do{ + k = k*3; + n = n*2; + inc++; + }while (k <= n); + System.out.println(inc); + } +} +/* +https://codeforces.com/problemset/problem/791/A +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/BeautifulMatrix.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/BeautifulMatrix.java new file mode 100644 index 0000000..e433b7f --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/BeautifulMatrix.java @@ -0,0 +1,29 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; +/* +https://codeforces.com/problemset/problem/263/A +*/ + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class BeautifulMatrix { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int x = 0,y = 0; + for (int i = 0; i < 5;i++){ + String s = br.readLine(); + if(s.contains("1")){ + String[] sA = s.split("\\s+"); + x = i; + for (int j = 0; j < 5; j++) { + if(sA[j].equals("1")) y = j; + } + break; + } + } + System.out.println(Math.abs(x-2)+Math.abs(y-2)); + } +} diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/BitPlusPlus.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/BitPlusPlus.java new file mode 100644 index 0000000..8c183be --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/BitPlusPlus.java @@ -0,0 +1,27 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; +/* +https://codeforces.com/problemset/problem/282/A +*/ + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class BitPlusPlus { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()); + int x = 0; + while (n-- > 0){ + String temp = br.readLine(); + if (temp.equals("++X") || temp.equals("X++")) { + ++x; + } else { + --x; + } + } + System.out.println(x); + } +} diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/BoyOrGirl.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/BoyOrGirl.java new file mode 100644 index 0000000..26443db --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/BoyOrGirl.java @@ -0,0 +1,27 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.HashSet; + +import static java.lang.System.in; + +public class BoyOrGirl { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String a = br.readLine(); + System.out.println(solution(a)); + } + + private static String solution(String a) { + HashSet hs= new HashSet<>(); + for(Character cha : a.toCharArray()){ + hs.add(cha); + } + return hs.size()%2==0 ? "CHAT WITH HER!" : "IGNORE HIM!" ; + } +} +/* +https://codeforces.com/problemset/problem/236/A +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/ChatRoom.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/ChatRoom.java new file mode 100644 index 0000000..4f7540c --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/ChatRoom.java @@ -0,0 +1,36 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.Locale; + +import static java.lang.System.in; + +public class ChatRoom { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String s = br.readLine().toLowerCase(Locale.ROOT); + int sl = s.length(); + char[] c = s.toCharArray(); + int hCount = 0,eCount = 0,lCount =0,oCount =0; + for (int i = 0; i < sl; i++) { + if(c[i]=='o' && lCount==2){ + oCount=1; + }else if (c[i] == 'l' && lCount>=1) { + lCount=2; + }else if(c[i] == 'l' && eCount==1){ + lCount=1; + }else if(c[i] == 'e' && hCount==1){ + eCount=1; + }else if(c[i] == 'h'){ + hCount=1; + } + } + System.out.println( + hCount==1 && eCount==1 && lCount==2 && oCount==1 ? "YES" : "NO" + ); + + } +} +/* https://codeforces.com/problemset/problem/58/A */ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/DominoPiling.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/DominoPiling.java new file mode 100644 index 0000000..1b6cec0 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/DominoPiling.java @@ -0,0 +1,19 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; +/* +https://codeforces.com/problemset/problem/50/A +*/ + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class DominoPiling { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String[] s = br.readLine().split("\\s+"); + long n = Integer.parseInt(s[0]), m = Integer.parseInt(s[1]); + System.out.println((n*m)/2); + } +} diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Elephant.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Elephant.java new file mode 100644 index 0000000..dbead3d --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Elephant.java @@ -0,0 +1,22 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class Elephant { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + long n = Integer.parseInt(br.readLine()); + // System.out.println(n/5+(n%5)/4+(n%5%4)/3+(n%5%4%3)/2+(n%5%4%3%2)/1); + System.out.println(n/5+(n%5 ==0 ? 0 : 1)); + } +} +/* +https://codeforces.com/problemset/problem/617/A +https://codeforces.com/contest/617/submission/15550796 + (n + 4) / 5 in case want to check remainder existence already +https://codeforces.com/problemset/submission/617/15516838 +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Football.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Football.java new file mode 100644 index 0000000..9d7f0f0 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Football.java @@ -0,0 +1,31 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class Football { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String a = br.readLine(); + System.out.println(solution(a)); + } + + private static String solution(String a) { + char[] c = a.toCharArray(); + int al = a.length(),count = 0; + for (int i = 1; i < al; i++) { + if(c[i] == c[i-1]){ + count++; + if(count == 6) return "YES"; + }else{ + count = 0; + } + } + return "NO"; + } +} +//https://codeforces.com/problemset/problem/96/A +//https://codeforces.com/problemset/submission/96/10152862 \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/HelpfulMaths.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/HelpfulMaths.java new file mode 100644 index 0000000..0ba43bd --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/HelpfulMaths.java @@ -0,0 +1,31 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; +/* +https://codeforces.com/problemset/problem/339/A +https://codeforces.com/problemset/submission/339/127325292 +https://codeforces.com/problemset/submission/339/13223816 +https://codeforces.com/problemset/submission/339/9265405 +*/ + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.Arrays; + +import static java.lang.System.in; + +public class HelpfulMaths { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String[] s = br.readLine().split("[+]"); + int sl = s.length; + if(sl==1) System.out.println(s[0]); + else{ + Arrays.sort(s); + StringBuilder sb = new StringBuilder(); + for(int i = 0;i < sl-1;i++){ + sb.append(s[i]).append("+"); + } + System.out.println(sb.append(s[sl-1])); + } + } +} diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/LuckyDivision.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/LuckyDivision.java new file mode 100644 index 0000000..a076688 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/LuckyDivision.java @@ -0,0 +1,26 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class LuckyDivision { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()); + int[] alA = {4,7,44,47,74,77,444,447,474,744,777,774,747,477}; + for(int i : alA){ + if(i==n || n%i==0){ + System.out.println("YES"); + return; + } + } + System.out.println("NO"); + } +} +/* + https://codeforces.com/problemset/problem/122/A + https://codeforces.com/problemset/submission/122/9132980 +*/ \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/NearlyLuckyNumber.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/NearlyLuckyNumber.java new file mode 100644 index 0000000..99abb7c --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/NearlyLuckyNumber.java @@ -0,0 +1,23 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class NearlyLuckyNumber { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + char[] cA = br.readLine().toCharArray(); + int counter = 0; + for(char c : cA){ + if(c == '4' || c == '7') counter++; + } + System.out.println(counter == 4 || counter == 7 ? "YES" : "NO"); + } +} + +/* + https://codeforces.com/problemset/problem/110/A + */ \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/NextRound.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/NextRound.java new file mode 100644 index 0000000..d01dd04 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/NextRound.java @@ -0,0 +1,33 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; +/* +https://codeforces.com/problemset/problem/158/A +https://codeforces.com/problemset/submission/158/127314961 +https://codeforces.com/problemset/submission/158/9264539 +*/ + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +public class NextRound { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); + String[] sA = br.readLine().split("\\s+"); + int n = Integer.parseInt(sA[0]),k = Integer.parseInt(sA[1]); + String[] sA1 = br.readLine().split("\\s+"); + System.out.println(nextRound(sA1,n,k)); + } + public static int nextRound(String[] s,int n,int k){ + int ans =0; + for(int i = 0;i < k;i++){ + if(s[i].equals("0")){ + return i; + } + } + for(int i = k;i < n;i++){ + if(s[i].equals(s[i-1])) ans++; + else break; + } + return ans+k; + } +} diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/PetyaAndStrings.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/PetyaAndStrings.java new file mode 100644 index 0000000..774f265 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/PetyaAndStrings.java @@ -0,0 +1,24 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; +/* +https://codeforces.com/problemset/problem/112/A +https://codeforces.com/problemset/submission/112/127322661 +https://codeforces.com/problemset/submission/112/9265069 +*/ + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class PetyaAndStrings { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String a = br.readLine(); + String b = br.readLine(); + int ans = a.compareToIgnoreCase(b); + if(ans > 0) System.out.println("1"); + else if(ans < 0) System.out.println("-1"); + else System.out.println("0"); + } +} diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/SoldierAndBananas.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/SoldierAndBananas.java new file mode 100644 index 0000000..ebfdd6e --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/SoldierAndBananas.java @@ -0,0 +1,22 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class SoldierAndBananas { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String[] s = br.readLine().split("\\s+"); + long k = Integer.parseInt(s[0]),n = Integer.parseInt(s[1]),w = Integer.parseInt(s[2]); + long ans = ((2*k+(w-1)*k)*w)/2; + System.out.println(n > ans ? 0 : ans-n ); + } +} +/* +https://codeforces.com/problemset/problem/546/A +Arithmetic Progressions + +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/StonesOnTheTable.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/StonesOnTheTable.java new file mode 100644 index 0000000..d88374c --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/StonesOnTheTable.java @@ -0,0 +1,28 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; +/* +https://codeforces.com/problemset/problem/266/A +https://codeforces.com/problemset/submission/266/9264985 +*/ + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class StonesOnTheTable { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int l = Integer.parseInt(br.readLine()); + String s = br.readLine(); + System.out.println(solution(s,l)); + } + private static int solution(String s, int l) { + if(l == 1) return 0; + int ans = 0; + for (int i = 1; i < l; i++) { + if(s.charAt(i)==s.charAt(i-1)) ans++; + } + return ans; + } +} diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/StringTask.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/StringTask.java new file mode 100644 index 0000000..366d61c --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/StringTask.java @@ -0,0 +1,27 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; +/* +https://codeforces.com/problemset/problem/118/A +*/ + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.Locale; + +import static java.lang.System.in; + +public class StringTask { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String a = br.readLine().toLowerCase(Locale.ROOT); + int sl = a.length(); + StringBuilder ans = new StringBuilder(); + for(int i = 0;i < sl;i++){ + if(!(a.charAt(i)=='a' || a.charAt(i)=='e' || a.charAt(i)=='i' + || a.charAt(i)=='o' || a.charAt(i)=='u' || a.charAt(i)=='y')){ + ans.append(".").append(a.charAt(i)); + } + } + System.out.println(ans); + } +} diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Team.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Team.java new file mode 100644 index 0000000..9191c4f --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Team.java @@ -0,0 +1,25 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; +/* +https://codeforces.com/problemset/problem/231/A + +*/ + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; +import static java.lang.System.out; + +public class Team { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()); + int ans = 0; + while (n-- > 0){ + String[] s = br.readLine().split("\\s+"); + if(Integer.parseInt(s[0]) + Integer.parseInt(s[1]) + Integer.parseInt(s[2]) >=2) ans++; + } + out.println(ans); + } +} diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/TheatreSquare.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/TheatreSquare.java new file mode 100644 index 0000000..5c1b618 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/TheatreSquare.java @@ -0,0 +1,26 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; +/* +https://codeforces.com/problemset/problem/1/A + +*/ + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class TheatreSquare { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String[] s = br.readLine().split("\\s+"); + long n = Integer.parseInt(s[0]),m = Integer.parseInt(s[1]),a = Integer.parseInt(s[2]); + //System.out.println((n+a-1)/a * ((m+a-1)/a)); + long ans =0; + if(n%a == 0) ans += n / a; + else ans += n / a + 1; + if(m%a == 0) ans *= (double) m / a; + else ans *= m / a + 1; + System.out.println(ans); + } +} diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Tram.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Tram.java new file mode 100644 index 0000000..32cce78 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Tram.java @@ -0,0 +1,23 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class Tram { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()),ans = 0,max = Integer.MIN_VALUE; + while(n-- >0){ + String[] s = br.readLine().split("\\s+"); + ans += (-Integer.parseInt(s[0])+Integer.parseInt(s[1])); + max = Math.max(ans,max); + } + System.out.println(max); + } +} +/* +https://codeforces.com/problemset/problem/116/A +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Watermelon.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Watermelon.java new file mode 100644 index 0000000..275e4a7 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Watermelon.java @@ -0,0 +1,16 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; +/* + https://codeforces.com/problemset/problem/4/A + */ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +public class Watermelon { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); + int w = Integer.parseInt(br.readLine()); + if (w % 2 == 0 && w >= 4) System.out.println("YES"); + else System.out.println("NO"); + } +} diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/WayTooLongWords.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/WayTooLongWords.java new file mode 100644 index 0000000..2aefe76 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/WayTooLongWords.java @@ -0,0 +1,26 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; +/* +https://codeforces.com/problemset/problem/71/A +*/ + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.*; + +public class WayTooLongWords { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()); + while (n-- > 0){ + String s = br.readLine(); + int sl = s.length(); + if(sl > 10) { + out.println(String.valueOf(s.charAt(0)) + (sl - 2) + s.charAt(sl - 1)); + } else { + out.println(s); + } + } + } +} diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Word.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Word.java new file mode 100644 index 0000000..c9a2115 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/Word.java @@ -0,0 +1,27 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.Locale; + +import static java.lang.System.in; + +public class Word { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String s = br.readLine(); + char[] cA = s.toCharArray(); + int lower = 0, upper = 0; + for(char c :cA){ + if(c>=65 && c <=90) upper++; + else lower++; + } + if(upper > lower) System.out.println(s.toUpperCase(Locale.ROOT)); + else System.out.println(s.toLowerCase(Locale.ROOT)); + } +} +/* +https://codeforces.com/problemset/problem/59/A + +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/WordCapitalization.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/WordCapitalization.java new file mode 100644 index 0000000..0d6511e --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/WordCapitalization.java @@ -0,0 +1,20 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.Locale; + +import static java.lang.System.in; + +public class WordCapitalization { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String a = br.readLine(); + System.out.println(a.substring(0, 1).toUpperCase(Locale.ROOT) + a.substring(1)); + } +} +/* +https://codeforces.com/problemset/problem/281/A + +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/WrongSubtraction.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/WrongSubtraction.java new file mode 100644 index 0000000..d5b0d3f --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/WrongSubtraction.java @@ -0,0 +1,21 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class WrongSubtraction { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String[] s = br.readLine().split("\\s+"); + long n = Integer.parseInt(s[0]), k = Integer.parseInt(s[1]); + while(k-- >0){ + if(n%10 >0) n--; + else n /=10; + } + System.out.println(n); + } +} +/* https://codeforces.com/problemset/problem/977/A */ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/YoungPhysicist.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/YoungPhysicist.java new file mode 100644 index 0000000..24f75fc --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/initialtwentyfive/YoungPhysicist.java @@ -0,0 +1,25 @@ +package com.mishra.aman.problemlevelA.initialtwentyfive; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class YoungPhysicist { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()); + int xsum = 0,ysum = 0, zsum =0; + while (n-- > 0) { + String[] s = br.readLine().split("\\s+"); + xsum += Integer.parseInt(s[0]); + ysum += Integer.parseInt(s[1]); + zsum += Integer.parseInt(s[2]); + } + System.out.println(xsum==0 && ysum == 0 && zsum ==0 ? "YES" : "NO"); + } +} +/* +https://codeforces.com/problemset/problem/69/A +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/Candies.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/Candies.java new file mode 100644 index 0000000..9d0f4b6 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/Candies.java @@ -0,0 +1,25 @@ +package com.mishra.aman.problemlevelA.seventyfivetohundred; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class Candies { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int testCases = Integer.parseInt(br.readLine()); + while (testCases-- > 0){ + int n = Integer.parseInt(br.readLine()); + for (int i = 2; i <= 29; i++) { + if(n%(Math.pow(2,i)-1) == 0){ + System.out.println((int)(n/(Math.pow(2,i)-1))); + break; + } + } + } + } +} + +//https://codeforces.com/problemset/problem/1343/A diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/ChoosingTeams.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/ChoosingTeams.java new file mode 100644 index 0000000..32da4a9 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/ChoosingTeams.java @@ -0,0 +1,30 @@ +package com.mishra.aman.problemlevelA.seventyfivetohundred; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.StringTokenizer; + +import static java.lang.System.in; + +public class ChoosingTeams { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + StringTokenizer st = new StringTokenizer(br.readLine()); + int n = Integer.parseInt(st.nextToken()); + int k = Integer.parseInt(st.nextToken()); + int count = 0; + if(k > 5){ + System.out.println("0"); + }else{ + int temp = 5-k; + st = new StringTokenizer(br.readLine()); + for (int i = 0; i < n; i++) { + if(Integer.parseInt(st.nextToken()) <= temp) count++; + } + System.out.println(count/3); + } + } +} + +//https://codeforces.com/problemset/problem/432/A diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/HolidayOfEquality.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/HolidayOfEquality.java new file mode 100644 index 0000000..5b6cb56 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/HolidayOfEquality.java @@ -0,0 +1,32 @@ +package com.mishra.aman.problemlevelA.seventyfivetohundred; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.StringTokenizer; + +import static java.lang.System.in; + +public class HolidayOfEquality { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()); + StringTokenizer st = new StringTokenizer(br.readLine()); + int[] aA = new int[n]; + int max = Integer.MIN_VALUE; + for (int i = 0; i < n; i++) { + int temp =Integer.parseInt(st.nextToken()); + aA[i] = temp; + max = Math.max(max,temp); + } + int ans =0; + for (int i = 0; i < n; i++) { + ans += (max-aA[i]); + } + System.out.println(ans); + } +} + +/* +https://codeforces.com/problemset/problem/758/A +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/IlyaAndBankAccount.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/IlyaAndBankAccount.java new file mode 100644 index 0000000..bb72cdd --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/IlyaAndBankAccount.java @@ -0,0 +1,28 @@ +package com.mishra.aman.problemlevelA.seventyfivetohundred; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class IlyaAndBankAccount { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String s = br.readLine(); + if(s.charAt(0) != '-'){ + System.out.println(s); + }else{ + int sl = s.length(); + if(s.charAt(sl-1) > s.charAt(sl-2)){ + System.out.println(s.substring(0,sl-1)); + }else{ + System.out.println(Integer.parseInt(s.substring(0,sl-2)+s.substring(sl-1))); + } + } + } +} + +/* +https://codeforces.com/problemset/problem/313/A +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/MinimalSquare.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/MinimalSquare.java new file mode 100644 index 0000000..610623c --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/MinimalSquare.java @@ -0,0 +1,24 @@ +package com.mishra.aman.problemlevelA.seventyfivetohundred; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.StringTokenizer; + +import static java.lang.System.in; + +public class MinimalSquare { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int testCases = Integer.parseInt(br.readLine()); + while (testCases-- > 0) { + StringTokenizer st = new StringTokenizer(br.readLine()); + int a = Integer.parseInt(st.nextToken()),b = Integer.parseInt(st.nextToken()); + int min = Math.min(a,b),max = Math.max(a,b); + System.out.println(max <= 2*min ? (2*min)*(2*min) : max*max); + } + } +} + + +//https://codeforces.com/problemset/problem/1360/A diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/NewYearTransportation.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/NewYearTransportation.java new file mode 100644 index 0000000..64e7b90 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/NewYearTransportation.java @@ -0,0 +1,35 @@ +package com.mishra.aman.problemlevelA.seventyfivetohundred; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.StringTokenizer; + +import static java.lang.System.in; + +public class NewYearTransportation { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + StringTokenizer st = new StringTokenizer(br.readLine()); + int n = Integer.parseInt(st.nextToken()); + int k = Integer.parseInt(st.nextToken()); + st = new StringTokenizer(br.readLine()); + int[] aA = new int[n]; + for (int i = 1; i < n; i++) { + aA[i] = Integer.parseInt(st.nextToken()); + } + int temp = 1 + aA[1]; + for (int i = temp; i < n; i = temp) { + if(i == k){ + System.out.println("YES"); + return; + } + temp += aA[temp]; + } + System.out.println(temp == k ? "YES" :"NO"); + } +} + +/* +https://codeforces.com/problemset/problem/500/A +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/RequiredRemainder.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/RequiredRemainder.java new file mode 100644 index 0000000..43132ee --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/RequiredRemainder.java @@ -0,0 +1,25 @@ +package com.mishra.aman.problemlevelA.seventyfivetohundred; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.StringTokenizer; + +import static java.lang.System.in; + +public class RequiredRemainder { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int testCases = Integer.parseInt(br.readLine()); + while (testCases-- > 0){ + StringTokenizer st = new StringTokenizer(br.readLine()); + int x = Integer.parseInt(st.nextToken()); + int y = Integer.parseInt(st.nextToken()); + int n = Integer.parseInt(st.nextToken()); + int temp = (n/x); + System.out.println((n%x >=y) ? (temp*x)+y : (temp-1)*x+y); + } + } +} + +//https://codeforces.com/problemset/problem/1374/A diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/TeamOlympiad.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/TeamOlympiad.java new file mode 100644 index 0000000..290bbcb --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/TeamOlympiad.java @@ -0,0 +1,53 @@ +package com.mishra.aman.problemlevelA.seventyfivetohundred; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.ArrayList; +import java.util.HashMap; +import java.util.StringTokenizer; + +import static java.lang.System.in; + +public class TeamOlympiad { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()); + StringTokenizer st = new StringTokenizer(br.readLine()); + HashMap> hM = new HashMap<>(); + int count1 = 0, count2 = 0,count3 = 0; + for (int i = 0; i < n; i++) { + int temp = Integer.parseInt(st.nextToken()); + if(temp == 1) count1++; + if(temp == 2) count2++; + if(temp == 3) count3++; + if(hM.containsKey(temp)){ + ArrayList list = hM.get(temp); + list.add(i + 1); + hM.put(temp,list); + }else{ + int finalI = i+1; + hM.put(temp,new ArrayList(){{ + add(finalI); + }}); + } + } + int min = Math.min(Math.min(count1,count2),count3); + if(min == 0){ + System.out.println(min); + }else{ + System.out.println(min); + int i = 0; + while(min-- > 0){ + System.out.println(hM.get(1).get(i)+" "+hM.get(2).get(i)+" "+hM.get(3).get(i)); + i++; + } + + } + } +} + +/* +https://codeforces.com/problemset/problem/490/A +https://codeforces.com/problemset/submission/490/10216607 +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/TheNewYearMeetingFriends.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/TheNewYearMeetingFriends.java new file mode 100644 index 0000000..a57efe8 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/seventyfivetohundred/TheNewYearMeetingFriends.java @@ -0,0 +1,22 @@ +package com.mishra.aman.problemlevelA.seventyfivetohundred; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.Arrays; +import java.util.StringTokenizer; + +import static java.lang.System.in; + +public class TheNewYearMeetingFriends { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + StringTokenizer st = new StringTokenizer(br.readLine()); + int[] a = {Integer.parseInt(st.nextToken()),Integer.parseInt(st.nextToken()),Integer.parseInt(st.nextToken())}; + Arrays.sort(a); + System.out.println(a[2]-a[0]); + } +} +/* +https://codeforces.com/problemset/problem/723/A +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/AntonAndDanik.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/AntonAndDanik.java new file mode 100644 index 0000000..e30d4d4 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/AntonAndDanik.java @@ -0,0 +1,26 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class AntonAndDanik { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()); + char[] sA= br.readLine().toCharArray(); + int counterA = 0; + for(int i = 0;i < n;i++){ + if(sA[i] == 'A') counterA++; + } + if(counterA > n-counterA){ + System.out.println("Anton"); + }else{ + System.out.println( counterA == n-counterA ? "Friendship" : "Danik" ); + } + } +} + +/* https://codeforces.com/problemset/problem/734/A */ \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/ArrivalOfTheGeneral.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/ArrivalOfTheGeneral.java new file mode 100644 index 0000000..83bb1d8 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/ArrivalOfTheGeneral.java @@ -0,0 +1,38 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class ArrivalOfTheGeneral { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()); + String[] sA = br.readLine().split("\\s+"); + int[] array = new int[n]; + for (int i = 0; i < n; i++) { + array[i] = Integer.parseInt(sA[i]); + } + int max = Integer.MIN_VALUE,min = Integer.MAX_VALUE,minIndex = 0,maxIndex = 0; + for (int i = 0; i < n; i++) { + if(array[i]>max){ + max = array[i]; + maxIndex = i; + } + if(array[i] <= min){ + min = array[i]; + minIndex = i; + } + } + if(minIndex>maxIndex){ + System.out.println(maxIndex+n-minIndex-1); + }else{ + System.out.println(maxIndex+n-minIndex-2); + } + } +} + +//https://codeforces.com/problemset/problem/144/A +//https://codeforces.com/problemset/submission/144/9266130 \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/BeautifulYear.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/BeautifulYear.java new file mode 100644 index 0000000..3e0160c --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/BeautifulYear.java @@ -0,0 +1,29 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.HashSet; + +import static java.lang.System.in; + +public class BeautifulYear { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()),size = 0; + int result; + while(size!=4){ + n++; + result =n; + HashSet hs = new HashSet<>(); + while(result>0){ + hs.add(result%10); + result /=10; + } + size =hs.size(); + } + System.out.println(n); + } +} + +//https://codeforces.com/problemset/problem/271/A \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/CalculatingFunction.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/CalculatingFunction.java new file mode 100644 index 0000000..ceb1f9a --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/CalculatingFunction.java @@ -0,0 +1,20 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class CalculatingFunction { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + long n = Long.parseLong(br.readLine()); + System.out.println(n%2==0 ? n/2 : n/2-n); + } +} + +/* +https://codeforces.com/problemset/problem/486/A +https://codeforces.com/problemset/submission/486/9266658 +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/DivisibilityProblem.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/DivisibilityProblem.java new file mode 100644 index 0000000..7e459af --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/DivisibilityProblem.java @@ -0,0 +1,24 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class DivisibilityProblem { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int t = Integer.parseInt(br.readLine()); + while (t-- >0){ + String[] nm = br.readLine().split("\\s+"); + int n = Integer.parseInt(nm[0]); + int m = Integer.parseInt(nm[1]); + System.out.println(n%m == 0 ? 0 : m - (n%m)); + } + } +} + +//https://codeforces.com/problemset/problem/1328/A +//https://codeforces.com/problemset/submission/1328/74399093 +//https://codeforces.com/problemset/submission/1328/75297958 \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Dubstep.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Dubstep.java new file mode 100644 index 0000000..3f37375 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Dubstep.java @@ -0,0 +1,18 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class Dubstep { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String s = br.readLine(); + System.out.println(s.replaceAll("(WUB)+"," ").trim()); + } +} + +//https://codeforces.com/problemset/problem/208/A +//https://codeforces.com/problemset/submission/208/9266470 diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/EvenOdds.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/EvenOdds.java new file mode 100644 index 0000000..58c4e88 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/EvenOdds.java @@ -0,0 +1,26 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class EvenOdds { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String[] s = br.readLine().split("\\s+"); + long n = Long.parseLong(s[0]); + long k = Long.parseLong(s[1]); + if(k <= (n+1)/2){ + System.out.println(1+(k-1)*2); + }else{ + System.out.println((k-(n+1)/2)*2); + } + } +} + +/* +https://codeforces.com/problemset/problem/318/A +https://codeforces.com/problemset/submission/318/31200492 +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Expression.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Expression.java new file mode 100644 index 0000000..d4aa1a5 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Expression.java @@ -0,0 +1,25 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class Expression { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int a = Integer.parseInt(br.readLine()); + int b = Integer.parseInt(br.readLine()); + int c = Integer.parseInt(br.readLine()); + int ans = a+b+c; + ans = Math.max(ans,(a + b) * c); + ans = Math.max(ans,a * (b + c)); + ans = Math.max(ans, a * b * c); + System.out.println(ans); + } + +} + +//https://codeforces.com/problemset/problem/479/A +//https://codeforces.com/problemset/submission/479/9272211 diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/GeorgeAndAccommodation.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/GeorgeAndAccommodation.java new file mode 100644 index 0000000..da43409 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/GeorgeAndAccommodation.java @@ -0,0 +1,26 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class GeorgeAndAccommodation { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()); + int ans = 0; + while(n-- > 0) { + String[] nh = br.readLine().split("\\s+"); + int p = Integer.parseInt(nh[0]); + int q = Integer.parseInt(nh[1]); + ans += (q-p >=2) ? 1 :0; + } + System.out.println(ans); + } +} +/* +https://codeforces.com/problemset/problem/467/A +https://codeforces.com/problemset/submission/467/30217491 +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/GravityFlip.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/GravityFlip.java new file mode 100644 index 0000000..90200ad --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/GravityFlip.java @@ -0,0 +1,47 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class GravityFlip { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int a = Integer.parseInt(br.readLine()); + String[] sA = br.readLine().split("\\s+"); + int[] ans = new int[100]; + for (int i = 0; i < a; i++) { + int temp = Integer.parseInt(sA[i])-1; + ans[temp]++; + } + for (int i = 0; i < 100; i++) { + while(ans[i]-->0){ + System.out.print(""+(i+1)+ " "); + } + + } + } +} +/* + +//https://codeforces.com/problemset/problem/405/A +//https://codeforces.com/contest/405/submission/127885228 +public class GravityFlip { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int a = Integer.parseInt(br.readLine()); + String[] sA = br.readLine().split("\\s+"); + int[] ans = new int[a]; + for (int i = 0; i < a; i++) { + ans[i] = Integer.parseInt(sA[i]); + } + Arrays.sort(ans); + for (int i = 0; i < a; i++) { + System.out.print(""+ans[i]+ " "); + } + } + +//https://codeforces.com/problemset/submission/405/9272152 +}*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/HQ9PLUS.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/HQ9PLUS.java new file mode 100644 index 0000000..da548a0 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/HQ9PLUS.java @@ -0,0 +1,24 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class HQ9PLUS { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + char[] cA = br.readLine().toCharArray(); + for(char c : cA){ + if(c == 'H' || c=='Q' || c == '9'){ + System.out.println("YES"); + return; + } + } + System.out.println("NO"); + } +} + +//https://codeforces.com/problemset/problem/133/A +//https://codeforces.com/problemset/submission/133/13223106 \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Hulk.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Hulk.java new file mode 100644 index 0000000..33bcad6 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Hulk.java @@ -0,0 +1,30 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class Hulk { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()); + StringBuilder sb = new StringBuilder(); + for(int i = 1;i <= n;i++){ + if(i==n && i%2 != 0){ + sb.append("I hate it"); + }else if(i == n){ + sb.append("I love it"); + }else if(i%2 !=0){ + sb.append("I hate that "); + }else{ + sb.append("I love that "); + } + } + System.out.println(sb); + } +} + +//https://codeforces.com/problemset/problem/705/A +//https://codeforces.com/problemset/submission/705/19719454 \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/IWannaBeTheGuy.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/IWannaBeTheGuy.java new file mode 100644 index 0000000..1a79ce4 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/IWannaBeTheGuy.java @@ -0,0 +1,28 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.Arrays; +import java.util.HashSet; + +import static java.lang.System.in; + +public class IWannaBeTheGuy { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()); + String[] pA = br.readLine().split("\\s+"); + String[] qA = br.readLine().split("\\s+"); + HashSet unique = new HashSet<>(); + int pAl = Integer.parseInt(pA[0]); + int qAl = Integer.parseInt(qA[0]); + unique.addAll(Arrays.asList(pA).subList(1, pAl + 1)); + unique.addAll(Arrays.asList(qA).subList(1, qAl + 1)); + System.out.println(unique.size()>=n ? "I become the guy." : "Oh, my keyboard!"); + } +} + +/* +https://codeforces.com/problemset/problem/469/A +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/InSearchOfAnEasyProblem.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/InSearchOfAnEasyProblem.java new file mode 100644 index 0000000..3f3ec26 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/InSearchOfAnEasyProblem.java @@ -0,0 +1,27 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class InSearchOfAnEasyProblem { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()); + String[] s = br.readLine().split("\\s+"); + for (int i = 0; i < n; i++) { + if(s[i].equals("1")){ + System.out.println("HARD"); + return; + } + } + System.out.println("EASY"); + } +} + +/* +https://codeforces.com/problemset/problem/1030/A +https://codeforces.com/problemset/submission/1030/44739934 +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/InsomniaCure.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/InsomniaCure.java new file mode 100644 index 0000000..44e9bf4 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/InsomniaCure.java @@ -0,0 +1,49 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class InsomniaCure { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int k = Integer.parseInt(br.readLine()); + int l = Integer.parseInt(br.readLine()); + int m = Integer.parseInt(br.readLine()); + int n = Integer.parseInt(br.readLine()); + int d = Integer.parseInt(br.readLine()); + int ans = 0; + if(k==1 || l == 1 || m == 1 || n == 1){ + System.out.println(d); + }else{ + /* System.out.println( + d/k+d/l+d/m+d/n - d/(lcm(k,l)) -d/(lcm(k,m)) -d/(lcm(k,n)) -d/(lcm(l,m)) -d/(lcm(l,n)) - + d/(lcm(m,n)) + );*/ + for(int i =1;i<=d;i++){ + if(i%k==0 || i%l==0 || i%m==0 || i%n==0) ans++; + } + System.out.println(ans); + } + } + /*public static int lcm(int number1, int number2) { + if (number1 == 0 || number2 == 0) { + return 0; + } + int absHigherNumber = Math.max(number1, number2); + int absLowerNumber = Math.min(number1, number2); + int lcm = absHigherNumber; + while (lcm % absLowerNumber != 0) { + lcm += absHigherNumber; + } + return lcm; + }*/ +} + +/* +https://codeforces.com/problemset/problem/148/A + +https://codeforces.com/contest/148/submission/11987935 O(n) +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/IsYourHorseshoeOnTheOtherHoof.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/IsYourHorseshoeOnTheOtherHoof.java new file mode 100644 index 0000000..87cf418 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/IsYourHorseshoeOnTheOtherHoof.java @@ -0,0 +1,23 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.Collections; +import java.util.HashSet; + +import static java.lang.System.in; + +public class IsYourHorseshoeOnTheOtherHoof { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String[] sA = br.readLine().split("\\s+"); + HashSet unique = new HashSet<>(); + Collections.addAll(unique, sA); + System.out.println(4-unique.size()); + } +} + +/* +https://codeforces.com/problemset/problem/228/A +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/KefaAndFirstSteps.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/KefaAndFirstSteps.java new file mode 100644 index 0000000..95bf9ca --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/KefaAndFirstSteps.java @@ -0,0 +1,30 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class KefaAndFirstSteps { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()); + String[] sA = br.readLine().split("\\s+"); + int max = Integer.MIN_VALUE,count =0; + for(int i = 0; i < n ;i++){ + if(i == 0 || Integer.parseInt(sA[i]) >= Integer.parseInt(sA[i-1])){ + count++; + }else{ + count = 1; + } + max = Math.max(max,count); + + } + System.out.println(max); + } +} + +/* +https://codeforces.com/problemset/problem/580/A +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Magnets.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Magnets.java new file mode 100644 index 0000000..6237326 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Magnets.java @@ -0,0 +1,26 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class Magnets { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()); + char last = br.readLine().charAt(1); + int gC = 1; + while(n -- > 1){ + String temp = br.readLine(); + gC += (last == temp.charAt(0) ? 1 : 0); + last = temp.charAt(1); + } + System.out.println(gC); + } +} + +/* +https://codeforces.com/problemset/problem/344/A +*/ \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Presents.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Presents.java new file mode 100644 index 0000000..219bbb6 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Presents.java @@ -0,0 +1,27 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class Presents { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()); + String[] fA = br.readLine().split("\\s+"); + String[] ans = new String[n]; + for (int i = 0; i < n; i++) { + int temp = Integer.parseInt(fA[i])-1; + ans[temp] = ""+(i+1); + } + for(String a : ans){ + System.out.print(a+" "); + } + } +} + +/* +https://codeforces.com/problemset/problem/136/A +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Puzzles.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Puzzles.java new file mode 100644 index 0000000..9fccb5d --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Puzzles.java @@ -0,0 +1,30 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.Arrays; + +import static java.lang.System.in; + +public class Puzzles { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String[] nm = br.readLine().split("\\s+"); + int n = Integer.parseInt(nm[0]); + int m = Integer.parseInt(nm[1]); + String[] pA = br.readLine().split("\\s+"); + int[] temp = new int[m]; + for (int i = 0; i < m;i++) { + temp[i] = Integer.parseInt(pA[i]); + } + Arrays.sort(temp); + int ans = Integer.MAX_VALUE; + for (int i = 0; i <= m-n; i++) { + ans = Math.min(ans,temp[i+n-1]-temp[i]); + } + System.out.println(ans); + } +} + +/* https://codeforces.com/problemset/problem/337/A */ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Translation.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Translation.java new file mode 100644 index 0000000..53f0380 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Translation.java @@ -0,0 +1,32 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class Translation { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + /*char[] sA = br.readLine().toCharArray(); + char[] tA = br.readLine().toCharArray(); + int sl = sA.length,tl = tA.length; + if(sl != tl){ + System.out.println("NO"); + return; + } + for(int i = 0;i < sl;i++){ + if(sA[i] != tA[sl-i-1]){ + System.out.println("NO"); + return; + } + } + System.out.println("YES");*/ + System.out.println(new StringBuilder(br.readLine()).reverse().toString().equals(br.readLine()) ? "YES" : "NO"); + } +} + +/* +https://codeforces.com/problemset/problem/41/A +*/ \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Twins.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Twins.java new file mode 100644 index 0000000..73f1a5f --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/Twins.java @@ -0,0 +1,39 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.Arrays; +import java.util.Collections; + +import static java.lang.System.in; + +public class Twins { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()); + String[] sA= br.readLine().split("\\s+"); + Integer[] a = new Integer[n]; + int sum = 0; + for (int i = 0; i < n; i++) { + int temp = Integer.parseInt(sA[i]); + sum += temp; + a[i] = temp; + } + int coin = 0; + int tempsum = 0; + Arrays.sort(a , Collections.reverseOrder()); + for (int i : a){ + tempsum +=i; + coin++; + if(tempsum > sum -tempsum){ + System.out.println(coin); + return; + } + } + + } +} +/* +https://codeforces.com/problemset/problem/160/A + */ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/UltraFastMathematician.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/UltraFastMathematician.java new file mode 100644 index 0000000..b0ab9f8 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/UltraFastMathematician.java @@ -0,0 +1,25 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class UltraFastMathematician { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String s1 = br.readLine(); + int s1l = s1.length(); + String s2 = br.readLine(); + String result = ""; + for(int i = 0;i < s1l;i++){ + result += (s1.charAt(i) == s2.charAt(i)) ? "0" : "1"; + } + System.out.println(result); + } +} + +/* +https://codeforces.com/problemset/problem/61/A +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/VanyaAndFence.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/VanyaAndFence.java new file mode 100644 index 0000000..a465b1f --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/VanyaAndFence.java @@ -0,0 +1,24 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class VanyaAndFence { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String[] nh = br.readLine().split("\\s+"); + int n = Integer.parseInt(nh[0]); + int h = Integer.parseInt(nh[1]); + String[] hE = br.readLine().split("\\s+"); + int count = 0; + for(int i = 0;i h) count++; + } + System.out.println(n+count); + } +} + +/* https://codeforces.com/problemset/problem/677/A */ \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/cAPSlOCK.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/cAPSlOCK.java new file mode 100644 index 0000000..8f9e2cd --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelA/twentyfivetofifty/cAPSlOCK.java @@ -0,0 +1,37 @@ +package com.mishra.aman.problemlevelA.twentyfivetofifty; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.Locale; + +import static java.lang.System.in; + +public class cAPSlOCK { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String s = br.readLine(); + int sl = s.length(); + if(sl == 1){ + System.out.println(Character.isLowerCase(s.charAt(0)) ? + s.toUpperCase(Locale.ROOT) + : s.toLowerCase(Locale.ROOT) + ); + return; + } + for(int i = 1;i < sl;i++){ + if(Character.isLowerCase(s.charAt(i))) { + System.out.println(s); + return; + } + } + System.out.println( + Character.isLowerCase(s.charAt(0)) ? + s.substring(0,1).toUpperCase(Locale.ROOT)+s.substring(1).toLowerCase(Locale.ROOT) + : s.toLowerCase(Locale.ROOT) + ); + } +} + +//https://codeforces.com/problemset/problem/131/A +//https://codeforces.com/problemset/submission/131/9264939 \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/BalancedArray.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/BalancedArray.java new file mode 100644 index 0000000..679ebb7 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/BalancedArray.java @@ -0,0 +1,32 @@ +package com.mishra.aman.problemlevelB; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class BalancedArray { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int testCases = Integer.parseInt(br.readLine()); + while (testCases-- >0){ + int n = Integer.parseInt(br.readLine()); + StringBuilder sb = new StringBuilder(); + if((n/2)%2 != 0 ){ + System.out.println("NO"); + }else{ + for(int i = 0;i < n/2;i++){ + sb.append(2+2*i).append(" "); + } + for (int i = 0; i < (n/2)-1; i++) { + sb.append(1+(2*i)).append(" "); + } + sb.append((n+(n/2)-1)); + System.out.println("YES"); + System.out.println(sb); + } + } + } +} +//https://codeforces.com/problemset/problem/1343/B diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/Drinks.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/Drinks.java new file mode 100644 index 0000000..ee262ee --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/Drinks.java @@ -0,0 +1,26 @@ +package com.mishra.aman.problemlevelB; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.math.BigDecimal; +import java.math.RoundingMode; + +import static java.lang.System.in; + +public class Drinks { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()); + String[] sA = br.readLine().split("\\s+"); + int sum = 0; + for(String s : sA){ + sum += Integer.parseInt(s); + } + System.out.println(BigDecimal.valueOf(sum).divide(BigDecimal.valueOf(n),12 ,RoundingMode.HALF_EVEN)); + } +} + +/* +https://codeforces.com/problemset/problem/200/B +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/EvenArray.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/EvenArray.java new file mode 100644 index 0000000..3909519 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/EvenArray.java @@ -0,0 +1,35 @@ +package com.mishra.aman.problemlevelB; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.StringTokenizer; + +import static java.lang.System.in; + +public class EvenArray { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int testCases = Integer.parseInt(br.readLine()); + while (testCases-- > 0) { + int n = Integer.parseInt(br.readLine()); + StringTokenizer st = new StringTokenizer(br.readLine()); + int counter1 = 0,counter2 = 0; + for (int i = 0; i < n; i++) { + if(i%2 == 0){ + if(Integer.parseInt(st.nextToken())%2 != 0){ + counter1++; + } + }else{ + if(Integer.parseInt(st.nextToken())%2 != 1){ + counter2++; + } + } + } + System.out.println(counter1==counter2 ? counter1 : -1); + } + } +} + + +//https://codeforces.com/problemset/problem/1367/B \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/GiftsFixing.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/GiftsFixing.java new file mode 100644 index 0000000..8149377 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/GiftsFixing.java @@ -0,0 +1,40 @@ +package com.mishra.aman.problemlevelB; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.StringTokenizer; + +import static java.lang.System.in; + +public class GiftsFixing { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int testCases = Integer.parseInt(br.readLine()); + while (testCases-- > 0) { + int n = Integer.parseInt(br.readLine()); + int minA = Integer.MAX_VALUE,minB = Integer.MAX_VALUE; + long result = 0; + int[] aA = new int[n]; + int[] bA = new int[n]; + StringTokenizer st = new StringTokenizer(br.readLine()); + for (int i = 0; i < n; i++) { + aA[i] = Integer.parseInt(st.nextToken()); + minA = Math.min(minA,aA[i]); + } + st = new StringTokenizer(br.readLine()); + for (int i = 0; i < n; i++) { + bA[i] = Integer.parseInt(st.nextToken()); + minB = Math.min(minB,bA[i]); + } + for (int i = 0; i < n; i++) { + result += Math.max(aA[i] - minA , bA[i] - minB); + } + System.out.println(result); + } + } +} + +/* +https://codeforces.com/problemset/problem/1399/B +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/QueueAtTheSchool.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/QueueAtTheSchool.java new file mode 100644 index 0000000..cc9bf10 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/QueueAtTheSchool.java @@ -0,0 +1,27 @@ +package com.mishra.aman.problemlevelB; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class QueueAtTheSchool { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String[] s = br.readLine().split("\\s+"); + int n = Integer.parseInt(s[0]), t = Integer.parseInt(s[1]); + char[] cA = br.readLine().toCharArray(); + while(t-->0){ + for (int i = 1; i < n; i++) { + if(cA[i] == 'G' && cA[i-1] == 'B'){ + cA[i]= 'B'; + cA[i-1] ='G'; + i++; + } + } + } + System.out.println(String.valueOf(cA)); + } +} +//https://codeforces.com/problemset/problem/266/B diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/TPrimes.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/TPrimes.java new file mode 100644 index 0000000..c1fb297 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/TPrimes.java @@ -0,0 +1,80 @@ +package com.mishra.aman.problemlevelB; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.Arrays; + +import static java.lang.System.in; + +public class TPrimes { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int t = Integer.parseInt(br.readLine()); + String[] sA = br.readLine().split("\\s+"); + boolean[] isPrime = new boolean[1000001]; + Arrays.fill(isPrime,true); + sieveofEratosthenes(isPrime); + for (int i = 0; i < t; i++) { + long num = Long.parseLong(sA[i]); + if(num == 1L || num == 0L){ + System.out.println("NO"); + continue; + } + int index = (Math.sqrt(num)%1==0) ? (int)Math.sqrt(num) : 4; + if(isPrime[index]){ + System.out.println("YES"); + }else{ + System.out.println("NO"); + } + + } + + } + + private static void sieveofEratosthenes(boolean[] isPrime) { + for(int i = 2; i < Math.sqrt(1000001); i++){ + if(isPrime[i]){ + for (int j = i*i; j < 1000001; j=j+i) { + isPrime[j] = false; + } + } + } + } + +} + +/* +https://codeforces.com/problemset/problem/230/B +*/ + +/* +TLE SOLUTION +public class TPrimes { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int t = Integer.parseInt(br.readLine()); + String[] sA = br.readLine().split("\\s+"); + for (int i = 0; i < t; i++) { + long num = Long.parseLong(sA[i]); + int dC = 0; + if(num < 4 || (num > 4 && (num & 1) ==0 )){ + System.out.println("NO"); + continue; + } + if(num == 4){ + System.out.println("YES"); + continue; + } + for(int j = 3;j <= Math.sqrt(num);j=j+2 ){ + if(num%j == 0) dC++; + if(dC >= 2){ + break; + } + } + System.out.println(dC == 1 ? "YES" : "NO"); + + } + } +} +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/Taxi.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/Taxi.java new file mode 100644 index 0000000..52dc9e0 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/Taxi.java @@ -0,0 +1,41 @@ +package com.mishra.aman.problemlevelB; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class Taxi { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int n = Integer.parseInt(br.readLine()); + String[] sA = br.readLine().split("\\s+"); + int ans=0,ones =0,twos =0,threes=0; + for(String s : sA){ + if(s.equals("1")){ + ones++; + }else if(s.equals("2")){ + twos++; + }else if(s.equals("3")){ + threes++; + }else if(Integer.parseInt(s)>3){ + ans++; + } + } + if(threes >= ones){ + ans +=ones +(threes-ones); + ones = 0; + }else { + ans += threes; + ones = ones - threes; + } + + ans += (twos%2==0) ? twos/2 +(ones+3)/4: twos/2 + 1+ (ones+1)/4; + System.out.println(ans); + } +} + +/* +https://codeforces.com/problemset/problem/158/B +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/TwoArraysAndSwaps.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/TwoArraysAndSwaps.java new file mode 100644 index 0000000..8cfdfa8 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/TwoArraysAndSwaps.java @@ -0,0 +1,56 @@ +package com.mishra.aman.problemlevelB; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.Arrays; +import java.util.StringTokenizer; + +import static java.lang.System.in; + +public class TwoArraysAndSwaps { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int testCases = Integer.parseInt(br.readLine()); + while (testCases-- > 0){ + StringTokenizer st = new StringTokenizer(br.readLine()); + int n = Integer.parseInt(st.nextToken()); + int k = Integer.parseInt(st.nextToken()); + int[] aA = new int[n]; + int[] bA = new int[n]; + st = new StringTokenizer(br.readLine()); + int sum = 0; + for (int i = 0; i < n; i++) { + aA[i] = Integer.parseInt(st.nextToken()); + sum += aA[i]; + } + st = new StringTokenizer(br.readLine()); + for (int i = 0; i < n; i++) { + bA[i] = Integer.parseInt(st.nextToken()); + } + System.out.println(k == 0 ? sum : solution(aA,bA,n,k,sum)); + } + } + + private static int solution(int[] aA, int[] bA, int n, int k,int sum) { + Arrays.sort(aA); + Arrays.sort(bA); + int j = n-1,counterswap = 0; + for (int i = 0; i < n; i++) { + if(aA[i] < bA[j]){ + sum +=(bA[j]-aA[i]); + j--; + counterswap++; + if (counterswap==k){ + break; + } + }else{ + break; + } + } + return sum; + } +} + +//https://codeforces.com/problemset/problem/1353/B +// \ No newline at end of file diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/VanyaAndLanterns.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/VanyaAndLanterns.java new file mode 100644 index 0000000..07fb822 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/VanyaAndLanterns.java @@ -0,0 +1,36 @@ +package com.mishra.aman.problemlevelB; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.math.BigDecimal; +import java.math.RoundingMode; +import java.util.Arrays; + +import static java.lang.System.in; + +public class VanyaAndLanterns { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String[] nl = br.readLine().split("\\s+"); + int n = Integer.parseInt(nl[0]); + int l = Integer.parseInt(nl[1]); + String[] aA = br.readLine().split("\\s+"); + int[] aiA = new int[n]; + for (int i = 0; i < n; i++) { + aiA[i] = Integer.parseInt(aA[i]); + } + Arrays.sort(aiA); + int max = Integer.MIN_VALUE; + for (int i = 1; i < n; i++) { + max = Math.max(max,aiA[i]-aiA[i-1]); + } + BigDecimal ans = BigDecimal.valueOf(max).divide(BigDecimal.valueOf(2), 10,RoundingMode.HALF_EVEN); + int temp = Math.max(aiA[0],l-aiA[n-1]); + System.out.println(ans.compareTo(BigDecimal.valueOf(temp)) >= 0 ? ans : temp+".0000000000" ); + + } +} + +/* https://codeforces.com/problemset/problem/492/B */ + diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/XeniaAndRingroad.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/XeniaAndRingroad.java new file mode 100644 index 0000000..e902bdd --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelB/XeniaAndRingroad.java @@ -0,0 +1,37 @@ +package com.mishra.aman.problemlevelB; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; + +import static java.lang.System.in; + +public class XeniaAndRingroad { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + String[] nm = br.readLine().split("\\s+"); + int n = Integer.parseInt(nm[0]); + int m = Integer.parseInt(nm[1]); + String[] aA = br.readLine().split("\\s+"); + int[] aiA = new int[m]; + long ans = 0; + for (int i = 0; i < m; i++) { + aiA[i] = Integer.parseInt(aA[i]); + } + for (int i = 0; i < m; i++) { + if (i == 0){ + ans += aiA[i]-1; + }else if(aiA[i] < aiA[i-1]){ + ans += (n-aiA[i-1]) + aiA[i]; + }else if(aiA[i] > aiA[i-1]){ + ans += aiA[i] - aiA[i-1]; + } + } + System.out.println(ans); + + } +} + +/* +https://codeforces.com/problemset/problem/339/B +*/ diff --git a/CODEFORCES/src/main/java/com/mishra/aman/problemlevelC/RegistrationSystem.java b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelC/RegistrationSystem.java new file mode 100644 index 0000000..5e8bd77 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/problemlevelC/RegistrationSystem.java @@ -0,0 +1,29 @@ +package com.mishra.aman.problemlevelC; + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.HashMap; + +import static java.lang.System.in; + +public class RegistrationSystem { + public static void main(String[] args) throws IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(in)); + int t = Integer.parseInt(br.readLine()); + HashMap hM = new HashMap<>(); + while (t-- > 0){ + String temp = br.readLine(); + if(hM.containsKey(temp)){ + int x = hM.get(temp); + System.out.println(temp+""+x); + hM.put(temp,x+1); + }else{ + hM.put(temp,1); + System.out.println("OK"); + } + } + } +} + +//https://codeforces.com/problemset/problem/4/C diff --git a/CODEFORCES/src/main/java/com/mishra/aman/templates/TEMPLATE_ONE.java b/CODEFORCES/src/main/java/com/mishra/aman/templates/TEMPLATE_ONE.java new file mode 100644 index 0000000..5605d78 --- /dev/null +++ b/CODEFORCES/src/main/java/com/mishra/aman/templates/TEMPLATE_ONE.java @@ -0,0 +1,59 @@ +package com.mishra.aman.templates; + +import java.util.Arrays; +import java.util.Comparator; + +public class TEMPLATE_ONE { + public static void main(String[] args) { + Pair[] arrOne = new Pair[10]; + Arrays.sort(arrOne, (p1, p2) -> p1.v1 - p2.v1); + Arrays.sort(arrOne, new Comparator() { + @Override public int compare(Pair p1, Pair p2) + { + return p1.v1 - p2.v1; + } + }); + int[][] arr = new int[4][4]; + TEMPLATE_ONE.sortbyColumn(arr,0); + + } + public static void sortbyColumn(int arr[][], final int col){ + // Using built-in sort function Arrays.sort + Arrays.sort(arr, new Comparator() { + + @Override + // Compare values according to columns + public int compare(final int[] entry1, final int[] entry2) { + + // To sort in descending order revert + // the '>' Operator + if (entry1[col] > entry2[col]) + return 1; + if(entry1[col] < entry2[col]) + return -1; + return 0; + } + }); // End of function call sort(). + } + private static class Pair { + int v1; + int v2; + public Pair(int x,int y){ + this.v1 = x; + this.v2 = y; + } + + @Override + public String toString() { + return "Pair{" + + "v1=" + v1 + + ", v2=" + v2 + + '}'; + } + } +} + +//https://codeforces.com/problemset/submission/230/54335779 +//https://codeforces.com/problemset/submission/339/9135621 +//https://codeforces.com/problemset/submission/750/23421649 + diff --git a/CODEFORCES/src/main/resources/Notes.md b/CODEFORCES/src/main/resources/Notes.md new file mode 100644 index 0000000..2fc6b9c --- /dev/null +++ b/CODEFORCES/src/main/resources/Notes.md @@ -0,0 +1,2 @@ +### Algorithms +1.sieve of Eratosthenes diff --git a/CODEFORCES/src/main/resources/ProblemsTookHelp.md b/CODEFORCES/src/main/resources/ProblemsTookHelp.md new file mode 100644 index 0000000..a55b88c --- /dev/null +++ b/CODEFORCES/src/main/resources/ProblemsTookHelp.md @@ -0,0 +1,5 @@ +1. https://codeforces.com/problemset/problem/230/B +2. https://codeforces.com/problemset/problem/189/A +3. https://codeforces.com/problemset/problem/455/A +4. https://codeforces.com/problemset/problem/1343/A +5. \ No newline at end of file diff --git a/CODEFORCES/src/main/resources/RegularExpression.md b/CODEFORCES/src/main/resources/RegularExpression.md new file mode 100644 index 0000000..898111b --- /dev/null +++ b/CODEFORCES/src/main/resources/RegularExpression.md @@ -0,0 +1,5 @@ +# To Replace any number of occurrences of a word(more than one) with single space +1.("(WORDTOBEREPLACED)+"," ")
+Example Program : https://codeforces.com/problemset/problem/208/A
+2.replaceAll("^0+(?!$)","") replace all trailing zero from string + diff --git a/CODEFORCES/src/main/resources/StackOverflow.md b/CODEFORCES/src/main/resources/StackOverflow.md new file mode 100644 index 0000000..2326d9e --- /dev/null +++ b/CODEFORCES/src/main/resources/StackOverflow.md @@ -0,0 +1,2 @@ +1. https://stackoverflow.com/questions/3759112/whats-faster-inserting-into-a-priority-queue-or-sorting-retrospectively/10761286 +2. \ No newline at end of file