08 JULY 2021

Author: sonuKumar03

codeshef/CIELRCPT.cpp

@@ -0,0 +1,43 @@
+#include<bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+#define INF 10000009
+vector<int>menus;
+vector<int>dp(100002,-1);
+int f(int p){
+	if(p==0){
+		return 0;
+	}
+	if(p<0){
+		return INF;
+	}
+	if(dp[p]!=-1)
+		return dp[p];
+
+	int best = INF;
+	for(auto  a:menus){
+		best = min(best,f(p-a)+1);
+		dp[p]=best;
+	}
+	return best;
+ }
+
+void solve(){
+	ll sum;
+	cin>>sum;
+	int t = f(sum);
+	cout<<t<<endl;
+}	
+int main(){
+	int t;
+	cin>>t;
+	for(int i =11;i>=0;i--){
+		menus.push_back(pow(2,i));
+	}
+	dp[0]=0;
+	dp[1]=1;
+	while(t--){
+		solve();
+	}
+	return 0;
+}

codeshef/CORTSENT.cpp

@@ -0,0 +1,53 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+bool checkGroup(string str){
+    // finds its groups
+    if(str[0] >='a' && str[0] <='m'){ // first group
+        for(int i =1;i<str.length();i++){
+            if(!(str[i] >='a' && str[i] <='m')){
+                return false;
+            }
+        }
+        return true;
+    }
+    else if (str[0] >='N' && str[0] <='Z'){
+        for(int i =1;i<str.length();i++){
+            if(!(str[i] >='N' && str[i] <='Z')){
+                return false;
+            }
+        }
+        return true;
+    }
+
+    return false;
+}
+
+ void solve(){
+        int n;
+	    cin>>n;
+	    vector<string> ar;
+	    for(int i =0;i<n;i++){
+	        string str;
+	        cin>>str;
+	        ar.push_back(str);
+	    }
+	    bool ans = true;
+	    for(auto a:ar){
+	    	ans = ans && checkGroup(a);
+	    }
+	    if(ans){
+	        cout<<"YES\n";
+	    }else{
+	        cout<<"NO\n";
+	    }
+ }
+
+int main() {
+	int t;
+	cin>>t;
+	while(t--){
+	  solve();
+	}
+	return 0;
+}

codeshef/CTIME.cpp

@@ -0,0 +1,37 @@
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+ void solve(){
+ 	ll n,k,f;
+ 	cin>>n>>k>>f;
+ 	vector<pair<int,int>>timeslots;
+ 	for(int i=0;i<n;i++){
+	 	ll start,end;
+	 	cin>>start>>end;
+	 	timeslots.push_back(make_pair(start,end));
+ 	}
+	ll ans = 0;
+	vector<pair<int,int>>::iterator it = timeslots.begin();
+	ll last_end = it->second;		
+	it++;
+	for(; it != timeslots.end();it++){
+		ans += it->first - last_end;
+		last_end = it->second;
+	} 
+	// cout<<ans<<" \t";
+	if(ans >= k || f - last_end >= k ){
+		cout<<"Yes\n";
+	}else{
+		cout<<"No\n";
+	}
+ }
+
+
+int main() {
+	int t;
+	cin>>t;
+	while(t--){
+	  solve();
+	}
+	return 0;
+}

codeshef/EITA.cpp

@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+ void solve(){
+ 	int d,x,y,z;
+ 	cin>>d>>x>>y>>z;
+ 	int s1 =  7 * x;
+ 	int s2 = y *d + (7-d)*z;
+ 	if(s1 > s2){
+ 		cout<<s1<<endl;
+ 	}else{
+ 		cout<<s2<<endl;
+ 	}
+ }
+
+
+
+int main() {
+	int t;
+	cin>>t;
+	while(t--){
+	  solve();
+	}
+	return 0;
+}

codeshef/FAIRELCT.cpp

@@ -7,7 +7,7 @@
 #include<math.h>
 using namespace std;
 typedef long long ll ;
-ifstream fin("tests");
+// ifstream cin("tests");
 int increasing(int a,int b){
   return b>a;
 }
