Merge pull request #239 from sanchitgupta456/master

Added Codeforces Round 638 Problem A & Problem B

Author: larissalages

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;
+   }
+}

readme.md

@@ -84,6 +84,11 @@ Problem Statement | Solution
 [B](https://codeforces.com/contest/1341/problem/B) | [Solution](https://github.com/larissalages/code_problems/blob/master/Codeforces_Contests/6_Round_637_Div_2/B.cpp)
 [C](https://codeforces.com/contest/1341/problem/C) | [Solution](https://github.com/larissalages/code_problems/blob/master/Codeforces_Contests/6_Round_637_Div_2/C.cpp)
 
+### Round 638
+Problem Statement | Solution
+------------ | -------------
+[A](https://codeforces.com/contest/1348/problem/A) | [Solution](https://github.com/sanchitgupta456/code_problems/blob/master/Codeforces_Contests/Round_638_Div_2/A.cpp)
+
 # LeetCode
 ## Binary Search Trees
 Challenge | Solution