Merge branch 'master' into add-comb-sort

Author: larissalages

CodeChef_problems/CVDRUN.cpp

@@ -0,0 +1,59 @@
+//************************** it's all about practice ***********************
+#include<bits/stdc++.h>
+using namespace std;
+//**** Abbrevations ****
+typedef long long ll;
+typedef unsigned long long ull;
+typedef long double ld;
+//**** STL ****
+#define pb push_back
+#define pf push_front
+#define ppb pop_back
+#define ppf pop_front
+#define ff first
+#define ss second
+#define mp make_pair
+#define ALL(x) x.begin(), x.end()
+//**** some I/O ****
+#define no         cout << "NO\n"
+#define yes        cout << "YES\n"
+//**** Fast I/O ****
+#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
+//**** Short Code ****
+#define tc ll t;cin>>t;while(t--)
+#define fi(a,b) for(ll i=a;i<b;i++)
+#define fj(a,b) for(ll j=a;j<b;j++)
+#define fk(a,b) for(ll k=a;k<b;k++)
+/*---------------------------------------------------------------------------*/
+int main()
+{
+    FAST_IO
+    tc
+    {
+        int n,k,x,y;
+        cin>>n>>k>>x>>y;
+        bool c=false;
+        int i=x;
+        if(x==y)
+            c=true;
+        else
+            i=(i+k)%n;
+        while(i!=x)
+        {
+            if(i==y)
+            {
+                c=true;
+                break;
+            }
+            else
+                i=(i+k)%n;
+        }
+        if(c==true)
+            yes;
+        else
+            no;
+
+    }
+    return 0;
+}
+

CodeChef_problems/PrimeGenerator(PRIME1).cpp

@@ -0,0 +1,39 @@
+#include <bits/stdc++.h> 
+#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
+typedef unsigned long long int unt;
+using namespace std; 
+
+bool Prime(unt n){
+
+    if (n <= 1) 
+        return false; 
+    if (n <= 3) 
+        return true; 
+
+    if (n % 2 == 0 || n % 3 == 0) 
+        return false; 
+  
+    for (unt i = 5; i * i <= n; i = i + 6) 
+        if (n % i == 0 || n % (i + 2) == 0) 
+            return false; 
+  
+    return true; 
+} 
+
+void printPrime(unt a,unt n){ 
+    for (unt i = a; i <= n; i++){ 
+        if(Prime(i)) 
+            cout <<i<<'\n'; 
+    } 
+} 
+
+int main(){
+	fast;
+	unt t;
+	cin>>t;
+	while(t--){
+	int a,n;
+	cin>>a>>n;
+    printPrime(a,n); 
+	}
+} 

Codeforces_Contests/Round_638_Div_2/A.cpp

@@ -0,0 +1,49 @@
+/**************************************************************************
+ *  $Id$
+ *  File:	
+ *
+ *  Purpose:	
+ *
+ *  Author:	Sanchit Gupta (CS19B071)
+ *
+ *  Created:    
+ *
+ *  Last modified:  
+ *
+ *  Bugs:	
+ *
+ *  Change Log:	
+ *
+ * While(!(succeed==try());
+ **************************************************************************/
+ #include<iostream>
+ #include<bits/stdc++.h>
+ 
+ using namespace std;
+ 
+ int main()
+ {
+     int t;
+     cin>>t;
+     while(t--)
+     {
+        long long int n;
+        cin>>n;
+        long long int sum1=0,sum2=0;
+        long long int current=2,i=1;
+        while(i<(n/2))
+        {
+            sum1=sum1+current;
+            current=current*2;
+            i++;
+        }
+        while(i<n)
+        {
+            sum2=sum2+current;
+            current=current*2;
+            i++;
+        }
+        sum1=sum1+current;
+        cout<<abs(sum1-sum2)<<endl;
+     }
+ }

Codeforces_Contests/Round_638_Div_2/B.cpp

@@ -0,0 +1,47 @@
+/**************************************************************************
+ *  $Id$
+ *  File:	
+ *
+ *  Purpose:	
+ *
+ *  Author:	Sanchit Gupta (CS19B071)
+ *
+ *  Created:    
+ *
+ *  Last modified:  
+ *
+ *  Bugs:	
+ *
+ *  Change Log:	
+ *
+ * While(!(succeed==try());
+ **************************************************************************/
+#include <bits/stdc++.h>
+using namespace std;
+
+int main(){
+  int t; cin>>t;
+  while (t--)
+   {
+       int n,k;
+  cin>>n,k;
+  set<int>s;
+  for (int i=0;i<n;i++){
+    int a;
+    cin>>a;
+    s.insert(a);
+  }
+  if (s.size()>k){
+    cout<<-1<<endl;
+    return;
+  }
+  cout<<n*k<<endl;
+  for (int i=0;i<N;i++){
+    for (int b:s)
+      cout<<b<<' ';
+    for (int j=0;j<k-(int)s.size();j++)
+      cout<<1<<' ';
+  }
+  cout<<endl;
+   }
+}