@@ -23,60 +23,59 @@ void print(vector<ll> ar){
 }
 void solve(){
   ll n,m;
-  fin>>n>>m;
+  cin>>n>>m;
   vector<ll> jackson(n,0);
   vector<ll> johnson(m,0);
   ll jackson_votes = 0;
   ll johnson_votes = 0;
 
   for(int i =0;i<n;i++){
-    fin>>jackson[i];
+    cin>>jackson[i];
   }
   for(int i =0;i<m;i++){
-    fin>>johnson[i];
+    cin>>johnson[i];
   }
 
   sort(jackson.begin(),jackson.end(),increasing);
   sort(johnson.begin(),johnson.end(),decreasing);
 
-  for(auto u:jackson){
-    jackson_votes+=u;
+
+  for(auto a:jackson){
+    jackson_votes+=a;
   }
-  for(auto u:johnson){
-    johnson_votes+=u;
+  for(auto a:johnson){
+    johnson_votes+=a;
   }
-  int i =0;int j =0;
-  int swaps =0;
-  bool successful = false;
-  while(i<jackson.size() && j< johnson.size()){
+
+  int swap = 0;
+  int i=0;
+  int j=0;
+  bool f = false;
+  while(i <= jackson.size() && j<=jackson.size()){
     if(jackson_votes > johnson_votes){
-      successful = true;
+      f = true;
       break;
     }
-    jackson_votes-=jackson[i];
-    jackson_votes+=johnson[j];
-
-    johnson_votes-=johnson[j];
-    johnson_votes+=jackson[i];
-
-    int temp = jackson[i];
-    jackson[i] = johnson[j];
-    johnson[j] = temp;
+    // cout<<jackson_votes<<" "<<johnson_votes<<endl;
+    jackson_votes=jackson_votes-jackson[i] + johnson[j];
+    johnson_votes=johnson_votes-johnson[j]+jackson[i];
+    swap++;
     i++;
     j++;
-    swaps++;
   }
-  if(successful){
-    cout<<swaps<<endl;
+
+  if(f){
+    cout<<swap<<endl;
   }else{
     cout<<-1<<endl;
   }
+
 }
 
 int main() {
 
   ll t;
-  fin>>t;
+  cin>>t;
   while(t--){
     solve();
   }

codeshef/HOOPS.cpp

@@ -0,0 +1,19 @@
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+ void solve(){
+ 	ll n;
+ 	cin>>n;
+ 	cout<<(n/2)+1<<endl;
+ }
+
+
+
+int main() {
+	int t;
+	cin>>t;
+	while(t--){
+	  solve();
+	}
+	return 0;
+}

codeshef/KPATHQRY.cpp

@@ -0,0 +1,65 @@
+#include<bits/stdc++.h>
+using namespace std;
+vector<vector<int>>graph;
+vector<bool>visited;
+void print(){
+	int i = 1;
+	for(auto g:graph){
+		cout<<i<<" ";
+		for(auto a:g){
+			cout<<(a+1)<<" ";
+		}
+		cout<<endl;	
+		i++;
+	}
+}
+void dfs(int s ){
+	visited[s]=true;
+	cout<<(s+1)<<" ";
+	for(auto a : graph[s]){
+		if(!visited[a]){
+			dfs(a);
+		}
+	}
+}
+void solve(){
+	int n;
+	cin>>n;
+	graph = vector<vector<int>>(n);
+	visited = vector<bool>(n,false);
+	for(int i =1;i<=n-1;i++){
+		int u,v;
+		cin>>u>>v;
+		u--;
+		v--;
+		graph[u].push_back(v);
+		graph[v].push_back(u);
+	}
+	int q ;
+	cin>>q;
+	vector<int> vertices;
+	while(q--){
+		int k;
+		cin>>k;
+		vertices = vector<int>(k);
+		for(int i =0;i<k;i++){
+			cin>>vertices[i];
+		}
+		visited = vector<bool>(n);
+		for(auto a : vertices){
+			a--;
+			// dfs(a);
+			// cout<<endl;
+		}
+	}
+	print();
+}
+
+int main(){
+	int t ;
+	cin>>t;
+	while(t--){
+		solve();
+	}
+	return 0;
+}

codeshef/QUIZPLAG.cpp

@@ -0,0 +1,46 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+ void solve(){
+        int n,m,k;
+	    cin>>n>>m>>k;
+	   	vector<int> ar;
+	   	for(int i =0;i<k;i++){
+	   		int a;
+	   		cin>>a;
+	   		ar.push_back(a);
+	   	}
+	   	map<int,int> _map ;
+	   	for(int i =0;i<k;i++){
+	   		if(ar[i]<=n){
+	   			map<int,int >::iterator it  = _map.find(ar[i]);
+	   			if(it != _map.end()){
+	   				it->second = it->second + 1;
+	   			}else{
+	   				_map.insert(make_pair(ar[i],1));
+	   			}
+	   		}
+	   	}
+	   	vector<int> plagers ;
+
+	   	for(map<int,int>::iterator it = _map.begin() ; it !=_map.end();it++){
+	   		if(it->second > 1){
+	   			plagers.push_back(it->first);
+	   		}
+	   		// cout<<it->first<<", "<<it->second<<"\t";
+	   	}
+	   	cout<<plagers.size();
+	   	for(auto a:plagers){
+	   		cout<<" "<<a<<" ";
+	   	}
+	   	cout<<endl;
+ }
+
+int main() {
+	int t;
+	cin>>t;
+	while(t--){
+	  solve();
+	}
+	return 0;
+}