Commit

Author: rachitvk

Codechef/DEC18 Cookoff/CAMPON.cpp

@@ -0,0 +1,40 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+
+	int t;
+	cin >> t;
+
+    while(t--){
+	    int d;
+	    cin >> d;
+	    
+	    int arr[32]={0};
+	    
+	    for(int i=0;i<d;i++){
+	        int di,pi;
+	        cin >> di >> pi;
+	        
+	        arr[di]+=pi;
+	    }
+	    
+	    for(int i=1;i<=31;i++){
+	        arr[i]+=arr[i-1];
+	    }
+	    
+	    int q;
+	    cin >> q;
+	    
+	    for(int i=0;i<q;i++){
+	        int di,ri;
+	        cin >> di >> ri;
+	        
+	        if(arr[di]<ri)
+	            cout << "Go Sleep" << endl;
+	        else
+	            cout << "Go Camp" << endl;
+	    }
+
+	}
+}

Codechef/DEC18 Cookoff/YNUM.cpp

@@ -0,0 +1,48 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+#define ll long long
+#define MOD 1000000007
+#define f(i,a,b) for(int i=a;i<b;i++)
+
+int main(){
+    int t;
+    cin >> t;
+    
+    while(t--){
+        string s;
+        cin >> s;
+        
+        int l=s.length();
+        ll mi=0,total;
+        
+        vector<ll>arr(100005);
+        
+        arr[0]=1;
+        
+        f(i,1,100005){
+            arr[i]=(arr[i-1]*10)%MOD;
+        }
+        
+        f(i,0,l){
+            mi+=((s[i]-'0')*arr[l-i-1])%MOD;
+        }
+        mi = mi%MOD;
+       // cout << mi << endl;
+        total=mi;
+        
+        f(i,0,s.length()-1){
+            mi=(((mi*10)%MOD+(s[i]-'0'))%MOD-((s[i]-'0')*arr[l])%MOD)%MOD;
+             if(mi<0)
+                mi+=MOD;
+            total=((total*arr[l])%MOD+mi)%MOD;
+            
+           
+        }
+        
+        total%=MOD;
+        cout << total << endl;
+        
+        
+    }
+}

Leetcode/InsertIntoABinarySearchTree.cpp

@@ -0,0 +1,26 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+ * };
+ */
+class Solution {
+public:
+    TreeNode* insertIntoBST(TreeNode* root, int val) {
+        if(!root){
+                TreeNode* n = new TreeNode(val);
+                return n;
+        }
+           
+        
+        if(root->val > val)
+            root->left=insertIntoBST(root->left,val);
+        else
+            root->right=insertIntoBST(root->right,val);
+       
+        return root;
+    }
+};