├── .idea ├── .gitignore ├── codeStyles │ └── codeStyleConfig.xml ├── misc.xml ├── modules.xml └── vcs.xml ├── Codechef ├── Codechef.iml ├── README.md ├── beg │ ├── .Guddu.java.swp │ ├── .SmallFactorials.java.swp │ ├── AddNumber.java │ ├── Addfstnlst.java │ ├── BankAtm.java │ ├── BigIntegerFactorial.java │ ├── EnormousInputTest.java │ ├── FindRem.java │ ├── LuckyFour.java │ ├── ReverseNumber.java │ ├── SecondLargest.java │ ├── SmallFactorial.java │ ├── SumofDigits.java │ └── TurboSort.java └── contest │ ├── 2020 │ ├── 2020.iml │ └── janLong │ │ └── brkbks.java │ ├── AprilLong │ ├── FriendorGirlfriend.java │ ├── MaximumRemaining.java │ ├── in() { │ └── maxrem.cpp │ ├── IcL │ ├── FlatLand.java │ └── candies.java │ ├── Long │ ├── 2q │ ├── DistributeApples.java │ └── FootballGame.java │ ├── contest.iml │ └── zonal │ └── SmartPhone.java ├── Competitive-Programming.iml ├── Graphs └── BellmanFord.go ├── Leetcode ├── .m.c.swp ├── 2.add-two-numbers.java ├── 34.find-first-and-last-position-of-element-in-sorted-array.java ├── ExpressionEval.java ├── FindPeakElement.java ├── MinimumRotated.java ├── ReverseNum.java ├── RightArrayRotation.java ├── removeDuplicates.java └── two-sum.java ├── README.md ├── atcoder ├── 169 │ ├── Multiplication.java │ ├── Multiplication2.java │ ├── Multiplication3.java │ └── mul.java ├── 170 │ ├── a │ ├── a.cpp │ ├── b │ └── b.cpp ├── 093 │ ├── .swp │ ├── permut.cpp │ ├── permut.java │ └── small.java ├── 8-March │ └── Station.java ├── DiscountFare.java ├── sam.jav └── sam.java ├── cdblocks ├── .AnyBase.java.swp ├── cdblocks.iml ├── challenge1 │ ├── .PythgorasTriplet.java.swp │ ├── Amstrong.java │ ├── AnyBase.java │ ├── BasicCalci.java │ ├── BinaryDecimal.java │ ├── BinarySearch.java │ ├── CountDigit.java │ ├── DelhiOddEven.java │ ├── Fahrenheit.java │ ├── FibnocciPattern.java │ ├── GlobalVar.java │ ├── HollowDiamond.java │ ├── IncreasingDecreasingSequence.java │ ├── Manmohan2.java │ ├── ManmohanLovesPatternsI.java │ ├── ManmohanLovesPatternsII.java │ ├── MaxArray.java │ ├── PascalTriangle.java │ ├── PatternMountain.java │ ├── PatternStar.java │ ├── PatternStar2.java │ ├── PatternTriangle.java │ ├── PatternwithZeros.java │ ├── PrintSeries.java │ ├── PythgorasTriplet.java │ ├── Quadratic.java │ ├── Rhombus.java │ ├── SimpleInput.java │ ├── candyPrime.java │ ├── check.java │ ├── helpRamu.java │ ├── nPrime.java │ └── patternMountain.java └── challenge2 │ ├── BinarySearch.java │ └── StringSort.java ├── codeforces ├── 636 │ ├── candies │ └── candies.cpp ├── Practice │ ├── FingerPrint.java │ ├── maths │ │ ├── .theatreSquare.cpp.swp │ │ ├── NextRound.java │ │ ├── theatreSquare │ │ ├── theatreSquare.cpp │ │ └── watermelon.cpp │ └── strings │ │ └── way2long.java ├── Round46 │ └── .tshirt.java.swp ├── codeforces.iml ├── rating1300 │ └── 69A.java ├── round491div2 │ ├── Probelem1.java │ └── Problem7.java └── round492div2 │ ├── Problem1.java │ ├── Problem3.java │ ├── Problem3a.java │ └── \ ├── codejam ├── 2018 │ ├── .trobleSort.java.swp │ ├── allen.java │ └── troble.cpp ├── 2019 │ ├── ForgoneSolution.cpp │ ├── Solution.cpp │ ├── Solution.java │ ├── cope.cpp │ ├── fr.py │ ├── interactive_runner.py │ └── testing_tool.py ├── foobar1.java ├── kickstart │ ├── .Gbus.java.swp │ └── Gbus.cpp └── kickstart1oct │ └── palindrome.cpp ├── codes ├── cpp │ ├── basics │ │ ├── ' │ │ ├── .MaxandMinDataTypesSize.cpp.swp │ │ ├── .studentsResults.cpp.swp │ │ ├── Array.cpp │ │ ├── Duplicate │ │ ├── Duplicate.cpp │ │ ├── binary2Decimal.cpp │ │ ├── c.cpp │ │ ├── check.cpp │ │ ├── checkString.cpp │ │ ├── delete.cpp │ │ ├── exceed.cpp │ │ ├── findString.cpp │ │ ├── funcOver.cpp │ │ ├── gcd │ │ ├── gcd.cpp │ │ ├── inline.cpp │ │ ├── java │ │ │ ├── anagram.java │ │ │ └── tolower.java │ │ ├── large10Num.cpp │ │ ├── leapyear.cpp │ │ ├── limits.cpp │ │ ├── loops │ │ │ ├── patter5 │ │ │ ├── patter5.cpp │ │ │ ├── pattern1.cpp │ │ │ ├── pattern2.cpp │ │ │ ├── pattern3 │ │ │ ├── pattern3.cpp │ │ │ ├── pattern4 │ │ │ └── pattern4.cpp │ │ ├── lower.cpp │ │ ├── main.cpp │ │ ├── namespaces.cpp │ │ ├── nullptr.cpp │ │ ├── ptr.cpp │ │ ├── readAllLower.cpp │ │ ├── spiral.cpp │ │ ├── stringSlice.cpp │ │ ├── studMarks │ │ ├── studMarks.cpp │ │ ├── studentsResults.cpp │ │ ├── sumEven.cpp │ │ ├── taxConditions.cpp │ │ ├── tictactoe.cpp │ │ ├── variableDeclaration.cpp │ │ ├── vector.cpp │ │ └── vowels.cpp │ ├── cpp.iml │ ├── learnCpp │ │ ├── addSub.cpp │ │ ├── evenOdd │ │ ├── evenOdd.cpp │ │ ├── size │ │ └── size.c │ └── stl │ │ └── maps.cpp ├── java │ ├── .idea │ │ ├── java.iml │ │ ├── misc.xml │ │ ├── modules.xml │ │ ├── vcs.xml │ │ └── workspace.xml │ ├── HeadFirstJava │ │ ├── PrintOwnSource.java │ │ ├── com │ │ │ └── pluralsight │ │ │ │ └── example │ │ │ │ └── hello.java │ │ └── module1 │ │ │ ├── Book.java │ │ │ ├── GuessGame.java │ │ │ ├── GuessingGame.java │ │ │ ├── LogicalvsConditionalOp.java │ │ │ ├── ObjectReference.java │ │ │ ├── PhraseOMatic.java │ │ │ └── forEachloop.java │ ├── codes.iml │ ├── derektut │ │ ├── UnderstandVariables.java │ │ ├── nestedClass.java │ │ ├── toStringf.java │ │ └── tut1.java │ ├── jetbrains-Acad │ │ ├── SimpleBot │ │ │ └── ChatBot.java │ │ └── jetbrains-Acad.iml │ └── practice │ │ ├── BigInteger │ │ ├── BigInteger.iml │ │ └── Lesson │ │ │ ├── 1q │ │ │ ├── big1.java │ │ │ └── gcdBigInteger.java │ │ ├── baiscs │ │ ├── .count.py.swp │ │ ├── .idea │ │ │ ├── baiscs.iml │ │ │ ├── misc.xml │ │ │ ├── modules.xml │ │ │ └── workspace.xml │ │ ├── Bitwise.java │ │ ├── DuplicateElements.java │ │ ├── Monopoly.java │ │ ├── NonRepeatMap.java │ │ ├── NonRepeatingLetters.java │ │ ├── Spiral.java │ │ ├── SwapArrayRandom.java │ │ ├── SwapNumbers.java │ │ ├── Temperature.java │ │ ├── arrayCheck.java │ │ ├── calculatorSwitch.java │ │ ├── calculatorifElse.java │ │ ├── calenderDay.java │ │ ├── checkLetter.java │ │ ├── fibdp.java │ │ ├── fibnocci.java │ │ ├── gcd.java │ │ ├── hello.java │ │ ├── newPrime.java │ │ ├── pattern │ │ │ ├── java-app │ │ │ │ ├── PascalTriangle.java │ │ │ │ ├── pat1.java │ │ │ │ ├── pat10.java │ │ │ │ ├── pat11.java │ │ │ │ ├── pat12.java │ │ │ │ ├── pat13.java │ │ │ │ ├── pat14.java │ │ │ │ ├── pat15.java │ │ │ │ ├── pat16.java │ │ │ │ ├── pat17.java │ │ │ │ ├── pat18.java │ │ │ │ ├── pat19.java │ │ │ │ ├── pat2.java │ │ │ │ ├── pat20.java │ │ │ │ ├── pat3.java │ │ │ │ ├── pat4.java │ │ │ │ ├── pat5.java │ │ │ │ ├── pat6.java │ │ │ │ ├── pat7.java │ │ │ │ ├── pat8.java │ │ │ │ ├── pat9.java │ │ │ │ └── spojPtr1.java │ │ │ ├── pattern1.java │ │ │ ├── pattern10.cpp │ │ │ ├── pattern11.java │ │ │ ├── pattern12.cpp │ │ │ ├── pattern2.java │ │ │ ├── pattern3.java │ │ │ ├── pattern4.java │ │ │ ├── pattern5.java │ │ │ ├── pattern6.java │ │ │ ├── pattern7.java │ │ │ ├── pattern8.cpp │ │ │ ├── pattern9.cpp │ │ │ ├── square.cpp │ │ │ └── x.cpp │ │ ├── secondLargest.java │ │ ├── sorting │ │ │ └── Bubble.java │ │ └── ss.java │ │ ├── collections │ │ ├── arrayList.java │ │ ├── swapArray.java │ │ └── treeSet │ │ │ ├── Treeset.java │ │ │ └── treeMap.java │ │ ├── oops │ │ ├── PassbyRefernce.java │ │ └── PassingObjects.java │ │ ├── practice1.iml │ │ ├── strings │ │ ├── ReverseCharArr.java │ │ ├── StringConstructor.java │ │ ├── byteAscii.java │ │ ├── compareTO.java │ │ ├── getCharsDemo.java │ │ ├── index.java │ │ ├── reverseString.java │ │ ├── startEnds.java │ │ ├── stringSort.java │ │ ├── trim.java │ │ ├── trimJava.java │ │ └── valueOf.java │ │ └── understanding-datatypes │ │ ├── BitbyBit.java │ │ ├── ByteType.java │ │ └── LightYears.java ├── term.txt └── web tech │ ├── node │ ├── app.js │ └── logger.js │ └── pluralsight │ ├── web │ ├── index.html │ └── tags.txt │ ├── web2.0 │ ├── images │ │ ├── button.svg │ │ └── googl.png │ ├── index.css │ └── index.html │ ├── web3.0 │ ├── images │ │ ├── button.svg │ │ └── googl.png │ ├── index.css │ └── index.html │ └── web4.0 │ ├── index.css │ └── index.html ├── hackerearth ├── Parcel.java ├── TestClass.java ├── maths │ └── canyouguess.java ├── myvar.java └── octoberEasy │ └── InnocentPeople.java ├── hackerrank ├── .ReachingPoint.java.swp ├── algo │ ├── .birds.java.swp │ ├── birds.java │ └── sumPairs.java ├── compete │ ├── 101hack5 │ │ └── swap.java │ ├── IOSD │ │ └── search.cpp │ ├── c2c │ │ ├── .vscode │ │ │ └── ipch │ │ │ │ └── d1ffd9a5c22b66d7 │ │ │ │ ├── mmap_address.bin │ │ │ │ └── pattern.ipch │ │ └── pattern.c │ ├── compete.iml │ ├── hourrank26 │ │ └── combomeal.cpp │ ├── weekofCode38 │ │ ├── .Replace.java.swp │ │ └── WhichSection.java │ └── worldcodesprint13 │ │ ├── .absent.java.swp │ │ └── absent.java ├── cpp │ ├── Untitled1.cpp │ ├── breaking beds.cpp │ ├── numbergroup.cpp │ ├── practice │ │ ├── and.cpp │ │ ├── arrays.cpp │ │ ├── dt.cpp │ │ ├── for.cpp │ │ ├── function.cpp │ │ ├── hello.cpp │ │ ├── if-else.cpp │ │ ├── inp-op.cpp │ │ ├── pointers.cpp │ │ ├── v-array │ │ └── v-array.cpp │ ├── printprettyInhertence.cpp │ ├── strings │ ├── strings.cpp │ ├── thesalesperson.cpp │ └── vector.cpp ├── hackerrank.iml └── java │ ├── ArrayQuery.java │ └── ReachingPoint.java ├── interviewbit └── maxPoint.java ├── practice ├── LinkedList │ ├── 1 │ ├── DoubleLinkedList.java │ ├── Insertion.java │ ├── InsertionAtMid.java │ ├── LinkedCollection.java │ └── LinkedListClass.java ├── algorithms │ └── merge.java ├── arrays │ ├── ArrayRotation.java │ ├── ArrayRotationBrute.java │ ├── ClassicalArray │ │ ├── ArrayList │ │ │ └── removeElement.java │ │ ├── BinarySearch.java │ │ ├── ElementDeletion.java │ │ └── Sortings.java │ ├── ReverseArray.java │ ├── RightArrayRotation.java │ └── geeksforgeeks │ │ └── CyclicallyRotate.java ├── automorphic.cpp ├── bruteforce │ └── printMicrosoft.cpp ├── gcd ├── gcd.cpp ├── maths │ ├── GcdLcm.java │ ├── MagicNumbers.java │ ├── factorial.java │ ├── largeGcd.java │ ├── newLine.py │ ├── productFractions.java │ └── x.txt ├── practice.iml ├── recursion │ ├── .addArray.cpp.swp │ ├── addArray.cpp │ ├── arraySum.java │ ├── countDigit.cpp │ ├── findelement.cpp │ ├── headRec.java │ ├── is_sorted.cpp │ └── power.java ├── strings │ ├── Lex.java │ ├── MembershipString.java │ ├── StringConcat.java │ ├── StringSlice.java │ ├── checkNull.java │ ├── gfg │ │ ├── CountCharacters.java │ │ ├── Kpanagram.java │ │ ├── panagram.java │ │ └── removeSpace.java │ ├── stringBuilder │ │ └── reverse.java │ └── upper.java └── tree │ ├── BST.java │ ├── LevelOrderTraversal.java │ └── maxSum.java ├── projectEuler ├── README.md ├── cpp │ ├── fibonaci.cpp │ ├── largest pallindrome.cpp │ ├── largestprime.cpp │ └── multipleof3and5.cpp ├── java │ ├── 13.txt │ ├── EvenFibonacci.java │ ├── FactorialDigitSum.java │ ├── SmallestMultiple.java │ └── largeSum.java ├── primeFact.c └── projectEuler.iml ├── spoj ├── CPTTRN1.java ├── CPTTRN2.java ├── HS12MBR.java ├── Pattern │ ├── CPTTRN1.java │ ├── CPTTRN2.java │ └── Main.java ├── PrimeGen.py ├── PrimeGenerator.java ├── STRHH.java └── factorialTrailingZero.java ├── techgig ├── Array │ └── ThirdLargest.java └── CodeGladiator2019a.java ├── timusJudge └── reverseRoot.java ├── topcoder ├── 784 │ ├── 250 │ └── 250.cpp ├── LCMRange.cpp ├── chess.cpp ├── tco │ ├── .Solution.java.swp │ └── warm.java └── topcoder.iml └── uva └── 900.java /.idea/.gitignore: -------------------------------------------------------------------------------- 1 | # Default ignored files 2 | /shelf/ 3 | /workspace.xml 4 | # Datasource local storage ignored files 5 | /dataSources/ 6 | /dataSources.local.xml 7 | # Editor-based HTTP Client requests 8 | /httpRequests/ 9 | -------------------------------------------------------------------------------- /.idea/codeStyles/codeStyleConfig.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 5 | -------------------------------------------------------------------------------- /.idea/misc.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 6 | 7 | 8 | 9 | -------------------------------------------------------------------------------- /.idea/vcs.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | -------------------------------------------------------------------------------- /Codechef/Codechef.iml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Codechef/README.md: -------------------------------------------------------------------------------- 1 | ## This repository contains codes for codechef problems 2 | 3 | #### @author: Saurav Jaiswal(sauravjaiswalsj.github.io) 4 | -------------------------------------------------------------------------------- /Codechef/beg/.Guddu.java.swp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sauravjaiswalsj/Competitive-Programming/81aae2e43c484b21d2c495cd15d510a49771b92f/Codechef/beg/.Guddu.java.swp -------------------------------------------------------------------------------- /Codechef/beg/.SmallFactorials.java.swp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sauravjaiswalsj/Competitive-Programming/81aae2e43c484b21d2c495cd15d510a49771b92f/Codechef/beg/.SmallFactorials.java.swp -------------------------------------------------------------------------------- /Codechef/beg/AddNumber.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | class AddNumeber{ 3 | public static void main(String[] args){ 4 | Scanner cin=new Scanner(System.in); 5 | int t=cin.nextInt(); 6 | while(t!=0){ 7 | int a=cin.nextInt(); 8 | int b=cin.nextInt(); 9 | System.out.println(a+b); 10 | t--; 11 | } 12 | } 13 | } 14 | -------------------------------------------------------------------------------- /Codechef/beg/Addfstnlst.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | class Addfstnlst{ 4 | public static void main(String[] args){ 5 | Scanner cin=new Scanner(System.in); 6 | int t=cin.nextInt(); 7 | while(t!=0){ 8 | long num=cin.nextLong(); 9 | System.out.println(addDigit(num)); 10 | t--; 11 | } 12 | } 13 | public static long addDigit(long num){ 14 | int sum=0,fst=0; 15 | int lst=(int)num%10; 16 | while(num!=0){ 17 | if(num<10 && num>0){ 18 | fst=(int)num; 19 | } 20 | num/=10; 21 | } 22 | return lst+fst; 23 | } 24 | } 25 | -------------------------------------------------------------------------------- /Codechef/beg/BankAtm.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | import java.text.DecimalFormat; 3 | class BankAtm{ 4 | public static final Scanner cin=new Scanner(System.in); 5 | public static final DecimalFormat df=new DecimalFormat("#0.00"); 6 | public static void main(String[] args){ 7 | int amount=cin.nextInt(); 8 | double balance=cin.nextDouble(); 9 | if(amount%5==0 && amount<=balance-0.5){ 10 | double bal=balance-(double)amount-0.50; 11 | System.out.println(df.format(bal)); 12 | }else{ 13 | System.out.println(df.format(balance)); 14 | } 15 | } 16 | } 17 | 18 | -------------------------------------------------------------------------------- /Codechef/beg/BigIntegerFactorial.java: -------------------------------------------------------------------------------- 1 | import java.math.BigInteger; 2 | import java.io.*; 3 | public class BigIntegerFactorial{ 4 | public static void main(String[] args)throws IOException{ 5 | final BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); 6 | int t=Integer.parseInt(br.readLine()); 7 | for(int i=0;ib && a>c){ 17 | if(b>c){ 18 | return b; 19 | }else{ 20 | return c; 21 | } 22 | }else if(b>a && b>c){ 23 | if(a>c){ 24 | return a; 25 | }else return c; 26 | }else if(c>a && c>b){ 27 | if(a>b){ 28 | return a; 29 | }else return b; 30 | }else{ 31 | return a; 32 | } 33 | 34 | } 35 | } 36 | -------------------------------------------------------------------------------- /Codechef/beg/SmallFactorial.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | class SmallFactorial{ 3 | public static void main(String[] args){ 4 | Scanner cin=new Scanner(System.in); 5 | int t=cin.nextInt(); 6 | while(t!=0){ 7 | int c=cin.nextInt(); 8 | System.out.println(fact(c)); 9 | t--; 10 | } 11 | } 12 | public static long fact(int n){ 13 | long fc=1; 14 | for(int i=2;i<=n;i++){ 15 | fc*=(long)i; 16 | } 17 | return fc; 18 | } 19 | } 20 | -------------------------------------------------------------------------------- /Codechef/beg/SumofDigits.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | class SumofDigits{ 4 | public static void main(String[] args){ 5 | Scanner scan=new Scanner(System.in); 6 | int t=scan.nextInt(); 7 | while(t!=0){ 8 | int num=scan.nextInt(); 9 | System.out.println(digitAdd(num)); 10 | t--; 11 | } 12 | } 13 | static int digitAdd(int num){ 14 | int sum=0; 15 | while(num!=0){ 16 | int rem=num%10; 17 | sum=sum+rem; 18 | num/=10; 19 | } 20 | return sum; 21 | } 22 | } 23 | -------------------------------------------------------------------------------- /Codechef/beg/TurboSort.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | class TurboSort{ 4 | public static void main(String[] args){ 5 | Scanner cin=new Scanner(System.in); 6 | int t=cin.nextInt(); 7 | int[] arr=new int[t]; 8 | for(int i=0;i 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Codechef/contest/AprilLong/FriendorGirlfriend.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class FriendorGirlfriend{ 4 | public static void main(String[] args){ 5 | Scanner cin=new Scanner(System.in); 6 | int n=cin.nextInt(); 7 | while(n!=0){ 8 | int t=cin.nextInt(); 9 | String s=cin.nextLine(); 10 | cin.next(); 11 | String c=cin.next(); 12 | System.out.println(checkLetters(s,c)); 13 | n--; 14 | } 15 | } 16 | public static int checkLetters(String s, String c){ 17 | 18 | } 19 | } 20 | -------------------------------------------------------------------------------- /Codechef/contest/AprilLong/MaximumRemaining.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | class MaximumRemaining{ 4 | public static void main(String[] args){ 5 | Scanner cin=new Scanner(System.in); 6 | int n=cin.nextInt(); 7 | int[] arr=new int[n]; 8 | for(int i=0;i 2 | #include 3 | int main(void){ 4 | int n; 5 | std::cin>>n; 6 | int arr[n]; 7 | for(int i=0;i>arr[i]; 9 | } 10 | std::sort(arr,arr+n); 11 | int j=arr[n-1],max=0,mod; 12 | try{ 13 | for(int i=0;i=max){ 18 | max=mod; 19 | } 20 | } 21 | std::cout<0){ 22 | box=0; 23 | long val=apple-boxes; 24 | System.out.print("val is "+val+" "); 25 | apple=val; 26 | box=Math.min(apple,box); 27 | System.out.print("Box at" + apple +" is "+ box+ " "); 28 | } 29 | }else{ 30 | box=-1; 31 | } 32 | if(box<0){ 33 | return "NO"; 34 | }else{ 35 | return "YES"; 36 | } 37 | } 38 | } 39 | 40 | -------------------------------------------------------------------------------- /Codechef/contest/contest.iml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | -------------------------------------------------------------------------------- /Codechef/contest/zonal/SmartPhone.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | class SmartPhone{ 4 | public static void main(String[] args){ 5 | Scanner cin=new Scanner(System.in); 6 | int n=cin.nextInt(); 7 | long[] arr=new long[n]; 8 | for(int i=0;i=num){ 17 | num=sum; 18 | } 19 | } 20 | System.out.println(num); 21 | } 22 | } 23 | -------------------------------------------------------------------------------- /Leetcode/.m.c.swp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sauravjaiswalsj/Competitive-Programming/81aae2e43c484b21d2c495cd15d510a49771b92f/Leetcode/.m.c.swp -------------------------------------------------------------------------------- /Leetcode/2.add-two-numbers.java: -------------------------------------------------------------------------------- 1 | /* 2 | * @lc app=leetcode id=2 lang=java 3 | * 4 | * [2] Add Two Numbers 5 | */ 6 | 7 | // @lc code=start 8 | /** 9 | * Definition for singly-linked list. 10 | * public class ListNode { 11 | * int val; 12 | * ListNode next; 13 | * ListNode(int x) { val = x; } 14 | * } 15 | */ 16 | class Solution { 17 | public ListNode addTwoNumbers(ListNode l1, ListNode l2) { 18 | 19 | } 20 | } 21 | // @lc code=end 22 | 23 | -------------------------------------------------------------------------------- /Leetcode/34.find-first-and-last-position-of-element-in-sorted-array.java: -------------------------------------------------------------------------------- 1 | /* 2 | * @lc app=leetcode id=34 lang=java 3 | * 4 | * [34] Find First and Last Position of Element in Sorted Array 5 | */ 6 | 7 | // @lc code=start 8 | class Solution { 9 | public int[] searchRange(int[] nums, int target) { 10 | int[] arr= new int[2]; 11 | int low=0; 12 | int high=nums.length; 13 | while(low list=new ArrayList(); 9 | for(int i=0;i list, int low,int high){ 21 | while(low 2 | using namespace std; 3 | 4 | int main(){ 5 | string s; 6 | cin>>s; 7 | if((s=="abc")||(s="bac")||(s="cab")){ 8 | cout<<"Yes"; 9 | } 10 | else 11 | cout<<"No"; 12 | } 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /atcoder/093/permut.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | public class permut{ 3 | public static void main(String[] args){ 4 | Scanner cin=new Scanner(System.in); 5 | String s=cin.next(); 6 | if((s.equals("abc"))||(s.equals("acb"))||(s.equals("bac"))||(s.equals("cab"))||(s.equals("bca"))||(s.equals("cba"))){ 7 | System.out.println("Yes"); 8 | } 9 | else{ 10 | System.out.println("No"); 11 | } 12 | } 13 | } 14 | -------------------------------------------------------------------------------- /atcoder/093/small.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | public class small{ 3 | public static void main(String[] args){ 4 | Scanner cin=new Scanner(System.in); 5 | int a,b; 6 | a=cin.nextInt(); 7 | b=cin.nextInt(); 8 | int k=cin.nextInt(); 9 | int n=k; 10 | int c=b; 11 | System.out.println(a); 12 | for(int i=a;i<=min(b,a+k−1);i++){ 13 | System.out.printf(”%d/n”,+i); 14 | } 15 | for(int i=max(b−k+1,a+k);i<=b;i++){ 16 | System.out.printf(”%d/n”,+i); 17 | } 18 | System.out.println(b); 19 | } 20 | } 21 | -------------------------------------------------------------------------------- /atcoder/169/Multiplication.java: -------------------------------------------------------------------------------- 1 | import java.io.*; 2 | public class Multiplication{ 3 | public static void main(String[] args)throws IOException{ 4 | final BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); 5 | int a=Integer.parseInt(br.readLine()); 6 | int b=Integer.parseInt(br.readLine()); 7 | System.out.println(a*b); 8 | } 9 | } 10 | -------------------------------------------------------------------------------- /atcoder/169/Multiplication2.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | import java.util.Arrays; 3 | public class Multiplication2{ 4 | public static void main(String[] args){ 5 | final Scanner cin = new Scanner(System.in); 6 | int n = cin.nextInt(); 7 | long[] arr=new long[n]; 8 | for(int i=0;i(long)1e18 || mul<=0){ 19 | System.out.print(-1); 20 | System.exit(0); 21 | } 22 | mul=mul*a; 23 | //System.out.print(mul+" "); 24 | } 25 | //System.out.println(); 26 | System.out.print(mul>(long)1e18?-1:mul); 27 | } 28 | } 29 | 30 | -------------------------------------------------------------------------------- /atcoder/169/Multiplication3.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | import java.math.*; 3 | public class Multiplication3{ 4 | public static void main(String[] args){ 5 | final Scanner cin=new Scanner(System.in); 6 | long a=cin.nextLong(); 7 | double b=cin.nextDouble(); 8 | long k=(long)Math.round(b*100); 9 | long mul=(a*k); 10 | System.out.print(mul/100); 11 | } 12 | } 13 | -------------------------------------------------------------------------------- /atcoder/169/mul.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | import java.math.BigInteger; 3 | 4 | public class mul{ 5 | public static void main(String[] args){ 6 | final Scanner cin = new Scanner(System.in); 7 | BigInteger a=cin.nextBigInteger(); 8 | BigInteger b=cin.nextBigInteger(); 9 | BigInteger c=BigInteger.ONE; 10 | c=a.multiply(b); 11 | System.out.println(c); 12 | } 13 | } 14 | 15 | -------------------------------------------------------------------------------- /atcoder/170/a: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sauravjaiswalsj/Competitive-Programming/81aae2e43c484b21d2c495cd15d510a49771b92f/atcoder/170/a -------------------------------------------------------------------------------- /atcoder/170/a.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using std::cin; 4 | using std::vector; 5 | using std::cout; 6 | 7 | #define fa for(int i=0;i<5;i++) 8 | int main(){ 9 | int a; 10 | vector arr; 11 | bool x=false; 12 | fa{ 13 | cin>>a; 14 | arr.push_back(a); 15 | } 16 | fa{ 17 | if(arr[i]==0){ 18 | cout< 2 | 3 | using namespace std; 4 | 5 | int main(){ 6 | int x,y; 7 | cin>>x>>y; 8 | if(y<=4*x && y%2==0){ 9 | cout<<"Yes\n"; 10 | } 11 | else{ 12 | cout<<"No\n"; 13 | } 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /atcoder/8-March/Station.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | import java.io.*; 3 | public class Station{ 4 | public static void main(String[] args)throws IOException{ 5 | final BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); 6 | String S=br.readLine(); 7 | System.out.println(getStationPair(S)); 8 | } 9 | public static String getStationPair(String S){ 10 | if(S.charAt(0).equals(S.charAt(1))&&(S.charAt(1).equals(S.charAt(2)))){ 11 | return "No"; 12 | } 13 | return "YES"; 14 | } 15 | } 16 | -------------------------------------------------------------------------------- /atcoder/DiscountFare.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | public class DiscountFare{ 3 | public static void main(String[] args){ 4 | Scanner cin=new Scanner(System.in); 5 | int x=cin.nextInt(); 6 | int y=cin.nextInt(); 7 | int temp=y/2; 8 | System.out.println(temp+x); 9 | } 10 | } 11 | -------------------------------------------------------------------------------- /atcoder/sam.jav: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sauravjaiswalsj/Competitive-Programming/81aae2e43c484b21d2c495cd15d510a49771b92f/atcoder/sam.jav -------------------------------------------------------------------------------- /atcoder/sam.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | public class sam{ 3 | public static void main(String[] args){ 4 | int x,y; 5 | Scanner cin=new Scanner(System.in); 6 | x=cin.nextInt(); 7 | y=cin.nextInt(); 8 | String s=cin.next(); 9 | System.out.print(x+y); 10 | System.out.print(" "+s); 11 | } 12 | } 13 | -------------------------------------------------------------------------------- /cdblocks/.AnyBase.java.swp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sauravjaiswalsj/Competitive-Programming/81aae2e43c484b21d2c495cd15d510a49771b92f/cdblocks/.AnyBase.java.swp -------------------------------------------------------------------------------- /cdblocks/cdblocks.iml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | -------------------------------------------------------------------------------- /cdblocks/challenge1/.PythgorasTriplet.java.swp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sauravjaiswalsj/Competitive-Programming/81aae2e43c484b21d2c495cd15d510a49771b92f/cdblocks/challenge1/.PythgorasTriplet.java.swp -------------------------------------------------------------------------------- /cdblocks/challenge1/Amstrong.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | public class Amstrong { 3 | public static void main(String args[]) { 4 | Scanner cin=new Scanner(System.in); 5 | int n=cin.nextInt(); 6 | System.out.println(AmstrongChecker(n)); 7 | } 8 | public static boolean AmstrongChecker(int n){ 9 | int sum=0,temp=n;; 10 | while(n!=0){ 11 | int rem=n%10; 12 | sum=sum+(rem*rem*rem); 13 | n/=10; 14 | } 15 | if(sum==temp){ 16 | return true; 17 | }else 18 | return false; 19 | } 20 | } 21 | -------------------------------------------------------------------------------- /cdblocks/challenge1/AnyBase.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | import java.lang.*; 3 | public class AnyBase{ 4 | public static void main(String[] args){ 5 | Scanner cin=new Scanner(System.in); 6 | System.out.println("Enter the Num : "); 7 | int n=cin.nextInt(); 8 | System.out.println("Enter the Source base: "); 9 | int sb=cin.nextInt(); 10 | System.out.println("Enter the Destination Base: "); 11 | int db=cin.nextInt(); 12 | if(sb==16){ 13 | String g=cin.nextLine(); 14 | int t=Integer.parseInt(g,16); 15 | System.out.println(t); 16 | }else 17 | System.out.println(ToAnyBase(n,sb,db)); 18 | } 19 | public static int ToAnyBase(int n,int sb,int db){ 20 | int sum=0,i=0; 21 | while(n!=0){ 22 | int rem=n%db; 23 | sum=sum+(rem*(int)(Math.pow(sb,i))); 24 | i++; 25 | n/=db; 26 | } 27 | return sum; 28 | } 29 | } 30 | -------------------------------------------------------------------------------- /cdblocks/challenge1/BinaryDecimal.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | public class BinaryDecimal{ 3 | public static void main(String[] args){ 4 | Scanner cin=new Scanner(System.in); 5 | int t=cin.nextInt(); 6 | while(t!=0){ 7 | int n=cin.nextInt(); 8 | System.out.println(ToConvert(n)); 9 | t--; 10 | } 11 | } 12 | public static int ToConvert(int n){ 13 | int i=0,sum=0; 14 | while(n!=0){ 15 | int rem=n%10; 16 | sum=sum+(rem*(int)Math.pow(2,i)); 17 | n/=10; 18 | i++; 19 | } 20 | return sum; 21 | } 22 | } 23 | -------------------------------------------------------------------------------- /cdblocks/challenge1/BinarySearch.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | public class BinarySearch{ 3 | public static void main(String[] args){ 4 | Scanner cin=new Scanner(System.in); 5 | int item=55; 6 | int[] arr={10,20,30,35,40,45,50,55,60,65,70}; 7 | int bin=Search(arr,item); 8 | System.out.println(arr[bin]+" "+bin); 9 | } 10 | public static int Search(int[] arr,int item){ 11 | int low=0,high=arr.length-1; 12 | int mid; 13 | while(low<=high){ 14 | mid=(low+high)/2; 15 | if(arr[mid]==item){ 16 | return mid; 17 | }else if(arr[mid] 1 && cst2 && (cst>1 && cst2) 26 | pr++; 27 | } 28 | } 29 | } 30 | 31 | 32 | -------------------------------------------------------------------------------- /cdblocks/challenge1/MaxArray.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | public class MaxArray{ 3 | public static void main(String[] args){ 4 | int[] arr={10,20,30,-12,-1231,34}; 5 | System.out.println(MaxValue(arr)); 6 | } 7 | public static int MaxValue(int[] arr){ 8 | int max=Integer.MIN_VALUE; 9 | for(int i:arr){ 10 | if(i>max){ 11 | max=i; 12 | } 13 | } 14 | return max; 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /cdblocks/challenge1/PascalTriangle.java: -------------------------------------------------------------------------------- 1 | // sum=sum*(nrow-cst)/cst 2 | import java.util.Scanner; 3 | public class PascalTriangle{ 4 | public static void main(String[] args){ 5 | Scanner cin=new Scanner(System.in); 6 | int n=cin.nextInt(); 7 | int nrow=1; 8 | int nst=1; 9 | int nsp=n-1; 10 | while(nrow<=n){ 11 | int sum=1; 12 | int cst=1; 13 | while(cst<=nst){ 14 | System.out.print(sum+"\t"); 15 | sum=sum*(nrow-cst)/cst; 16 | cst++; 17 | } 18 | //prep 19 | System.out.println(); 20 | nst++; 21 | ++nrow; 22 | } 23 | } 24 | } 25 | -------------------------------------------------------------------------------- /cdblocks/challenge1/PatternMountain.java: -------------------------------------------------------------------------------- 1 | //nsp=2*n-3 2 | import java.util.Scanner; 3 | public class PatternMountain{ 4 | public static void main(String[] args){ 5 | Scanner cin=new Scanner(System.in); 6 | int n=cin.nextInt(); 7 | int nrow=1; 8 | int nst=1; 9 | int nsp=2*n-3; 10 | int val=1; 11 | while(nrow<=n){ 12 | //work 13 | val=1; 14 | int cst=1; 15 | while(cst<=nst){ 16 | System.out.print(val+"\t"); 17 | if(cst!=nst){ 18 | val++; 19 | } 20 | ++cst; 21 | 22 | } 23 | int csp=1; 24 | while(csp<=nsp){ 25 | System.out.print("\t"); 26 | ++csp; 27 | } 28 | int csd=1; 29 | if(nrow==n){ 30 | csd=2; 31 | --val; 32 | } 33 | while(csd<=nst){ 34 | System.out.print(val+"\t"); 35 | ++csd; 36 | val--; 37 | } 38 | //prep 39 | System.out.println(); 40 | ++nrow; 41 | nsp-=2; 42 | ++nst; 43 | } 44 | } 45 | } 46 | -------------------------------------------------------------------------------- /cdblocks/challenge1/PatternStar.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | public class PatternStar{ 3 | public static void main(String[] args){ 4 | Scanner cin=new Scanner(System.in); 5 | int n=cin.nextInt(); 6 | int nst=1; 7 | int nsp=n-1; 8 | int nrow=1; 9 | while(nrow<=n){ 10 | int cst=1; 11 | while(cst<=nst){ 12 | System.out.print(cst); 13 | ++cst; 14 | } 15 | int csp=1; 16 | while(csp<=nsp){ 17 | System.out.print("*"); 18 | ++csp; 19 | } 20 | System.out.println(); 21 | ++nst; 22 | --nsp; 23 | ++nrow; 24 | } 25 | } 26 | } 27 | -------------------------------------------------------------------------------- /cdblocks/challenge1/PatternStar2.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | public class PatternStar2{ 3 | public static void main(String[] args){ 4 | Scanner cin=new Scanner(System.in); 5 | int n=cin.nextInt(); 6 | int nst=n; 7 | int nsp=n-nst; 8 | int nrow=1; 9 | while(nrow<=n){ 10 | int cst=1; 11 | while(cst<=nst){ 12 | System.out.print(cst); 13 | ++cst; 14 | } 15 | int csp=1; 16 | while(csp<=nsp){ 17 | System.out.print("*"); 18 | ++csp; 19 | } 20 | System.out.println(); 21 | --nst; 22 | ++nrow; 23 | nsp+=2; 24 | } 25 | } 26 | } 27 | -------------------------------------------------------------------------------- /cdblocks/challenge1/PatternwithZeros.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | public class PatternwithZeros{ 3 | public static void main(String[] args){ 4 | Scanner cin=new Scanner(System.in); 5 | int n=cin.nextInt(); 6 | int nst=1; 7 | int nrow=1; 8 | while(nrow<=n){ 9 | int cst=1; 10 | while(cst<=nst){ 11 | if(nst>2 && (cst>=2 && cst m>n>0 2 | * Triplet=> (m^2-n^2 ,2*m*n, m^2+n^2 3 | * Where m2+n2 is greatest hence Hypotenous 4 | * and 2mn is even 5 | * if N is even: 6 | * 2mn=N 7 | * m*n=N/2*1 8 | * m=N/2 9 | * n=1 10 | * else: 11 | * N!=even 12 | * N!=2mn 13 | * N=m2-n2 14 | * N=(m+n)*(m-n) 15 | * m=(N+1)/2 16 | * n=(N-1)/2 17 | */ 18 | import java.util.*; 19 | public class PythgorasTriplet{ 20 | public static void main(String[] args){ 21 | Scanner cin=new Scanner(System.in); 22 | int N=cin.nextInt(); 23 | /*if(N<1){ 24 | System.out.println("-1"); 25 | return; 26 | }*/ 27 | int m,n; 28 | if(N%2==0){ 29 | m=N/2; 30 | n=1; 31 | //m^2-n^2 , m^2+n^2 32 | System.out.println((int)(Math.pow(m,2)-Math.pow(n,2))+" "+(int)(Math.pow(m,2)+Math.pow(n,2))); 33 | } 34 | else{ 35 | m=(N+1)/2; 36 | n=(N-1)/2; 37 | System.out.println((2*m*n)+" "+(int)(Math.pow(m,2)+Math.pow(n,2))); 38 | } 39 | } 40 | } 41 | -------------------------------------------------------------------------------- /cdblocks/challenge1/Quadratic.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | import java.lang.*; 3 | public class Quadratic{ 4 | public static void main(String[] args){ 5 | Scanner cin=new Scanner(System.in); 6 | int a=cin.nextInt(); 7 | int b=cin.nextInt(); 8 | int c=cin.nextInt(); 9 | int d=(b*b)-(4*a*c); 10 | if(d==0){ 11 | System.out.println("Real and Equal"); 12 | int x=(-b)/2*a; 13 | System.out.println(x+" "+x); 14 | } 15 | else if(d>0){ 16 | System.out.println("Real and Distinct"); 17 | int x=((-b)-(int)(Math.sqrt(d)))/2*a; 18 | int y=((-b)+(int)(Math.sqrt(d)))/2*a; 19 | System.out.println(x+" "+y); 20 | } 21 | else{ 22 | System.out.println("Imaginary"); 23 | } 24 | } 25 | } 26 | -------------------------------------------------------------------------------- /cdblocks/challenge1/Rhombus.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | public class Rhombus{ 3 | public static void main(String[] args){ 4 | Scanner cin=new Scanner(System.in); 5 | int nr=cin.nextInt(); 6 | int row=1; 7 | int nst=nr; 8 | int nsp=nr-1; 9 | while(row<=nr){ 10 | int csp=1; 11 | while(csp<=nsp){ 12 | System.out.print(" "); 13 | csp++; 14 | } 15 | int cst=1; 16 | while(cst<=nst){ 17 | if(row==1 || cst ==1 || row ==nr || cst == nr){ 18 | System.out.print("*"); 19 | } 20 | else{ 21 | System.out.print(" "); 22 | } 23 | cst++; 24 | } 25 | //prep 26 | System.out.println(""); 27 | nsp--; 28 | row++; 29 | } 30 | } 31 | } 32 | -------------------------------------------------------------------------------- /cdblocks/challenge1/SimpleInput.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | public class SimpleInput { 3 | public static void main(String args[]) { 4 | Scanner cin=new Scanner(System.in); 5 | /*int c; 6 | while((c=cin.nextInt())>=0){ 7 | System.out.println(c); 8 | }*/ 9 | int c,sum=0; 10 | do{ 11 | c=cin.nextInt(); 12 | sum=sum+c; 13 | System.out.println(c); 14 | }while(sum>=0); 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /cdblocks/challenge1/candyPrime.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | public class candyPrime { 3 | public static void main(String args[]) { 4 | Scanner cin=new Scanner(System.in); 5 | int test=cin.nextInt(); 6 | while(test!=0){ 7 | int n=cin.nextInt(); 8 | System.out.println(GeneratePrime(n)); 9 | test--; 10 | } 11 | } 12 | public static int GeneratePrime(int n){ 13 | int count=0,prime=2,last=0; 14 | if(n==1)return 2; 15 | while(count<=n){ 16 | for(int i=2;i<=n;i++){ 17 | if(prime/i==0){ 18 | last=prime; 19 | } 20 | prime++; 21 | count++; 22 | } 23 | } 24 | return last; 25 | } 26 | } 27 | -------------------------------------------------------------------------------- /cdblocks/challenge1/check.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | class check{ 3 | public static void main(String[] args){ 4 | Scanner cin=new Scanner(System.in); 5 | int base=cin.nextInt(); 6 | int n=cin.nextInt(); 7 | String d; 8 | if(base ==16) 9 | d=cin.nextLine(); 10 | int dec=0; 11 | if(base ==2 ) dec=Integer.parseInt(n,2); 12 | if(base ==8) dec=Integer.parseInt(n,8); 13 | if(base ==16) dec=Integer.parseInt(d,16); 14 | System.out.println(dec); 15 | 16 | } 17 | } 18 | -------------------------------------------------------------------------------- /cdblocks/challenge1/helpRamu.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | public class helpRamu{ 3 | public static void main(String[] args){ 4 | Scanner cin = new Scanner(System.in); 5 | int test=cin.nextInt(); 6 | while(test-->0){ 7 | int c1=cin.nextInt(); 8 | int c2=cin.nextInt(); 9 | int c3=cin.nextInt(); 10 | int c4=cin.nextInt(); 11 | int n=cin.nextInt(); 12 | int m=cin.nextInt(); 13 | int[] a=new int[n]; 14 | int[] b=new int[m]; 15 | for(int i=0;im){ 21 | right=mid-1; 22 | }else{ 23 | left=mid+1; 24 | } 25 | } 26 | return -1; 27 | } 28 | } 29 | -------------------------------------------------------------------------------- /cdblocks/challenge2/StringSort.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | public class StringSort { 3 | public static void main(String args[]) { 4 | Scanner cin=new Scanner(System.in); 5 | int n=cin.nextInt(); 6 | ArrayList list=new ArrayList<>(); 7 | for(int i=0;i<=n;i++){ 8 | String s=cin.nextLine(); 9 | list.add(s); 10 | } 11 | Collections.sort(list); 12 | for(String s:list){ 13 | System.out.println(s); 14 | } 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /codeforces/636/candies: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sauravjaiswalsj/Competitive-Programming/81aae2e43c484b21d2c495cd15d510a49771b92f/codeforces/636/candies -------------------------------------------------------------------------------- /codeforces/636/candies.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | void findX(int n){ 4 | double x; 5 | for(int k=1;k<=n;k++){ 6 | double p=pow(2,k); 7 | x=n*((1-k)/(1-p)); 8 | std::cout<>t; 16 | while(t!=0){ 17 | std::cin>>n; 18 | findX(n); 19 | t--; 20 | } 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /codeforces/Practice/maths/.theatreSquare.cpp.swp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sauravjaiswalsj/Competitive-Programming/81aae2e43c484b21d2c495cd15d510a49771b92f/codeforces/Practice/maths/.theatreSquare.cpp.swp -------------------------------------------------------------------------------- /codeforces/Practice/maths/NextRound.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | public class NextRound{ 3 | public static void main(String[] args){ 4 | final Scanner cin=new Scanner(System.in); 5 | int n=cin.nextInt(); 6 | int k=cin.nextInt(); 7 | int[] arr = new int[n]; 8 | for(int i=0;ik){ 18 | count++; 19 | } 20 | } 21 | for(int i=0;i=k){ 23 | diffcount++; 24 | } 25 | } 26 | return diffcount+count; 27 | } 28 | } 29 | -------------------------------------------------------------------------------- /codeforces/Practice/maths/theatreSquare: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sauravjaiswalsj/Competitive-Programming/81aae2e43c484b21d2c495cd15d510a49771b92f/codeforces/Practice/maths/theatreSquare -------------------------------------------------------------------------------- /codeforces/Practice/maths/theatreSquare.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main(){ 3 | int n,m,a; 4 | std::cin>>n>>m>>a; 5 | int sides= ceil(n/a) * ceil(m/a); 6 | std::cout< 2 | int main(){ 3 | int n; 4 | std::cin>>n; 5 | if(n%2==0 && n!=2){ 6 | std::cout<<"YES"; 7 | } 8 | else{ 9 | std::cout<<"NO"; 10 | } 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /codeforces/Practice/strings/way2long.java: -------------------------------------------------------------------------------- 1 | import java.io.*; 2 | public class Main{ 3 | public static void main(String[] args)throws IOException{ 4 | final BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); 5 | for(int test=Integer.parseInt(br.readLine());test>0;test--){ 6 | System.out.println(getShortString(br.readLine())); 7 | } 8 | } 9 | private static String getShortString(String s){ 10 | if(s.length()<=10){ 11 | return s; 12 | } 13 | int len=s.length()-2; 14 | String t=s.charAt(0)+String.valueOf(len)+s.charAt(s.length()-1); 15 | return t; 16 | } 17 | } 18 | -------------------------------------------------------------------------------- /codeforces/Round46/.tshirt.java.swp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sauravjaiswalsj/Competitive-Programming/81aae2e43c484b21d2c495cd15d510a49771b92f/codeforces/Round46/.tshirt.java.swp -------------------------------------------------------------------------------- /codeforces/codeforces.iml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | -------------------------------------------------------------------------------- /codeforces/rating1300/69A.java: -------------------------------------------------------------------------------- 1 | import java.io.*; 2 | 3 | class Main{ 4 | public static void main(String[] args)throws IOException{ 5 | final BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); 6 | int test=Integer.parseInt(br.readLine()); 7 | int sum=0; 8 | while(test -- >0){ 9 | int[] arr = Integer.parseInt(br.readLine().split(" ")); 10 | int x=arr[0]; 11 | int y=arr[1]; 12 | int z=arr[2]; 13 | sum=sum+x+y+z; 14 | } 15 | if(sum==0){ 16 | System.out.println("YES"); 17 | } 18 | else{ 19 | System.out.println("NO"); 20 | } 21 | } 22 | } 23 | 24 | 25 | -------------------------------------------------------------------------------- /codeforces/round491div2/Probelem1.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | public class Probelem1{ 3 | public static final Scanner cin=new Scanner(System.in); 4 | public static void main(String[] args){ 5 | int a=cin.nextInt(); 6 | int b=cin.nextInt(); 7 | int c=cin.nextInt(); 8 | int n=cin.nextInt(); 9 | // total students 10 | int sum=(a-c)+(b-c)+c; 11 | if(n-sum==0){ 12 | System.out.println("-1"); 13 | } 14 | else if(n4){ 9 | while(n!=0){ 10 | r=n%10; 11 | n/=10; 12 | c++; 13 | } 14 | if(r!=0){ 15 | System.out.println(fact+r); 16 | } 17 | 18 | } 19 | } 20 | public static void main(String[] args){ 21 | long fact=cin.nextLong(); 22 | int count=0; 23 | int num=fact; 24 | while(num != 0) 25 | { 26 | num /= 10; 27 | count++; 28 | } 29 | if(count<5){ 30 | System.out.println(fact); 31 | } 32 | 33 | scientificNotation(fact, count); 34 | } 35 | } 36 | -------------------------------------------------------------------------------- /codeforces/round492div2/Problem3.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | public class Problem3{ 3 | public static final Scanner cin=new Scanner(System.in); 4 | public static void main(String[] args){ 5 | int n=cin.nextInt(); 6 | int[] arr=new int[n*2]; 7 | for(int i=0;i0)&&(arr[i]>key)){ 18 | arr[i+1]=arr[i]; 19 | i=i-1; 20 | arr[i+1]=key; 21 | c++; 22 | } 23 | } 24 | return c; 25 | } 26 | } 27 | -------------------------------------------------------------------------------- /codejam/2018/.trobleSort.java.swp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sauravjaiswalsj/Competitive-Programming/81aae2e43c484b21d2c495cd15d510a49771b92f/codejam/2018/.trobleSort.java.swp -------------------------------------------------------------------------------- /codejam/2018/allen.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | //import java.lang.*; 3 | //import java.io.*; 4 | public class allen{ 5 | static void hack(){ 6 | Scanner cin=new Scanner(System.in); 7 | int d=cin.nextInt(); 8 | String sh=cin.nextLine(); 9 | char[] ch=sh.toCharArray(); 10 | for(int i=0;i < ch.length-1;i++){ 11 | System.out.println(ch[i]); 12 | } 13 | System.out.println(d); 14 | 15 | 16 | } 17 | 18 | public static void main(String[] args){ 19 | 20 | int n; 21 | Scanner cin=new Scanner(System.in); 22 | n=cin.nextInt(); 23 | while(n!=0){ 24 | hack(); 25 | n--; 26 | } 27 | } 28 | } 29 | -------------------------------------------------------------------------------- /codejam/2019/Solution.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | class Solution{ 3 | public static void main(String[] agrs){ 4 | Scanner cin=new Scanner(System.in); 5 | int t=new Scanner(System.in); 6 | while(t!=0){ 7 | int n=cin.nextInt(); 8 | String s=cin.nextInt(); 9 | mazeRunner(s,n); 10 | t--; 11 | } 12 | } 13 | public static void mazeRunner(String s, int n){ 14 | 15 | -------------------------------------------------------------------------------- /codejam/2019/cope.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | class jamcoins{ 3 | public: 4 | jamcoins(long long jc, int i){ 5 | long long a=jc/4; 6 | long long b=jc-a; 7 | if(modChecker(a,b)){ 8 | if(a+b==jc) 9 | std::cout<<"Case #"<>t; 30 | long long arr[t]; 31 | for(int i=0;i>arr[i]; 33 | } 34 | while(t!=0){ 35 | long long n=arr[i-1]; 36 | jamcoins j(n,i); 37 | t--; 38 | i++; 39 | } 40 | } 41 | -------------------------------------------------------------------------------- /codejam/2019/fr.py: -------------------------------------------------------------------------------- 1 | inp=input() 2 | i=0; 3 | while(i 2 | #include 3 | using namespace std; 4 | class palin{ 5 | public: 6 | void even_palindrome(int num){ 7 | int sum=2*(pow(10,num/2)-1); 8 | cout<>n>>num; 18 | palin geti; 19 | while(n!=0){ 20 | if(num%2==0){ 21 | geti.even_palindrome(num); 22 | } 23 | else{ 24 | geti.odd_palindrome(num); 25 | } 26 | n--; 27 | } 28 | return 0; 29 | } 30 | -------------------------------------------------------------------------------- /codes/cpp/basics/': -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | //#include 4 | //using namespace std; 5 | int main(void){ 6 | int n,val; 7 | std::cin>>n; 8 | std::vector list; 9 | for(int i=0;i>val; 11 | list.push_back(val); 12 | } 13 | int flag=0; 14 | std::vector duplicate; 15 | std::vector::iterator it=list.begin(); 16 | for(int i=0;i0){ 29 | std::cout<<"yes"; 30 | } 31 | else{ 32 | std::cout<<"no"; 33 | } 34 | std::cout<<"\n"; 35 | for(int i:duplicate){ 36 | std::cout< 2 | 3 | using namespace std; 4 | 5 | int main(){ 6 | int n,count=0; 7 | cin>>n; 8 | int arr[n],arr1[n]; 9 | for(int i=0;i>arr[i]; 11 | } 12 | for(int i=0;i>arr1[i]; 14 | } 15 | for(int i=0;i 2 | #include 3 | //#include 4 | //using namespace std; 5 | int main(void){ 6 | int n,val; 7 | std::cin>>n; 8 | std::vector list; 9 | for(int i=0;i>val; 11 | list.push_back(val); 12 | } 13 | int flag=0; 14 | std::vector::iterator it=list.begin(); 15 | for(int i=0;i0){ 27 | std::cout<<"yes"; 28 | } 29 | else{ 30 | std::cout<<"no"; 31 | } 32 | std::cout<<"\n"; 33 | for(int i:list) 34 | std::cout< 2 | #include 3 | int main(){ 4 | int n,sum=0,i=0; 5 | std::cin>>n; 6 | while(n!=0){ 7 | int r=n%10; 8 | sum+=r*pow(2,i); 9 | n/=10; 10 | i++; 11 | } 12 | std::cout< 2 | int main(void){ 3 | int e; 4 | char c='a'; 5 | int t=(int)c-2; 6 | std::cout< 2 | #include 3 | int main(){ 4 | std::string sr; 5 | std::getline(std::cin , sr); 6 | int i=0,sum=0; 7 | while(sr[i]!='\0'){ 8 | if(sr[i]>='0' && sr[i]<='9'){ 9 | sum+=(sr[i]-'0'); 10 | } 11 | } 12 | std::cout< 2 | #include 3 | 4 | class findLen{ 5 | private: 6 | std::string st; 7 | int tLen,sLen; 8 | public: 9 | int findLength(std::string s,std::string t){ 10 | sLen=s.size(); 11 | tLen=t.size(); 12 | if(t.compare(s)==0){ 13 | for(int i=0;ifindLength(s,t); 36 | delete get; 37 | get->findLength("hello","world"); 38 | } 39 | -------------------------------------------------------------------------------- /codes/cpp/basics/delete.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | class check{ 3 | int v=20; 4 | public: 5 | void gcheck(){ 6 | std::cout<gcheck(); 12 | delete ob; 13 | ob->gcheck(); 14 | return 0; 15 | } 16 | 17 | -------------------------------------------------------------------------------- /codes/cpp/basics/exceed.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main(){ 5 | for(char a=0;a<=225;a++){ 6 | std::cout< 2 | #include 3 | int main(){ 4 | std::string a; 5 | std::string b; 6 | std::getline(std::cin, a); 7 | std::getline(std::cin,b); 8 | if(b.find(a)){ 9 | std::cout<<"b in a"< 2 | int add(int n){ 3 | return n; 4 | } 5 | int add(int a,int b){ 6 | return a+b; 7 | } 8 | int add(int a,int b,int c){ 9 | return a+b+c; 10 | } 11 | int main(){ 12 | std::cout< 2 | int gcd(int max, int min){ 3 | int hcf=max%min; 4 | while(hcf!=0){ 5 | max=min; 6 | min=hcf; 7 | hcf=max%min; 8 | } 9 | return min; 10 | } 11 | int main(){ 12 | int a,b; 13 | std::cin>>a>>b; 14 | std::cout<b?a:b),(a 2 | #define SQR(x) x*x 3 | inline int sqr(int n){ 4 | return n*n; 5 | } 6 | int main(){ 7 | int n; 8 | std::cin>>n; 9 | int num=n; 10 | std::cout<=65 && (int)arr[i]<=91){ 10 | System.out.print((char)((int)arr[i]+32)); 11 | } 12 | } 13 | } 14 | } 15 | 16 | -------------------------------------------------------------------------------- /codes/cpp/basics/large10Num.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main(){ 3 | int n;int l=0; 4 | for(int i=1;i<=10;i++){ 5 | std::cin>>n; 6 | l=n>l?n:l; 7 | std::cout< 2 | bool leapyr(int yr){ 3 | if(((yr%4==0)||(yr%400==0))&&(yr%100!=0)){ 4 | return true; 5 | } 6 | else{ 7 | return false; 8 | } 9 | } 10 | int main(){ 11 | int yr; 12 | std::cin>>yr; 13 | if(leapyr(yr)){ 14 | std::cout<<"Leap Year"; 15 | }else{ 16 | std::cout<<"Not Leap Year"; 17 | } 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /codes/cpp/basics/limits.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main(){ 4 | //https://en.cppreference.com/w/cpp/types/numeric_limits 5 | // is a template : 6 | std::cout<::max()< 2 | int main(){ 3 | int n,k=1; 4 | std::cin>>n; 5 | for(int i=1;i<=n;i++){ 6 | for(int j=n;j>=i;j--){ 7 | std::cout<<" "; 8 | } 9 | for(;k<=i;k++){ 10 | std::cout<=i;--l){ 14 | std::cout< 9 | int main(){ 10 | int n; 11 | std::cin>>n; 12 | for(int i=1;i<=n;i++){ 13 | std::cout<<"Pass "< 8 | int main(){ 9 | int n; 10 | std::cin>>n; 11 | for(int i=1;i<=n;i++){ 12 | for(int j=1;j<=i;j++){ 13 | std::cout<<"*"; 14 | } 15 | std::cout< 2 | int main(){ 3 | int n; 4 | std::cin>>n; 5 | for(int i=1;i<=n;i++){ 6 | for(int j=1;j<=i;j++){ 7 | std::cout<<(char)(64+j); 8 | } 9 | std::cout< 2 | int main(){ 3 | int n; 4 | std::cin>>n; 5 | for(int i=1;ii;j--){ 7 | std::cout<<" "; 8 | } 9 | for(int k=1;k<=i;k++){ 10 | std::cout< 2 | #include 3 | int main(){ 4 | char c[20]; 5 | std::cin.getline(c,20); 6 | // std::cin.ignore(); 7 | int i=0; 8 | while(c[i]!='\0'){ 9 | if((int)c[i] >=65 && (int)c[i]<=91){ 10 | std::cout<<(char)((int)c[i]+32); 11 | } 12 | i++; 13 | } 14 | std::cin.get(); 15 | } 16 | -------------------------------------------------------------------------------- /codes/cpp/basics/main.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(int args,char** argv){ 4 | std::cout<<"hello"< 2 | #include 3 | namespace saurav{ 4 | int sj=10; 5 | int saurav(){ 6 | return sj; 7 | } 8 | } 9 | namespace hello{ 10 | class geek{ 11 | int d=20; 12 | public: 13 | void geeqk(){ 14 | std::cout<<"hello"<geeqk(); 22 | delete ob; 23 | ob->geeqk(); 24 | return 0; 25 | } 26 | -------------------------------------------------------------------------------- /codes/cpp/basics/nullptr.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define LOG(x) std::cout< 2 | #include 3 | int main(){ 4 | char* buffer=new char[8]; 5 | memset(buffer,0,8); 6 | delete[] buffer; 7 | std::cin.get(); 8 | return 0; 9 | } 10 | -------------------------------------------------------------------------------- /codes/cpp/basics/readAllLower.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | int main(){ 5 | std::string str; 6 | //std::gets(str); 7 | std::getline(std::cin,str); 8 | //std::cout<=97 && (int)str[i]<=122){ 14 | count++; 15 | } 16 | } 17 | //printf("%d\n",INT_MAX); 18 | std::cout< 2 | //k=row 3 | //l=col 4 | int reverseSpiral(int m,int n, int arr[][]){ 5 | int i; 6 | int k=m-1; 7 | int l=n-1; 8 | while(k>-1 && l>-1){ 9 | for(int i=k;i>-1;i--){ 10 | std::cout<-1;i--){ 13 | std::cout<>m>>n; 21 | int arr[m][n]; 22 | for(int i=0;i>arr[i][j]; 25 | } 26 | } 27 | std::cout< 2 | #include 3 | int main(){ 4 | std::string str; 5 | std::getline(std::cin,str); 6 | // str.erase(str.begin()); 7 | // str.pop_back(); 8 | //str.substr(1,str.size()-2); 9 | std::cout< 2 | #include 3 | using namespace std; 4 | int main(){ 5 | int n; 6 | cin>>n; 7 | int marks[n]; 8 | int group[10]={0}; 9 | for(int i=0;i>marks[i]; 11 | ++group[(int)(marks[i]/10)]; 12 | } 13 | for(int i=0;i<10;i++){ 14 | cout< 2 | int main(){ 3 | int n; 4 | std::cin>>n; 5 | int sum=0; 6 | for(int i=2;i<=n;i++){ 7 | if(i & 1 !=0) 8 | continue; 9 | else{ 10 | sum+=i*i; 11 | } 12 | } 13 | std::cout< 2 | #define MIN1 150001 3 | #define MAX1 300000 4 | #define RAT1 0.10 5 | #define MIN2 300001 6 | #define MAX2 500000 7 | #define RAT2 0.20 8 | #define MIN3 500001 9 | #define RAT3 0.30 10 | int main(){ 11 | double income,t_income; 12 | std::cout<<"Enter your income: "; 13 | std::cin>>income; 14 | t_income=income-MIN1; 15 | std::cout<<"Income After tax Deduction"<= MIN3){ 17 | t_income=RAT3*(t_income-MIN3); 18 | } 19 | else if(t_income>=MIN2 && t_income<=MAX2){ 20 | t_income=RAT2*(t_income-MIN2); 21 | } 22 | else if(t_income>=MIN1 && t_income<=MAX1){ 23 | t_income=RAT1*(t_income-MIN1); 24 | } 25 | else{ 26 | t_income=income; 27 | std::cout<<"No tax\n"; 28 | } 29 | std::cout<<"Your income is: "< 2 | 3 | using namespace std; 4 | 5 | int main(){ 6 | 7 | // Uniform Initialisation of variable 8 | int width{ 5 }; 9 | cout< 2 | #include 3 | #include 4 | using std::cin; 5 | using std::cout; 6 | using std::vector; 7 | 8 | int main(){ 9 | vector mylist;// = new vector; 10 | for(int i=0;i<5;i++){ 11 | cin>>mylist.at(i); 12 | } 13 | sort(mylist.begin(),mylist.end()); 14 | for(int i=0;i<5;i++){ 15 | cout< 2 | #define String std::string 3 | class vowels{ 4 | public: 5 | bool vowel(char c){ 6 | if(c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u'){ 7 | return true; 8 | }else{ 9 | return false; 10 | } 11 | } 12 | }; 13 | 14 | int main(){ 15 | vowels *v =new vowels(); 16 | String str; 17 | std::getline(std::cin,str); 18 | int i=0; 19 | std::cout<vowel(std::tolower(str[i]))){ 22 | std::cout< 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /codes/cpp/learnCpp/addSub.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(){ 4 | int first_Variable{0}, second_Variable{0}; 5 | 6 | std::cout<<"Enter the variable\n"; 7 | 8 | std::cin>>first_Variable>>second_Variable; 9 | 10 | std::cout< 2 | int main(){ 3 | int ipVar1; 4 | std::cin>>ipVar1; 5 | if(ipVar1%2==0){ 6 | std::cout<<"Even number"< 2 | int main(void){ 3 | int x=2; 4 | printf("%ld",sizeof(x)); 5 | } 6 | -------------------------------------------------------------------------------- /codes/cpp/stl/maps.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | int main(){ 5 | int n,t; 6 | std::cin>>n; 7 | std::string s; 8 | std::map maps; 9 | for(int i=0;i>t; 12 | maps.insert(s,t); 13 | } 14 | for(auto it=maps.begin();it!=maps.end();++it){ 15 | std::cout<<(*it).first<<" "<<(*it).second< 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | -------------------------------------------------------------------------------- /codes/java/.idea/misc.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 6 | 7 | -------------------------------------------------------------------------------- /codes/java/.idea/modules.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | -------------------------------------------------------------------------------- /codes/java/.idea/vcs.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | -------------------------------------------------------------------------------- /codes/java/HeadFirstJava/PrintOwnSource.java: -------------------------------------------------------------------------------- 1 | class PrintOwnSource{ 2 | public static void main(String[] args) { 3 | String s = "class PrintOwnSource{public static void main(String[] args){String[] s=%c %s %s $c;System..out.println(s,34,.s);}"; 4 | System.out.println(s, 34, s); 5 | } 6 | } -------------------------------------------------------------------------------- /codes/java/HeadFirstJava/com/pluralsight/example/hello.java: -------------------------------------------------------------------------------- 1 | package com.pluralsight.example; 2 | 3 | import java.util.*; 4 | 5 | public class hello{ 6 | public static void main(String[] args){ 7 | System.out.println("dksfj|"); 8 | } 9 | } 10 | -------------------------------------------------------------------------------- /codes/java/HeadFirstJava/module1/Book.java: -------------------------------------------------------------------------------- 1 | class books{ 2 | String title; 3 | String author; 4 | } 5 | class Book{ 6 | public static void main(String[] args){ 7 | books[] myBook=new books[3]; 8 | int x=0; 9 | myBook[0] =new books(); 10 | myBook[1]=new books(); 11 | myBook[2]=new books(); 12 | myBook[0].title="The Grape of Java"; 13 | myBook[1].title="the Java Gatsby"; 14 | myBook[2].title="The Java CookBook"; 15 | myBook[0].author="Bob"; 16 | myBook[1].author="aue"; 17 | myBook[2].author="Sa"; 18 | while(x<3){ 19 | System.out.println(myBook[x].title); 20 | System.out.println("by"); 21 | System.out.println(myBook[x].author); 22 | x++; 23 | } 24 | } 25 | 26 | } -------------------------------------------------------------------------------- /codes/java/HeadFirstJava/module1/LogicalvsConditionalOp.java: -------------------------------------------------------------------------------- 1 | public class LogicalvsConditionalOp{ 2 | public static void main(String[] args){ 3 | int a=55; 4 | int b=60; 5 | int c=11; 6 | 7 | if(a/c==5 & b>50){ 8 | System.out.println("Success"); 9 | } 10 | else{ 11 | System.out.println("Unsuccessful $"); 12 | } 13 | 14 | if(a/c==5 && b>50){ 15 | System.out.println("Success $$"); 16 | } 17 | else{ 18 | System.out.println("Unsuccessful $$"); 19 | } 20 | } 21 | } 22 | -------------------------------------------------------------------------------- /codes/java/HeadFirstJava/module1/ObjectReference.java: -------------------------------------------------------------------------------- 1 | class Dog{ 2 | String name; 3 | void bark(){ 4 | System.out.println(name +" Says Ruff!"); 5 | } 6 | void eat(){} 7 | void chaseCat(){} 8 | } 9 | public class ObjectReference{ 10 | public static void main(String[] args){ 11 | Dog d=new Dog(); 12 | d.bark(); 13 | d.name="Brat"; 14 | Dog[] myDogs=new Dog[3]; 15 | myDogs[0]=new Dog(); 16 | myDogs[1]=new Dog(); 17 | } 18 | } -------------------------------------------------------------------------------- /codes/java/HeadFirstJava/module1/forEachloop.java: -------------------------------------------------------------------------------- 1 | public class forEachloop{ 2 | public static void main(String[] args){ 3 | float[] theCals={10.0f,30.04f,56.6f}; 4 | float sum=0.0f; 5 | for(float i:theCals){ 6 | sum +=i; 7 | } 8 | System.out.println("Sum is :"+sum); 9 | } 10 | } 11 | -------------------------------------------------------------------------------- /codes/java/codes.iml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | -------------------------------------------------------------------------------- /codes/java/derektut/UnderstandVariables.java: -------------------------------------------------------------------------------- 1 | public class UnderstandVariables{ 2 | public static void main(String[] args){ 3 | 4 | byte bigBy=127; 5 | short shrt=32000; 6 | int integer=210000000; 7 | long integ=922000000000000000l; 8 | float bigfloat=314f; 9 | double num=3.14145434154d; 10 | 11 | // to get the min value of the data types we need to use 12 | // MIN_VALUE 13 | // to get the maximun value we need to use 14 | // MAX_VALUE 15 | System.out.println(Float.MIN_VALUE); 16 | System.out.println(Long.MAX_VALUE); 17 | System.out.println(Integer.MAX_VALUE); 18 | } 19 | } 20 | 21 | 22 | -------------------------------------------------------------------------------- /codes/java/derektut/nestedClass.java: -------------------------------------------------------------------------------- 1 | public class nestedClass{ 2 | public static class data{ 3 | int dat; 4 | data(){ 5 | dat=10; 6 | } 7 | } 8 | public static void main(String[] args){ 9 | data d=new data(); 10 | System.out.print(d.dat); 11 | } 12 | } 13 | -------------------------------------------------------------------------------- /codes/java/derektut/toStringf.java: -------------------------------------------------------------------------------- 1 | public class toStringf{ 2 | public static void main(String[] args){ 3 | int x=32; 4 | String he=Integer.toString(x); 5 | System.out.println(he); 6 | int ab=Integer.parseInt(he); 7 | System.out.println(ab); 8 | } 9 | } 10 | -------------------------------------------------------------------------------- /codes/java/derektut/tut1.java: -------------------------------------------------------------------------------- 1 | public class tut1{ 2 | 3 | // if we want to make a const we need to use word final 4 | // Static variable can be accesed by any method in the same class 5 | static final double PIN=3.14d; 6 | static String randomWords="String to print"; 7 | public static void main(String[] args){ 8 | System.out.println(randomWords); 9 | hello(); 10 | } 11 | public static void hello(){ 12 | System.out.println(PIN); 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /codes/java/jetbrains-Acad/SimpleBot/ChatBot.java: -------------------------------------------------------------------------------- 1 | /* @name: Console Based Bot 2 | * @author: sauravjaiswalsj 3 | * @desc: this is a simple bot 4 | */ 5 | 6 | import java.util.*; 7 | public class ChatBot{ 8 | public static void main(String[] args){ 9 | xomi heyxomi=new xomi(); 10 | heyxomi.start(); 11 | } 12 | } 13 | class xomi{ 14 | void start(){ 15 | System.out.println("Hello! My name is Xomi."); 16 | System.out.println("I was created in Aug 30 2019."); 17 | } 18 | } 19 | -------------------------------------------------------------------------------- /codes/java/jetbrains-Acad/jetbrains-Acad.iml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /codes/java/practice/BigInteger/BigInteger.iml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /codes/java/practice/BigInteger/Lesson/1q: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | import java.math.BigInteger; 3 | public class gcdBigInteger{ 4 | public static void main(String[] args)/*throws IOException*/{ 5 | /*final BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); 6 | BigInteger a=new BigInteger(br.readLine()); 7 | BigInteger b=new BigInteger(br.readLine()); 8 | */ 9 | final Scanner cin=new Scanner(System.in); 10 | BigInteger a=cin.nextBigInteger(); 11 | BigInteger b=cin.nextBigInteger(); 12 | System.out.println(a.gcd(b)); 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /codes/java/practice/BigInteger/Lesson/gcdBigInteger.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | import java.math.BigInteger; 3 | public class gcdBigInteger{ 4 | public static void main(String[] args)/*throws IOException*/{ 5 | /*final BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); 6 | BigInteger a=new BigInteger(br.readLine()); 7 | BigInteger b=new BigInteger(br.readLine()); 8 | */ 9 | final Scanner cin=new Scanner(System.in); 10 | BigInteger a=cin.nextBigInteger(); 11 | BigInteger b=cin.nextBigInteger(); 12 | System.out.println(a.gcd(b)); 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /codes/java/practice/baiscs/.count.py.swp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sauravjaiswalsj/Competitive-Programming/81aae2e43c484b21d2c495cd15d510a49771b92f/codes/java/practice/baiscs/.count.py.swp -------------------------------------------------------------------------------- /codes/java/practice/baiscs/.idea/baiscs.iml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | -------------------------------------------------------------------------------- /codes/java/practice/baiscs/.idea/misc.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 6 | 7 | -------------------------------------------------------------------------------- /codes/java/practice/baiscs/.idea/modules.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | -------------------------------------------------------------------------------- /codes/java/practice/baiscs/Bitwise.java: -------------------------------------------------------------------------------- 1 | public class Bitwise{ 2 | public static void main(String[] args){ 3 | int a=3; 4 | int b=6; 5 | int c = a | b; 6 | int d=a&b; 7 | int e=a^b; 8 | int g=~a & 0x0f; 9 | int t=0x0f; 10 | System.out.printf(" or %d \nand %d\nxor %d\nnot %d \n0x0f = %d",c,d,e,g,t); 11 | } 12 | } 13 | -------------------------------------------------------------------------------- /codes/java/practice/baiscs/DuplicateElements.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | import java.util.ArrayList; 3 | import java.util.Collection; 4 | public class DuplicateElements{ 5 | public static void main(String[] args){ 6 | Scanner cin=new Scanner(System.in); 7 | int n=cin.nextInt(); 8 | ArrayList list=new ArrayList(); 9 | for(int i=0;i0){ 26 | System.out.println("Yes"); 27 | } 28 | else{ 29 | System.out.println("No"); 30 | } 31 | for(Integer i: list){ 32 | System.out.println(i); 33 | } 34 | } 35 | } 36 | -------------------------------------------------------------------------------- /codes/java/practice/baiscs/Monopoly.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | public class Monopoly{ 3 | public static void main(String[] args){ 4 | Scanner cin=new Scanner(System.in); 5 | System.out.println(monopolyRoll()); 6 | } 7 | /* 8 | * Provides the results based on the dice rolling 9 | * @returns the sum of both the dice 10 | */ 11 | public static int monopolyRoll(){ 12 | int roll1=diceRoll(6); 13 | int roll2=diceRoll(6); 14 | int total=roll1+roll2; 15 | if(roll1==roll2){ 16 | roll1=diceRoll(6); 17 | roll2=diceRoll(6); 18 | total=total+roll1+roll2; 19 | } 20 | return total; 21 | } 22 | /* 23 | * Generatres the Random number between 1 to 6 24 | * @param Takes number of sides of a dice 25 | * @return the number generated for each throw 26 | */ 27 | public static int diceRoll(int sides){ 28 | double num=Math.random()*6; 29 | int nu=(int)(num+1); 30 | System.out.println(nu); 31 | return nu; 32 | } 33 | } 34 | 35 | -------------------------------------------------------------------------------- /codes/java/practice/baiscs/NonRepeatMap.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | public class NonRepeatMap{ 3 | public static void main(String[] args){ 4 | Scanner cin=new Scanner(System.in); 5 | LinkedHashMap map=new LinkedHashMap<>(); 6 | String name=cin.nextLine(); 7 | int i=0; 8 | while(i> hmap=map.entrySet(); 20 | for(Map.Entry data:hmap){ 21 | if(data.getValue()==1){ 22 | System.out.println(data.getKey()); 23 | break; 24 | } 25 | } 26 | } 27 | } 28 | 29 | -------------------------------------------------------------------------------- /codes/java/practice/baiscs/NonRepeatingLetters.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | public class NonRepeatingLetters{ 3 | public static void main(String[] args){ 4 | Scanner cin=new Scanner(System.in); 5 | String name=cin.nextLine(); 6 | int c=-100; 7 | for(int i=0;ilarge){ 24 | large=array[i]; 25 | l=i; 26 | } 27 | if(small>array[i]){ 28 | small=array[i]; 29 | s=i; 30 | } 31 | //System.out.print("l: "+large+"s: "+small); 32 | i++; 33 | } 34 | //System.out.println(array[l]+""+array[s]+""+large+""+small); 35 | int temp=array[l]; 36 | array[l]=array[s]; 37 | array[s]=temp; 38 | } 39 | } 40 | -------------------------------------------------------------------------------- /codes/java/practice/baiscs/SwapNumbers.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class SwapNumbers{ 4 | public static final Scanner cin=new Scanner(System.in); 5 | public static void main(String[] args){ 6 | int num1=cin.nextInt(); 7 | int num2=cin.nextInt(); 8 | swap(num1,num2); 9 | } 10 | public static void swap(int num1,int num2){ 11 | int t; 12 | t=num1; 13 | num1=num2; 14 | num2=t; 15 | System.out.println("num1: "+num1); 16 | System.out.println("num2: "+num2); 17 | } 18 | } 19 | -------------------------------------------------------------------------------- /codes/java/practice/baiscs/arrayCheck.java: -------------------------------------------------------------------------------- 1 | public class arrayCheck{ 2 | public static void main(String[] args){ 3 | int[] arr=new int[4]; 4 | for(int i=0;i<4;i++){ 5 | System.out.println(arr[i]); 6 | } 7 | } 8 | } 9 | 10 | -------------------------------------------------------------------------------- /codes/java/practice/baiscs/calculatorifElse.java: -------------------------------------------------------------------------------- 1 | public class calculatorifElse{ 2 | public static void main(String[] args){ 3 | 4 | // create the data structures for the calculator 5 | double[] leftValue={10.0,9.5,6.7,8.5}; 6 | double[] rightValue={20.5,6.5,1.5,12.15}; 7 | char[] opcode={'a','s','d','m'}; 8 | double[] result=new double[opcode.length]; 9 | 10 | // calculate the result 11 | 12 | for(int i=0;i 2 | int main(void){ 3 | int n; 4 | std::cin>>n; 5 | int nsp=n-1; 6 | int nst=1; 7 | int row=1; 8 | while(row<=n){ 9 | int csp=1; 10 | while(csp<=nsp){ 11 | std::cout<<" "; 12 | csp++; 13 | } 14 | int cst=1; 15 | while(cst<=nst){ 16 | std::cout<<"1"; 17 | cst++; 18 | } 19 | //prep 20 | std::cout< 2 | int main(void){ 3 | int nr; 4 | std::cin>>nr; 5 | int row=1; 6 | int val,nst=1,nsp=nr-1; 7 | while(row<=nr){ 8 | val=1; 9 | int csp=1; 10 | while(csp<=nsp){ 11 | std::cout<<" "; 12 | csp++; 13 | } 14 | int cst=1; 15 | while(cst<=nst){ 16 | std::cout< 2 | int main(void){ 3 | int nr; 4 | std::cin>>nr; 5 | int row=1; 6 | int nst=1; 7 | int nsp=nr/2; 8 | while(row<=nr){ 9 | int csp=1; 10 | while(csp<=nsp){ 11 | std::cout<<" "; 12 | csp++; 13 | } 14 | int cst=1; 15 | while(cst<=nst){ 16 | std::cout<<"*"; 17 | cst++; 18 | } 19 | //prep 20 | std::cout< 2 | int main(void){ 3 | int nr; 4 | std::cin>>nr; 5 | int row=1; 6 | int nst=1; 7 | int nsp=2*nr-3; 8 | while(row 2 | int main(){ 3 | int nr; 4 | std::cin>>nr; 5 | int row=1; 6 | int nst=nr; 7 | while(row<=nr){ 8 | int cst=1; 9 | while(cst<=nst){ 10 | if(row==1 || row ==nr || cst == 1 || cst == nr){ 11 | std::cout<<"*"; 12 | } 13 | else{ 14 | std::cout<<" "; 15 | } 16 | cst++; 17 | } 18 | std::cout< 2 | int main(){ 3 | int nr; 4 | std::cin>>nr; 5 | int row=1; 6 | int nst=nr; 7 | for(int i=1;i<=nr;i++){ 8 | for(int j=1;j<=nr;j++){ 9 | if(i==j || ((i==nst || j==nst) && nst!=(nr/2)+1)){ 10 | std::cout<<"*"; 11 | }else{ 12 | std::cout<<" "; 13 | } 14 | } 15 | std::cout<=largest){ 22 | secLargest=largest; 23 | largest=arr[i]; 24 | } 25 | System.out.println(largest+" "+secLargest); 26 | } 27 | return secLargest; 28 | } 29 | } 30 | -------------------------------------------------------------------------------- /codes/java/practice/baiscs/sorting/Bubble.java: -------------------------------------------------------------------------------- 1 | public class Bubble{ 2 | public static void main(String[] args){ 3 | int[] arr={88,66,55,44,22}; 4 | for(int i=0;iarr[j+1]){ 7 | int temp=arr[j+1]; 8 | arr[j+1]=arr[j]; 9 | arr[j]=temp; 10 | 11 | } 12 | } 13 | } 14 | for(int i:arr){ 15 | System.out.println(i); 16 | } 17 | } 18 | } 19 | -------------------------------------------------------------------------------- /codes/java/practice/baiscs/ss.java: -------------------------------------------------------------------------------- 1 | public class ss{ 2 | public static void main(String[] args){ 3 | int x=0; 4 | for(int i=0;i<10;i++){ 5 | // System.out.println("x is: "+x); 6 | x++; 7 | // System.out.println("x is: "+x); 8 | } 9 | System.out.println("x is: "+x); 10 | 11 | } 12 | } 13 | -------------------------------------------------------------------------------- /codes/java/practice/collections/arrayList.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | public class arrayList{ 3 | public static void main(String[] args){ 4 | ArrayList list=new ArrayList<>(); 5 | Scanner cin=new Scanner(System.in); 6 | int n=cin.nextInt(); 7 | for(int i=0;i list=new ArrayList<>(); 7 | for(int i=0;i ts=new TreeSet<>(); 7 | for(int i=0;i map=new TreeMap<>(); 7 | for(int i=0;i 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | -------------------------------------------------------------------------------- /codes/java/practice/strings/ReverseCharArr.java: -------------------------------------------------------------------------------- 1 | import java.lang.*; 2 | import java.util.*; 3 | public class ReverseCharArr{ 4 | public static void main(String[] args){ 5 | Scanner cin=new Scanner(System.in); 6 | char[] s=new char[10]; 7 | for(int i=0;i make filename 6 | to run =>./filename 7 | ************************* 8 | To compile a file in c++ 9 | g++ filename.cpp -o filename.out 10 | To run it -./filename.out 11 | 12 | ************************** 13 | make filename 14 | ./filename 15 | ************************** 16 | To compile a file in java 17 | javac filename.java 18 | (however it is necessary to give file name and java main class name same other wise it show error) 19 | 20 | To run a file in java-- java file 21 | here file is class name 22 | ********************************** 23 | 24 | TO compile a file in python 25 | python filename.py 26 | 27 | This will run the file as well compile 28 | 29 | ************************************ 30 | -------------------------------------------------------------------------------- /codes/web tech/node/app.js: -------------------------------------------------------------------------------- 1 | 2 | const EventEmitter = require('events'); 3 | const emitter = new EventEmitter(); 4 | //Register a listener 5 | 6 | emitter.on('messageLogged', (arg) =>{ 7 | console.log('Listener called', arg); 8 | }); 9 | 10 | const log = require('./logger'); 11 | log('message'); 12 | 13 | -------------------------------------------------------------------------------- /codes/web tech/node/logger.js: -------------------------------------------------------------------------------- 1 | const EventEmitter = require('events'); 2 | const emitter = new EventEmitter(); 3 | 4 | function log(message) { 5 | //send request 6 | console.log(message); 7 | 8 | //Raise an event 9 | emitter.emit('messageLogged', {id: 1, url:'https://'}); 10 | } 11 | 12 | module.exports = log; 13 | -------------------------------------------------------------------------------- /codes/web tech/pluralsight/web2.0/images/googl.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sauravjaiswalsj/Competitive-Programming/81aae2e43c484b21d2c495cd15d510a49771b92f/codes/web tech/pluralsight/web2.0/images/googl.png -------------------------------------------------------------------------------- /codes/web tech/pluralsight/web2.0/index.css: -------------------------------------------------------------------------------- 1 | *{ 2 | color:black; 3 | } 4 | body{ 5 | background-color: antiquewhite; 6 | background-image: url(images/googl.png) 7 | } 8 | h1{ 9 | background-color:aqua; 10 | font-family: fantasy; 11 | } 12 | h2{ 13 | background-color: cornflowerblue; 14 | font-family: monospace; 15 | } 16 | .content{ 17 | background-color: deepskyblue; 18 | font-family: cursive; 19 | } 20 | #menu{ 21 | background-color: darkviolet; 22 | } 23 | /* mouse over link */ 24 | #button{ 25 | background-color: aquamarine; 26 | border-style: solid; 27 | border-color: black; 28 | border-width: 1mm; 29 | font-size: 1.5em; 30 | width:6%; 31 | 32 | } 33 | #button a:hover{ 34 | color: blueviolet; 35 | } -------------------------------------------------------------------------------- /codes/web tech/pluralsight/web2.0/index.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | PluralSight_CSS 5 | 6 | 7 | 8 |
9 | Home 10 |
11 | 12 |

Heading 1

13 |

Heading 2

14 | 15 |
16 |

I am a div element

17 | 19 | 20 | -------------------------------------------------------------------------------- /codes/web tech/pluralsight/web3.0/images/googl.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sauravjaiswalsj/Competitive-Programming/81aae2e43c484b21d2c495cd15d510a49771b92f/codes/web tech/pluralsight/web3.0/images/googl.png -------------------------------------------------------------------------------- /codes/web tech/pluralsight/web4.0/index.css: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sauravjaiswalsj/Competitive-Programming/81aae2e43c484b21d2c495cd15d510a49771b92f/codes/web tech/pluralsight/web4.0/index.css -------------------------------------------------------------------------------- /codes/web tech/pluralsight/web4.0/index.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | My page 5 | 6 | 7 | 8 | 9 | 10 |
11 |

Absolute Division of Pages

12 |

Saurav Jaiswal | August 17 2018

13 | 14 | 15 | 16 | 17 | 18 |
19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | -------------------------------------------------------------------------------- /hackerearth/Parcel.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | class TestClass1{ 3 | public static final Scanner cin=new Scanner(System.in); 4 | public static void main(String[] args){ 5 | int sum,c=0; 6 | int n=cin.nextInt(); 7 | cin.next(); 8 | String s=cin.nextLine(); 9 | for(int i=0;i0){ 32 | System.out.println("invalid"); 33 | } 34 | else{ 35 | System.out.println("valid"); 36 | } 37 | } 38 | } -------------------------------------------------------------------------------- /hackerrank/.ReachingPoint.java.swp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sauravjaiswalsj/Competitive-Programming/81aae2e43c484b21d2c495cd15d510a49771b92f/hackerrank/.ReachingPoint.java.swp -------------------------------------------------------------------------------- /hackerrank/algo/.birds.java.swp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sauravjaiswalsj/Competitive-Programming/81aae2e43c484b21d2c495cd15d510a49771b92f/hackerrank/algo/.birds.java.swp -------------------------------------------------------------------------------- /hackerrank/algo/birds.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | import java.lang.*; 3 | class migration{ 4 | public static void migration(){ 5 | 6 | } 7 | } 8 | 9 | public class birds 10 | -------------------------------------------------------------------------------- /hackerrank/algo/sumPairs.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | import java.lang.*; 3 | class Solution{ 4 | static void Solution(int[] a,int n, int k){ 5 | int sum,count=0; 6 | for(int i=0;i arr[j+1]){ 9 | int temp = arr[j]; 10 | arr[j] = arr[j+1]; 11 | arr[j+1] = temp; 12 | c++; 13 | } 14 | } 15 | } 16 | if(c>1){ 17 | System.out.println(c); 18 | } 19 | else{ 20 | System.out.println(c); 21 | } 22 | } 23 | } 24 | public class swap{ 25 | public static final Scanner cin=new Scanner(System.in); 26 | public static void main(String[] args){ 27 | int n=cin.nextInt(); 28 | int[] arr=new int[n]; 29 | for(int i=0;i 2 | using namespace std; 3 | int binarySearch(int A[],int n,int x){ 4 | int start=0; 5 | int end=n-1; 6 | while(start<=end){ 7 | int mid=(start+end)/2; 8 | if(A[mid]==x){ 9 | return mid; 10 | } 11 | else if(x>A[mid]){ 12 | start=mid+1; 13 | } 14 | else{ 15 | end=mid-1; 16 | } 17 | } 18 | return -1; 19 | } 20 | int main(){ 21 | int n,result; 22 | cin>>n; 23 | int A[n]; 24 | for(int i=0;i>A[i]; 26 | } 27 | int x; 28 | cin>>x; 29 | result=binarySearch(A,n,x); 30 | if(result==-1){ 31 | x++; 32 | result=binarySearch(A,n,x); 33 | cout<<"No "< 2 | #include 3 | #include 4 | #include 5 | 6 | //Complete the following function. 7 | 8 | int marks_summation(int* marks, int number_of_students, char gender) { 9 | //Write your code here. 10 | int sum = 0, i = 0; 11 | if (gender == 'g') { 12 | i = 1; 13 | } 14 | for (; i < number_of_students;i+=2) { 15 | sum = sum + *(marks + i); 16 | } 17 | return sum; 18 | } 19 | int main() { 20 | int number_of_students; 21 | char gender; 22 | int sum; 23 | 24 | scanf("%d", &number_of_students); 25 | int *marks = (int *) malloc(number_of_students * sizeof (int)); 26 | 27 | for (int student = 0; student < number_of_students; student++) { 28 | scanf("%d", (marks + student)); 29 | } 30 | 31 | scanf(" %c", &gender); 32 | sum = marks_summation(marks, number_of_students, gender); 33 | printf("%d", sum); 34 | free(marks); 35 | 36 | return 0; 37 | } -------------------------------------------------------------------------------- /hackerrank/compete/compete.iml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | -------------------------------------------------------------------------------- /hackerrank/compete/hourrank26/combomeal.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | given price of burger, can of soda and a combo meal. 3 | to compute the fixed price. 4 | 5 | */ 6 | #include 7 | using namespace std; 8 | int main(){ 9 | long int t,b,s,c,sum; 10 | cin>>t; 11 | while(t!=0){ 12 | cin>>b>>s>>c; 13 | sum=(b+s)-c; 14 | cout<sum[i])&&(k 2 | #include 3 | using namespace std; 4 | 5 | int main() { 6 | long int n; 7 | int i,j; 8 | cin>>n; 9 | long int a[n]; 10 | for(i=0;i>a[i]; 13 | } 14 | long int temp; 15 | for(i=0; i a[j]){ 18 | temp=a[i]; 19 | a[i]=a[j]; 20 | a[j]=temp; 21 | } 22 | } 23 | } 24 | long int c=1; 25 | for(i=0;i0) 34 | { 35 | cout< 6 | 7 | using namespace std; 8 | 9 | int main() { 10 | int tt; 11 | cin >> tt; 12 | long long ans = 0; 13 | while (tt--) { 14 | long long x; 15 | cin >> x; 16 | ans += (x > 1 ? x : 0); 17 | while (x > 1) { 18 | bool found = false; 19 | for (long long i = 2; i * i <= x; i++) { 20 | if (x % i == 0) { 21 | found = true; 22 | x /= i; 23 | ans += x; 24 | break; 25 | } 26 | } 27 | if (!found) { 28 | break; 29 | } 30 | } 31 | ans += 1; 32 | } 33 | cout << ans << endl; 34 | return 0; 35 | } 36 | -------------------------------------------------------------------------------- /hackerrank/cpp/numbergroup.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | 1 3 | 3 5 4 | 7 9 11 5 | 13 15 17 19 6 | */ 7 | #include 8 | using namespace std; 9 | void pattern(int a){ 10 | int i,j,s=1; 11 | 12 | for(i=1;i<=a;i++) 13 | { int sum=0; 14 | for(j=1;j<=i;j++) 15 | { 16 | cout<>n; 31 | pattern(n); 32 | return 0; 33 | } 34 | -------------------------------------------------------------------------------- /hackerrank/cpp/practice/hello.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main(void){ 4 | std::cout<<"Hello, World!"< 2 | 3 | using namespace std; 4 | /* 5 | * Create classes Rectangle and RectangleArea 6 | */ 7 | class Rectangle{ 8 | private: int width,height; 9 | public: 10 | void display(){ 11 | std::cout<>width>>height; 17 | } 18 | }; 19 | 20 | int main() 21 | { 22 | /* 23 | * Declare a RectangleArea object 24 | */ 25 | RectangleArea r_area; 26 | 27 | /* 28 | * Read the width and height 29 | */ 30 | r_area.read_input(); 31 | 32 | /* 33 | * Print the width and height 34 | */ 35 | r_area.Rectangle::display(); 36 | 37 | /* 38 | * Print the area 39 | */ 40 | r_area.display(); 41 | 42 | return 0; 43 | } 44 | -------------------------------------------------------------------------------- /hackerrank/cpp/strings: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sauravjaiswalsj/Competitive-Programming/81aae2e43c484b21d2c495cd15d510a49771b92f/hackerrank/cpp/strings -------------------------------------------------------------------------------- /hackerrank/cpp/strings.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define String std::string 4 | int main(){ 5 | String a,b; 6 | std::getline(std::cin,a); 7 | std::getline(std::cin,b); 8 | String c=b.substr(0,1); 9 | c=c.append(a.substr(1,a.size())); 10 | std::cout< 2 | using namespace std; 3 | 4 | void mintime(){ 5 | int n,temp; 6 | cin>>n; 7 | int a[n]; 8 | for(int i=0;i>a[i]; 10 | } 11 | for(int i=0;ia[j]){ 14 | temp=a[i]; 15 | a[i]=a[j]; 16 | a[j]=temp; 17 | } 18 | } 19 | } 20 | int min=a[0]; 21 | 22 | for(int i=0;ia[i]){ 24 | min=a[i]; 25 | } 26 | } 27 | cout<>t; 35 | while(t!=0){ 36 | mintime(); 37 | t--; 38 | } 39 | return 0; 40 | } 41 | -------------------------------------------------------------------------------- /hackerrank/cpp/vector.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | int main(){ 5 | int n,t; 6 | std::cin>>n; 7 | std::vector list; 8 | for(int i=0;i>t; 10 | list.push_back(t); 11 | } 12 | sort(list.begin(),list.end()); 13 | for(int i=0;i 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | -------------------------------------------------------------------------------- /hackerrank/java/ArrayQuery.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | import java.lang.Math; 3 | public class ArrayQuery{ 4 | public static final Scanner cin=new Scanner(System.in); 5 | public static void calculation(){ 6 | int a,b,n; 7 | a=cin.nextInt(); 8 | b=cin.nextInt(); 9 | n=cin.nextInt(); 10 | int sum=a,x; 11 | for(int i=0;i list=new LinkedList(); 5 | for(int i=1;i<10;i++){ 6 | list.add(i); 7 | } 8 | System.out.println(Collections.reverse(list)); 9 | } 10 | } 11 | 12 | -------------------------------------------------------------------------------- /practice/algorithms/merge.java: -------------------------------------------------------------------------------- 1 | import java.util.io; 2 | public class merge{ 3 | public static void main(String[] args){ 4 | int[] arr=[1,4,5,8,10]; 5 | int[] arr2=[0,2,3,6,7,9]; 6 | merge(arr,arr2); 7 | } 8 | public static merge(int[] arr,int[] arr2){ 9 | int[] newArray=new int[arr.length+arr2.length]; 10 | int i=0; 11 | int n=newArray.length; 12 | while(i list=new ArrayList<>(); 10 | for(int i=0;i list=new ArrayList<>(); 10 | for(int i=0;i list,int low,int high){ 25 | //System.out.println(low+" "+high); 26 | while(low list = new ArrayList<>(); 6 | for (int i = 0; i < 10; i++) { 7 | list.add(i); 8 | } 9 | list.remove(5); 10 | for (int i : list) { 11 | System.out.println(i); 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /practice/arrays/ClassicalArray/BinarySearch.java: -------------------------------------------------------------------------------- 1 | public class BinarySearch { 2 | public static void main(String[] args) { 3 | int[] arr = { 1, 2, 3, 4, 5, 6, 7, 8, 9 }; 4 | System.out.println(Search(arr, 8)); 5 | } 6 | 7 | public static int Search(int[] arr, int key) { 8 | int low = 0, high = arr.length - 1, mid; 9 | while (low < high) { 10 | mid = (low + high) / 2; 11 | if (arr[mid] == key) { 12 | return arr[mid]; 13 | } else if (arr[mid] > key) { 14 | high = mid - 1; 15 | } else { 16 | low = mid + 1; 17 | } 18 | } 19 | return -1; 20 | } 21 | } -------------------------------------------------------------------------------- /practice/arrays/ClassicalArray/ElementDeletion.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | public class ElementDeletion{ 3 | public static void main(String[] args){ 4 | int[] array={1,2,3,4,5,6,7}; 5 | //System.out.println(array.length); 6 | array=removeArray(array,4); 7 | //System.out.println(array.length); 8 | for(int i:array){ 9 | System.out.print(i+" "); 10 | } 11 | } 12 | /* 13 | * This function removes the element from the list 14 | * @param takes the array and the element that has to be removed 15 | */ 16 | public static int[] removeArray(int[] array,int key){ 17 | int[] arr=new int[array.length-1]; 18 | int j=0; 19 | for(int i=0;i"+arr[j]+"->"+i+"->"+j); 25 | j++; 26 | } 27 | return arr; 28 | 29 | } 30 | 31 | } 32 | -------------------------------------------------------------------------------- /practice/arrays/RightArrayRotation.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | import java.util.Collections; 3 | import java.util.ArrayList; 4 | public class RightArrayRotation{ 5 | public static void main(String[] args){ 6 | Scanner cin=new Scanner(System.in); 7 | int n=cin.nextInt(); 8 | ArrayList list=new ArrayList(); 9 | for(int i=0;i list, int low,int high){ 22 | while(low 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int n,rev,num; 8 | cout<<"enter the number"<>num; //5 10 | n=num*num; //25 11 | cout<<"Square of "<=10)&&(num<100)) 25 | { 26 | rev=n%100; 27 | if(rev==num) 28 | { 29 | flag=1; 30 | break; 31 | } 32 | } 33 | else 34 | { 35 | rev=n%1000; 36 | if(rev==num) 37 | { 38 | flag=1; 39 | break; 40 | } 41 | } 42 | n=n/10; 43 | } 44 | if(flag==1) 45 | { 46 | cout<<"automorphic no is "< 2 | 3 | int main(){ 4 | int n; 5 | std::cin>>n; 6 | int temp=n; 7 | do{ 8 | std::cout<0){ 10 | n=n-5; 11 | std::cout< 2 | int gcd(int a,int b){ 3 | if(b==0){ 4 | return a; 5 | } 6 | int p=a%b; 7 | return gcd(b,p); 8 | } 9 | int main(void){ 10 | int a,b; 11 | std::cin>>a>>b; 12 | std::cout< 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | -------------------------------------------------------------------------------- /practice/recursion/.addArray.cpp.swp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sauravjaiswalsj/Competitive-Programming/81aae2e43c484b21d2c495cd15d510a49771b92f/practice/recursion/.addArray.cpp.swp -------------------------------------------------------------------------------- /practice/recursion/addArray.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | static int summ=0; 3 | static int id=0; 4 | int sum(int array[],int n){ 5 | if(id>n){ 6 | return 0; 7 | } 8 | id++; 9 | std::cout<>n; 17 | int *arr= new int[n]; 18 | for(int i=0;i>arr[i]; 20 | } 21 | std::cout<arr.length){ 12 | return 0; 13 | } 14 | if(id 2 | int counter=0; 3 | int count(int n) 4 | { 5 | if(n==0) 6 | return 1; 7 | count(n/10); 8 | std::cout<>n; 16 | std::cout< 2 | bool check(int arr[],int n,int x){ 3 | if(n==0) 4 | return 1; 5 | std::cout< 2 | int id=1; 3 | bool is_sorted(int *arr ,int size){ 4 | if(id>size){ 5 | return false; 6 | } 7 | if(arr[id-1]>arr[id]){return false;} 8 | id++; 9 | is_sorted(arr,size); 10 | return true; 11 | } 12 | int main(){ 13 | int n; 14 | std::cin>>n; 15 | int *arr=new int[n]; 16 | for(int i=0;i>arr[i]; 18 | } 19 | std::cout<0){ 29 | return n; 30 | }else if(n.compareTo(s)<0){ 31 | return Lexicographically(n); 32 | }else{ 33 | return "-1"; 34 | } 35 | } 36 | } 37 | -------------------------------------------------------------------------------- /practice/strings/MembershipString.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | class MembershipString{ 3 | public static void main(String[] args){ 4 | Scanner cin=new Scanner(System.in); 5 | String s1=cin.nextLine(); 6 | char c=cin.next().charAt(0); 7 | int i=0; 8 | boolean check=false; 9 | while(i0;i--){ 8 | System.out.println(kPanagram(br.readLine(),Integer.parseInt(br.readLine()))); 9 | } 10 | } 11 | private static int kPanagram(String string, int k){ 12 | if(string.length()<26){return 0;} 13 | Set set=new HashSet<>(); 14 | for(int i=0;i set=new TreeSet<>(); 10 | for(int i=0;i0;t--){ 9 | cin.nextLine(); 10 | String s=cin.nextLine(); 11 | System.out.println(s.trim()); 12 | } 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /practice/strings/stringBuilder/reverse.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | public class reverse{ 3 | public static void main(String[] args){ 4 | final Scanner cin=new Scanner(System.in); 5 | String s=cin.nextLine(); 6 | StringBuilder sb=new StringBuilder(s); 7 | System.out.println(sb.reverse()); 8 | sb.deleteCharAt(2); 9 | System.out.println(sb); 10 | sb.setCharAt(1,'d'); 11 | System.out.println(sb); 12 | String x="123"; 13 | x.replaceAll("1","0"); 14 | System.out.println(x); 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /practice/strings/upper.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | class Upper{ 3 | public static void main(String[] args){ 4 | Scanner cin=new Scanner(System.in); 5 | String s1=cin.nextLine(); 6 | System.out.print(s1.toUpperCase()); 7 | } 8 | } 9 | -------------------------------------------------------------------------------- /projectEuler/README.md: -------------------------------------------------------------------------------- 1 | ### Solved 2 | * Multiples of 3 and 5 3 | * Even Fibonacci numbers 4 | * Largest prime factor 5 | -------------------------------------------------------------------------------- /projectEuler/cpp/fibonaci.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() 4 | { 5 | int a=0; 6 | int b=1; 7 | int sum,add=0; 8 | 9 | for(int i=1;i<=32;i++) 10 | { 11 | sum=a+b; 12 | cout< 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int n,sum=0; 7 | for(int i=1;i<1000;i++) 8 | { 9 | if((i%3==0)||(i%5==0)) 10 | { 11 | sum=sum+i; 12 | } 13 | } 14 | cout< 2 | #include 3 | void primeFact(long); 4 | int main(void){ 5 | long n; 6 | printf("Enter the Number to find the primeFactors: "); 7 | scanf("%ld",&n); 8 | primeFact(n); 9 | 10 | } 11 | void primeFact(long n){ 12 | int count; 13 | for(long i=2;i<=sqrt(n);i++){ 14 | if(n%i==0){ 15 | count=0; 16 | while(n%i==0){ 17 | n/=i; 18 | count++; 19 | printf("%ld\n",i); 20 | 21 | } 22 | } 23 | } 24 | if(n!=1){ 25 | printf("%ld",n); 26 | } 27 | } 28 | -------------------------------------------------------------------------------- /projectEuler/projectEuler.iml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /spoj/CPTTRN1.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | import java.lang.*; 3 | public class CPTTRN1{ 4 | public static final Scanner cin=new Scanner(System.in); 5 | public static void main(String[] args) throws java.lang.Exception{ 6 | int testCase=cin.nextInt(); 7 | while(testCase!=0){ 8 | PatternPrinting(); 9 | testCase--; 10 | } 11 | } 12 | public static void PatternPrinting(){ 13 | int n=cin.nextInt(); 14 | int m=cin.nextInt(); 15 | //Rows Print 16 | //Column 17 | int row=1; 18 | int nst=m; 19 | while(row<=n){ 20 | //work 21 | //star 22 | int cst=1; 23 | while(cst<=nst){ 24 | if(row%2==0){ 25 | if(cst%2!=0){ 26 | System.out.print("."); 27 | }else{ 28 | System.out.print("*"); 29 | } 30 | } 31 | else{ 32 | if(cst%2!=0){ 33 | System.out.print("*"); 34 | }else{ 35 | System.out.print("."); 36 | } 37 | } 38 | cst++; 39 | } 40 | System.out.println(""); 41 | row++; 42 | } 43 | } 44 | } 45 | 46 | -------------------------------------------------------------------------------- /spoj/CPTTRN2.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | import java.lang.*; 3 | class Main{ 4 | public static final Scanner cin=new Scanner(System.in); 5 | public static void main(String[] args) throws java.lang.Exception{ 6 | int testCase=cin.nextInt(); 7 | while(testCase!=0){ 8 | PatternPrinting(); 9 | testCase--; 10 | } 11 | } 12 | public static void PatternPrinting(){ 13 | int n=cin.nextInt(); 14 | int m=cin.nextInt(); 15 | //Rows Print 16 | //Column 17 | int row=1; 18 | int nst=m; 19 | while(row<=n){ 20 | //work 21 | //star 22 | int cst=1; 23 | while(cst<=nst){ 24 | if(row==1|| row==n){ 25 | System.out.print("*"); 26 | } 27 | else{ 28 | if(cst==1|| cst==n){ 29 | System.out.print("*"); 30 | }else{ 31 | System.out.print("."); 32 | } 33 | } 34 | cst++; 35 | } 36 | System.out.println(""); 37 | row++; 38 | } 39 | } 40 | } 41 | 42 | -------------------------------------------------------------------------------- /spoj/HS12MBR.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | import java.lang.*; 3 | public class HS12MBR{ 4 | public static void main(String[] args)throws java.lang.Exception{ 5 | 6 | -------------------------------------------------------------------------------- /spoj/Pattern/CPTTRN1.java: -------------------------------------------------------------------------------- 1 | package Pattern; 2 | 3 | public class CPTTRN1 { 4 | public CPTTRN1(int n,int m){ 5 | int row=1,nst=m; 6 | while(row<=n){ 7 | for(int cst=1;cst<=nst;cst++) { 8 | if(((row & 1)==1)){ 9 | if(((cst & 1)==1)){ 10 | System.out.print("*"); 11 | }else{ 12 | System.out.print("."); 13 | } 14 | }else{ 15 | if((cst&1)==1){ 16 | System.out.print("."); 17 | }else{ 18 | System.out.print("*"); 19 | } 20 | } 21 | } 22 | System.out.println(); 23 | row++; 24 | } 25 | } 26 | } 27 | -------------------------------------------------------------------------------- /spoj/Pattern/CPTTRN2.java: -------------------------------------------------------------------------------- 1 | package Pattern; 2 | 3 | public class CPTTRN2 { 4 | CPTTRN2(int n,int m){ 5 | int row=1; 6 | while(row<=n){ 7 | for(int cst=1;cst<=m;cst++){ 8 | if((row==1) || (row ==n ) || (cst ==1) || (cst==m)){ 9 | System.out.print("*"); 10 | }else{ 11 | System.out.print("."); 12 | } 13 | } 14 | System.out.println(); 15 | row++; 16 | } 17 | } 18 | } 19 | -------------------------------------------------------------------------------- /spoj/Pattern/Main.java: -------------------------------------------------------------------------------- 1 | package Pattern; 2 | import java.util.Scanner; 3 | import Pattern.CPTTRN2; 4 | public class Main { 5 | public static void main(String[] args) { 6 | final Scanner cin = new Scanner(System.in); 7 | int test=cin.nextInt(); 8 | int n=0,m=0; 9 | while(test-- >0) { 10 | n = cin.nextInt(); 11 | m = cin.nextInt(); 12 | CPTTRN2 pattern = new CPTTRN2(n,m); 13 | } 14 | } 15 | } 16 | -------------------------------------------------------------------------------- /spoj/PrimeGen.py: -------------------------------------------------------------------------------- 1 | import math 2 | def checkPrime(num): 3 | if(num<=1): 4 | return False 5 | if(num == 2 or num == 3): 6 | return True 7 | if(num%2==0 or num%3==0): 8 | return False 9 | for i in range(3,int(math.sqrt(num))): 10 | if(num%i==0): 11 | return False 12 | return True 13 | 14 | if __name__ == "__main__": 15 | loop=int(input()) 16 | while(loop!=0): 17 | firstInput, secondInput = map(int, input().split()) 18 | for i in range(firstInput, secondInput+1): 19 | if(checkPrime(i)==True): 20 | print(i) 21 | if(loop!=1): 22 | print() 23 | loop-=1 24 | 25 | -------------------------------------------------------------------------------- /spoj/PrimeGenerator.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | class PrimeGenerator{ 3 | public static void main(String[] args){ 4 | Scanner cin=new Scanner(System.in); 5 | int test=cin.nextInt(); 6 | while(test!=0){ 7 | long a=cin.nextLong(); 8 | long b=cin.nextLong(); 9 | for(long i=a;i<=b;i++){ 10 | if(Prime(i)){ 11 | System.out.println(i); 12 | } 13 | } 14 | test--; 15 | } 16 | } 17 | public static boolean Prime(long n){ 18 | if(n<=1)return false; 19 | if(n==2 || n==3) return true; 20 | if(n%2==0 || n%3==0) return false; 21 | for(long i=3;i name=new ArrayList<>(); 7 | for(int i=0;i<=n;i++){ 8 | String val=cin.nextLine(); 9 | name.add(val); 10 | } 11 | for(String word:name){ 12 | int k=word.length(); 13 | //System.out.println(k); 14 | for(int i=0;i0;i=i*5){ 26 | count+=A/i; 27 | } 28 | return count; 29 | } 30 | } 31 | -------------------------------------------------------------------------------- /techgig/Array/ThirdLargest.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | public class ThirdLargest{ 3 | public static void main(String[] args){ 4 | Scanner cin=new Scanner(System.in); 5 | int n=cin.nextInt(); 6 | ArrayList list=new ArrayList<>(); 7 | for(int i=0;i list){ 13 | Collections.sort(list,Collections.reverseOrder()); 14 | return list.get(2); 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /techgig/CodeGladiator2019a.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | class CandidateCode{ 3 | public static final Scanner cin=new Scanner(System.in); 4 | public static void main(String[] args){ 5 | int t=cin.nextInt(); 6 | while(t!=0){ 7 | int n=cin.nextInt(); 8 | gameBlock(n); 9 | t--; 10 | } 11 | } 12 | public static void gameBlock(int n){ 13 | int[] st=new int[n]; 14 | int[] en=new int[n]; 15 | for(int i=0;i=st[i]){ 30 | count++; 31 | } 32 | } 33 | if(count==n){ 34 | System.out.println("WIN"); 35 | } 36 | else{ 37 | System.out.println("LOSE"); 38 | } 39 | } 40 | 41 | } 42 | 43 | -------------------------------------------------------------------------------- /timusJudge/reverseRoot.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | import java.util.ArrayList; 3 | import java.text.DecimalFormat; 4 | public class reverseRoot{ 5 | public static void main(String[] args){ 6 | Scanner cin=new Scanner(System.in); 7 | DecimalFormat df=new DecimalFormat("0.0000"); 8 | ArrayList arr=new ArrayList(); 9 | while(cin.hasNextLong()){ 10 | arr.add(cin.nextLong()); 11 | } 12 | for(int i=arr.size()-1;i>=0;i--){ 13 | System.out.println(df.format(Math.sqrt(arr.get(i)))); 14 | } 15 | } 16 | } 17 | 18 | -------------------------------------------------------------------------------- /topcoder/784/250: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sauravjaiswalsj/Competitive-Programming/81aae2e43c484b21d2c495cd15d510a49771b92f/topcoder/784/250 -------------------------------------------------------------------------------- /topcoder/784/250.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | class Scissors{ 4 | public: 5 | int openingTime(int N){ 6 | int pair=1; 7 | int time=10; 8 | N=N-pair; 9 | pair=pair+1; 10 | for(int i=0;;i++){ 11 | N=N-pair; 12 | pair+=2; 13 | time+=10; 14 | if(N<=pair && N!=0){ 15 | time+=10; 16 | break; 17 | } 18 | if(N==0){ 19 | break; 20 | } 21 | } 22 | return time; 23 | } 24 | }; 25 | 26 | int main(void){ 27 | int n; 28 | Scissors *p = new Scissors(); 29 | std::cin>>n; 30 | int t=p->openingTime(n); 31 | std::cout< 2 | #include 3 | class LCMRange{ 4 | public: 5 | int lcm(int f, int l){ 6 | int lcm=1; 7 | for(int i=f;i<=l;i++){ 8 | lcm=lcm*(i/gcd(lcm,i)); 9 | } 10 | return lcm; 11 | } 12 | int gcd(int a,int b){ 13 | while(b>0){ 14 | int t=b; 15 | b=a%b; 16 | a=t; 17 | } 18 | return a; 19 | } 20 | }; 21 | int main(){ 22 | int f,l; 23 | std::cin>>f>>l; 24 | LCMRange *get =new LCMRange(); 25 | std::cout<lcm(f,l); 26 | return 0; 27 | } 28 | -------------------------------------------------------------------------------- /topcoder/chess.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | class BrokenChessboard{ 6 | public: 7 | int minimumFixes(char* p){ 8 | int count,sum; 9 | char *ptr=p; 10 | while(*ptr!='\0'){ 11 | count=0; 12 | if(*ptr=='B'){ 13 | if(*ptr++=='W'){ 14 | *ptr++; 15 | } 16 | else 17 | { 18 | count++; 19 | *ptr++; 20 | } 21 | sum=count; 22 | } 23 | } 24 | return sum; 25 | } 26 | }; 27 | int main(){ 28 | char str[50]; 29 | cin>>str; 30 | BrokenChessboard b; 31 | int k=b.minimumFixes(str); 32 | cout< 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /uva/900.java: -------------------------------------------------------------------------------- 1 | // Fibnocci Secquence 2 | import java.util.Scanner; 3 | 4 | class BrickWallPatterns{ 5 | public static void main(String[] args){ 6 | Scanner cin =new Scanner(System.in); 7 | int n; 8 | while((n=cin.nextInt())!=0){ 9 | System.out.println(getWallLength(n)); 10 | } 11 | } 12 | private static long getWallLength(int n){ 13 | if(n==1) return 1; 14 | if(n==2) return 2; 15 | long a=1; 16 | long b=2; 17 | long sum=0; 18 | for(int i=3;i<=n;i++){ 19 | sum=a+b; 20 | a=b; 21 | b=sum; 22 | } 23 | return sum; 24 | } 25 | } 26 | --------------------------------------------------------------------------------