new Codesignals problems

Author: coderjojo

CodeChef/BinAddC.cpp

@@ -0,0 +1,44 @@
+
+	#include <bits/stdc++.h>
+	#include <cstdio>
+	#include <cstring>
+	#include <cmath>
+	#include <cstring>
+	#include <chrono>
+	#include <complex>
+	#define endl "\n"
+	#define ll long long int
+	#define vi vector<int>
+	#define vll vector<ll>
+	#define vvi vector < vi >
+	#define pii pair<int,int>
+	#define pll pair<long long, long long>
+	#define mod 1000000007
+	#define inf 1000000000000000001;
+	#define all(c) c.begin(),c.end()
+	#define mp(x,y) make_pair(x,y)
+	#define mem(a,val) memset(a,val,sizeof(a))
+	#define eb emplace_back
+	#define f first
+	#define s second
+	
+	using namespace std;
+	int main()
+	{
+		std::ios::sync_with_stdio(false);
+		int T;
+		cin>>T;
+		// cin.ignore(); must be there when using getline(cin, s)
+		while(T--)
+		{
+			int a, b;
+			cin>>a>>b;
+
+			int ans = b - (a%b);
+			if(ans!=b)
+			cout<<ans<<endl;
+			else
+			cout<<0<<endl;
+		}
+		return 0;
+	}

CodeChef/CKWLK.cpp

@@ -0,0 +1,5 @@
+/*Please add ; after each select statement*/
+CREATE PROCEDURE countriesSelection()
+BEGIN
+    select name, continent, population from countries where continent='Africa';
+END

CodeChef/COIN.cpp

@@ -0,0 +1,5 @@
+/*Please add ; after each select statement*/
+CREATE PROCEDURE monthlyScholarships()
+BEGIN
+    select id, scholarship/12 "scholarship" from scholarships;
+END

CodeChef/COOK13B/CHANGT.cpp

@@ -0,0 +1,52 @@
+//top Solution
+int commonCharacterCount(std::string s1, std::string s2) {
+    int count1[26] = {0};
+    int count2[26] = {0};
+    
+    for(char c: s1) ++count1[c-'a'];
+    for(char c: s2) ++count2[c-'a'];
+    
+    int ret = 0;
+    for(int i=0; i<26; ++i)
+        ret += min(count1[i],count2[i]);
+    
+    return ret;
+}
+
+
+//My
+
+int commonCharacterCount(std::string s1, std::string s2) {
+    int res  = 0;
+
+    for(int i = 0; i < s1.length(); i++){
+        for(int j = 0; j < s2.length(); j++){
+            if(s1[i] == s2[j]){
+                res++;
+                s2[j] = ' '; 
+        break;     
+            }
+        }
+    }
+    return res;
+
+}
+
+//with map
+int commonCharacterCount(std::string s1, std::string s2) {
+map<int,int> resultTable1;
+map<int,int> resultTable2;
+int sum = 0;
+
+for(int i=0;i<s1.size();i++){
+    resultTable1[s1.at(i)]++;
+}
+for(int i=0;i<s2.size();i++){
+    resultTable2[s2.at(i)]++;
+}
+
+for(int i='a';i<='z';i++){
+    sum += min(resultTable1[i],resultTable2[i]);
+}
+
+return sum;

CodeChef/COOK13B/PRFYIT.cpp

@@ -0,0 +1,66 @@
+#include<bits/stdc++.h>
+#include<string.h>
+using namespace std;
+
+
+
+string revS(string s){
+  string s1;
+    stack<char> stk;
+    for(int i = 0; i < s.length(); i++){
+        if(s[i] == '('){
+        while(s[i] != ')'){
+            if(s[++i] == '('){
+
+                while(s[i] != ')')
+                    s1.push_back(s[i]);
+            }
+            stk.push(s[++i]);
+        }
+        while(!stk.empty()){
+            if(stk.top() != ')' && stk.top() != '(')
+            s1.push_back(stk.top());
+            stk.pop();
+        }
+        }
+
+        if(s[i] != '(' && s[i] != ')')
+        s1.push_back(s[i]);
+    }
+
+    return s1; 
+   
+}
+
+int main(int argc, char const *argv[])
+{
+    string s = "foo(bar(baz))blim";
+
+    string ans = "foobazrabblim";
+    s = revS(s);
+    if(s == ans)
+        cout<<1;
+    else{
+        cout<<0<<endl;
+        cout<<s;
+    }
+
+
+    return 0;
+}
+
+string reverseInParentheses(string s) {
+    int a,b;
+    for(int i = 0; i < s.size(); i++){
+        if(s[i] == '(')
+            a = i;
+        if(s[i] == ')')
+        {
+            b = i;
+            string t = s.substr(a + 1, b - a - 1);
+            reverse(t.begin(), t.end());
+            return reverseInParentheses(s.substr(0, a) + t + s.substr(b + 1));
+        }
+    }
+    return s;
+}

CodeChef/Chef&Sorting.cpp

@@ -0,0 +1,30 @@
+//top solution
+std::vector<int> t, sortByHeight(std::vector<int> a) {
+    for (x:a) if (x>-1) t.push_back(x);
+    sort(begin(t), end(t));
+    auto p = begin(t);
+    for (x:a) if (x>-1) x = *(p++);
+    return a;
+}
+
+//my
+std::vector<int> sortByHeight(std::vector<int> a) {
+    for(int i = 0; i < a.size()-1; i++){
+        if(a[i] == -1)
+        continue; 
+        int min = i;
+
+            for(int j = i+1; j < a.size(); j++){
+                if(a[j] == -1)
+                    continue;
+
+                if(a[min] > a[j])
+                min = j;
+            }
+                    int temp = a[i];
+                    a[i] = a[min];
+                    a[min] = temp;
+            
+        }
+
+    return a;

CodeChef/FEB20B/cash.cpp

@@ -0,0 +1,39 @@
+//top solution
+bool isLucky(int n) {
+    int digits = (int)log10(n) + 1;
+    int sum1 = 0, sum2 = 0;
+    
+    
+    for (int x = 0; n > 0; n /= 10, x++) {
+        if (x < digits / 2)
+            sum1 += n % 10;
+        else
+            sum2 += n % 10;
+    }
+    
+    return sum1 == sum2;
+}
+
+//my sol
+bool isLucky(int n) {
+  vector<int> v; 
+  while(n>0){
+      v.push_back(n%10);
+      n = n/10;
+  }
+  int f_half=0, s_half=0, half = v.size()/2;
+
+
+  for (int i = 0; i < half; i++)
+  f_half += v[i];
+
+  for(int i = half; i < v.size(); i++)
+  s_half += v[i];
+
+   //cout<<f_half<<s_half; 
+  return(f_half == s_half);
+
+   
+}
+
+

CodeChef/FEB20B/cpptry.cpp

@@ -0,0 +1,13 @@
+#include <iostream>
+using namespace std;
+
+int main(){
+	
+	int val =0;
+	std::cout<<val;
+}
+
+unsigned GetNumberOfDigits (unsigned i)
+{
+    return i > 0 ? (int) log10 ((double) i) + 1 : 1;
+}