A Shell Game
#include<bits/stdc++.h>
using namespace std;
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
For(j,m-1) cout<<a[i][j]<<' ';\
cout<<a[i][m]<<endl; \
}
#pragma
#define
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
int x=0,f=1; char ch=getchar();
while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
return x*f;
}
int main()
{
// freopen("A.in","r",stdin);
// freopen(".out","w",stdout);
int n=read(),x=read();
n%=6;
while(n>=1) {
if (n&1) {
if(x==1) x=0;
else if (x==0) x=1;
} else {
if(x==1) x=2;
else if (x==2) x=1;
}--n;
}
cout<<x<<endl;
return 0;
}
B Game of Credit Cards
#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int>
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %I64d\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
For(j,m-1) cout<<a[i][j]<<' ';\
cout<<a[i][m]<<endl; \
}
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
int x=0,f=1; char ch=getchar();
while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
return x*f;
}
char s[10000],s2[10000];
multiset<int> S,S2;
int main()
{
// freopen("B.in","r",stdin);
// freopen(".out","w",stdout);
int n=read();
cin>>s;
Rep(i,n) S.insert(s[i]);
cin>>s2;
Rep(i,n) S2.insert(s2[i]);
int t=0;
Rep(i,n) {
multiset<int>::iterator p=S.upper_bound(s2[i]);
if (p!=S.begin()) {
--p;
++t;
S.erase(p);
}
}
cout<<n-t<<endl;
t=0;
Rep(i,n) {
multiset<int>::iterator p=S2.upper_bound(s[i]);
if (p!=S2.end()) {
++t;
S2.erase(p);
}
}
cout<<t<<endl;
return 0;
}
C Alyona and Spreadsheet
#include<bits/stdc++.h>
using namespace std;
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
For(j,m-1) cout<<a[i][j]<<' ';\
cout<<a[i][m]<<endl; \
}
#pragma
#define
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
int x=0,f=1; char ch=getchar();
while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
return x*f;
}
#define
int l[MAXN];
int up[MAXN],u[MAXN]={};
int main()
{
// freopen("C.in","r",stdin);
// freopen(".out","w",stdout);
int n=read(),m=read();
For(i,n+1) {
For(j,m) {
int p=0;
if (i<=n) p=read();
if (up[j]<=p) {
up[j]=p;
} else {
l[u[j]+1]=max(i-1,l[u[j]+1]);
up[j]=p;
u[j]=i-1;
}
}
}
Fork(i,2,n) l[i]=max(l[i],l[i-1]);
int k=read();
while(k--) {
int L=read(),R=read();
if (l[L]>=R) puts("Yes");
else puts("No");
}
return 0;
}
D Cloud of Hashtags
#include<bits/stdc++.h>
using namespace std;
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
#define
For(j,m-1) cout<<a[i][j]<<' ';\
cout<<a[i][m]<<endl; \
}
#pragma
#define
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
int x=0,f=1; char ch=getchar();
while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
return x*f;
}
int n;
string s[512345];
int main()
{
// freopen("D.in","r",stdin);
// freopen(".out","w",stdout);
cin>>n;
For(i,n) cin>>s[i];
ForD(i,n-1) {
int len=min(s[i+1].length(),s[i].length());
int fl=0;
Rep(j,len) {
if (s[i][j]<s[i+1][j]) {
fl=1;break;
}
if (s[i][j]>s[i+1][j]) {
s[i]=s[i].substr(0,j); fl=-1;break;
}
}
if (!fl) {
s[i]=s[i].substr(0,len);
}
}
For(i,n) cout<<s[i]<<endl;
return 0;
}