From cd3aff3aa5434ba27049f39317a3deb8fdc39a59 Mon Sep 17 00:00:00 2001
From: abhinav vinci <vinciabhinav7@gmail.com>
Date: Mon, 30 Oct 2017 03:06:59 -0700
Subject: [PATCH] Add files via upload

added my solutions to problems with id 600 to 700
---
 641e.cpp             |  89 +++++++++++++++++++++++++++++
 659F.cpp             | 131 +++++++++++++++++++++++++++++++++++++++++++
 659d.cpp             |  68 ++++++++++++++++++++++
 659e.cpp             |  68 ++++++++++++++++++++++
 660d.cpp             | 124 ++++++++++++++++++++++++++++++++++++++++
 665c.cpp             |  50 +++++++++++++++++
 667c.cpp             |  67 ++++++++++++++++++++++
 669c.cpp             |  98 ++++++++++++++++++++++++++++++++
 670c.cpp             |  64 +++++++++++++++++++++
 670d2.cpp            |  97 ++++++++++++++++++++++++++++++++
 672c.cpp             |  75 +++++++++++++++++++++++++
 672c_dp.cpp          |  63 +++++++++++++++++++++
 673c.cpp             |  60 ++++++++++++++++++++
 675c.cpp             |  92 ++++++++++++++++++++++++++++++
 675d_new.cpp         |  80 ++++++++++++++++++++++++++
 676c.cpp             |  89 +++++++++++++++++++++++++++++
 677c.cpp             |  72 ++++++++++++++++++++++++
 678d_matrix_expo.cpp |  94 +++++++++++++++++++++++++++++++
 680c.cpp             | 106 ++++++++++++++++++++++++++++++++++
 681d.cpp             | 129 ++++++++++++++++++++++++++++++++++++++++++
 688v.cpp             |  95 +++++++++++++++++++++++++++++++
 691b.cpp             |  66 ++++++++++++++++++++++
 691d.cpp             |  70 +++++++++++++++++++++++
 23 files changed, 1947 insertions(+)
 create mode 100644 641e.cpp
 create mode 100644 659F.cpp
 create mode 100644 659d.cpp
 create mode 100644 659e.cpp
 create mode 100644 660d.cpp
 create mode 100644 665c.cpp
 create mode 100644 667c.cpp
 create mode 100644 669c.cpp
 create mode 100644 670c.cpp
 create mode 100644 670d2.cpp
 create mode 100644 672c.cpp
 create mode 100644 672c_dp.cpp
 create mode 100644 673c.cpp
 create mode 100644 675c.cpp
 create mode 100644 675d_new.cpp
 create mode 100644 676c.cpp
 create mode 100644 677c.cpp
 create mode 100644 678d_matrix_expo.cpp
 create mode 100644 680c.cpp
 create mode 100644 681d.cpp
 create mode 100644 688v.cpp
 create mode 100644 691b.cpp
 create mode 100644 691d.cpp

