program

submissions/2018/lovish/a.cpp

@@ -0,0 +1,27 @@
+#include<bits/stdc++.h>
+using namespace std;
+int cmp(pair<int,int> p,pair<int,int> p1){
+	return p.first<p1.second;
+}
+int main(){
+	int t;
+	cin>>t;
+	while(t--){
+		int n;
+		cin>>n;
+		vector<pair<int,int>> v[n];
+		for(int i=0;i<n;i++){
+
+			cin>>v[i].first>>v[i].second;
+		}
+		sort(v.begin(),v.end(),cmp);
+		int dp[n+1]={0};
+		dp[0]=0;
+		for(int i=1;i<=n;i++){
+			for(int j=0;j<i;j++){
+				if(v[i])
+			}
+		}
+
+	}
+}

submissions/2018/lovish/b.cpp

@@ -0,0 +1,4 @@
+dejf
+diewkdj
+bedkewk'
+bk;k

submissions/2018/lovish/c.cpp

@@ -0,0 +1,11 @@
+lkdjkwjakd
+sajl;kd
+
+aosjdopjqe[dioehjdlqe
+lkhead;
+'ewjfpk
+ekfpj
+;lophev;
+e'vjhwvd;vl[phwrvdsvl'
+;rh
+

submissions/2018/lovish/d.cpp

@@ -0,0 +1,11 @@
+mkalsdk
+saojdadajsd;
+hdaskd
+jhjas'
+kdja
+sdlkewoihfj
+'we'kjfpe
+ofha'
+fkjhpe
+'jhfh'ifheu]foih
+