Hackerrank/30 days of code/Day25_RunningTimeAndComplexity.java

@@ -0,0 +1,29 @@
+import java.io.*;
+import java.util.*;
+
+public class Solution {
+
+    public static void main(String[] args) 
+    {
+        Scanner sc = new Scanner(System.in);
+        int n  = sc.nextInt();
+        for(int i=0; i<n; i++)
+        {
+            int c = 0;
+            int p = sc.nextInt();
+            if(p==1)
+                System.out.println("Not prime");
+            for(int j=2; j*j<=p;j++)
+            {
+                if(p%j==0)
+                {
+                    System.out.println("Not prime");
+                    c++;
+                    break;
+                }
+            }
+            if(c==0 && p!=1)
+                System.out.println("Prime");
+        }
+    }
+}

Hackerrank/Java/output_formatting.java

@@ -0,0 +1,43 @@
+  
+/************************************
+Java's System.out.printf function can be used to print formatted output. The purpose of this exercise is to test your understanding of formatting output using printf.
+To get you started, a portion of the solution is provided for you in the editor; you must format and print the input to complete the solution.
+Input Format
+Every line of input will contain a String followed by an integer.
+Each String will have a maximum of  alphabetic characters, and each integer will be in the inclusive range from  to .
+Output Format
+In each line of output there should be two columns:
+The first column contains the String and is left justified using exactly  characters.
+The second column contains the integer, expressed in exactly  digits; if the original input has less than three digits, you must pad your output's leading digits with zeroes.
+Sample Input
+java 100
+cpp 65
+python 50
+Sample Output
+================================
+java           100 
+cpp            065 
+python         050 
+================================
+Explanation
+Each String is left-justified with trailing whitespace through the first  characters. The leading digit of the integer is the  character, and each integer that was less than  digits now has leading zeroes.
+***************************************/
+import java.util.Scanner;
+
+public class Solution {
+
+    public static void main(String[] args) {
+            Scanner sc=new Scanner(System.in);
+            System.out.println("================================");
+            for(int i=0;i<3;i++){
+                String s1=sc.next();
+                int x=sc.nextInt();
+                System.out.printf("%-15s%03d%n", s1, x);
+                //Complete this line
+            }
+            System.out.println("================================");
+
+    }
+}
+
+

Hackerrank/java/Java_2D_Array.java

@@ -0,0 +1,43 @@
+import java.io.*;
+import java.math.*;
+import java.security.*;
+import java.text.*;
+import java.util.*;
+import java.util.concurrent.*;
+import java.util.regex.*;
+
+public class Solution {
+
+
+
+    private static final Scanner scanner = new Scanner(System.in);
+
+    public static void main(String[] args) {
+        int[][] arr = new int[6][6];
+        int max = -70;
+
+        for (int i = 0; i < 6; i++) {
+            String[] arrRowItems = scanner.nextLine().split(" ");
+            scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
+
+            for (int j = 0; j < 6; j++) {
+                int arrItem = Integer.parseInt(arrRowItems[j]);
+                arr[i][j] = arrItem;
+            }
+        }
+
+        for(int i=0;i<4;i++)
+        {
+            for(int j=0;j<4;j++)
+            {
+                int sum = arr[i][j] + arr[i][j+1] + arr[i][j+2] + arr[i+1][j+1] + arr[i+2][j] + arr[i+2][j+1] + arr[i+2][j+2];
+                if(sum >= max)
+                    max = sum;
+            }
+        }
+
+        System.out.println(max);
+
+        scanner.close();
+    }
+}

Hackerrank/java/Java_String_Tokens.java

@@ -0,0 +1,22 @@
+import java.io.*;
+import java.util.*;
+
+public class Solution {
+
+    public static void main(String[] args) {
+        Scanner scan = new Scanner(System.in);
+        String s = scan.nextLine().trim();
+
+        String[] str = s.split("[ !,?._'@]+");
+        int l = str.length;
+        if(s.compareTo("")==0)
+            System.out.println(0);
+        else
+        {
+            System.out.println(l);
+            for(int i=0;i<l;i++)
+                System.out.println(str[i]);
+        }
+        scan.close();
+    }
+}