diff --git a/641e.cpp b/641e.cpp
new file mode 100644
index 0000000..6c2c273
--- /dev/null
+++ b/641e.cpp
@@ -0,0 +1,89 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+typedef pair<long long int , long long int> P;
+#define mod 1000000007
+#define all(container) container.begin(),container.end()
+#define tr(container,it) for(typeof(container.begin()) it = container.begin();it!=container.end();it++)
+#define sz(a) int((a).size())
+#define pb push_back
+#define CLR(arr) memset(arr, 0, sizeof(arr))
+#define mk make_pair
+#define present(container,x) ((container).find(x) != (container).end())
+#define inf 123456789123456
+#define fs first
+#define sc second
+#define ll long long int
+#define fr(it,st,en) for(it=st;it<en;it++)
+#define NL cout<<"\n";  
+#define INP ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define what_is(x) cout << #x << " = " << x << endl
+// ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
+// ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
+// ll lcm(ll a, ll b) { return a * (b / gcd(a, b)); }
+#define N 234567
+
+// bool compare(P a, P b){ return ((a.first) >  (b.first) ); }
+//ll ord[123456],a[123456],f[123456],p[123456],s[123456];
+// // ll find (ll u ){
+// //     if(p[u]!=u)
+// //         return(find(p[u]));
+// //     return u;
+// // }
+// void  merge (ll u, ll v){
+//     ll y = find(u);
+//     ll yy = find(v);
+//     p[yy] = y;
+//     s[y] = s[yy] + s[y];
+// }
+//std::priority_queue<P, std::vector< P >, decltype(&compare)> pq(&compare);
+
+ll m,mx=-1,i,j,n,tmp,t,val,a,ans,k,cnt = 0 ;
+// ll deg[N],vis[N],v[N],u[N];
+// vector< set < ll> >  g(210);
+// struct sort_pred {
+//     bool operator()(const  ll &left, const ll &right) {
+    	
+//         if(deg[left]%2 != deg[right]%2){
+//         	if(deg[left]%2==1)
+//             return false;
+//             else 
+//             return true;
+// 		}
+//         return ((deg[left]%2 == deg[right]%2 ) && (deg[left] > deg[right]));
+//     }  };
+
+
+map< ll , set < ll > > amp,rmp;
+int main(){
+INP
+freopen("inp.txt","r",stdin);
+cin>>n;
+fr(i,0,n){
+    cin>>a>>t>>val;
+    if(a==1){
+        amp[val].insert(t);
+    }
+    else if(a==2){
+        rmp[val].insert(t);
+    }
+    else{
+        if(amp.find(val) == amp.end()){
+            cout<<"0\n";
+        }
+        else{
+            if(rmp.find(val) == rmp.end()){
+               cout<<amp[val].lower_bound(t) - amp[val].begin()<<endl;
+            }
+            else{
+               cout << (amp[val].lower_bound(t) - amp[val].begin() ) -   (rmp[val].lower_bound(t) - rmp[val].begin() ) << endl;
+            }
+            
+            
+            
+        }
+    }
+}
+return 0;
+}
+
diff --git a/659F.cpp b/659F.cpp
new file mode 100644
index 0000000..018f683
--- /dev/null
+++ b/659F.cpp
@@ -0,0 +1,131 @@
+// avvinci
+#include<bits/stdc++.h>
+using namespace std;
+
+typedef pair<long long int , long long int> P;
+#define mod 1000000007  
+#define all(container) container.begin(),container.end()
+#define tr(container,it) for(typeof(container.begin()) it = container.begin();it!=container.end();it++)
+#define pb push_back
+#define CLR(arr) memset(arr, 0, sizeof(arr))
+#define mk make_pair
+#define present(container,x) ((container).find(x) != (container).end())
+#define inf 123456789123456
+#define fs first
+#define sc second
+#define ll long long int
+#define fr(it,st,en) for(it=st;it<en;it++)
+#define INP ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define ws(x) cout << #x << " = " << x << endl
+#define N 1234
+
+ll b,cnt, m,n,tmp,q,cn,i,j,k,ans,w,w1 ,pos,val,tmp1,f = 0,sz, mrk[N][N],a[N][N],vis[N][N],vis2[N][N];
+struct sort_pred {
+    bool operator()(const  pair< P , ll >   &left, const pair< P , ll >   &right) {
+    	
+    	return left.sc < right.sc ; 
+    }  };
+
+//     struct cmp
+// {
+//     bool operator()(pair< P , ll > a, pair< P , ll > b)
+//     {
+         
+//             return a.sc  < b.sc;
+//     }
+// };
+
+vector< pair< P , ll >  > v,v1,v2;
+
+void dfs( int x ,int y){
+	if(x< 0 || y < 0 || x >=n || y >= m ) return ; 
+	if(vis[x][y] || a[x][y] == 0 ) return ;
+	vis[x][y] = 1;
+	v.pb( mk ( mk(x,y) , a[x][y]) );
+	dfs(x+1,y);
+	dfs(x-1,y);
+	dfs(x,y+1);
+	dfs(x,y-1);
+}
+
+void dfs2( int x , int y  , ll yy){
+		if(x< 0 || y < 0 || x >=n || y >= m ) return ; 
+		if(vis2[x][y] || a[x][y] < yy  ) return ;
+	vis2[x][y] = 1;
+	v2.pb( mk ( mk(x,y) , a[x][y]) );
+	dfs2(x+1,y,yy);
+	dfs2(x-1,y,yy);
+	dfs2(x,y+1,yy);
+	dfs2(x,y-1,yy);
+}
+int main(){
+INP
+if (fopen("inp.txt", "r")) {
+    freopen("myfile.txt","w",stdout);
+    freopen("inp.txt", "r", stdin);
+}
+
+cin>>n>>m>>k;
+fr(i,0,n){
+	fr(j,0,m){
+		cin>>a[i][j];
+		if(a[i][j]!=0)
+			v1.pb(mk( mk(i,j) , a[i][j]));
+	}
+}
+
+sort(all(v1),sort_pred()) ; 
+
+fr(w1,0,v1.size()){
+	i = v1[w1].fs.fs;
+	j = v1[w1].fs.sc;
+	//ws(v1[w1].sc);
+	if(!vis[i][j]){
+		dfs(i,j);
+		sort(all(v),sort_pred()) ; 
+		fr(w,0,v.size()){
+			
+			if(v[w].sc * (v.size() - w ) >= k &&  k%v[w].sc==0){
+			   //  ws(v[w].fs.fs);
+			   //  ws(v[w].fs.sc);
+			   // ws(v[w].sc);
+			    v2.clear();
+			    dfs2(v[w].fs.fs, v[w].fs.sc,v[w].sc);
+			   // ws(v2.size());
+	            if(v2.size()*v[w].sc <  k) continue;
+	            f= 1;
+	            val = v[w].sc;
+	            ll it =0;
+	            while(it < v2.size()){
+	                 mrk[v2[it].fs.fs][v2[it].fs.sc] = 1;
+
+	                 it++;
+	                 if(it * v[w].sc == k ) break;
+	                }
+	                w = v.size();
+				}
+				//a[i][j] =0;
+			}
+			v.clear();
+		}
+	if(f) break;
+}
+
+
+if(!f){
+	cout<<"NO";
+}
+else{
+	cout<<"YES\n";
+	fr(i,0,n){
+		fr(j,0,m){
+			if(mrk[i][j])
+				cout<<val<<" ";
+			else
+				cout<<"0 ";
+		}
+		cout<<"\n";
+	}
+}
+return 0;
+}
\ No newline at end of file
diff --git a/659d.cpp b/659d.cpp
new file mode 100644
index 0000000..5461d4b
--- /dev/null
+++ b/659d.cpp
@@ -0,0 +1,68 @@
+// avvinci
+#include<bits/stdc++.h>
+using namespace std;
+
+typedef pair<long long int , long long int> P;
+#define mod 1000000007  
+#define all(container) container.begin(),container.end()
+#define tr(container,it) for(typeof(container.begin()) it = container.begin();it!=container.end();it++)
+#define pb push_back
+#define CLR(arr) memset(arr, 0, sizeof(arr))
+#define mk make_pair
+#define present(container,x) ((container).find(x) != (container).end())
+#define inf 123456789123456
+#define fs first
+#define sc second
+#define ll long long int
+#define fr(it,st,en) for(it=st;it<en;it++)
+#define INP ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define ws(x) cout << #x << " = " << x << endl
+#define N 123456
+
+ll b,cnt, m,n,tmp,q,cn,i,j,k,ans,pos,val,tmp1,f = 0,a;
+
+int main(){
+INP
+if (fopen("inp.txt", "r")) {
+    freopen("myfile.txt","w",stdout);
+    freopen("inp.txt", "r", stdin);
+}
+
+cin>>m;
+int dir = 1 ;
+int oa ,ob,sa,sb; 
+cin>>sa>>sb;
+cin>>oa>>ob;
+
+fr(i,0,m-1){
+	cin>>a>>b;
+	if(a - oa == 0){
+		if(b > ob){
+			if(dir == 2)
+				ans++;
+			dir  = 1;
+		}
+		if(b < ob){
+			if(dir == 4)
+				ans++;
+			dir =3;
+		}
+	}
+	else{
+		if(a > oa){
+			if(dir == 3)	ans++;
+			dir =2;
+		}
+		else{
+			if(dir ==1 )  ans++;
+			dir =4;
+		}
+	}
+
+	oa =a;
+	ob =b;
+}
+cout<<ans;
+
+return 0;
+}
\ No newline at end of file
diff --git a/659e.cpp b/659e.cpp
new file mode 100644
index 0000000..ec2597a
--- /dev/null
+++ b/659e.cpp
@@ -0,0 +1,68 @@
+// avvinci
+#include<bits/stdc++.h>
+using namespace std;
+
+typedef pair<long long int , long long int> P;
+#define mod 1000000007  
+#define all(container) container.begin(),container.end()
+#define tr(container,it) for(typeof(container.begin()) it = container.begin();it!=container.end();it++)
+#define pb push_back
+#define CLR(arr) memset(arr, 0, sizeof(arr))
+#define mk make_pair
+#define present(container,x) ((container).find(x) != (container).end())
+#define inf 123456789123456
+#define fs first
+#define sc second
+#define ll long long int
+#define fr(it,st,en) for(it=st;it<en;it++)
+#define INP ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define ws(x) cout << #x << " = " << x << endl
+#define N 123456
+
+ll b,cnt, m,n,tmp,q,cn,i,j,k,ans ,pos,val,tmp1,f = 0,sz, vis[N];
+vector< vector < ll > > v(N);
+
+void dfs( int ver ,int par){
+	if(vis[ver] == 1) {
+		f= 1;
+		return ; 
+	}
+	vis[ver] = 1;
+	sz++;
+	for(auto & it: v[ver]){
+		if(it == par) continue;
+		dfs(it,ver);
+	}
+
+}
+int main(){
+INP
+if (fopen("inp.txt", "r")) {
+    freopen("myfile.txt","w",stdout);
+    freopen("inp.txt", "r", stdin);
+}
+
+cin>>n>>m;
+fr(i,0,m){
+	cin>>tmp>>tmp1;
+	tmp--; tmp1--;
+	v[tmp].pb(tmp1);
+	v[tmp1].pb(tmp);
+}
+
+fr(i,0,n){
+	if(!vis[i]){
+		dfs(i,-1);
+		//ws(sz);
+		//ws(f);
+		if( !f || sz==1 ){
+			ans++;
+		}
+		f= 0 ;
+		sz = 0;
+	}
+}
+cout<<ans;
+
+return 0;
+}
\ No newline at end of file
diff --git a/660d.cpp b/660d.cpp
new file mode 100644
index 0000000..5cc6526
--- /dev/null
+++ b/660d.cpp
@@ -0,0 +1,124 @@
+// avvinci
+//#include"prettyprint.hpp"
+#include<bits/stdc++.h>
+using namespace std;
+
+typedef pair<long long int , long long int> P;
+#define mod 1000000007  
+#define all(container) container.begin(),container.end()
+#define tr(container,it) for(typeof(container.begin()) it = container.begin();it!=container.end();it++)
+#define pb push_back
+#define CLR(arr) memset(arr, 0, sizeof(arr))
+#define mk make_pair
+#define present(container,x) ((container).find(x) != (container).end())
+#define inf 3234567891
+//#define infl LLONG_MAX
+#define fs first
+#define sc second
+#define ll long long int
+#define fr(it,st,en) for(it=st;it<en;it++)
+#define INP ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define ws(x) cout << #x << " = " << x << endl
+#define sz size()
+#define N 112345
+const long long infl = 1e18+5;
+
+ll m,n,q,cn,i,j,k,w,pos,tmp1,cnt[26],f,sz,mx =-1,tmp,mx1 = -1,val,ans,t,c,sm;
+string a,b;
+vector< char > ans1;
+double d1;
+
+
+
+int main(){
+INP
+if (fopen("inp.txt", "r")) {
+    freopen("myfile.txt","w",stdout);
+    freopen("inp.txt", "r", stdin);
+}
+cin>>a>>b;
+int st = 0 ,en = a.sz , beg =-1,fin =-1;
+fr(i,0,a.sz){
+	cnt[a[i]-'a']++;
+}
+fr(i,0,b.sz){
+	if(cnt[b[i]-'a'] == 0 ){
+			if(beg == -1){
+				beg = i;
+			}
+			fin =i+1;
+	}
+	else{
+		while(a[st]!= b[i] && st < a.sz){
+			st++;
+		}
+		if(st >= a.sz){
+			if(beg == -1){
+				beg = i;
+			}
+
+			fin =i+1;
+		}
+		else
+			cnt[b[i]-'a']--;
+		st++;
+
+	}
+	//ws(st);
+}
+// ws(beg);
+// ws(fin);
+ll len1  = fin -  beg ;
+fr(i,0,b.sz){
+		if( i >= beg  && i < fin) continue;
+			ans1.pb(b[i]);
+}
+///ws(ans1);
+ reverse(all(b));
+// ws(b);
+st = 0 ;en = a.sz ; beg =-1;fin =-1;
+fr(i,0,b.sz){
+	if(cnt[b[i]-'a'] == 0 ){
+			if(beg == -1){
+				beg = i;
+			}
+			fin =i+1;
+	}
+	else{
+		while(a[st]!= b[i] && st < a.sz){
+			st++;
+		}
+		if(st >= a.sz){
+			if(beg == -1){
+				beg = i;
+			}
+
+			fin =i+1;
+		}
+		else
+			cnt[b[i]-'a']--;
+		st++;
+
+	}
+//	ws(st);
+}
+// ws(beg);
+// ws(fin);
+ll len2  = fin -  beg ;
+if(len2  < len1){
+	ans1.clear();
+	fr(i,0,b.sz){
+		if( i >= beg  && i < fin) continue;
+	ans1.pb(b[i]);
+	}
+	reverse(all(ans1));
+}
+fr(i,0,ans1.sz){
+	cout<<ans1[i];
+}
+if(ans1.empty()){
+	cout<<"-";
+}
+
+return 0;
+}
\ No newline at end of file
diff --git a/665c.cpp b/665c.cpp
new file mode 100644
index 0000000..6d4bd0c
--- /dev/null
+++ b/665c.cpp
@@ -0,0 +1,50 @@
+// avvinci
+//#include"prettyprint.hpp"
+#include<bits/stdc++.h>
+using namespace std;
+
+typedef pair<long long int , long long int> P;
+#define mod 1000000007  
+#define all(container) container.begin(),container.end()
+#define tr(container,it) for(typeof(container.begin()) it = container.begin();it!=container.end();it++)
+#define pb push_back
+#define CLR(arr) memset(arr, 0, sizeof(arr))
+#define mk make_pair
+#define present(container,x) ((container).find(x) != (container).end())
+#define inf 3234567891
+//#define infl LLONG_MAX
+#define fs first
+#define sc second
+#define ll long long int
+#define fr(it,st,en) for(it=st;it<en;it++)
+#define INP ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define ws(x) cout << #x << " = " << x << endl
+#define sz size()
+#define N 312345
+const long long infl = 1e18+5;
+
+ll m,n,q,cn,i,j,k,w,pos,tmp1,cnt,f,sz,mx =-1,tmp,mx1 = -1,val,t,c,sm;
+//vector< vector< int > > g(N),ans;
+//int inp[N],vis[N];
+double d1;
+string s;
+int main(){
+INP
+if (fopen("inp.txt", "r")) {
+    freopen("myfile.txt","w",stdout);
+    freopen("inp.txt", "r", stdin);
+}
+cin>>s;
+//cout<<s;
+fr(i,1,s.sz){
+	if(s[i] == s[i-1] ){
+		s[i] = (char) (97+( s[i-1]+1)%26);
+		//ws(s[i]);
+		//ws(s[i+1]);
+		if(i < s.sz-1 && s[i] == s[i+1])
+			s[i] = (char) (97+( s[i+1]+1)%26);
+	}
+}
+cout<<s;
+return 0;
+}
\ No newline at end of file
diff --git a/667c.cpp b/667c.cpp
new file mode 100644
index 0000000..9af57de
--- /dev/null
+++ b/667c.cpp
@@ -0,0 +1,67 @@
+// avvinci
+#include<bits/stdc++.h>
+using namespace std;
+
+typedef pair<long long int , long long int> P;
+#define mod 1000000007  
+#define all(container) container.begin(),container.end()
+#define tr(container,it) for(typeof(container.begin()) it = container.begin();it!=container.end();it++)
+#define pb push_back
+#define CLR(arr) memset(arr, 0, sizeof(arr))
+#define mk make_pair
+#define present(container,x) ((container).find(x) != (container).end())
+#define inf 123456789123456
+#define infl LLONG_MAX
+#define fs first
+#define sc second
+#define ll long long int
+#define fr(it,st,en) for(it=st;it<en;it++)
+#define INP ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define ws(x) cout << #x << " = " << x << endl
+#define N 12345
+
+
+ll b,m,n,q,cn,i,j,k,ans,w,pos,val,tmp1,cnt,f,sz,x,y,mx =-1,tmp,mn=LLONG_MAX,dp[N][4];
+
+string s;
+char c1;
+map< string , int > mp;
+set<string > st;
+void rec(int ind , int stat , string sref){
+	if(ind < 5)
+		return;
+	if(dp[ind][stat]) return; 
+	string stmp  = s.substr(ind,stat);
+	ws(ind);
+	ws(stmp);
+	if(stmp.compare(sref)!=0)
+	{
+		st.insert(stmp);
+		//ws(stmp);
+		rec(ind-3,3,stmp);
+		rec(ind -2 ,2,stmp);
+			dp[ind][stat] = 1;
+	}
+
+	
+
+}
+int main(){
+INP
+if (fopen("inp.txt", "r")) {
+    freopen("myfile.txt","w",stdout);
+    freopen("inp.txt", "r", stdin);
+}
+cin>>s;
+n =s.size();
+rec(n-3, 3 ,"*");
+rec(n-2,2,"*");
+//ws(mp.size());
+cout<<st.size()<<"\n";
+for(auto &it :st){
+	cout<<it<<"\n";
+}
+
+
+return 0;
+}
\ No newline at end of file
diff --git a/669c.cpp b/669c.cpp
new file mode 100644
index 0000000..00901d0
--- /dev/null
+++ b/669c.cpp
@@ -0,0 +1,98 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+typedef pair<long long int , long long int> P;
+#define mod 1000000007
+#define all(container) container.begin(),container.end()
+#define tr(container,it) for(typeof(container.begin()) it = container.begin();it!=container.end();it++)
+#define sz(a) int((a).size())
+#define pb push_back
+#define CLR(arr) memset(arr, 0, sizeof(arr))
+#define mk make_pair
+#define present(container,x) ((container).find(x) != (container).end())
+#define inf 123456789123456
+#define fs first
+#define sc second
+#define ll long long int
+#define fr(it,st,en) for(it=st;it<en;it++)
+#define NL cout<<"\n";  
+#define INP ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define what_is(x) cout << #x << " = " << x << endl
+// ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
+// ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
+// ll lcm(ll a, ll b) { return a * (b / gcd(a, b)); }
+#define N 12345
+
+// bool compare(P a, P b){ return ((a.first) >  (b.first) ); }
+//ll ord[123456],a[123456],f[123456],p[123456],s[123456];
+// // ll find (ll u ){
+// //     if(p[u]!=u)
+// //         return(find(p[u]));
+// //     return u;
+// // }
+// void  merge (ll u, ll v){
+//     ll y = find(u);
+//     ll yy = find(v);
+//     p[yy] = y;
+//     s[y] = s[yy] + s[y];
+// }
+//std::priority_queue<P, std::vector< P >, decltype(&compare)> pq(&compare);
+
+ll m,mx=-1,i,j,n,tmp,ans,q ,a[102][102],t[N],val[N],ind1[N],ind2[N];
+// vector< set < ll> >  g(210);
+// struct sort_pred {
+//     bool operator()(const  ll &left, const ll &right) {
+    	
+//         if(deg[left]%2 != deg[right]%2){
+//         	if(deg[left]%2==1)
+//             return false;
+//             else 
+//             return true;
+// 		}
+//         return ((deg[left]%2 == deg[right]%2 ) && (deg[left] > deg[right]));
+//     }  };
+
+int main(){
+INP
+//freopen("inp.txt","r",stdin);
+cin>>n>>m>>q;
+fr(i,0,q){
+    cin>>t[i]>>ind1[i];
+    if(t[i]==3)
+    {
+        cin>>ind2[i]>>val[i];
+    }
+    
+}
+for(i=q-1;i>=0;i--){
+    if(t[i] == 1){
+        tmp = a[ind1[i]][m];
+        for(j=m;j>=2;j--){
+            a[ind1[i]][j] = a[ind1[i]][j-1];
+            
+        }
+         a[ind1[i]][1] = tmp;
+        
+    }
+    else if(t[i]== 2){
+        tmp = a[n][ind1[i]];
+         for(j=n;j>=2;j--)
+            a[j][ind1[i]] = a[j-1][ind1[i]];
+        a[1][ind1[i]] = tmp;
+    }
+    else{
+    	//what_is(ind1[i]);
+    	//	what_is(ind2[i]);
+    	//		what_is(val[i]);
+        a[ind1[i]][ind2[i]] = val[i];
+    }
+}
+fr(i,1,n+1){
+    fr(j,1,m+1){
+        cout<<a[i][j]<<" ";
+    }
+    NL;
+}
+return 0;
+}
+
diff --git a/670c.cpp b/670c.cpp
new file mode 100644
index 0000000..5cc145e
--- /dev/null
+++ b/670c.cpp
@@ -0,0 +1,64 @@
+// avvinci
+#include<bits/stdc++.h>
+using namespace std;
+
+typedef pair<long long int , long long int> P;
+#define mod 1000000007  
+#define all(container) container.begin(),container.end()
+#define tr(container,it) for(typeof(container.begin()) it = container.begin();it!=container.end();it++)
+#define pb push_back
+#define CLR(arr) memset(arr, 0, sizeof(arr))
+#define mk make_pair
+#define present(container,x) ((container).find(x) != (container).end())
+#define inf 123456789123456
+#define infl LLONG_MAX
+#define fs first
+#define sc second
+#define ll long long int
+#define fr(it,st,en) for(it=st;it<en;it++)
+#define INP ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define ws(x) cout << #x << " = " << x << endl
+#define N 212345
+
+
+ll m,n,q,cn,i,j,k,ans,w,pos,val,tmp1,cnt,f,sz,x,y,mx =-1,tmp,mn=LLONG_MAX,a[N],b[N],c[N],mx1 = -1;
+
+string s;
+map < ll ,ll > mp;
+int main(){
+INP
+if (fopen("inp.txt", "r")) {
+    freopen("myfile.txt","w",stdout);
+    freopen("inp.txt", "r", stdin);
+}
+cin>>n;
+fr(i,0,n)	{
+	cin>>a[i];
+	mp[a[i]]++;
+}
+cin>>m;
+fr(i,0,m)
+	cin>>b[i];
+fr(i,0,m)
+	cin>>c[i];
+
+fr(i,0,m){
+	ll v1 = mp[b[i]];
+
+	if(mx < v1){
+		ll v2 = mp[c[i]];
+		mx  = v1;
+		mx1 =  v2;
+		ans = i ;
+	}
+	else if(mx == v1){
+		ll v2 = mp[c[i]];
+		if(mx1 < v2){
+			mx1 =  v2;
+			ans = i;
+		}
+	}
+}
+cout<<ans +1 ;
+return 0;
+}
\ No newline at end of file
diff --git a/670d2.cpp b/670d2.cpp
new file mode 100644
index 0000000..b9f4469
--- /dev/null
+++ b/670d2.cpp
@@ -0,0 +1,97 @@
+// avvinci
+#include<bits/stdc++.h>
+using namespace std;
+
+typedef pair<long long int , long long int> P;
+#define mod 1000000007  
+#define all(container) container.begin(),container.end()
+#define tr(container,it) for(typeof(container.begin()) it = container.begin();it!=container.end();it++)
+#define pb push_back
+#define CLR(arr) memset(arr, 0, sizeof(arr))
+#define mk make_pair
+#define present(container,x) ((container).find(x) != (container).end())
+#define inf 3234567891
+#define infl LLONG_MAX
+#define fs first
+#define sc second
+#define ll long long int
+#define fr(it,st,en) for(it=st;it<en;it++)
+#define INP ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define ws(x) cout << #x << " = " << x << endl
+#define N 112345
+
+
+ll m,n,q,cn,i,j,k,ans,w,pos,val,tmp1,cnt,f,sz,x,y,mx =-1,tmp,mn=LLONG_MAX,a[N],b[N],c[N],mx1 = -1;
+
+string s,sq;
+char ch;
+list<char> ls;
+
+int main(){
+INP
+if (fopen("inp.txt", "r")) {
+    freopen("myfile.txt","w",stdout);
+    freopen("inp.txt", "r", stdin);
+}
+cin>>n>>m>>k;
+fr(i,0,n)
+{
+	cin>>ch;
+	ls.push_back(ch);
+}
+cin>>sq;
+auto pos = ls.begin();
+advance(pos,k-1);
+fr(i,0,m){
+
+	if(sq[i]=='R') pos++;
+	else if(sq[i]== 'L') pos-- ;
+	else{
+		if( *pos == '('){
+			auto cpos = pos;
+			cpos++;
+			cnt = 1;
+			while(cnt !=0){
+				if(*cpos == ')')
+					cnt--;
+				else 
+					cnt++;
+				auto cc = cpos;
+				cpos++;
+				ls.erase(cc);								
+			}
+
+		}
+		else{
+			auto cpos =pos ;
+			cpos--;
+			cnt =-1;
+			while(cnt !=0){
+				if( *cpos == ')')
+					cnt--;
+				else 
+					cnt++;
+				auto cc = cpos;
+				cpos--;
+				ls.erase(cc);				
+			}
+	
+		}
+
+	auto npos = pos;
+	npos++;
+	if(npos == ls.end()){
+		npos--;
+		npos--;
+	}
+	ls.erase(pos);
+	pos =npos;
+
+	}
+
+}
+
+for(std::list<char>::iterator it1 = ls.begin(); it1 != ls.end(); it1++)
+cout<<*it1;
+return 0;
+}
\ No newline at end of file
diff --git a/672c.cpp b/672c.cpp
new file mode 100644
index 0000000..6979541
--- /dev/null
+++ b/672c.cpp
@@ -0,0 +1,75 @@
+// avvinci
+#include<bits/stdc++.h>
+using namespace std;
+
+typedef pair<long long int , long long int> P;
+#define mod 1000000007  
+#define all(container) container.begin(),container.end()
+#define tr(container,it) for(typeof(container.begin()) it = container.begin();it!=container.end();it++)
+#define pb push_back
+#define CLR(arr) memset(arr, 0, sizeof(arr))
+#define mk make_pair
+#define present(container,x) ((container).find(x) != (container).end())
+#define inf 3234567891
+//#define infl LLONG_MAX
+
+#define fs first
+#define sc second
+#define ll long long int
+#define fr(it,st,en) for(it=st;it<en;it++)
+#define INP ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define ws(x) cout << #x << " = " << x << endl
+#define N 112345
+
+ const long long infl = 1e18+5;
+ll m,n,q,cn,i,j,k,w,pos,tmp1,cnt,f,sz,mx =-1,tmp,x[N],y[N],mx1 = -1;
+ll ax,ay,tx,ty,bx,by;
+double sm = 0 ,val,da[N],dbp[N],dbs[N],ans;
+double dist( ll x1 ,ll y1 ,ll x2 , ll y2){
+	double ff = (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2);
+	return sqrt(ff);
+}
+int main(){
+INP
+if (fopen("inp.txt", "r")) {
+    freopen("myfile.txt","w",stdout);
+    freopen("inp.txt", "r", stdin);
+}
+cin>>ax>>ay>>bx>>by>>tx>>ty;
+cin>>n;
+fr(i,1,n+1)
+{
+	cin>>x[i]>>y[i];
+	val = dist(tx,ty,x[i],y[i]);
+	sm += val;
+	da[i] = dist(ax,ay,x[i],y[i]) - val;
+	dbs[i] = dist(bx,by,x[i],y[i]) - val ;
+	dbp[i] = dbs[i];
+
+}
+sm = sm*2;
+dbp[0] = infl;
+dbs[n+1] = infl;
+
+fr(i,1,n+1) {
+	dbp[i] = min(dbp[i],dbp[i-1]);
+
+}
+ans = sm + dbp[n];
+
+for(i =n ;i >=1;i--)
+	dbs[i] = min(dbs[i],dbs[i+1]);
+
+fr(i,1,n+1){
+	ans = min(ans , sm + min(0.0 , da[i]+min(dbp[i-1], dbs[i+1])));
+}
+ cout<<fixed<<setprecision(12);
+cout<<ans;
+
+
+
+
+
+
+return 0;
+}
\ No newline at end of file
diff --git a/672c_dp.cpp b/672c_dp.cpp
new file mode 100644
index 0000000..648b916
--- /dev/null
+++ b/672c_dp.cpp
@@ -0,0 +1,63 @@
+#include <bits/stdc++.h>
+ 
+using namespace std;
+ 
+#define pb push_back
+#define orta (bas + son >> 1)
+#define sag (k + k + 1)
+#define sol (k + k)
+#define endl '\n'
+#define foreach(i,x) for(type(x)i=x.begin();i!=x.end();i++)
+#define FOR(ii,aa,bb) for(int ii=aa;ii<=bb;ii++)
+#define ROF(ii,aa,bb) for(int ii=aa;ii>=bb;ii--)
+#define mp make_pair
+#define nd second
+#define st first
+#define type(x) __typeof(x.begin())
+ 
+typedef pair < int ,int > pii;
+ 
+typedef long long ll;
+ 
+const long long linf = 1e18+5;
+const int mod = (int) 1e9 + 7;
+const int logN = 17;
+const int inf = 1e9;
+const int N = 1e6 + 5;
+ 
+int Kx, Ky, Cx, Cy, Tx, Ty, n, x, y;
+ 
+double pre[N], suff[N], add[N], all;
+ 
+double dist(int x, int y, int a, int b) { return sqrt((ll) (x - a) * (x - a) + (ll) (y - b) * (y - b)); }
+ 
+int main() {
+ if (fopen("inp.txt", "r")) {
+    freopen("myfile.txt","w",stdout);
+    freopen("inp.txt", "r", stdin);
+}
+	scanf("%d %d %d %d %d %d", &Kx, &Ky, &Cx, &Cy, &Tx, &Ty);
+ 
+	scanf("%d", &n);
+ 
+	FOR(i, 1, n) {
+		scanf("%d %d", &x, &y);
+		double add = dist(Tx, Ty, x, y);
+		all += add * 2;
+		suff[i] = pre[i] = dist(Cx, Cy, x, y) - add;
+		::add[i] = dist(Kx, Ky, x, y) - add;
+	}
+ 
+	pre[0] = suff[n+1] = linf;
+	FOR(i, 1, n) { pre[i] = min(pre[i-1], pre[i]); }
+	ROF(i, n, 1) { suff[i] = min(suff[i+1], suff[i]); }
+ 
+	double ans = suff[1] + all;
+ 
+	FOR(i, 1, n) 
+		ans = min(ans, all + min(0.0, min(pre[i-1], suff[i+1])) + add[i]);
+ 
+	printf("%.12lf\n", ans);
+ 
+	return 0;
+}
\ No newline at end of file
diff --git a/673c.cpp b/673c.cpp
new file mode 100644
index 0000000..692014e
--- /dev/null
+++ b/673c.cpp
@@ -0,0 +1,60 @@
+// avvinci
+//#include"prettyprint.hpp"
+#include<bits/stdc++.h>
+using namespace std;
+
+typedef pair<long long int , long long int> P;
+#define mod 1000000007  
+#define all(container) container.begin(),container.end()
+#define tr(container,it) for(typeof(container.begin()) it = container.begin();it!=container.end();it++)
+#define pb push_back
+#define CLR(arr) memset(arr, 0, sizeof(arr))
+#define mk make_pair
+#define present(container,x) ((container).find(x) != (container).end())
+#define inf 3234567891
+//#define infl LLONG_MAX
+#define fs first
+#define sc second
+#define ll long long int
+#define fr(it,st,en) for(it=st;it<en;it++)
+#define INP ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define ws(x) cout << #x << " = " << x << endl
+#define sz size()
+#define N 1002
+const long long infl = 1e18+5;
+
+ll m,n,q,cn,i,j,k,w,pos,tmp1,sz,mx =-1,tmp,mx1 = -1,val,sm,a,b,c,d,mn = infl ,cnt,k1;
+//vector< vector< int > > g(N);
+int cons[N][N] ,dp[N][N][11],ans;
+double d1;
+string s,t;
+
+int main(){
+INP
+if (fopen("inp.txt", "r")) {
+    freopen("myfile.txt","w",stdout);
+    freopen("inp.txt", "r", stdin);
+}
+cin>>n>>m>>k1;
+cin>>s;
+cin>>t;
+fr(i,1,n+1){
+	fr(j,1,m+1){
+		if(s[i-1] == t[j-1])
+			cons[i][j] = cons[i-1][j-1]+1;		
+
+	}
+}
+
+fr(k,1,k1+1){
+	fr(i,1,n+1){
+		fr(j,1,m+1){
+			int len = cons[i][j];
+			dp[i][j][k] = max (max(dp[i-1][j][k] , dp[i][j-1][k]) , dp[i-len][j-len][k-1] + len );
+			ans = max(ans,dp[i][j][k]);
+		}
+	}
+}
+cout<<ans;
+return 0;
+}
\ No newline at end of file
diff --git a/675c.cpp b/675c.cpp
new file mode 100644
index 0000000..a396c02
--- /dev/null
+++ b/675c.cpp
@@ -0,0 +1,92 @@
+// avvinci
+#include"prettyprint.hpp"
+#include<bits/stdc++.h>
+using namespace std;
+
+typedef pair<long long int , long long int> P;
+#define mod 1000000007  
+#define all(container) container.begin(),container.end()
+#define tr(container,it) for(typeof(container.begin()) it = container.begin();it!=container.end();it++)
+#define pb push_back
+#define CLR(arr) memset(arr, 0, sizeof(arr))
+#define mk make_pair
+#define present(container,x) ((container).find(x) != (container).end())
+#define inf 3234567891
+//#define infl LLONG_MAX
+#define fs first
+#define sc second
+#define ll long long int
+#define fr(it,st,en) for(it=st;it<en;it++)
+#define INP ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define ws(x) cout << #x << " = " << x << endl
+#define N 112345
+const long long infl = 1e18+5;
+
+ll m,n,q,cn,i,j,k,w,pos,tmp1,cnt,f,sz,mx =-1,tmp,x,y,mx1 = -1,val,inp[N];
+struct node {
+	ll lt; 
+	ll rt;
+	ll val;
+}a[N];
+ll t= 1;
+map < ll ,ll > mp;
+int main(){
+INP
+if (fopen("inp.txt", "r")) {
+    freopen("myfile.txt","w",stdout);
+    freopen("inp.txt", "r", stdin);
+}
+cin>>n;
+
+fr(i,0,n)	{
+	cin>>inp[i];
+}
+
+
+
+a[0].val = inp[0];
+a[0].lt = -1;
+a[0].rt  = - 1;
+
+
+fr(i,1,n){
+
+	ll st = 0;
+	while(1){
+	//	ws(st);
+
+		if(inp[i] < a[st].val){
+			if(a[st].lt !=-1)
+				st = a[st].lt;
+			else{
+				a[st]. lt = t++;
+				break;
+			}
+		}
+		else{
+			if(a[st].rt !=-1)
+				st = a[st].rt;
+			else{
+				a[st].rt =t++;
+				break;
+			}
+
+		}
+	}
+	a[t-1].val = inp[i];
+	a[t-1].lt = -1;
+	a[t-1].rt = -1;
+	mp[inp[i]] = st;
+
+
+
+}
+ws(mp);
+fr(i,1,n){
+	cout<< inp[ mp[inp[i]] ] <<" ";
+}
+
+
+
+return 0;
+}
\ No newline at end of file
diff --git a/675d_new.cpp b/675d_new.cpp
new file mode 100644
index 0000000..f0bff26
--- /dev/null
+++ b/675d_new.cpp
@@ -0,0 +1,80 @@
+// avvinci
+#include<bits/stdc++.h>
+using namespace std;
+
+typedef pair<long long int , long long int> P;
+#define mod 1000000007  
+#define all(container) container.begin(),container.end()
+#define tr(container,it) for(typeof(container.begin()) it = container.begin();it!=container.end();it++)
+#define pb push_back
+#define CLR(arr) memset(arr, 0, sizeof(arr))
+#define mk make_pair
+#define present(container,x) ((container).find(x) != (container).end())
+#define inf 3123456789
+#define  infn -3123456789
+//#define infl LLONG_MAX
+#define fs first
+#define sc second
+#define ll long long int
+#define fr(it,st,en) for(it=st;it<en;it++)
+#define INP ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define ws(x) cout << #x << " = " << x << endl
+#define N 112345
+const long long infl = 1e18+5;
+
+ll m,n,q,cn,i,j,k,w,pos,tmp1,cnt,f,sz,mx =-1,tmp,x,y,mx1 = -1,val,inp[N];
+ll t= 1;
+map < P , ll  > mp;
+set<ll> s;
+int main(){
+INP
+if (fopen("inp.txt", "r")) {
+    freopen("myfile.txt","w",stdout);
+    freopen("inp.txt", "r", stdin);
+}
+cin>>n;
+
+fr(i,0,n)	{
+	cin>>inp[i];
+}
+
+s.insert(inp[0]);
+mp[mk(inp[0],inf)] = inp[0];
+mp[mk( infn,inp[0])] = inp[0];
+
+ll lt,rt;
+fr(i,1,n){
+	s.insert(inp[i]);
+	auto it  = s.find(inp[i]);
+	if(it == s.begin())
+		lt = infn;
+	else{
+		it--;
+		lt  = *it;
+		it++;
+	}
+	it++; 
+	if(it == s.end())
+		rt = inf ;
+	else
+		rt  = *it;
+	// ws(lt);
+	// ws(rt);
+	val  = mp[ mk ( lt,rt )];
+	map < P , ll  >::iterator it1 = mp.find(mk(lt,rt));
+	   assert(it1!=mp.end());
+	cout<< val<<" ";
+	mp[mk(lt,inp[i])]  = inp[i];
+	mp[mk(inp[i] ,rt)] = inp[i];
+
+	mp.erase(it1);
+
+
+}
+
+
+
+
+
+return 0;
+}
\ No newline at end of file
diff --git a/676c.cpp b/676c.cpp
new file mode 100644
index 0000000..5262893
--- /dev/null
+++ b/676c.cpp
@@ -0,0 +1,89 @@
+// avvinci
+#include<bits/stdc++.h>
+using namespace std;
+
+typedef pair<long long int , long long int> P;
+#define mod 1000000007  
+#define all(container) container.begin(),container.end()
+#define tr(container,it) for(typeof(container.begin()) it = container.begin();it!=container.end();it++)
+#define pb push_back
+#define CLR(arr) memset(arr, 0, sizeof(arr))
+#define mk make_pair
+#define present(container,x) ((container).find(x) != (container).end())
+#define inf 3234567891
+//#define infl LLONG_MAX
+#define fs first
+#define sc second
+#define ll long long int
+#define fr(it,st,en) for(it=st;it<en;it++)
+#define INP ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define ws(x) cout << #x << " = " << x << endl
+#define N 112345
+const long long infl = 1e18+5;
+
+ll m,n,q,cn,k,w,pos,tmp1,cnt,f,sz,mx =-1,tmp,x,y,mx1 = -1,val,inp[N];
+string s;
+
+
+int ok(ll len){
+	ll i,j ;
+	 ll c1 =0 ,c2 = 0;	
+
+	fr(i,0,len){
+		if(s[i] == 'a')
+				c1++;
+			else
+				c2++;
+		
+
+	}
+	if(min(c1,c2 ) <= k)
+			return 1;
+	fr(i,len,n){
+
+		if(s[i] == 'a')
+			c1++;
+		else
+			c2++;
+		if(s[i-len] == 'a')
+			c1--;
+		else
+			c2--;
+		if(min(c1,c2 ) <= k)
+			return 1;
+			
+
+
+	}
+	return 0 ;
+}
+int main(){
+INP
+if (fopen("inp.txt", "r")) {
+    freopen("myfile.txt","w",stdout);
+    freopen("inp.txt", "r", stdin);
+}
+cin>>n>>k;
+cin>>s;
+
+
+ll low =1 , high = n ,mid ,ans  =-1;
+
+while(low <= high){
+
+	mid = low + (high-low)/2;
+
+	if(ok(mid)){
+		ans =mid;
+		low = mid+1;
+	}
+	else
+	{
+		high = mid-1;
+	}
+	//ws(mid);
+}
+cout<<ans;
+
+return 0;
+}
\ No newline at end of file
diff --git a/677c.cpp b/677c.cpp
new file mode 100644
index 0000000..83463c2
--- /dev/null
+++ b/677c.cpp
@@ -0,0 +1,72 @@
+// avvinci
+//#include"prettyprint.hpp"
+#include<bits/stdc++.h>
+using namespace std;
+
+typedef pair<long long int , long long int> P;
+#define mod 1000000007  
+#define all(container) container.begin(),container.end()
+#define tr(container,it) for(typeof(container.begin()) it = container.begin();it!=container.end();it++)
+#define pb push_back
+#define CLR(arr) memset(arr, 0, sizeof(arr))
+#define mk make_pair
+#define present(container,x) ((container).find(x) != (container).end())
+#define inf 3234567891
+//#define infl LLONG_MAX
+#define fs first
+#define sc second
+#define ll long long int
+#define fr(it,st,en) for(it=st;it<en;it++)
+#define INP ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define ws(x) cout << #x << " = " << x << endl
+#define N 112345
+const long long infl = 1e18+5;
+
+ll m,n,q,cn,i,j,k,w,pos,tmp1,cnt,f,sz,mx =-1,tmp,x,y,mx1 = -1,val,inp[N],ans=1;
+
+string s;
+int main(){
+INP
+if (fopen("inp.txt", "r")) {
+    freopen("myfile.txt","w",stdout);
+    freopen("inp.txt", "r", stdin);
+}
+cin>>s;
+
+for(  ll i= 0 ; i< s.size() ; i++){
+		if(s[i] >= 48 && s[i] <= 57){
+			val = s[i] - 48;
+		}
+		else if( s[i] >= 65 && s[i]<=90){
+			val = s[i]-'A' +10;
+
+		}
+		else if( s[i] >= 97 && s[i]<=122){
+			val = s[i] -'a' + 36;
+
+		}
+		else if(s[i] == '-'){
+			val =62 ;
+		}
+		else if(s[i] == '_'){
+				val =63;
+		}
+		//ws(val);
+
+		for(  ll it1= 0 ; it1< 6 ; it1++){
+			int vv= val & (1<<it1) ;
+				//ws(vv);
+				if(vv == 0){
+
+					ans = (ans*3 )%mod;
+				}
+
+
+		}
+
+}
+cout<<ans;
+
+
+return 0;
+}
\ No newline at end of file
diff --git a/678d_matrix_expo.cpp b/678d_matrix_expo.cpp
new file mode 100644
index 0000000..95a3b45
--- /dev/null
+++ b/678d_matrix_expo.cpp
@@ -0,0 +1,94 @@
+// avvinci
+//#include"prettyprint.hpp"
+#include<bits/stdc++.h>
+using namespace std;
+
+typedef pair<long long int , long long int> P;
+#define mod 1000000007 
+#define MOD 1000000007
+#define all(container) container.begin(),container.end()
+#define tr(container,it) for(typeof(container.begin()) it = container.begin();it!=container.end();it++)
+#define pb push_back
+#define CLR(arr) memset(arr, 0, sizeof(arr))
+#define mk make_pair
+#define present(container,x) ((container).find(x) != (container).end())
+#define inf 3234567891
+//#define infl LLONG_MAX
+#define fs first
+#define sc second
+#define ll long long int
+#define fr(it,st,en) for(it=st;it<en;it++)
+#define INP ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define ws(x) cout << #x << " = " << x << endl
+#define sz size()
+#define N 300005
+const long long infl = 1e18+5;
+
+ll m,n,q,cn,k,w,pos,tmp1,sz,mx =-1,tmp,mx1 = -1,val,sm,a,b,c,d,mn = infl ,cnt=1,k1,ans,p,x;
+//vector< vector< int > > g(N);
+//ll cons[N][N] ,dp[N][N][11];
+double d1;
+//string s,t;
+void mul(ll mat[2][2] ,ll m2 [2][2]){
+		ll res[2][2];
+	int i,j,k;
+	fr(i,0,2){
+		fr(j,0,2){
+			res[i][j] = 0;
+			fr(k,0,2){
+				res[i][j] =  (res[i][j] + (mat[i][k]*m2[k][j])%mod)%mod ; 
+			}
+
+		}
+	}
+ 	fr(i,0,2)
+		fr(j,0,2)
+			mat[i][j] =res[i][j];
+
+}
+ void powmod( ll mat[2][2] , ll p1 ){
+ 	 ll res[2][2];
+ 	int i,j;
+ 	res[0][0] = 1LL;
+ 	 res[1][1] =1LL;
+ 	res[0][1] = 0LL;
+ 	res[1][0] = 0LL; 
+
+ 	while(p1 > 0 ){
+ 		if(p1 & 1){
+ 			mul(res,mat);
+ 			
+ 		}
+ 		mul(mat,mat);
+ 		p1 /=2;
+ 	}
+ 	fr(i,0,2)
+ 		fr(j,0,2)
+ 			mat[i][j] =res[i][j];
+
+
+ }
+
+
+int main(){
+INP
+if (fopen("inp.txt", "r")) {
+    freopen("myfile.txt","w",stdout);
+    freopen("inp.txt", "r", stdin);
+}
+cin>>a>>b>>n>>x;
+ll mat[2][2];
+mat[0][0] =a;
+mat[0][1] =b;
+mat[1][0] = 0;
+mat[1][1] =1;
+
+powmod(mat ,n);
+
+cout << ((mat[0][0]*x)%mod  + mat[0][1]) %mod ; 
+
+
+
+
+return 0;
+}
\ No newline at end of file
diff --git a/680c.cpp b/680c.cpp
new file mode 100644
index 0000000..21ffd58
--- /dev/null
+++ b/680c.cpp
@@ -0,0 +1,106 @@
+// avvinci
+//#include"prettyprint.hpp"
+#include<bits/stdc++.h>
+using namespace std;
+
+typedef pair<long long int , long long int> P;
+#define mod 1000000007  
+#define all(container) container.begin(),container.end()
+#define tr(container,it) for(typeof(container.begin()) it = container.begin();it!=container.end();it++)
+#define pb push_back
+#define CLR(arr) memset(arr, 0, sizeof(arr))
+#define mk make_pair
+#define present(container,x) ((container).find(x) != (container).end())
+#define inf 3234567891
+//#define infl LLONG_MAX
+#define fs first
+#define sc second
+#define ll long long int
+#define fr(it,st,en) for(it=st;it<en;it++)
+#define INP ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define ws(x) cout << #x << " = " << x << endl
+#define sz size()
+#define N 312345
+const long long infl = 1e18+5;
+
+ll m,n,q,cn,i,j,k,w,pos,tmp1,cnt,f,sz,mx =-1,tmp,mx1 = -1,val,t,c,sm;
+//vector< vector< int > > g(N),ans;
+//int inp[N],vis[N];
+vector< int > ans;
+double d1;
+string s;
+bool pr[110];
+void prim(){
+
+	for(  ll it= 1 ; it< 101 ; it++){
+			pr[it] = true;
+	}
+	pr[2] = true;
+	int it1 =2;
+while(it1 < 101){
+	if(pr[it1]){
+		ans.pb(it1);
+		for(  ll it= 2*it1 ; it< 101 ; it += it1){
+			pr[it] = false;
+		}
+	
+	}
+	it1++;
+		
+}
+
+
+}
+int main(){
+
+prim();
+fr(i,0,5){
+	cout<<ans[i]<<endl;
+	fflush(stdout);
+	cin>>s;
+	if(s == "yes"){
+		f=i+1;
+		break;
+	}
+}
+int cf  = ans[f-1];
+
+if(f==0){
+	cout<<"prime"<<endl;
+	fflush(stdout);
+}
+else{
+	if(cf*cf <  101){
+		cout<<cf*cf<<endl;
+		fflush(stdout);
+		cin>>s;
+		if(s == "yes"){
+		f=i+1;
+	cout<<"composite"<<endl;
+	fflush(stdout);
+	return 0 ;
+	}
+	}
+	
+	
+	fr(i,f,100){
+	cout<<ans[i]<<endl;
+	fflush(stdout);
+	cin>>s;
+	if(s == "yes"){
+		f=i+1;
+	cout<<"composite"<<endl;
+	fflush(stdout);
+	return 0 ;
+	}
+	if(cf*ans[i] > 100){
+			cout<<"prime"<<endl;
+			fflush(stdout);
+			return 0 ;
+	}
+		
+	}
+
+}
+return 0;
+}
diff --git a/681d.cpp b/681d.cpp
new file mode 100644
index 0000000..eb10a5f
--- /dev/null
+++ b/681d.cpp
@@ -0,0 +1,129 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+typedef pair<long long int , long long int> P;
+#define mod 1000000007
+#define all(container) container.begin(),container.end()
+#define tr(container,it) for(typeof(container.begin()) it = container.begin();it!=container.end();it++)
+#define sz(a) int((a).size())
+#define pb push_back
+#define CLR(arr) memset(arr, 0, sizeof(arr))
+#define mk make_pair
+#define present(container,x) ((container).find(x) != (container).end())
+#define inf 123456789123456
+#define fs first
+#define sc second
+#define ll long long int
+#define fr(it,st,en) for(it=st;it<en;it++)
+#define NL cout<<"\n";  
+#define INP ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define what_is(x) cout << #x << " = " << x << endl
+// ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
+// ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
+// ll lcm(ll a, ll b) { return a * (b / gcd(a, b)); }
+#define N 123456
+
+// bool compare(P a, P b){ return ((a.first) >  (b.first) ); }
+//ll ord[123456],a[123456],f[123456],p[123456],s[123456];
+// // ll find (ll u ){
+// //     if(p[u]!=u)
+// //         return(find(p[u]));
+// //     return u;
+// // }
+// void  merge (ll u, ll v){
+//     ll y = find(u);
+//     ll yy = find(v);
+//     p[yy] = y;
+//     s[y] = s[yy] + s[y];
+// }
+//std::priority_queue<P, std::vector< P >, decltype(&compare)> pq(&compare);
+
+ll m,mx=-1,i,j,n,tmp,p,q,cnt,vis[N],cmp[N],mrk[N],inp[N],pm;
+ vector< vector < ll> >  g(N);
+// struct sort_pred {
+//     bool operator()(const  ll &left, const ll &right) {
+    	
+//         if(deg[left]%2 != deg[right]%2){
+//         	if(deg[left]%2==1)
+//             return false;
+//             else 
+//             return true;
+// 		}
+//         return ((deg[left]%2 == deg[right]%2 ) && (deg[left] > deg[right]));
+//     }  };
+vector< vector < ll > > v(N),v1(N),vr(N);
+vector< ll > ans;
+void dfs(ll u , ll dc){
+    if(vis[u])  return;
+    vis[u] = 1;
+    cmp[u] = dc;
+    if(mrk[u])
+    vr[cmp[u]].pb(u);
+    for(auto &it:g[u]){
+        dfs(it,dc);
+    }
+    if(mrk[u])
+    v[cmp[u]].pb(u);
+}
+int main(){
+INP
+freopen("inp.txt","r",stdin);
+cin>>n>>m;
+fr(i,0,m){
+    cin>>p>>q;
+    g[p].pb(q);
+    
+}
+
+fr(i,0,n){
+	cin>>tmp;
+	if(mrk[tmp]==0)
+	pm++;
+	mrk[tmp] =1;
+	
+	inp[i] =tmp;
+//	v1[cmp[tmp]].insert(tmp);
+}
+
+fr(i,1,n+1){
+    if(!vis[i]){
+        dfs(i,cnt++);
+    }
+   // v1[cmp[i]].pb(i);
+    
+}
+fr(i,0,n){
+	if(!v1[cmp[inp[i]]].empty() ){
+		auto it1  = v1[cmp[inp[i]]].end();
+		it1--;
+		if(*it1 == inp[i])
+			continue;
+	}
+	v1[cmp[inp[i]]].pb(inp[i]);	
+}
+fr(i,0,cnt){
+//	 	what_is(i);
+//	 	for(auto &it : v1[i])
+//   				 cout<<it<<endl;NL;
+//   				  for(auto &it : v[i])
+//   				 cout<<it<<endl;NL;
+//   				 for(auto &it : vr[i])
+//   				 cout<<it<<endl;NL;
+    if(v1[i] == vr[i] ){
+        ans.insert(ans.end(),v[i].begin(), v[i].end());
+    }
+//    else if(v1[i] == vr[i]  ){
+//        ans.insert(ans.end(),v[i].begin(), v[i].end());
+//    }
+   else{
+  
+        cout<<"-1";
+        return 0 ;
+    }
+}
+cout<<pm<<endl;
+for(auto &it : ans)
+    cout<<it<<endl;
+return 0;
+}
+
diff --git a/688v.cpp b/688v.cpp
new file mode 100644
index 0000000..d377895
--- /dev/null
+++ b/688v.cpp
@@ -0,0 +1,95 @@
+// avvinci
+//#include"prettyprint.hpp"
+#include<bits/stdc++.h>
+using namespace std;
+
+typedef pair<long long int , long long int> P;
+#define mod 1000000007 
+#define MOD 1000000007
+#define all(container) container.begin(),container.end()
+#define tr(container,it) for(typeof(container.begin()) it = container.begin();it!=container.end();it++)
+#define pb push_back
+#define CLR(arr) memset(arr, 0, sizeof(arr))
+#define mk make_pair
+#define present(container,x) ((container).find(x) != (container).end())
+#define inf 3234567891
+//#define infl LLONG_MAX
+#define fs first
+#define sc second
+#define ll long long int
+#define fr(it,st,en) for(it=st;it<en;it++)
+#define INP ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define ws(x) cout << #x << " = " << x << endl
+#define sz size()
+#define N 502
+const long long infl = 1e18+5;
+
+ll m,n,q,cn,k,w,pos,tmp1,sz,mx =0,tmp,mx1 = -1,sm,b,c,d,mn = infl ,k1,p,x,i,j,f,cnt,u;
+// vector< vector< int > > g(N),ans(2);
+ int a[N],dp[N][N][N];
+
+// double d1;
+// string s,t;
+set<int >  s;
+int rec(int ind ,int ssum , int tsum){
+	// ws(ind);
+	// ws(ssum);
+	// ws(tsum);
+
+	if( tsum < 0 )	return  0 ;
+
+	if(ind  < 0   ){
+		if( tsum == 0)
+			return 1;
+		else 
+			return 0 ;
+	}
+
+	if(dp[ind][ssum][tsum] != - 1)
+		return dp[ind][ssum][tsum];
+	
+	 dp[ind][ssum][tsum] = max(  rec(ind-1,ssum, tsum) , dp[ind][ssum][tsum]);
+	 dp[ind][ssum][tsum] = max(  rec(ind-1,ssum, tsum - a[ind]) , dp[ind][ssum][tsum]);
+	 dp[ind][ssum][tsum] = max(  rec(ind-1,ssum + a[ind] , tsum - a[ind]) , dp[ind][ssum][tsum]);
+
+	 return dp[ind][ssum][tsum] ;
+
+
+}
+int main(){
+INP
+if (fopen("inp.txt", "r")) {
+    freopen("myfile.txt","w",stdout);
+    freopen("inp.txt", "r", stdin);
+}
+cin>>n>>k;
+fr(i,0,n){
+	cin>>a[i];
+}
+
+fr(i,0,n){
+	fr(j,0,k+1){
+		fr(u,0,k+1){
+			dp[i][j][u] = -1;
+		}
+	}
+}
+rec(n-1,0,k);
+
+fr(i,0,n){
+	fr(j,0,k+1){
+		fr(u,0,k+1){
+			if(dp[i][j][u]==1){
+				s.insert(j);
+				s.insert(k-j);
+			}
+		}
+	}
+}
+
+cout<<s.sz<<"\n";
+for(auto it : s)
+	cout << it <<" ";
+
+return 0;
+}
\ No newline at end of file
diff --git a/691b.cpp b/691b.cpp
new file mode 100644
index 0000000..5494ca2
--- /dev/null
+++ b/691b.cpp
@@ -0,0 +1,66 @@
+// avvinci
+#include<bits/stdc++.h>
+using namespace std;
+
+typedef pair<long long int , long long int> P;
+#define mod 1000000007  
+#define all(container) container.begin(),container.end()
+#define tr(container,it) for(typeof(container.begin()) it = container.begin();it!=container.end();it++)
+#define sz(a) int((a).size())
+#define pb push_back
+#define CLR(arr) memset(arr, 0, sizeof(arr))
+#define mk make_pair
+#define present(container,x) ((container).find(x) != (container).end())
+#define inf 123456789123456
+#define fs first
+#define sc second
+#define ll long long int
+#define fr(it,st,en) for(it=st;it<en;it++)
+#define NL cout<<"\n";  
+#define INP ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define ws(x) cout << #x << " = " << x << endl
+//ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
+// ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
+// ll lcm(ll a, ll b) { return a * (b / gcd(a, b)); }
+#define N 1234567
+
+
+ll a,b,t,cnt =1, m,n,tmp,q,cn,i,j,k,ans ,pos,tmp1,f =1;
+
+
+// bool compare(P a, P b)
+// {
+//     return a.fs>b.fs;
+// }
+
+string s;
+std::vector<char> v = {'A','I','H','M','O','o','T','U','V','v','W','w','X','x','Y'};
+
+int main(){
+INP
+if (fopen("inp.txt", "r")) {
+    freopen("myfile.txt","w",stdout);
+    freopen("inp.txt", "r", stdin);
+}
+cin>>s;
+n= s.size();
+fr(i,0,s.size()){
+
+    if(s[i] != s[n-1-i] && !( (s[i]=='b' && s[n-1-i] == 'd') || (s[i]=='d' && s[n-1-i] == 'b') ) && !( (s[i]=='p' && s[n-1-i] == 'q') || (s[i]=='q' && s[n-1-i] == 'p') )  ){
+        f= 0;
+       // ws(i);
+    } 
+    else if(s[i]== s[n-1-i] && (find(all(v),s[i]) == v.end() ) ){
+        f=0;
+    }
+
+
+}
+
+if(f){
+    cout<<"TAK";
+}
+else cout<<"NIE";
+
+return 0;
+}
\ No newline at end of file
diff --git a/691d.cpp b/691d.cpp
new file mode 100644
index 0000000..34132f9
--- /dev/null
+++ b/691d.cpp
@@ -0,0 +1,70 @@
+// avvinci
+#include<bits/stdc++.h>
+using namespace std;
+
+typedef pair<long long int , long long int> P;
+#define mod 1000000007  
+#define all(container) container.begin(),container.end()
+#define tr(container,it) for(typeof(container.begin()) it = container.begin();it!=container.end();it++)
+#define sz(a) int((a).size())
+#define pb push_back
+#define CLR(arr) memset(arr, 0, sizeof(arr))
+#define mk make_pair
+#define present(container,x) ((container).find(x) != (container).end())
+#define inf 123456789123456
+#define fs first
+#define sc second
+#define ll long long int
+#define fr(it,st,en) for(it=st;it<en;it++)
+#define NL cout<<"\n";  
+#define INP ios_base::sync_with_stdio(false);cin.tie(NULL);
+#define ws(x) cout << #x << " = " << x << endl
+#define N 1234567
+
+ll b,cnt, m,n,tmp,q,cn,i,j,k,ans=1 ,pos,val,tmp1,a[N],cmp[N],vis[N];
+
+
+vector < vector < int > >v(N);
+priority_queue< int,  vector<int> , less<int>  > pq [N];
+void dfs(int ver){
+	if(vis[ver] == 1)	return;
+	vis[ver] =1;
+	cmp[ver] = cnt;
+	for(auto &it:v[ver])
+		dfs(it);
+	pq[cnt].push(a[ver]);
+}
+int main(){
+INP
+if (fopen("inp.txt", "r")) {
+    freopen("myfile.txt","w",stdout);
+    freopen("inp.txt", "r", stdin);
+}
+
+cin>>n>>m;
+fr(i,0,n){
+	cin>>a[i];
+}
+fr(i,0,m){
+	cin>>tmp>>tmp1;
+	tmp--;tmp1--;
+	v[tmp].pb(tmp1);
+	v[tmp1].pb(tmp);
+}
+
+fr(i,0,n){
+	if(vis[i] == 0){
+		dfs(i);
+		//ws(i);
+		cnt++;
+
+	}
+}
+fr(i,0,n){
+	ll val = pq[cmp[i]].top();
+	pq[cmp[i]].pop();
+	//ws(val);
+	cout<<val<<" "; 
+}
+return 0;
+}
\ No newline at end of file