text stringlengths 49 983k |
|---|
#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
int main(void)
{
double a, l, x;
while (scanf("%lf %lf %lf", &a, &l, &x) != EOF){
double s = 0, ret = 0;
s = (a + l + l) / 2.0;
ret += sqrt(s * (s - a) * (s - l) * (s - l));
s = (l + l + x) / 2.0;
ret += (sqrt(s * (s - l) * (s - ((l + x) / 2.0)) * (s - ((l + x) / 2.0))) * 2.0);
printf("%.08lf\n", ret);
}
return 0;
} |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
using namespace std;
double heron(double a, double b, double c){
double s = (a + b + c) / 2.0;
return sqrt(s * (s-a) * (s-b) * (s-c));
}
int main(){
double a,l,x;
while(cin >> a >> l >> x) printf("%.6f\n",heron(a,l,l) + heron(l,(l+x)/2.0,(l+x)/2.0)*2.0);
} |
#include <cmath>
#include <iostream>
#include <sstream>
#include <string>
#include <iomanip>
using namespace std;
int main()
{
string s;
while (getline(cin, s)) {
stringstream ss;
ss << s;
int a, l, x;
ss >> a >> l >> x;
auto r = l / 2.0 * sqrt(x * x + 2.0 * l * x) +
a / 4.0 * sqrt(4.0 * l * l - a * a);
cout << setprecision(17) << r << endl;
}
} |
#include<iostream>
#include<iomanip>
#include<cmath>
using namespace std;
double heron(double i, double j, double k){
double s = (i+j+k)/2;
return sqrt(s * (s-i) * (s-j) * (s-k));
}
int main(){
int a, l, x;
while(cin >> a >> l >> x){
cout << fixed << setprecision(10) << heron(a,l,l) + 2*heron(l, (l+x)/2.0, (l+x)/2.0) << endl;
}
return 0;
}
|
#include <iostream>
#include <cmath>
#include <cstdio>
using namespace std;
int main(){
int a,l,x;
while(cin >> a >> l >> x){
double s1,s2,tmp;
tmp = (double)(a + l * 2) / 2;
s1 = sqrt(tmp*(tmp-a)*(tmp-l)*(tmp-l));
tmp = (double)(l + l + x) / 2;
s2 = sqrt(tmp*(tmp-l)*(tmp-(double)(l+x)/2)*(tmp-(double)(l+x)/2));
printf("%.9f\n", s1+s2*2);
}
} |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int main() {
double a, l, x;
while (~scanf("%lf%lf%lf", &a, &l, &x)) {
double s1 = (a + l + l) / 2, s2 = (l + l + x) / 2;
double d = (l + x) / 2;
printf("%.10lf\n", sqrt(s1*(s1 - a)*(s1 - l)*(s1 - l)) + sqrt(s2*(s2 - d)*(s2 - d)*(s2 - l)) * 2);
}
} |
#include <bits/stdc++.h>
using namespace std;
double a,l,x,h,s;int main(){while(cin>>a>>l>>x){h=sqrt(x*x/4+x*l/2);s=l*h+a*sqrt(l*l-a*a/4)/2;printf("%.8f\n",s);}} |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
int a, l, x;
double s(double b, double c)
{
double h = sqrt(c*c-b*b/4);
return b*h/2;
}
void solve()
{
double ans = s(a, l)+2*s(l, (l+x)/2.0);
printf("%.6lf\n", ans);
}
int main()
{
while (cin >> a >> l >> x) solve();
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#define BW(a,x,b) ((a)<=(x)&&(x)<=(b))
#define F first
#define S second
#define INF 1 << 30
typedef pair<int, int> pi;
typedef pair<int, pi> pii;
typedef vector<int> vi;
typedef queue<int> qi;
typedef long long ll;
int main(){
double a, l, x;
while(~scanf("%lf%lf%lf", &a, &l, &x)){
double res = 0;
double s = (a+l+l)/2;
res += sqrt(s*(s-a)*(s-l)*(s-l));
double e = (l+x)/2;
s = (l+e+e)/2;
res += 2*sqrt(s*(s-l)*(s-e)*(s-e));
printf("%lf\n", res);
}
return 0;
} |
#include <iostream>
#include <iomanip>
#include <sstream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <climits>
#include <queue>
#include <set>
#include <map>
#include <valarray>
#include <bitset>
#include <stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef pair<int,int> pii;
const int INF = 1<<29;
const double PI = acos(-1);
const double EPS = 1e-8;
int main() {
double a, l, x;
while(cin>>a>>l>>x) {
double s = (a+l+l)/2;
double S = sqrt(s*(s-a)*(s-l)*(s-l));
x = (l+x)/2;
s = (l+x+x)/2;
S += 2*sqrt(s*(s-l)*(s-x)*(s-x));
printf("%.10f\n", S);
}
} |
#include <iostream>
#include <stdio.h>
#include <cmath>
using namespace std;
void solve()
{
double a, l, x;
while(cin >> a >> l >> x)
{
double s1 = a / 4 * sqrt((a + 2 * l) * (2 * l - a));
double maxS2 = 0;
for(double i = 0.00001; i < 1.0; i += 0.00001)
{
double len1 = i * (l + x);
double len2 = (1.0 - i) * (l + x);
double s = (l + len1 + len2) / 2.0;
if(s * (s - l) * (s - len1) * (s - len2) < 0)
{
continue;
}
else
{
double s2 = sqrt(s * (s - l) * (s - len1) * (s - len2));
if(maxS2 < s2)
{
maxS2 = s2;
}
}
}
printf("%6f\n", s1 + 2 * maxS2);
}
}
int main()
{
solve();
return(0);
} |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
double a, l, x;
while (cin >> a >> l >> x) {
double y = sqrt(l * l - (a / 2) * (a / 2));
double h = (l + x) / 2.;
double z = sqrt(h * h - (l / 2) * (l / 2));
printf("%.10lf\n", a * y / 2. + l * z);
}
return 0;
} |
#define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <cstdio>
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
#include <cctype>
#include <utility>
using namespace std;
typedef long long ll;
typedef pair <int,int> P;
typedef pair <int,P > PP;
int tx[] = {0,1,0,-1};
int ty[] = {-1,0,1,0};
static const double EPS = 1e-8;
int main(){
double a,l,x;
while(~scanf("%lf %lf %lf",&a,&l,&x)){
double s = (a+l+l)/2.0;
double ca = sqrt(s*(s-a)*(s-l)*(s-l));
double res = 0.0;
for(double scale = 0.00001; scale < 1.0; scale += 0.00001){
double e1 = scale * (l+x);
double e2 = (1.0-scale) * (l+x);
double s2 = (e1+e2+l)/2.0;
if(s2*(s2-e1)*(s2-e2)*(s2-l) < 0) continue;
double ca2 = sqrt(s2*(s2-e1)*(s2-e2)*(s2-l));
res=max(ca+ca2+ca2,res);
}
printf("%lf\n",res);
}
} |
#include <iostream>
#include <cstdio>
#include <math.h>
using namespace std;
int main(){
int a,l,x;
while( cin >> a >> l >> x ){
double result = a * sqrt( l*l - a * a / 4.0 ) / 2.0 +
( l * sqrt( ( (l+x) * (l+x) / 4.0 ) - l * l/4.0 ) ) ;
printf("%.10f\n",result);
}
return 0;
} |
#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
double a,l,x;
int main(){
while(cin>>a>>l>>x){
double b=sqrt(l*l-0.25*a*a);
double h=sqrt((2.0*l*x+x*x)*0.25);
printf("%.8f\n",a*b*0.5+l*h);
}
return 0;
} |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define INF 1e8
using namespace std;
bool is_digit(char x){
for(int i=48; i<=57; i++){
if(x == i) return true;
}
return false;
}
int main(){
int n;
cin >> n;
rep(k,n){
string s,t;
cin >> s >> t;
for(int i=s.size()-1; i>=0; i--){
//cout << t << endl;
if(s[i] == 'J') rotate(t.rbegin(),t.rbegin()+1,t.rend());
if(s[i] == 'C') rotate(t.begin(),t.begin()+1,t.end());
if(s[i] == 'E') {
rep(j,t.size()/2){
swap(t[j],t[t.size()-t.size()/2+j]);
}
}
if(s[i] == 'A') reverse(t.begin(),t.end());
if(s[i] == 'P') {
rep(j,t.size()){
if(is_digit(t[j])) {
if(t[j] == 48) t[j] = 57;
else t[j]--;
}
}
}
if(s[i] == 'M') {
rep(j,t.size()){
if(is_digit(t[j])) {
if(t[j] == 57) t[j] = 48;
else t[j]++;
}
}
}
}
cout << t << endl;
}
return 0;
}
|
#include<deque>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<cmath>
#include<cstring>
using namespace std;
int main(){
int i,j,k;
int n;
cin>>n;
for(i=0;i<n;++i){
char s[7],t[26];
cin>>s>>t;
int sln=strlen(s);
int tln=strlen(t);
for(j=sln-1;j>=0;--j){
if(0){
}else if(s[j]=='J'){
char u=t[tln-1];
for(k=tln-1;k>0;--k)
t[k]=t[k-1];
t[0]=u;
}else if(s[j]=='C'){
char u=t[0];
for(k=1;k<tln;++k)
t[k-1]=t[k];
t[tln-1]=u;
}else if(s[j]=='E'){
char u[12];
memcpy(u,t,tln/2*sizeof(char));
memcpy(t,t+(tln+1)/2,tln/2*sizeof(char));
memcpy(t+(tln+1)/2,u,tln/2*sizeof(char));
}else if(s[j]=='A'){
char u[26];
for(k=0;k<tln;++k)
u[k]=t[tln-k-1];
memcpy(t,u,tln*sizeof(char));
}else if(s[j]=='P'){
for(k=0;k<tln;++k){
if(0){
}else if(t[k]=='0'){
t[k]='9';
}else if('1'<=t[k]&&t[k]<='9'){
--t[k];
}
}
}else if(s[j]=='M'){
for(k=0;k<tln;++k){
if(0){
}else if(t[k]=='9'){
t[k]='0';
}else if('0'<=t[k]&&t[k]<='8'){
++t[k];
}
}
}
}
cout<<t<<endl;
}
return 0;
} |
#include <iostream>
#include <string>
#include <deque>
#include <algorithm>
#include <cctype>
using namespace std;
int main(){
int n, m;
for(cin >> n; n--; ){
string cmd, msgstr;
cin >> cmd >> msgstr;
deque<char> msg(msgstr.begin(), msgstr.end());
deque<char>::iterator it1, it2;
for(int i = cmd.size() - 1; i >= 0; --i){
switch(cmd[i]){
case 'J':
msg.push_front( msg.back() );
msg.pop_back();
break;
case 'C':
msg.push_back( msg.front() );
msg.pop_front();
break;
case 'E':
m = msg.size() / 2;
it1 = msg.begin();
it2 = msg.end() - m;
while( m-- ){
swap( *it1++, *it2++ );
}
break;
case 'A':
reverse(msg.begin(), msg.end());
break;
case 'P':
for(it1 = msg.begin(); it1 != msg.end(); ++it1){
if( isdigit(*it1) ){
*it1 = (*it1 == '0' ? '9' : *it1 - 1);
}
}
break;
case 'M':
for(it1 = msg.begin(); it1 != msg.end(); ++it1){
if( isdigit(*it1) ){
*it1 = (*it1 == '9' ? '0' : *it1 + 1);
}
}
break;
}
}
cout << string(msg.begin(), msg.end()) << '\n';
}
} |
// Enjoy your stay.
#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define sec second
#define sz(x) ((int)(x).size())
using namespace std;
typedef istringstream iss;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef stringstream sst;
typedef vector<ll> vi;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(0);
int n;
cin>>n;
while(n--){
string s,t;
cin>>s>>t;
for(int i=sz(s)-1;i>=0;i--){
if(s[i]=='C'){
t = t.substr(1) + t.substr(0,1);
}
if(s[i]=='J'){
t = t.substr(sz(t)-1) + t.substr(0,sz(t)-1);
}
if(s[i]=='E'){
if(sz(t)%2==0){
t = t.substr(sz(t)/2) + t.substr(0,sz(t)/2);
}else{
t = t.substr(sz(t)/2+1) + t.substr(sz(t)/2,1) + t.substr(0,sz(t)/2);
}
}
if(s[i]=='A'){
reverse(t.begin(),t.end());
}
if(s[i]=='M'){
rep(j,sz(t)){
if(t[j]=='9')t[j]='0';
else if(isdigit(t[j]))t[j]++;
}
}
if(s[i]=='P'){
rep(j,sz(t)){
if(t[j]=='0')t[j]='9';
else if(isdigit(t[j]))t[j]--;
}
}
}
cout<<t<<endl;
}
} |
#include<iostream>
#include<algorithm>
#include<cctype>
using namespace std;
void relay(char op, string &s){
}
int main(){
int n;
cin >> n;
while(n-- > 0){
string op, s;
cin >> op >> s;
reverse(op.begin(), op.end());
int len = s.length();
for(char x : op){
if(x == 'J'){
s = s.substr(len-1, 1) + s.substr(0, len-1);
}else if(x == 'C'){
s = s.substr(1) + s.substr(0,1);
}else if(x == 'E'){
if(len % 2 == 1){
s = s.substr(len/2+1) + s[len/2] + s.substr(0, len/2);
}else{
s = s.substr(len/2) + s.substr(0, len/2);
}
}else if(x == 'A'){
reverse(s.begin(), s.end());
}else if(x == 'P'){
for(int i = 0; i < len; i++){
if(isdigit(s[i])) s[i] = '0' + (s[i]-'0'-1+10)%10;
}
}else if(x == 'M'){
for(int i = 0; i < len; i++){
if(isdigit(s[i])) s[i] = '0' + (s[i]-'0'+1)%10;
}
}
}
cout << s << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-11;
const ll mod=1e9+7;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};
int n;
int main(){
cin>>n;
for(int i=0;i<n;i++){
string s,t;
cin>>s>>t;
int m=s.size();
int N=t.size();
for(int j=m-1;j>=0;j--){
string u;
if(s[j]=='J') u=t[N-1]+t.substr(0,N-1);
if(s[j]=='C') u=t.substr(1,N-1)+t[0];
if(s[j]=='E'){
if(N%2==0) u=t.substr(N/2,N/2)+t.substr(0,N/2);
else u=t.substr(N/2+1,N/2)+t[N/2]+t.substr(0,N/2);
}
if(s[j]=='A'){
u=t;
reverse(u.begin(),u.end());
}
if(s[j]=='P'){
u=t;
for(int k=0;k<N;k++) if(isdigit(u[k])){
if(u[k]=='0') u[k]='9';
else u[k]--;
}
}
if(s[j]=='M'){
u=t;
for(int k=0;k<N;k++) if(isdigit(u[k])){
if(u[k]=='9') u[k]='0';
else u[k]++;
}
}
t=u;
}
cout<<t<<endl;
}
}
|
#include "bits/stdc++.h"
using namespace std;
string cj(string s){
string tmp(s.size(),0);
for(int i=0;i<s.size()-1;i++){
tmp[i]=s[i+1];
}
tmp[s.size()-1]=s[0];
return tmp;
}
string cc(string s){
string tmp(s.size(),0);
for(int i=1;i<s.size();i++){
tmp[i]=s[i-1];
}
tmp[0]=s[s.size()-1];
return tmp;
}
string ce(string s){
string tmp(s.size(),0);
for(int i=0;i<s.size()/2;i++){
tmp[i]=s[s.size()-s.size()/2+i];
tmp[s.size()-s.size()/2+i]=s[i];
}
if(s.size()%2==1)tmp[s.size()/2]=s[s.size()/2];
return tmp;
}
string ca(string s){
string tmp(s.size(),0);
for(int i=0;i<s.size();i++){
tmp[i]=s[s.size()-1-i];
}
return tmp;
}
string cp(string s){
for(int i=0;i<s.size();i++){
if(s[i]>='0'&&s[i]<='8'){
int x=s[i]-'0';
x++;
char c=x+'0';
s[i]=c;
}else if(s[i]=='9')s[i]='0';
}
return s;
}
string cm(string s){
for(int i=0;i<s.size();i++){
if(s[i]>='1'&&s[i]<='9'){
int x=s[i]-'0';
x--;
char c=x+'0';
s[i]=c;
}else if(s[i]=='0')s[i]='9';
}
return s;
}
int main(){
int x;
cin>>x;
for(int j=0;j<x;j++){
string ji,s;
cin>>ji>>s;
for(int i=ji.size()-1;i>=0;i--){
if(ji[i]=='J')s=cc(s);
if(ji[i]=='C')s=cj(s);
if(ji[i]=='E')s=ce(s);
if(ji[i]=='A')s=ca(s);
if(ji[i]=='P')s=cm(s);
if(ji[i]=='M')s=cp(s);
}
cout<<s<<endl;
}
} |
#include<iostream>
#include<algorithm>
using namespace std;
string change(string mes, char o)
{
if(o=='A')
{
reverse(mes.begin(),mes.end());
}
if(o=='J')
{
char tmp=mes[mes.size()-1];
mes.erase(mes.size()-1);
mes=tmp+mes;
}
if(o=='M')
{
for(int i=0;i<mes.size();i++)
{
if(mes[i]>='0'&&mes[i]<='9')
{
if(mes[i]=='9')
mes[i]='0';
else
mes[i]++;
}
}
}
if(o=='P')
{
for(int i=0;i<mes.size();i++)
{
if(mes[i]>='0'&&mes[i]<='9')
{
if(mes[i]=='0')
mes[i]='9';
else
mes[i]--;
}
}
}
if(o=='E')
{
int diff=(mes.size()/2.0)+0.9;
for(int i=0;i<mes.size()/2;i++)
{
swap(mes[i],mes[i+diff]);
}
}
if(o=='C')
{
char tmp=mes[0];
mes.erase(0,1);
mes+=tmp;
}
return mes;
}
int main()
{
int n;
cin>>n;
for(;n--;)
{
string order;
string mes;
cin>>order;
cin>>mes;
for(int i=order.size()-1;i>=0;i--)
{
mes=change(mes,order[i]);
}
cout<<mes<<endl;
}
} |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, l, m;
string s, t;
char u, p;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> s;
cin >> t;
l = s.size();
m = t.size();
for (int i = l-1; i >= 0; --i) {
p = s[i];
if (p == 'P') {
for (int j = 0; j < m; ++j) {
if (t[j] == '0') t[j] = '9';
else if ('0' < t[j] && t[j] <= '9') {
t[j] = t[j] - 1;
}
}
} else if (p == 'M') {
for (int j = 0; j < m; ++j) {
if (t[j] == '9') t[j] = '0';
else if ('0' <= t[j] && t[j] < '9') {
t[j] = t[j] + 1;
}
}
} else if (p == 'C') {
u = t[0];
for (int j = 0; j < m-1; ++j) t[j] = t[j+1];
t[m-1] = u;
} else if (p == 'A') {
for (int j = 0; j < m/2; ++j) {
u = t[m-1-j];
t[m-1-j] = t[j];
t[j] = u;
}
} else if (p == 'E') {
for (int j = 0; j < m/2; ++j) {
u = t[m/2+m%2+j];
t[m/2+m%2+j] = t[j];
t[j] = u;
}
} else if (p == 'J') {
u = t[m-1];
for (int j = m-1; j > 0; --j) t[j] = t[j-1];
t[0] = u;
}
// cout << p << " " << t << endl;
}
cout << t << endl;
}
return 0;
} |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int n; cin >> n;
while (n--) {
string s, message; cin >> s >> message;
int msz = message.size();
for (int i = s.size() - 1; i >= 0; --i) {
if (s[i] == 'J') {
message = message[msz - 1] + message.substr(0, msz - 1);
} else if (s[i] == 'C') {
message = message.substr(1, msz - 1) + message[0];
} else if (s[i] == 'E') {
for (int j = 0; j < msz / 2; ++j) swap(message[j], message[j + (msz + 1) / 2]);
} else if (s[i] == 'A') {
reverse(message.begin(), message.end());
} else if (s[i] == 'P') {
for (int j = 0; j < msz; ++j)
if (isdigit(message[j])) message[j] = ((message[j] - '0' + 9) % 10) + '0';
} else if (s[i] == 'M') {
for (int j = 0; j < msz; ++j)
if (isdigit(message[j])) message[j] = ((message[j] - '0' + 1) % 10) + '0';
}
}
cout << message << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
for(int t=0 ; t < n ; t++ ){
string order, s;
cin >> order >> s;
reverse(order.begin(), order.end());
for(int i=0 ; i < order.size() ; i++ ){
char ch = order[i];
if( ch == 'J' ){
rotate( s.begin() , s.begin()+s.size()-1 , s.end() );
}else if( ch == 'C' ){
rotate( s.begin() , s.begin()+1 , s.end() );
}else if( ch == 'E' ){
string a, b, c;
for(int k=0 ; k < s.size()/2 ; k++ ){
a.push_back(s[k]);
}
if( s.size() % 2 == 1 ) b.push_back( s[s.size()/2] );
for(int k = s.size()/2+(s.size()%2?1:0) ; k < s.size() ; k++ ){
c.push_back(s[k]);
}
s = c + b + a;
}else if( ch == 'A' ){
reverse(s.begin(), s.end());
}else if( ch == 'P' ){
for(int k=0 ; k < s.size() ; k++ ){
if( '1' <= s[k] && s[k] <= '9' ) s[k] -= 1;
else if( s[k] == '0' ) s[k] = '9';
}
}else if( ch == 'M' ){
for(int k=0 ; k < s.size() ; k++ ){
if( '0' <= s[k] && s[k] <= '8' ) s[k] += 1;
else if( s[k] == '9' ) s[k] = '0';
}
}
}
cout << s << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
#define FOR for(int k = 0; k < si2; k++)
#define M(a) ('0'<=a&&a<='9')?(a-'0'+1)%10+'0':a
#define P(a) ('0'<=a&&a<='9')?(a-'0'-1+10)%10+'0':a
int main(){
int n, si, si2;
string str, str2, temp;
cin>>n;
for(int i = 0; i < n; i++){
cin>>str>>str2;
si = str.size(); si2 = str2.size();
for(int j = si-1; j >= 0; j--, str2 = temp){
temp.clear();
switch(str[j]){
case 'C':FOR temp += str2[(k+1)%si2]; break;
case 'J':FOR temp += str2[(k-1+si2)%si2]; break;
case 'E':if(si2%2){str2+=str2[si2/2];
FOR temp += str2[(k+(si2+1)/2)%(si2+1)];}
else FOR temp += str2[(k+si2/2)%si2]; break;
case 'A':FOR temp += str2[si2-k-1];break;
case 'M':FOR temp += M(str2[k]); break;
case 'P':FOR temp += P(str2[k]); break;
}
}
cout<<str2<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
vector<char> v;
void C(){
v.push_back(v[0]);
v.erase(v.begin());
}
void J(){
v.insert(v.begin(),v[v.size()-1]);
v.pop_back();
}
void E(){
stack<char> st[2];
for(int i=0;i<v.size()/2;i++){
st[0].push(v[i]);
st[1].push(v[v.size()-1-i]);
}
for(int i=0;i<v.size()/2;i++){
v[i]=st[1].top();
v[v.size()-1-i]=st[0].top();
st[0].pop(),st[1].pop();
}
}
void A(){
stack<char> st;
for(int i=0;i<v.size();i++)st.push(v[i]);
for(int i=0;i<v.size();i++){
v[i]=st.top();
st.pop();
}
}
void M(){
for(int i=0;i<v.size();i++){
if(v[i]>='0'&&v[i]<='9'){
v[i]=((v[i]-'0')+1)%10+'0';
}
}
}
void P(){
for(int i=0;i<v.size();i++){
if(v[i]>='0'&&v[i]<='9'){
v[i]=((v[i]-'0')+9)%10+'0';
}
}
}
int main(){
int n;
string s,q;
cin>>n;
while(n--){
cin>>s>>q;
v.clear();
for(int i=0;i<q.size();i++)v.push_back(q[i]);
for(int i=s.size()-1;i>=0;i--){
if(s[i]=='J')J();
if(s[i]=='C')C();
if(s[i]=='E')E();
if(s[i]=='A')A();
if(s[i]=='P')P();
if(s[i]=='M')M();
}
for(int i=0;i<v.size();i++)cout<<v[i];
cout<<endl;
}
return 0;
} |
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int main() {
int n;
cin>>n;
REP(i,n){
string cmd;
cin>>cmd;
string str;
cin>>str;
reverse(begin(cmd),end(cmd));
for(char c:cmd){
switch(c){
case 'C': {
string body=str.substr(1);
string head=str.substr(0,1);
str = body + head;
break;
}
case 'J': {
string body=str.substr(0,str.size()-1);
string head=str.substr(str.size()-1);
str = head + body;
break;
}
case 'E': {
int mid=str.size()/2;
string fwd=str.substr(0,mid);
string bwd=str.substr(str.size()-mid);
if((str.size()%2)==1){
str=bwd+str[mid]+fwd;
}else{
str=bwd+fwd;
}
break;
}
case 'A': {
reverse(begin(str),end(str));
break;
}
case 'M': {
for(char& d:str){
if('0' <= d && d < '9')
++d;
else if(d == '9')
d = '0';
}
break;
}
case 'P': {
for(char& c:str){
if('0' < c && c <= '9')
--c;
else if(c == '0')
c = '9';
}
break;
}
}
}
cout<<str<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int n;
int main(){
// cin.tie(0);
// ios::sync_with_stdio(false);
cin >> n;
for(int i=0; i<n; ++i){
string s, t;
cin >> t >> s;
for(int j=t.size()-1; j>=0; --j){
if(t[j] == 'J'){
s = s.substr(s.size()-1, 1) + s.substr(0, s.size()-1);
}else if(t[j] == 'C'){
s = s.substr(1, s.size()-1) + s.substr(0, 1);
}else if(t[j] == 'E'){
if(s.size() % 2 == 0){
s = s.substr(s.size()/2, s.size()/2) + s.substr(0, s.size()/2);
}else{
s = s.substr(s.size()/2+1, s.size()/2) + s[s.size()/2] + s.substr(0, s.size()/2);
}
}else if(t[j] == 'A'){
reverse(s.begin(), s.end());
}else if(t[j] == 'P'){
for(int k=0; k<s.size(); ++k){
if('1' <= s[k] && s[k] <= '9')
--s[k];
else if(s[k] == '0')
s[k] = '9';
}
}else{
for(int k=0; k<s.size(); ++k){
if('0' <= s[k] && s[k] <= '8')
++s[k];
else if(s[k] == '9')
s[k] = '0';
}
}
}
cout << s << "\n";
}
}
|
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repp(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
//#define int long long
using namespace std;
string hoge(string m, char c){
int h = m.size() / 2;
int sz = m.size();
string res = "";
if(c == 'J'){
res = m[sz - 1] + m.substr(0, sz - 1);
}else if(c == 'C'){
res = m.substr(1, sz - 1) + m[0];
}else if(c == 'E'){
rep(i, 0, h){
swap(m[i], m[(sz + 1) / 2 + i]);
}
res = m;
}else if(c == 'A'){
res = m;
reverse(all(res));
}else if(c == 'P'){
rep(i, 0, sz){
int tmp = m[i] - '0';
if(0 < tmp && tmp <= 9) m[i] = '0' + tmp - 1;
else if(tmp == 0) m[i] = '9';
}
res = m;
}else if(c == 'M'){
rep(i, 0, sz){
int tmp = m[i] - '0';
if(0 <= tmp && tmp < 9) m[i] = '0' + tmp + 1;
else if(tmp == 9) m[i] = '0';
}
res = m;
}
return res;
}
signed main(){
int n;
cin >> n;
rep(x, 0, n){
string s, m;;
cin >> s >> m;
repb(i, s.size() - 1, 0){
m = hoge(m, s[i]);
}
cout << m << endl;
}
} |
#include<iostream>
#include<algorithm>
using namespace std;
string C(string s){
return s.substr(1)+s[0];
}
string J(string s){
return s[s.length()-1]+s.substr(0,s.length()-1);
}
string E(string s){
if(s.length()%2 == 0){
//even
int half = s.length()/2;
return s.substr(half)+s.substr(0,half);
}else{
//odd
int half = s.length()/2;
return s.substr(half+1)+s[half]+s.substr(0,half);
}
}
string A(string s){
reverse(s.begin(),s.end());
return s;
}
string M(string s){
for(int i = 0; i < s.length(); i++)
if('0' <= s[i] && s[i] < '9') s[i]++;
else if(s[i] == '9') s[i] = '0';
return s;
}
string P(string s){
for(int i = 0; i < s.length(); i++)
if('0' < s[i] && s[i] <= '9') s[i]--;
else if(s[i] == '0') s[i] = '9';
return s;
}
int main(){
int n;
cin >> n;
while(n--){
string s,m;
cin >> s >> m;
for(int i = s.length()-1; i >= 0; i--){
if(s[i] == 'J') m = J(m);
if(s[i] == 'C') m = C(m);
if(s[i] == 'E') m = E(m);
if(s[i] == 'A') m = A(m);
if(s[i] == 'P') m = P(m);
if(s[i] == 'M') m = M(m);
// cout << "m " << m << endl;
}
cout << m << endl;
}
return 0;
} |
#include<iostream>
#include<string>
#include<algorithm>
#include<cctype>
using namespace std;
int main()
{
int n,i,j;
string messenger,m;
cin>>n;
while(n-->0){
cin>>messenger>>m;
for(i=messenger.size();i-->0;){
switch(messenger[i]){
case 'J':
m=m[m.size()-1]+m.substr(0,m.size()-1);
break;
case 'C':
m=m.substr(1,m.size()-1)+m[0];
break;
case 'E':
if(m.size()&1)m=m.substr(m.size()/2+1,m.size()/2)+m[m.size()/2]+m.substr(0,m.size()/2);
else m=m.substr(m.size()/2,m.size()/2)+m.substr(0,m.size()/2);
break;
case 'A':
reverse(m.begin(),m.end());
break;
case 'P':
for(j=0;j<m.size();j++)if(isdigit(m[j]))m[j]=(m[j]-'0'+9)%10+'0';
break;
case 'M':
for(j=0;j<m.size();j++)if(isdigit(m[j]))m[j]=(m[j]-'0'+1)%10+'0';
break;
}
}
cout<<m<<endl;
}
} |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
string cmd_J(string s){
string ret;
for(int i = 1 ; i < (int)(s.size()) ; i++){
ret += s[i];
}
ret += s[0];
return ret;
}
string cmd_C(string s){
string ret;
ret += s[s.size()-1];
for(int i = 0 ; i < (int)(s.size()-1) ; i++){
ret += s[i];
}
return ret;
}
string cmd_E(string s){
string a, b;
if(s.size()%2 == 1){
a = s.substr(0, s.size()/2);
b = s.substr(s.size()/2+1, s.size());
return b+s[s.size()/2]+a;
}
else{
a = s.substr(0, s.size()/2);
b = s.substr(s.size()/2, s.size());
return b+a;
}
}
string cmd_A(string s){
string ret = s;
reverse(ret.begin(), ret.end());
return ret;
}
string cmd_P(string s){
for(int i = 0 ; i < (int)(s.size()) ; i++){
if(isdigit(s[i])){
int a = s[i]-'0';
a++;
if(a == 10) a = 0;
s[i] = a+'0';
}
}
return s;
}
string cmd_M(string s){
for(int i = 0 ; i < (int)(s.size()) ; i++){
if(isdigit(s[i])){
int a = s[i]-'0';
a--;
if(a == -1) a = 9;
s[i] = a+'0';
}
}
return s;
}
int main(){
int n;
cin >> n;
while(n--){
string cmd, message;
cin >> cmd >> message;
for(int i = (int)(cmd.size()-1) ; i >= 0 ; i--){
switch(cmd[i]){
case 'J':
message = cmd_C(message);
break;
case 'C':
message = cmd_J(message);
break;
case 'E':
message = cmd_E(message);
break;
case 'A':
message = cmd_A(message);
break;
case 'P':
message = cmd_M(message);
break;
case 'M':
message = cmd_P(message);
break;
}
}
cout << message << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define MOD 1000000007
#define ALL(a) (a).begin(),(a).end()
#define pb(x) push_back(x)
#define ms(m,v) memset(m,v,sizeof(m))
#define D10 fixed<<setprecision(10)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> P;
typedef long long ll;
struct edge{ int from, to, cost; };
string s, mes;
string solve(string s, char c)
{
if (c == 'C') return s.substr(1) + s[0];
if (c == 'J') return s[s.size() - 1] + s.substr(0, s.size() - 1);
if (c == 'E')
{
if (s.size() % 2 == 0) return s.substr(s.size() / 2, s.size() - 1) + s.substr(0, s.size()/2);
else return s.substr(s.size() / 2 + 1, s.size()) + s[s.size() / 2] + s.substr(0, s.size() / 2);
}
if (c == 'A')
{
string r = "";
REP(i, s.size()) r += s[s.size() - i - 1];
return r;
}
if (c == 'M')
{
string r = "";
REP(i, s.size())
{
if (isdigit(s[i]))
{
if (s[i] == '9') r += '0';
else r += s[i] + 1;
}
else r += s[i];
}
return r;
}
if (c == 'P')
{
string r = "";
REP(i, s.size())
{
if (isdigit(s[i]))
{
if (s[i] == '0') r += '9';
else r += s[i] - 1;
}
else
{
r += s[i];
}
}
return r;
}
}
int main()
{
int n;
cin >> n;
REP(i, n)
{
cin >> mes >> s;
for (int i = mes.size() - 1; i >= 0;i--)
{
s = solve(s, mes[i]);
}
cout << s << endl;
}
} |
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <istream>
#include <sstream>
#include <iomanip>
using namespace std;
typedef ostringstream oss;
typedef istringstream iss;
string J(string str) {
str += str[0];
str.erase(str.begin());
return str;
}
string C(string str) {
str.insert(str.begin(), *(str.rbegin()));
str.erase(str.size() - 1);
return str;
}
string E(string str) {
for (int i = 0; i < str.size() / 2; i++) {
swap(str[i], str[(str.size() + 1) / 2 + i]);
}
return str;
}
string A(string str) {
for (int i = 0; i < str.size() / 2; i++) {
swap(str[i], str[str.size() - 1 - i]);
}
return str;
}
string P(string str) {
for (int i = 0; i < str.size(); i++) {
if (str[i] >= '0' && str[i] <= '8') {
str[i]++;
}else if (str[i] == '9') {
str[i] = '0';
}
}
return str;
}
string M(string str) {
for (int i = 0; i < str.size(); i++) {
if (str[i] >= '1' && str[i] <= '9') {
str[i]--;
}else if (str[i] == '0') {
str[i] = '9';
}
}
return str;
}
struct pFunc
{
pFunc(){}
pFunc(string (*p)(string str)) : f(p) {}
string (*f)(string str);
};
int main(void) {
map<char, pFunc> F;
F['J'] = pFunc(C);
F['C'] = pFunc(J);
F['E'] = pFunc(E);
F['A'] = pFunc(A);
F['P'] = pFunc(M);
F['M'] = pFunc(P);
int N;
cin >> N;
cin.ignore();
for (; N; N--) {
string str, ope;
getline(cin, ope);
getline(cin, str);
for (int i = ope.size() - 1; i >= 0; i--) {
str = F[ope[i]].f(str);
}
cout << str << endl;
}
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(int argc, char const *argv[])
{
string order;
string mess;
int n;
int sz;
cin>>n;
for(int i1=0;i1<n;i1++){
cin>>order;
cin>>mess;
reverse(order.begin(), order.end());
sz=mess.size();
for(int i2=0;i2<order.size();i2++){
if(order[i2]=='J'){
mess=mess[sz-1]+mess.substr(0,sz-1);
}
else if(order[i2]=='C'){
mess=mess.substr(1,sz-1)+mess[0];
}
else if(order[i2]=='E'){
string l,r;
l=mess.substr(0,sz/2);
if(sz%2==0){
r=mess.substr(sz/2,sz/2);
mess=r+l;
}
else {
r=mess.substr(sz/2+1,sz/2);
mess=r+mess[sz/2]+l;
}
}
else if(order[i2]=='A'){
reverse(mess.begin(), mess.end());
}
else if(order[i2]=='P'){
for(int i3=0;i3<sz;i3++){
if(mess[i3]>='1' && mess[i3]<='9') mess[i3]--;
else if(mess[i3]=='0') mess[i3]='9';
}
}
else {// M
for(int i3=0;i3<sz;i3++){
if(mess[i3]>='0' && mess[i3]<='8') mess[i3]++;
else if(mess[i3]=='9') mess[i3]='0';
}
}
}
cout<<mess<<endl;
}
return 0;
} |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
string J(string s) {
string res = s.substr(0, s.size() - 1);
return s[s.size() - 1] + res;
}
string C(string s) {
string res = s.substr(1, s.size() - 1);
return res + s[0];
}
string E(string s) {
int n = s.size();
string s1 = s.substr(0, n / 2);
string s2 = s.substr((n + 1) / 2, n / 2);
if (n % 2) s2 += s[n / 2];
return s2 + s1;
}
string A(string s) {
reverse(s.begin(), s.end());
return s;
}
string P(string s) {
for (int i = 0; i < s.size(); i++) {
if (s[i] >= '0' && s[i] <= '9') {
if (s[i] == '0') s[i] = '9';
else s[i]--;
}
}
return s;
}
string M(string s) {
for (int i = 0; i < s.size(); i++) {
if (s[i] >= '0' && s[i] <= '9') {
if (s[i] == '9') s[i] = '0';
else s[i]++;
}
}
return s;
}
void solve() {
string s1, s2;
cin >> s1 >> s2;
for (int i = s1.size() - 1; i >= 0; i--) {
if (s1[i] == 'J') s2 = J(s2);
else if (s1[i] == 'C') s2 = C(s2);
else if (s1[i] == 'E') s2 = E(s2);
else if (s1[i] == 'A') s2 = A(s2);
else if (s1[i] == 'P') s2 = P(s2);
else s2 = M(s2);
}
cout << s2 << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
for (int i = 0; i < N; i++) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<int, lint> pil;
typedef pair<lint, lint> pll;
template<class T>bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}
template<class T>bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}
constexpr lint mod = 1e9+7;
constexpr lint INF = mod*mod;
constexpr int MAX = 100010;
int main(){
int q;
scanf("%d", &q);
auto f = [](string s, char c){
int K = s.size();
string t;
if(c == 'J') t = s[K-1] + s.substr(0, K-1);
if(c == 'C') t = s.substr(1) + s[0];
if(c == 'E'){
if(K%2 == 0) t = s.substr(K/2) + s.substr(0, K/2);
else t = s.substr((K+1)/2) + s[K/2] + s.substr(0, K/2);
}
if(c == 'A'){
reverse(s.begin(), s.end());
t = s;
}
if(c == 'P'){
t = s;
for(auto &i: t)if(isdigit(i)) i = (i-48-1+10)%10 + 48;
}
if(c == 'M'){
t = s;
for(auto &i: t)if(isdigit(i)) i = (i-48+1)%10 + 48;
}
return t;
};
while(q--){
string t, s;
cin >> t >> s;
reverse(t.begin(), t.end());
for(auto c: t) s = f(s, c);
cout << s << "\n";
}
}
|
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
void Swap(string &s){
for(int i=0;i<s.size()/2;i++){
swap(s[i],s[(s.size()+1)/2+i]);
}
}
void Inc(string &s){
for(int i=0;i<s.size();i++){
if('0'<=s[i] && s[i]<='8')s[i]++;
else if(s[i] == '9')s[i] = '0';
}
}
void Dec(string &s){
for(int i=0;i<s.size();i++){
if('1'<=s[i] && s[i]<='9')s[i]--;
else if(s[i] == '0')s[i] = '9';
}
}
int main(){
int n;
string r,m;
cin >> n;
for(int i=0;i<n;i++){
cin >> r >> m;
for(int i=r.size()-1;i>=0;i--){
if(r[i]=='A')reverse(m.begin(),m.end());
if(r[i]=='C')m = m.substr(1,m.size()-1) + m[0];
if(r[i]=='E')Swap(m);
if(r[i]=='M')Inc(m);
if(r[i]=='J')m = m[m.size()-1] + m.substr(0,m.size()-1);
if(r[i]=='P')Dec(m);
}
cout << m << endl;
}
} |
#include <algorithm>
#include <cctype>
#include <iostream>
#include <string>
using namespace std;
void inv_A ( string& str )
{
reverse( str.begin(), str.end() );
}
void inv_C ( string& str )
{
str = str.substr( 1 ) + str[0];
}
void inv_E ( string& str )
{
int half = str.size() / 2, offset = ( str.size() + 1 ) / 2;
for ( int i = 0; i < half; ++i ) {
swap( str[i], str[i + offset] );
}
}
void inv_J ( string& str )
{
str = str[str.size() - 1 ] + str.substr( 0, str.size() - 1 );
}
void inv_M ( string& str )
{
for ( int i = 0; i < str.size(); ++i ) {
if ( isdigit( str[i] ) ) {
str[i] = '0' + ( str[i] - '0' + 1 ) % 10;
}
}
}
void inv_P ( string& str )
{
for ( int i = 0; i < str.size(); ++i ) {
if ( isdigit( str[i] ) ) {
str[i] = '0' + ( str[i] - '0' + 9 ) % 10;
}
}
}
int main ( void )
{
int n;
cin >> n;
while ( n-- ) {
string order,
message;
cin >> order
>> message;
for ( int i = order.size() - 1; i >= 0; --i ) {
switch ( order[i] ) {
case 'A':
inv_A( message );
break;
case 'C':
inv_C( message );
break;
case 'E':
inv_E( message );
break;
case 'J':
inv_J( message );
break;
case 'M':
inv_M( message );
break;
case 'P':
inv_P( message );
break;
}
// cout << i << ' ' << message << endl;
}
cout << message << endl;
}
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 0
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define each(it,c) for(auto it=(c).begin();it!=(c).end();it++)
#define all(c) c.begin(),c.end()
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9 + 7);
string A(string s) {
reverse(all(s));
return s;
}
string J(string s) {
return s[s.size() - 1] + s.substr(0, s.size() - 1);
}
string M(string s) {
rep(i, 0, s.size()) {
if (isdigit(s[i])) {
s[i] = char((s[i] - '0' + 1 + 10) % 10 + '0');
}
}
return s;
}
string P(string s) {
rep(i, 0, s.size()) {
if (isdigit(s[i])) {
s[i] = char((s[i] - '0' - 1 + 10) % 10 + '0');
}
}
return s;
}
string E(string s) {
int h = s.size() / 2;
if (s.size() % 2)return s.substr(h + 1) + s[h] + s.substr(0, h);
return s.substr(h) + s.substr(0, h);
}
string C(string s) {
return s.substr(1, s.size()) + s[0];
}
signed main() {
int n; cin >> n;
rep(h, 0, n) {
string o; cin >> o;
string m; cin >> m;
rrep(i, 0, o.size()) {
if (o[i] == 'J')m = J(m);
if (o[i] == 'C')m = C(m);
if (o[i] == 'E')m = E(m);
if (o[i] == 'A')m = A(m);
if (o[i] == 'P')m = P(m);
if (o[i] == 'M')m = M(m);
dump(m);
}
cout << m << endl;
}
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int n,i,j,k,orderlen,strlen;
string order,str,tempstr1,tempstr2;
char temp;
cin >> n;
for(i=0;i<n;i++){
cin >> order;
reverse(order.begin(),order.end());
cin >> str;
orderlen=order.size();
strlen=str.size();
for(j=0;j<orderlen;j++){
if(order[j]=='J'){
temp=str[strlen-1];
for(k=strlen-1;k>=1;k--){
str[k]=str[k-1];
}
str[0]=temp;
}
else if(order[j]=='C'){
temp=str[0];
for(k=0;k<strlen-1;k++){
str[k]=str[k+1];
}
str[strlen-1]=temp;
}
else if(order[j]=='E'){
tempstr1=tempstr2="";
for(k=0;k<strlen;k++){
if(k<strlen/2) tempstr1+=str[k];
else tempstr2+=str[k];
}
str="";
str+=tempstr2;
str+=tempstr1;
if(strlen%2==1){
temp=str[0];
for(k=0;k<strlen/2;k++){
str[k]=str[k+1];
}
str[strlen/2]=temp;
}
}
else if(order[j]=='A'){
reverse(str.begin(),str.end());
}
else if(order[j]=='P'){
for(k=0;k<strlen;k++){
if('1'<=str[k]&&str[k]<='9') str[k]-=1;
else if(str[k]=='0') str[k]='9';
}
}else{//M
for(k=0;k<strlen;k++){
if('0'<=str[k]&&str[k]<='8') str[k]+=1;
else if(str[k]=='9') str[k]='0';
}
}
}
cout << str << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
while (n--) {
string ord, s;
cin >> ord >> s;
reverse(begin(ord), end(ord));
for (char c : ord) {
if (c == 'J') {
rotate(begin(s), prev(end(s)), end(s));
} else if (c == 'C') {
rotate(begin(s), next(begin(s)), end(s));
} else if (c == 'E') {
if (s.size() & 1) {
for (int i = 0; i < (int)s.size() / 2; ++i) {
swap(s[i], s[(s.size() + 1) / 2 + i]);
}
} else {
rotate(begin(s), begin(s) + s.size() / 2, end(s));
}
} else if (c == 'A') {
reverse(begin(s), end(s));
} else if (c == 'P') {
for (auto&& e : s) {
if (isdigit(e)) {
e = e == '0' ? '9' : e - 1;
}
}
} else {
assert(c == 'M');
for (auto&& e : s) {
if (isdigit(e)) {
e = e == '9' ? '0' : e + 1;
}
}
}
}
cout << s << '\n';
}
}
|
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<functional>
#include<map>
using namespace std;
int main() {
int a; cin >> a;
for (int b = 0; b < a; b++) {
string c, d; cin >> c >> d;
for (int i = c.length() - 1; i >= 0;i--) {
char e = c[i];
switch (e) {
case 'P':for (int f = 0; f < d.length(); f++) {
if (d[f] == '0')d[f] = '9';
else if (d[f] <= '9')d[f]--;
} break;
case 'M':for (int f = 0; f < d.length(); f++) {
if (d[f] == '9')d[f] = '0';
else if (d[f] <= '9')d[f]++;
} break;
case 'C':d = d.substr(1, d.length() - 1) + d[0]; break;
case 'J':d = d[d.length() - 1] + d.substr(0, d.length() - 1); break;
case 'A': {string f = d;
for (int g = 0; g < d.length(); g++) {
d[g] = f[d.length() - 1 - g];
}
break; }
default: {
if (d.length() & 1)
{
string f = d;
d = "";
d += f.substr(f.length() - f.length() / 2, f.length() / 2);
d += f[f.length() / 2];
d += f.substr(0, f.length() / 2);
}
else {
string f = d;
d = "";
d += f.substr(f.length() - f.length() / 2, f.length() / 2);
d += f.substr(0, f.length() / 2);
}}
}
}
cout << d << endl;
}
} |
#include<iostream>
using namespace std;
string A(string str){
string str1;
for(int i=0;i<str.size();i++) str1+=str[str.size()-i-1];
return str1;
}
string C(string str){
string str1;
for(int i=1;i<str.size();i++) str1+=str[i];
str1+=str[0];
return str1;
}
string J(string str){
string str1;
str1+=str[str.size()-1];
for(int i=0;i<str.size()-1;i++) str1+=str[i];
return str1;
}
string E(string str){
string str1;
int a=0;
if(str.size()%2) a=1;
for(int i=(str.size()/2)+a;i<str.size();i++) str1+=str[i];
if(a==1) str1+=str[str.size()/2],a=0;
for(int i=0;i<(str.size()/2+a);i++) str1+=str[i];
return str1;
}
string M(string str){
string str1;
for(int i=0;i<str.size();i++){
if(str[i]>='0' && str[i]<'9') str[i]++;
else if(str[i]=='9')str[i]='0';
str1+=str[i];
}
return str1;
}
string P(string str){
string str1;
for(int i=0;i<str.size();i++){
if(str[i]>'0' && str[i]<='9') str[i]--;
else if(str[i]=='0') str[i]='9';
str1+=str[i];
}
return str1;
}
int main(){
int n;
string str,str1;
cin>>n;
for(int i=0;i<n;i++){
cin>>str;
cin>>str1;
for(int j=str.size()-1;j>=0;j--){
if(str[j]=='A') str1=A(str1);
else if(str[j]=='J') str1=J(str1);
else if(str[j]=='C') str1=C(str1);
else if(str[j]=='E') str1=E(str1);
else if(str[j]=='P') str1=P(str1);
else str1=M(str1);
}
cout<<str1<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(),(a).end()
int main()
{
int n;
cin >> n;
while (n--){
string m, s;
cin >> m >> s;
reverse(all(m));
for (int i = 0; i < m.size(); i++){
if (m[i] == 'C'){
string a(s, 0, 1);
string b(s, 1, s.size() - 1);
s = b + a;
}
else if (m[i] == 'J'){
string a(s, 0, s.size() - 1);
string b(s, s.size() - 1, 1);
//cout << s << " " << a << " " << b << endl;
s = b + a;
}
else if (m[i] == 'E'){
string a(s, 0, s.size() / 2);
string b(s, s.size() / 2, s.size() % 2);
string c(s, s.size() / 2 + s.size() % 2, s.size() / 2);
s = c + b + a;
}
else if (m[i] == 'A'){
reverse(all(s));
}
else if (m[i] == 'M'){
for (int j = 0; j < s.size(); j++){
if (s[j] >= '0' && s[j] <= '8'){
s[j]++;
}
else if (s[j] == '9'){
s[j] = '0';
}
}
}
else if (m[i] == 'P'){
for (int j = 0; j < s.size(); j++){
if (s[j] >= '1' && s[j] <= '9'){
s[j]--;
}
else if (s[j] == '0'){
s[j] = '9';
}
}
}
}
cout << s << endl;
}
return 0;
} |
#include <bits/stdc++.h>
typedef long long LL;
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
using namespace std;
string revj(string a)
{
string answer=a+a;
return string(answer.begin()+a.size()-1,answer.end()-1);
}
string revc(string a)
{
string answer=a+a;
return string(answer.begin()+1,answer.begin()+a.size()+1);
}
string reve(string a)
{
return string(a.end()-a.size()/2,a.end())+string(a.begin()+a.size()/2,a.end()-a.size()/2)+string(a.begin(),a.begin()+a.size()/2);
}
string reva(string a)
{
return string(a.rbegin(),a.rend());
}
string revp(string a)
{
string answer=a;
REP(i,answer.size()) if(0<= answer[i]-'0' && answer[i]-'0' <= 9) answer[i]=(answer[i]-'0'+9)%10+'0';
return answer;
}
string revm(string a)
{
string answer=a;
REP(i,answer.size()) if(0<= answer[i]-'0' && answer[i]-'0' <= 9) answer[i]=(answer[i]-'0'+1)%10+'0';
return answer;
}
int main(void)
{
int n;
cin >> n;
REP(i,n){
string cmd,tmp;
cin >> cmd >> tmp;
string rcmd(cmd.rbegin(),cmd.rend());
for(auto i:rcmd){
if(i=='J') tmp=revj(tmp);
if(i=='C') tmp=revc(tmp);
if(i=='E') tmp=reve(tmp);
if(i=='A') tmp=reva(tmp);
if(i=='P') tmp=revp(tmp);
if(i=='M') tmp=revm(tmp);
}
cout << tmp << endl;
}
return 0;
} |
#include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstring>
using namespace std;
#define INF 999999999
string mej(string v){
return v.substr(v.size()-1) + v.substr(0,v.size()-1);
}
string mec(string v){
return v.substr(1) + v.substr(0,1);
}
string mee(string v){
for(int i=0;i<v.size()/2;i++){
swap(v[i], v[i + (v.size()+1)/2]);
}
return v;
}
string mea(string v){
for(int i=0;i<v.size()/2;i++){
swap(v[i], v[v.size()-1-i]);
}
return v;
}
string mep(string v){
for(int i=0;i<v.size();i++){
if(v[i] >= '1' && v[i] <= '9') v[i] -= 1;
else if(v[i] == '0') v[i] = '9';
}
return v;
}
string mem(string v){
for(int i=0;i<v.size();i++){
if(v[i] >= '0' && v[i] <= '8') v[i] += 1;
else if(v[i] == '9') v[i] = '0';
}
return v;
}
int main(){
int i, j, n;
string s, o;
cin >> n;
for(i=0;i<n;i++){
cin >> o >> s;
for(j=o.size()-1;j>=0;j--){
if(o[j] == 'J') s = mej(s);
if(o[j] == 'C') s = mec(s);
if(o[j] == 'E') s = mee(s);
if(o[j] == 'A') s = mea(s);
if(o[j] == 'P') s = mep(s);
if(o[j] == 'M') s = mem(s);
}
cout << s << endl;
}
return 0;
} |
#include <bits/stdc++.h>
#define MOD 1000000007
typedef long long ll;
using namespace std;
string ir,str;
string convert(string s,char alp){
string res="";
int n=s.size();
if(alp=='J'){
if(n==1) return s;
res+=s.back();
res+=s.substr(0,n-1);
}else if(alp=='C'){
if(n==1) return s;
res+=s.substr(1,n-1);
res+=s[0];
}else if(alp=='E'){
if(n==1) return s;
else if(n%2){
res+=s.substr(n/2+1,n/2);
res+=s[n/2];
res+=s.substr(0,n/2);
}else{
res+=s.substr(n/2,n/2);
res+=s.substr(0,n/2);
}
}else if(alp=='A'){
res=s;
reverse(res.begin(),res.end());
}else if(alp=='M'){
res=s;
for(int i=0;i<n;i++){
if(res[i]>='0'&&res[i]<='9'){
if(res[i]=='9') res[i]='0';
else res[i]++;
}
}
}else{
res=s;
for(int i=0;i<n;i++){
if(res[i]>='0'&&res[i]<='9'){
if(res[i]=='0') res[i]='9';
else res[i]--;
}
}
}
return res;
}
void solve(){
cin>>ir;
cin>>str;
for(int i=ir.size()-1;i>=0;i--){
str=convert(str,ir[i]);
}
cout<<str<<endl;
}
int main(){
int T;
cin>>T;
for(int i=0;i<T;i++) solve();
return 0;
}
|
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 1
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define each(it,c) for(auto it=(c).begin();it!=(c).end();it++)
#define all(c) c.begin(),c.end()
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9 + 7);
string MrJ(string s) { return s.substr(1) + s.front(); }
string MissC(string s) { return s.back() + s.substr(0, s.size() - 1); }
string MrE(string s) {
string res;
if (s.size() % 2) {
res = s[s.size() / 2];
res += s.substr(0, s.size() / 2);
res = s.substr(s.size() / 2 + 1)+res;
}
else {
res = s.substr(s.size() / 2) + s.substr(0, s.size() / 2);
}
return res;
}
string MrA(string s) { string res = s; reverse(res.begin(), res.end()); return res; }
string DrP(string s) {
rep(i, 0, s.size()) {
if (isdigit(s[i])) {
if (s[i] == '9')s[i] = '0';
else s[i]++;
}
}
return s;
}
string MrM(string s) {
rep(i, 0, s.size()) {
if (isdigit(s[i])) {
if (s[i] == '0')s[i] = '9';
else s[i]--;
}
}
return s;
}
signed main() {
int n; cin >> n;
while (n--) {
string order, king;
cin >> order >> king;
rrep(i, 0, order.size()) {
switch (order[i])
{
case 'J':king = MissC(king); break;
case 'C':king = MrJ(king); break;
case 'E':king = MrE(king); break;
case 'A':king = MrA(king); break;
case 'P':king = MrM(king); break;
case 'M':king = DrP(king); break;
default:
break;
}
}
cout << king << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
for (;n--;){
string order,S; cin >> order >> S;
int s=S.size();
reverse(order.begin(),order.end());
for (int i=0;i<order.size();++i){
if (order[i]=='J'){
S+=S;
S=S.substr(s-1,s);
}
if (order[i]=='C'){
S+=S;
S=S.substr(1,s);
}
if (order[i]=='E'){
for (int j=0;j<s/2;++j) swap(S[j],S[j+(s+1)/2]);
}
if (order[i]=='A'){
reverse(S.begin(),S.end());
}
if (order[i]=='P'){
for (int j=0;j<s;++j){
int x=S[j]-'0';
if (x<10) S[j]='0'+(x+9)%10;
}
}
if (order[i]=='M'){
for (int j=0;j<s;++j){
int x=S[j]-'0';
if (x<10) S[j]='0'+(x+1)%10;
}
}
}
cout << S << '\n';
}
}
|
#include<iostream>
#include<string>
#include<algorithm>
#include<cstring>
#include<cctype>
using namespace std;
string revJ(string t){
string ret = t;
ret.insert(ret.begin(),t[t.length()-1]);
ret.erase(ret.end()-1);
return ret;
}
string revC(string t){
string ret = t;
ret += t[0];
ret.erase(ret.begin());
return ret;
}
string revE(string t){
char c=0;
if(t.length()==1)return t;
if(t.length()%2){
c = t[t.length()/2];
t.erase(t.begin()+t.length()/2);
}
string l = t.substr(0,t.length()/2);
string r = t.substr(t.length()/2,t.length()-t.length()/2);
if(c){
return r+c+l;
}else return r+l;
}
string revA(string t){
string ret = t;
reverse(ret.begin(),ret.end());
return ret;
}
string revP(string t){
//dec
string ret = t;
for(int i = 0; i < (signed)ret.length(); ++i){
if( isdigit(ret[i]) ){
ret[i]--;
if(ret[i]<'0')ret[i]='9';
}
}
return ret;
}
string revM(string t){
//inc
string ret = t;
for(int i = 0; i < (signed)ret.length(); ++i){
if( isdigit(ret[i]) ){
ret[i]++;
if(ret[i]>'9')ret[i]='0';
}
}
return ret;
}
int main()
{
int n;
cin >> n;
for(int i = 0; i < n; ++i){
string order;
string msg;
cin >> order >> msg;
for(int i = (int)order.length()-1; i>=0; --i){
if( order[i] == 'J' ){
msg = revJ( msg );
}
if( order[i] == 'C' ){
msg = revC( msg );
}
if( order[i] == 'E' ){
msg = revE( msg );
}
if( order[i] == 'A' ){
msg = revA( msg );
}
if( order[i] == 'P' ){
msg = revP( msg );
}
if( order[i] == 'M' ){
msg = revM( msg );
}
}
cout << msg << endl;
}
return 0;
} |
#include <iostream>
#include <string>
#include <list>
using namespace std;
int main(){
int n;
cin >> n;
while(n--){
string s,t;
cin >> s >> t;
list<char> p;
for(int i=t.length()-1; i>=0; i--){
p.push_front(t[i]);
}
for(int i=s.length()-1; i>=0; i--){
if(s[i]=='J'){
p.push_front(p.back());
p.pop_back();
}
else if(s[i]=='C'){
p.push_back(p.front());
p.pop_front();
}
else if(s[i]=='E'){
if(t.length()%2==0){
for(int j=0; j<t.length()/2; j++){
p.push_front(p.back());
p.pop_back();
}
}
else{
for(int j=0; j<(t.length()-1)/2; j++){
p.push_front(p.back());
p.pop_back();
}
list<char>::iterator it; it=p.begin();
for(int j=0; j<(t.length()-1)/2; j++)
it++;
p.insert(it,p.back());
p.pop_back();
}
}
else if(s[i]=='A'){
p.reverse();
}
else if(s[i]=='P'){
for(list<char>::iterator it=p.begin(); it!=p.end(); ++it){
if(isdigit(*it)){
int a = *it-'0';
a+=9;
a%=10;
*it = a+'0';
}
}
}
else{
for(list<char>::iterator it=p.begin(); it!=p.end(); ++it){
if(isdigit(*it)){
int a = *it-'0';
a+=11;
a%=10;
*it = a+'0';
}
}
}
}
for(list<char>::iterator it=p.begin(); it!=p.end(); ++it)
cout << *it;
cout << endl;
}
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
#include <deque>
#include <cctype>
using namespace std;
int main(){
int n;
cin >> n;
for (int _ = 0; _ < n; _++){
string op, s;
cin >> op >> s;
reverse(op.begin(), op.end());
deque<char> str(s.begin(), s.end());
for (char c : op){
if (c == 'C'){
char t = str.front();
str.pop_front();
str.push_back(t);
}
else if (c == 'J'){
char t = str.back();
str.pop_back();
str.push_front(t);
}
else if (c == 'E'){
for (int i = 0; i < str.size() / 2; i++){
swap(str[i], str[i + (str.size() + 1) / 2]);
}
}
else if (c == 'A'){
reverse(str.begin(), str.end());
}
else if (c == 'M'){
for (char & d : str){
if (isdigit(d)){
d++;
if (d == '9' + 1){
d = '0';
}
}
}
}
else if (c == 'P'){
for (char & d : str){
if (isdigit(d)){
d--;
if (d == '0' - 1){
d = '9';
}
}
}
}
}
for (char c : str){
cout << c;
}
cout << endl;
}
} |
#include <iostream>
#include <deque>
#include <string>
using namespace std;
int main(){
int n;
string s,t;
char c,d;
deque<char> de,sub;
cin >> n;
for(int i = 0;i < n;i++){
cin >> s >> t;
de.clear();
for(int j = 0;j < t.size();j++){
de.push_back(t[j]);
}
for(int j = s.size()-1;j >= 0;j--){
//cout << s[j] <<endl;
if(s[j] == 'C'){
c = de.front();
de.pop_front();
de.push_back(c);
}
else if(s[j] == 'J'){
c = de.back();
de.pop_back();
de.push_front(c);
}
else if(s[j] == 'A'){
for(int k = 0;k < de.size()/2;k++){
swap(de[k],de[de.size()-k-1]);
}
}
else if(s[j] == 'E'){
if(de.size()%2 == 1){
for(int k = 0;k < t.size()/2;k++){
c = de.back();
de.pop_back();
sub.push_front(c);
}
c = de.back();
de.pop_back();
de.push_front(c);
//cout << c << endl;
while(!sub.empty()){
c = sub.back();
sub.pop_back();
de.push_front(c);
}
}
else{
for(int k = 0;k < de.size()/2;k++){
c = de.front();
de.pop_front();
de.push_back(c);
}
}
}
else if(s[j] == 'M'){
for(int k = 0;k < de.size();k++){
if(de[k] >= '0' && de[k] <='8'){
de[k]++;
}
else if(de[k] == '9'){
de[k] = '0';
}
}
}
else if(s[j] == 'P'){
for(int k = 0;k < de.size();k++){
if(de[k] >= '1' && de[k] <='9'){
de[k]--;
}
else if(de[k] == '0'){
de[k] = '9';
}
}
}
}
for(int j = 0;j < de.size();j++){
cout << de[j];
if(j == de.size()-1)cout <<endl;
}
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
void conv(string &S, char c){
if (c == 'J'){
S = S.back() + S.substr(0, S.size() - 1);
}
if (c == 'C'){
S = S.substr(1) + S[0];
}
if (c == 'E'){
if (S.size() % 2 == 0){
S = S.substr(S.size() / 2) + S.substr(0, S.size() / 2);
} else {
S = S.substr(S.size() / 2 + 1) + S[S.size() / 2] + S.substr(0, S.size() / 2);
}
}
if (c == 'A'){
reverse(S.begin(), S.end());
}
if (c == 'P'){
for (int i = 0; i < S.size(); i++){
if (S[i] == '0'){
S[i] = '9';
} else if ('1' <= S[i] && S[i] <= '9'){
S[i]--;
}
}
}
if (c == 'M'){
for (int i = 0; i < S.size(); i++){
if (S[i] == '9'){
S[i] = '0';
} else if ('0' <= S[i] && S[i] <= '8'){
S[i]++;
}
}
}
}
int main(){
int n;
cin >> n;
for (int i = 0; i < n; i++){
string S;
cin >> S;
string T;
cin >> T;
int m = S.size();
for (int j = m - 1; j >= 0; j--){
conv(T, S[j]);
}
cout << T << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string order, s;
int n;
cin >> n;
for(int i = 0; i < n; ++i){
cin >> order;
cin >> s;
for(int j = order.size() - 1; j >= 0; --j){
if(order[j] == 'J'){
s = s[s.size() - 1] + s.substr(0, s.size() - 1);
}
if(order[j] == 'C'){
s = s.substr(1, s.size() - 1) + s[0];
}
if(order[j] == 'E'){
for(int k = 0; k < s.size() / 2; ++k)
swap(s[k], s[k + s.size() / 2 + s.size() % 2]);
}
if(order[j] == 'A'){
reverse(s.begin(), s.end());
}
if(order[j] == 'P'){
for(int k = 0; k < s.size(); ++k){
if('0' <= s[k] && s[k] <= '9'){
if(s[k] == '0')
s[k] = '9';
else
s[k] -= 1;
}
}
}
if(order[j] == 'M'){
for(int k = 0; k < s.size(); ++k){
if('0' <= s[k] && s[k] <= '9'){
if(s[k] == '9')
s[k] = '0';
else
s[k] += 1;
}
}
}
}
cout << s << endl;
}
return 0;
} |
#include <iostream>
#include <algorithm>
#define between(n,x,m) (((n)<=(x))&&((x)<=(m)))
using namespace std;
string filter,str;
void J(){rotate(str.begin(),str.begin()+(str.length()-1),str.end());}
void C(){rotate(str.begin(),str.begin()+1,str.end());}
void E(){
int i=(str.length())/2;
string tmp=str;
str.replace(0,i,tmp,str.length()-i,i);
str.replace(str.length()-i,i,tmp,0,i);
}
void A(){reverse(str.begin(),str.end());}
void P(){
int i=str.length();
char *p=(char*)str.data();
for(;i>=0;--i){
if(between('0',p[i],'9')){
p[i]--;
if(p[i]=='/')p[i]='9';
}
}
}
void M(){
int i=str.length();
char *p=(char*)str.data();
for(;i>=0;--i){
if(between('0',p[i],'9')){
p[i]++;
if(p[i]==':')p[i]='0';
}
}
}
struct x{
void operator()(char c){
switch(c){
case 'J': J();break;
case 'C': C();break;
case 'E': E();break;
case 'A': A();break;
case 'P': P();break;
default: M();break;
}
}
};
int main(){
int n;
cin >> n;
while(n--){
cin >> filter;
cin >> str;
for_each(filter.rbegin(), filter.rend(), x());
cout << str << endl;
}
return 0;
} |
#include<iostream>
#include<string>
#include<vector>
#include<cstdio>
using namespace std;
int main(){
int n;
string x;
string st;
cin >>n;
for(int i=0;i<n;i++){
cin >> x;
cin >> st;
for(int j=x.size()-1;j>=0;j--){
if(x[j]=='C'){
char stock;
stock = st[0];
st.erase(st.begin());
st+=stock;
}
else if(x[j]=='J'){
char stock;
stock = st[st.size()-1];
// cout << "p1"<<endl;
st.erase(st.size()-1);
//cout <<"p2"<<endl;
st.insert(st.begin(),stock);
}
else if(x[j]=='E'){
string stock;
stock.clear();
int l=st.size()/2;
for(int k=0;k<l;k++){
stock+=st[k];
}
string stock2;
stock2.clear();
int od = st.size()%2;
for(int k=l+od;k<l*2+od;k++){
stock2+=st[k];
}
char st3;
if(od==1){
st3=st[l];
st=stock2+st3+stock;
}
else{
st=stock2+stock;
}
}
else if(x[j]=='A'){
string stock;
stock.clear();
for(int k=0;st.empty()!=true;k++){
stock += st[0];
st.erase(st.begin());
}
//cout << stock <<endl;
for(int k=stock.size()-1;k>=0;k--){
st+=stock[k];
}
}
else if(x[j]=='M'){
for(int k=0;k<st.size();k++){
if(st[k]>='0'&&st[k]<'9'){
st[k]++;
}
else if(st[k]=='9'){
st[k]='0';
}
}
}
else if(x[j]=='P'){
for(int k=0;k<st.size();k++){
if(st[k]>'0'&&st[k]<='9'){
st[k]--;
}
else if(st[k]=='0'){
st[k]='9';
}
}
}
//cout <<"it is "<<x[j]<<endl;
//cout << st << endl;
}
cout << st << endl;
}
return 0;
} |
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
string decC(string s)
{
string mess=s;
mess[s.size()-1]=s[0];
for(int i = 0; i < s.size()-1; ++i)
{
mess[i]=s[i+1];
}
return mess;
}
string decJ(string s)
{
string mess=s;
mess[0]=s[s.size()-1];
for(int i = 1; i < s.size(); ++i)
{
mess[i]=s[i-1];
}
return mess;
}
string decE(string s)
{
int n=s.size();
string l=s.substr(0,n/2);
string m=n%2==0?"":s.substr(n/2,1);
string r=n%2==0?s.substr(n/2):s.substr(n/2+1);
return r+m+l;
}
string decP(string s)
{
for(int i = 0; i < s.size(); ++i)
{
if('0'<=s[i]&&s[i]<='9')
{
if(s[i]=='0') s[i]='9';
else s[i]-=1;
}
}
return s;
}
string decM(string s)
{
for(int i = 0; i < s.size(); ++i)
{
if('0'<=s[i]&&s[i]<='9')
{
if(s[i]=='9') s[i]='0';
else s[i]+=1;
}
}
return s;
}
int main()
{
int n; cin>>n;
while(n--)
{
string order,mess; cin>>order>>mess;
for(int i = order.size()-1; 0 <= i; --i)
{
if(order[i]=='J') mess=decJ(mess);
if(order[i]=='C') mess=decC(mess);
if(order[i]=='E') mess=decE(mess);
if(order[i]=='A') reverse(mess.begin(),mess.end());
if(order[i]=='P') mess=decP(mess);
if(order[i]=='M') mess=decM(mess);
}
cout<<mess<<endl;
}
return 0;
} |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int n;
string c,m;
cin>>n;
for(int i=0;i<n;i++){
cin>>c>>m;
int size=m.size();
for(int j=c.size()-1;j>=0;j--){
if(c[j]=='C'){
m+=m[0];
m.erase(m.begin());
}
if(c[j]=='J'){
m=m[size-1]+m;
m.erase(m.end()-1);
}
if(c[j]=='M'){
for(int k=0;k<size;k++){
if('0'<=m[k]&&m[k]<='8')m[k]++;
else if(m[k]=='9')m[k]='0';
}
}
if(c[j]=='P'){
for(int k=0;k<size;k++){
if('1'<=m[k]&&m[k]<='9')m[k]--;
else if(m[k]=='0')m[k]='9';
}
}
if(c[j]=='A')reverse(m.begin(),m.end());
if(c[j]=='E'){
if(size%2==0){
string a;
for(int k=size/2;k<size;k++)a+=m[k];
for(int k=0;k<size/2;k++)a+=m[k];
m=a;
}else{
string a;
for(int k=size/2+1;k<size;k++)a+=m[k];
a+=m[size/2];
for(int k=0;k<size/2;k++)a+=m[k];
m=a;
}
}
}
cout<<m<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
#include <stdint.h>
typedef uint32_t u32;
typedef uint64_t u64;
void revj(std::string& str) {
std::string temp;
temp += str[str.size() - 1];
for(int i = 0; i < (int)str.size() - 1; ++i) {
temp += str[i];
}
str = temp;
}
void revc(std::string& str) {
std::string temp;
for(int i = 1; i < (int)str.size(); ++i) {
temp += str[i];
}
temp += str[0];
str = temp;
}
void reve(std::string& str) {
for(int i = 0; i < (int)str.size() / 2; ++i) {
std::swap(str[i], str[(str.size() + 1) / 2 + i]);
}
}
void reva(std::string& str) {
std::reverse(str.begin(), str.end());
}
void revp(std::string& str) {
for(int i = 0; i < (int)str.size(); ++i) {
if( '0' <= str[i] and str[i] <= '9' ) {
str[i] = (str[i] - '0' + 10 - 1) % 10 + '0';
}
}
}
void revm(std::string& str) {
for(int i = 0; i < (int)str.size(); ++i) {
if( '0' <= str[i] and str[i] <= '9' ) {
str[i] = (str[i] - '0' + 1) % 10 + '0';
}
}
}
int main() {
int n;
std::cin >> n;
for(int i = 0; i < n; ++i) {
std::string order;
std::cin >> order;
std::string message;
std::cin >> message;
for(int j = (int)order.size(); j >= 0; --j) {
switch( order[j] ) {
case 'J' :
revj(message);
break;
case 'C' :
revc(message);
break;
case 'E' :
reve(message);
break;
case 'A' :
reva(message);
break;
case 'P' :
revp(message);
break;
case 'M' :
revm(message);
break;
}
}
std::cout << message << std::endl;
}
return 0;
} |
#include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL<<((ll)n))
#define BITCNT(n) (__builtin_popcountll(n))
#define SUBS(s,f,t) ((s).substr((f)-1,(t)-(f)+1))
#define ALL(a) (a).begin(),(a).end()
using namespace std;
void chmes(string &s,char me){
if(me == 'C'){
string tmp="";
for(int i=1;i<s.size();i++){
tmp+=s[i];
}
tmp += s[0];
s = tmp;
}else if(me == 'J'){
string tmp="";
tmp+=s.back();
for(int i=0;i<s.size()-1;i++){
tmp+=s[i];
}
s = tmp;
}else if(me == 'E'){
if(s.size()%2 == 1){
string tmp1="",tmp2="";
for(int i=0;i<s.size()/2;i++){
tmp1+=s[i];
tmp2+=s[s.size()/2+i+1];
}
char hge = s[s.size()/2];
s = tmp2;
s+= hge;
s += tmp1;
}else{
string tmp1="",tmp2="";
for(int i=0;i<s.size()/2;i++){
tmp1+=s[i];
tmp2+=s[s.size()/2+i];
}
s = tmp2+tmp1;
// cout<<"!"<<s<<endl;
}
}else if(me == 'A'){
reverse(ALL(s));
}else if(me == 'M'){
for(int i=0;i<s.size();i++){
if(isdigit(s[i])){
s[i] = (char)('0'+(s[i]-'0'+1)%10);
}
}
}else{
for(int i=0;i<s.size();i++){
if(isdigit(s[i])){
s[i] = (char)('0'+(s[i]-'0'+9)%10);
}
}
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n;cin>>n;
for(int i=0;i<n;i++){
string s,ss;
cin>>s>>ss;
reverse(ALL(s));
for(auto a:s){
chmes(ss,a);
}
cout<<ss<<endl;
}
return 0;
}
|
#include <algorithm>
#include <cstdint>
#include <iostream>
#include <string>
using namespace std;
string lshift(string &msg) {
string front{msg[0]};
return msg.substr(1, msg.size() - 1) + front;
}
string rshift(string &msg) {
string back{msg[msg.size() - 1]};
return back + msg.substr(0, msg.size() - 1);
}
void add_num(string &msg, int32_t num) {
for (uint32_t i = 0; i < msg.size(); i++) {
if ('0' <= msg[i] && msg[i] <= '9') {
msg[i] += num;
if (msg[i] < '0') msg[i] = '9';
if ('9' < msg[i]) msg[i] = '0';
}
}
}
string swap(string &msg) {
string front = msg.substr(0, msg.size() / 2);
if (msg.size() % 2 == 0) {
string back = msg.substr(msg.size() / 2, msg.size() - msg.size() / 2);
return back + front;
} else {
string center{msg[msg.size() / 2]};
string back =
msg.substr(msg.size() / 2 + 1, msg.size() - (msg.size() / 2 + 1));
return back + center + front;
}
}
int32_t main() {
uint32_t n;
cin >> n;
for (uint32_t _ = 0; _ < n; _++) {
string mem;
cin >> mem;
string msg;
cin >> msg;
for (int32_t i = mem.size() - 1; i >= 0; i--) {
switch (mem[i]) {
case 'A':
reverse(msg.begin(), msg.end());
break;
case 'P':
add_num(msg, -1);
break;
case 'M':
add_num(msg, +1);
break;
case 'J':
msg = rshift(msg);
break;
case 'C':
msg = lshift(msg);
break;
case 'E':
msg = swap(msg);
break;
}
}
cout << msg << endl;
}
return 0;
} |
#include <iostream>
#include <cstring>
using namespace std;
char rmsg[50];
int len;
void J();
void C();
void E();
void A();
void P();
void M();
int main(){
int n;
char msger[10];
cin >> n;
for (int i=0;i<n;i++){
cin >> msger >> rmsg;
// cin >> rmsg;
len=strlen(rmsg);
//cout << rmsg << endl;
for (int j=strlen(msger)-1;j>=0;j--){
switch (msger[j]){
case 'J':J();break;
case 'C':C();break;
case 'E':E();break;
case 'A':A();break;
case 'P':P();break;
case 'M':M();break;
}
//cout <<msger[j]<<" "<< rmsg << endl;
}
cout << rmsg << endl;
}
}
void C(){
char t=rmsg[0];
for (int i=0;i<len-1;i++){
rmsg[i]=rmsg[i+1];
}
rmsg[len-1]=t;
}
void J(){
char t=rmsg[len-1];
for (int i=len-1;i>0;i--){
rmsg[i]=rmsg[i-1];
}
rmsg[0]=t;
}
void E(){
char t;
if (len<=1)return;
for (int i=0;i<(len/2);i++){
t=rmsg[i];
rmsg[i]=rmsg[i+((len+1)/2)];
rmsg[i+((len+1)/2)]=t;
}
}
void A(){
char t;
for (int i=0;i<len-i;i++){
t=rmsg[i];
rmsg[i]=rmsg[len-i-1];
rmsg[len-i-1]=t;
}
}
void P(){
for (int i=0;i<len;i++){
if ('0'<rmsg[i]&&rmsg[i]<='9'){
rmsg[i]--;
}else if (rmsg[i]=='0'){
rmsg[i]='9';
}
}
}
void M(){
for (int i=0;i<len;i++){
if ('0'<=rmsg[i]&&rmsg[i]<'9'){
rmsg[i]++;
}else if (rmsg[i]=='9'){
rmsg[i]='0';
}
}
} |
#include<iostream>
#include<string>
#include<algorithm>
#include<cctype>
using namespace std;
int main()
{
int n,i,j,s;
string o,m,x,y,z;
string::iterator b,e;
cin>>n;
while(n--)
{
cin>>o>>m;
s=m.size();
for(i=o.size()-1;i>=0;--i)
{
b=m.begin(),e=m.end();
if(o[i]=='J')rotate(b,e-1,e);
if(o[i]=='C')rotate(b,b+1,e);
if(o[i]=='E')
{
if(s&1)x.assign(b,b+s/2),y=m[s/2],z.assign(b+s/2+1,e);
else x.assign(b,b+s/2),y="",z.assign(b+s/2,e);
m=z+y+x;
}
if(o[i]=='A')reverse(b,e);
if(o[i]=='P')for(j=0;j<s;++j)if(isdigit(m[j]))m[j]=(m[j]-'0'+9)%10+'0';
if(o[i]=='M')for(j=0;j<s;++j)if(isdigit(m[j]))m[j]=(m[j]-'0'+1)%10+'0';
}
cout<<m<<endl;
}
return 0;
} |
//Unreliable Message
#include<bits/stdc++.h>
using namespace std;
string J(string s){
if(s.length()==0)return s;
string ret="";
ret+=s[s.length()-1];
for(int i=0; i<s.length()-1; i++)ret+=s[i];
return ret;
}
string C(string s){
if(s.length()==0)return s;
string ret="";
for(int i=1; i<s.length(); i++)ret+=s[i];
ret+=s[0];
return ret;
}
string E(string s){
if(s.length()==0)return s;
string ret1="", ret2="";
for(int i=0; i<s.length()/2; i++)ret1+=s[i];
for(int i=(s.length()+1)/2; i<s.length(); i++)ret2+=s[i];
if(s.length()%2==1)ret2+=s[s.length()/2];
return ret2+ret1;
}
string A(string s){
reverse(s.begin(), s.end());
return s;
}
string P(string s){
for(int i=0; i<s.length(); i++){
if('0'<=s[i]&&s[i]<='9'){
if(s[i]=='0')s[i]='9';
else s[i]-=1;
}
}
return s;
}
string M(string s){
for(int i=0; i<s.length(); i++){
if('0'<=s[i]&&s[i]<='9'){
if(s[i]=='9')s[i]='0';
else s[i]+=1;
}
}
return s;
}
int main(){
int n;
cin>>n;
while(n--){
string p, m;
cin>>p;
cin>>m;
for(int i=p.length()-1; i>=0; i--){
if(p[i]=='J')m=J(m);
if(p[i]=='C')m=C(m);
if(p[i]=='E')m=E(m);
if(p[i]=='A')m=A(m);
if(p[i]=='P')m=P(m);
if(p[i]=='M')m=M(m);
}
cout<<m<<endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
string j(string s){
string ret;
ret += s[s.size()-1];
for(int unsigned i = 0;i<s.size()-1;i++){
ret += s[i];
}
return ret;
}
string c(string s){
string ret;
for(int unsigned i = 1;i<s.size();i++){
ret += s[i];
}
ret += s[0];
return ret;
}
string e(string s){
string ret;
int size = s.size()/2;
for(int unsigned i = s.size()-size;i<s.size();i++){
ret += s[i];
}
if(s.size()%2){
ret += s[s.size()/2];
}
for(int unsigned i = 0;i<s.size()/2;i++){
ret += s[i];
}
return ret;
}
string a(string s){
//reverse
return string(s.rbegin(),s.rend());
}
string p(string s){
//increments
string ret;
for(int unsigned i = 0;i<s.size();i++){
if(isdigit(s[i])) {
ret += (char)((s[i] - '0' + 9)%10 + '0');
} else {
ret += s[i];
}
}
return ret;
}
string m(string s){
//decrements
string ret;
for(int unsigned i = 0;i<s.size();i++){
if(isdigit(s[i])) {
ret += (char)((s[i] - '0' + 1)%10 + '0');
} else {
ret += s[i];
}
}
return ret;
}
int main(){
int n;
cin >> n;
for(int i=0;i<n;i++){
string messengers;
cin >> messengers;
string message;
cin >> message;
for(int i = (signed)messengers.size()-1;i>=0;i--){
if(messengers[i] == 'J') message=j(message);
if(messengers[i] == 'C') message=c(message);
if(messengers[i] == 'E') message=e(message);
if(messengers[i] == 'A') message=a(message);
if(messengers[i] == 'P') message=p(message);
if(messengers[i] == 'M') message=m(message);
}
cout << message << endl;
}
return 0;
} |
#include<string>
#include<algorithm>
#include<iostream>
using namespace std;
string J(string s, int len) {
return s.substr(1) + s[0];
}
string C(string s, int len) {
return s[len-1] + s.substr(0,len-1);
}
string E(string s, int len) {
if (len % 2 == 1) {
return s.substr(len/2+1) + s[len/2] + s.substr(0, len/2);
} else {
return s.substr(len/2) + s.substr(0, len/2);
}
}
string A(string s, int len) {
reverse(s.begin(), s.end());
return s;
}
string P(string s, int len) {
for (int i = 0; i < len; i++) {
if (!isdigit(s[i])) continue;
if (s[i] == '9') s[i] = '0';
else s[i]++;
}
return s;
}
string M(string s, int len) {
for (int i = 0; i < len; i++) {
if (!isdigit(s[i])) continue;
if (s[i] == '0') s[i] = '9';
else s[i]--;
}
return s;
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string messengers, crypt;
cin >> messengers >> crypt;
int len = crypt.length();
reverse(messengers.begin(), messengers.end());
for (char m : messengers) {
if (m == 'J') {
crypt = C(crypt, len);
} else if (m == 'C') {
crypt = J(crypt, len);
} else if (m == 'E') {
crypt = E(crypt, len);
} else if (m == 'A') {
crypt = A(crypt, len);
} else if (m == 'P') {
crypt = M(crypt, len);
} else if (m == 'M') {
crypt = P(crypt, len);
}
}
cout << crypt << endl;
}
} |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<math.h>
using namespace std;
string YA(string ans);
string YJ(string ans);
string YC(string ans);
string YE(string ans);
string YP(string ans);
string YM(string ans);
int main(){
int n;
string R;
string ans;
cin>>n;
for(int I=0;I<n;I++){
cin>>R;
cin>>ans;
for(int i=R.size()-1;i>=0;i--){
if(R[i]=='A')ans=YA(ans);
if(R[i]=='J')ans=YJ(ans);
if(R[i]=='C')ans=YC(ans);
if(R[i]=='E')ans=YE(ans);
if(R[i]=='P')ans=YP(ans);
if(R[i]=='M')ans=YM(ans);
}
cout<<ans<<endl;
}
return 0;
}
string YA(string ans){
string t=ans;
int x=ans.size()-1;
for(int i=0;i<ans.size();i++)
ans[i]=t[x-i];
return ans;
}
string YC(string ans){
string t=ans;
int x=ans.size()-1;
for(int i=0;i<ans.size()-1;i++)
ans[i]=t[i+1];
ans[x]=t[0];
return ans;
}
string YJ(string ans){
string t=ans;
int x=ans.size()-1;
for(int i=0;i<ans.size()-1;i++)
ans[i+1]=t[i];
ans[0]=t[x];
return ans;
}
string YM(string ans){
for(int i=0;i<ans.size();i++){
if(ans[i]>='0'&&ans[i]<'9'){
ans[i]+=1;
}
else if(ans[i]=='9')ans[i]='0';
}
return ans;
}
string YP(string ans){
for(int i=0;i<ans.size();i++){
if(ans[i]>'0'&&ans[i]<='9'){
ans[i]-=1;
}
else if(ans[i]=='0')ans[i]='9';
}
return ans;
}
string YE(string ans){
string t=ans;
int x=(ans.size())/2;
int N=x;
if(ans.size()%2==1)N++;
for(int i=0;i<x;i++)
ans[i]=t[N+i];
for(int i=N;i<ans.size();i++)
ans[i]=t[i-N];
//ans=Q+t;
return ans;
} |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=(a);i<(int)(b);i++)
#define rep(i,n) REP(i,0,n)
#define FOR(i,c) for(auto& (i):(c))
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) (int)(x).size()
string J(string s) {
string t = s.substr(1, SZ(s) - 1);
t += s[0];
return t;
}
string C(string s) {
string t = "";
t += s[SZ(s)-1];
t += s.substr(0, SZ(s) - 1);
return t;
}
string E(string s) {
int n = s.size();
string t = "";
if(n % 2 == 0) {
t += s.substr(n/2, n/2);
t += s.substr(0, n/2);
} else {
t += s.substr(n/2+1, n/2);
t += s[n/2];
t += s.substr(0, n/2);
}
return t;
}
string P(string s) {
FOR(c, s) {
if(isdigit(c)) {
if(c == '9') c = '0';
else c++;
}
}
return s;
}
string M(string s) {
FOR(c, s) {
if(isdigit(c)) {
if(c == '0') c = '9';
else c--;
}
}
return s;
}
void solve(string order, string msg) {
reverse(ALL(order));
FOR(c, order) {
if(c == 'C') msg = J(msg);
if(c == 'J') msg = C(msg);
if(c == 'E') msg = E(msg);
if(c == 'A') reverse(ALL(msg));
if(c == 'M') msg = P(msg);
if(c == 'P') msg = M(msg);
}
cout << msg << "\n";
}
int main() {
int n; cin>>n;
rep(data,n) {
string order, msg;
cin >> order >> msg;
solve(order, msg);
}
return 0;
} |
#include <cstdio>
#include <string>
#include <algorithm>
#include <cctype>
using namespace std;
int n;
char a_[11], b_[33];
int main(void) {
scanf("%d", &n);
while (n--) {
scanf("%s%s", a_, b_);
string a = a_, b = b_;
for (int i = a.size() - 1; i >= 0; i--) {
if (a[i] == 'J') rotate(b.rbegin(), b.rbegin() + 1, b.rend());
if (a[i] == 'C') rotate(b.begin(), b.begin() + 1, b.end());
if (a[i] == 'E') {
reverse(b.begin(), b.end());
reverse(b.begin(), b.begin() + (b.size())/2);
reverse(b.begin() + (b.size() + 1)/2, b.end());
}
if (a[i] == 'A') reverse(b.begin(), b.end());
if (a[i] == 'P') {
for (int j = 0; j < int(b.size()); j++) {
if (isdigit(b[j])) {
b[j] = b[j] == '0' ? '9' : (b[j] - 1);
}
}
}
if (a[i] == 'M') {
for (int j = 0; j < int(b.size()); j++) {
if (isdigit(b[j])) {
b[j] = b[j] == '9' ? '0' : (b[j] + 1);
}
}
}
}
printf("%s\n", b.c_str());
}
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
string s, o;
void J() {
string st = s[s.size() - 1] + s.substr(0, s.size() - 1);
s = st;
return;
}
void C() {
string st = s.substr(1, s.size() - 1) + s[0];
s = st;
return;
}
void E() {
string a, b, st;
int k = (s.size() - s.size() % 2) / 2;
a = s.substr(0, k);
if (s.size() % 2)st = s[k];
b = s.substr(k + s.size() % 2, k);
s = b + st + a;
return;
}
void A() {
string st;
for (int i = s.size() - 1; i >= 0; i--)st += s[i];
s = st;
return;
}
void P() {
string st;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0')st += '9';
else if (s[i] == '1')st += '0';
else if (s[i] == '2')st += '1';
else if (s[i] == '3')st += '2';
else if (s[i] == '4')st += '3';
else if (s[i] == '5')st += '4';
else if (s[i] == '6')st += '5';
else if (s[i] == '7')st += '6';
else if (s[i] == '8')st += '7';
else if (s[i] == '9')st += '8';
else st += s[i];
}
s = st;
return;
}
void M() {
string st;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '0')st += '1';
else if (s[i] == '1')st += '2';
else if (s[i] == '2')st += '3';
else if (s[i] == '3')st += '4';
else if (s[i] == '4')st += '5';
else if (s[i] == '5')st += '6';
else if (s[i] == '6')st += '7';
else if (s[i] == '7')st += '8';
else if (s[i] == '8')st += '9';
else if (s[i] == '9')st += '0';
else st += s[i];
}
s = st;
return;
}
int main() {
int n; cin >> n;
for (int i = 0; i < n; i++) {
cin >> o >> s;
for (int j = o.size() - 1; j > -1; j--) {
if (o[j] == 'J')J();
else if (o[j] == 'C')C();
else if (o[j] == 'E')E();
else if (o[j] == 'A')A();
else if (o[j] == 'P')P();
else if (o[j] == 'M')M();
}
cout << s << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
while(N--){
string order, mess;
cin >> order >> mess;
for(int i = order.size() - 1; i >= 0; i--){
char c;
switch(order[i]){
case 'J':
c = mess[mess.size() - 1];
for(int j = mess.size() - 1; j > 0; j--){
mess[j] = mess[j - 1];
}
mess[0] = c;
break;
case 'C':
c = mess[0];
for(int j = 1; j < mess.size(); j++){
mess[j - 1] = mess[j];
}
mess[mess.size() - 1] = c;
break;
case 'E':
if(mess.size() % 2){
mess = mess.substr(mess.size() / 2 + 1) + mess[mess.size() / 2] + mess.substr(0, mess.size() / 2);
}else{
mess = mess.substr(mess.size() / 2) + mess.substr(0, mess.size() / 2) ;
}
break;
case 'A':
reverse(mess.begin(), mess.end());
break;
case 'P':
for(int i = 0; i < mess.size(); i++){
c = mess[i];
if('0' <= c && c <= '9'){
mess[i] = (c - '0' + 9) % 10 + '0';
}
}
break;
case 'M':
for(int i = 0; i < mess.size(); i++){
c = mess[i];
if('0' <= c && c <= '9'){
mess[i] = (c - '0' + 1) % 10 + '0';
}
}
break;
}
}
cout << mess << endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
#define loop(i,a,b) for(int i=(a);i<ull(b);++i)
#define rep(i,n) loop(i,0,n)
const double eps = 1e-10;
const double pi = acos(-1.0);
const double inf = (int)1e8;
int main(){
int q;
cin >> q;
rep(p, q){
string s, m;
cin >> s >> m;
reverse(s.begin(), s.end());
for(int i=0; i< s.size(); i++){
if(s[i] == 'J'){
if(1 <= m.size())m = m.substr(m.size()-1, 1) + m.substr(0, m.size()-1);
}
if(s[i] == 'C'){
if(1 <= m.size())m = m.substr(1) + m.substr(0, 1);
}
if(s[i] == 'E'){
if(1 <= m.size()){
if(m.size()%2 == 0)m = m.substr(m.size()/2)+ m.substr(0, m.size()/2);
else m = m.substr(m.size()/2+1) + m.substr(m.size()/2, 1) + m.substr(0, m.size()/2);
}
}
if(s[i] == 'A') reverse(m.begin(), m.end());
if(s[i] == 'P'){
for(int j=0; j< m.size(); j++){
if('0' <= m[j] && m[j] <= '9'){
if(m[j] == '0') m[j] = '9';
else m[j]--;
}
}
}
if(s[i] == 'M'){
for(int j=0; j< m.size(); j++){
if('0' <= m[j] && m[j] <= '9'){
if(m[j] == '9') m[j] = '0';
else m[j]++;
}
}
}
}
cout << m << endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef vector<bool> VB;
typedef vector<string> VS;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define REP(i, init, N) for (int i = (init); i < (int)(N); i++)
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl
int main(void) {
int n;
cin >> n;
rep (i, n) {
string order, msg;
cin >> order >> msg;
reverse(ALL(order));
rep (j, order.size()) {
switch (order[j]) {
case 'J':
msg = msg[msg.size() - 1] + msg.substr(0, msg.size() - 1);
break;
case 'C':
msg = msg.substr(1) + msg[0];
break;
case 'E':
if (msg.size() % 2) {
string s1 = msg.substr(0, msg.size() / 2);
string s2 = msg.substr(msg.size() / 2 + 1);
msg = s2 + msg[msg.size() / 2] + s1;
} else {
string s1 = msg.substr(0, msg.size() / 2);
string s2 = msg.substr(msg.size() / 2);
msg = s2 + s1;
}
break;
case 'A':
reverse(ALL(msg));
break;
case 'P':
for (char &c : msg) {
if ('0' <= c && c <= '9') {
c = (c == '0'? '9' : c - 1);
}
}
break;
case 'M':
for (char &c : msg) {
if ('0' <= c && c <= '9') {
c = (c == '9'? '0' : c + 1);
}
}
break;
default:
break;
}
}
cout << msg << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long // <-----!!!!!!!!!!!!!!!!!!!
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> TUPLE;
typedef vector<int> V;
typedef vector<V> VV;
typedef vector<VV> VVV;
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int n;
cin >> n;
while (n--) {
string s;
cin >> s;
string t;
cin >> t;
int m = t.size();
reverse(all(s));
rep(i, s.size()) {
if (s[i] == 'J') {
t = t[m - 1] + t.substr(0, m - 1);
}
if (s[i] == 'C') {
t = t.substr(1) + t[0];
}
if (s[i] == 'E') {
string u = "";
u += t.substr((m + 1) / 2);
if (m % 2 == 1) u += t[m / 2];
u += t.substr(0, m / 2);
t = u;
}
if (s[i] == 'A') {
reverse(all(t));
}
if (s[i] == 'P') {
rep(j, m) {
if (isdigit(t[j])) {
t[j] = (t[j] - '0' - 1 + 10) % 10 + '0';
}
}
}
if (s[i] == 'M') {
rep(j, m) {
if (isdigit(t[j])) {
t[j] = (t[j] - '0' + 1) % 10 + '0';
}
}
}
}
cout << t << endl;
}
} |
#include<iostream>
#include<algorithm>
using namespace std;
string s;
int len;
void funcJ(){
if(len==1)return;
char tmp=s[len-1];
for(int i=len-1;i>0;i--)s[i]=s[i-1];
s[0]=tmp;
}
void funcC(){
if(len==1)return;
char tmp=s[0];
for(int i=0;i+1<len;i++)s[i]=s[i+1];
s[len-1]=tmp;
}
void funcE(){
if(len==1)return;
if(len%2){
s=s.substr(len/2+1,len/2)+s[len/2]+s.substr(0,len/2);
}else{
s=s.substr(len/2,len/2)+s.substr(0,len/2);
}
}
void funcA(){
reverse(s.begin(),s.end());
}
void funcP(){
for(int i=0;i<len;i++){
if(s[i]=='0'){
s[i]='9';
}else if('1'<=s[i]&&s[i]<='9'){
s[i]--;
}
}
}
void funcM(){
for(int i=0;i<len;i++){
if(s[i]=='9'){
s[i]='0';
}else if('0'<=s[i]&&s[i]<='8'){
s[i]++;
}
}
}
int main(){
int n;
string A;
cin>>n;
while(n--){
cin>>A>>s;
len=s.size();
reverse(A.begin(),A.end());
for(int i=0;i<(int)A.size();i++){
if(A[i]=='M')funcM();
if(A[i]=='P')funcP();
if(A[i]=='A')funcA();
if(A[i]=='E')funcE();
if(A[i]=='C')funcC();
if(A[i]=='J')funcJ();
}
cout<<s<<endl;
}
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int C; cin >> C;
for (int CASE = 0; CASE < C; ++CASE) {
string S, T; cin >> S >> T;
int n = (int)T.size();
reverse(S.begin(), S.end());
for (auto c : S) {
string nT = T;
if (c == 'J') nT = "", nT += T.back(), nT += T.substr(0, n-1);
else if (c == 'C') nT = T.substr(1) + T[0];
else if (c == 'E') {
for (int i = 0; i < n; ++i) {
if (i < n/2) nT[i] = T[i + (n+1)/2];
else if (i >= (n+1)/2) nT[i] = T[i - (n+1)/2];
else nT[i] = T[i];
}
}
else if (c == 'A') {
reverse(nT.begin(), nT.end());
}
else if (c == 'P') {
for (int i = 0; i < n; ++i) {
if (T[i] >= '0' && T[i] <= '9') {
int val = T[i] - '0';
val = (val + 9) % 10;
nT[i] = '0' + val;
}
else nT[i] = T[i];
}
}
else if (c == 'M') {
for (int i = 0; i < n; ++i) {
if (T[i] >= '0' && T[i] <= '9') {
int val = T[i] - '0';
val = (val + 1) % 10;
nT[i] = '0' + val;
}
else nT[i] = T[i];
}
}
T = nT;
}
cout << T << endl;
}
}
|
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <cctype>
#include <complex>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <cassert>
#include <iomanip>
using namespace std;
bool solve(){
string str, ans;
cin>> str>> ans;
for(int i=0;i<str.size();i++){
int n = ans.size();
char c;
string lstr, rstr;
switch(str[str.size()-1-i]){
case 'J':
c = ans[n-1];
for(int j=n-1;j>=0;j--) ans[j] = ans[(j+n-1)%n];
ans[0] = c;
break;
case 'C':
c = ans[0];
for(int j=0;j<n;j++) ans[j] = ans[(j+1)%n];
ans[n-1] = c;
break;
case 'E':
if(n%2==1){
lstr = ans.substr(0,(n-1)/2);
rstr = ans.substr((n+1)/2);
rstr += ans[(n-1)/2];
}else{
lstr = ans.substr(0,n/2);
rstr = ans.substr(n/2);
}
ans = rstr + lstr;
break;
case 'A':
reverse(ans.begin(), ans.end());
break;
case 'P':
for(int j=0;j<n;j++){
if('0'<=ans[j] && ans[j]<='9'){
ans[j] = '0' + ((ans[j]-'0') + 9)%10;
}
}
break;
case 'M':
for(int j=0;j<n;j++){
if('0'<=ans[j] && ans[j]<='9'){
ans[j] = '0' + ((ans[j]-'0') + 1)%10;
}
}
break;
default:
break;
}
}
cout<< ans<< endl;
return true;
}
int main(){
cout.setf(ios::fixed);
cout.precision(10);
int n;
cin>> n;
for(int i=0;i<n;i++) solve();
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N; cin >> N;
for (int t = 0; t < N; ++t) {
string s1, s2; cin >> s1 >> s2;
reverse( s1.begin(), s1.end() );
for (int i = 0; i < s1.size(); ++i) {
switch (s1[i]) {
case 'A':
reverse( s2.begin(), s2.end() );
break;
case 'J':
s2 = s2[s2.size()-1] + s2.substr(0, s2.size()-1);
break;
case 'C':
s2 = s2.substr(1) + s2[0];
break;
case 'E':
if (s2.size() > 1) {
if (s2.size() % 2 == 0) s2 = s2.substr(s2.size()/2) + s2.substr(0, s2.size()/2);
else s2 = s2.substr(s2.size()/2+1) + s2[s2.size()/2] + s2.substr(0, s2.size()/2);
}
break;
case 'M':
for (int j = 0; j < s2.size(); ++j) {
if ('0' <= s2[j] && s2[j] < '9') ++s2[j];
else if (s2[j] == '9') s2[j] = '0';
}
break;
case 'P':
for (int j = 0; j < s2.size(); ++j) {
if ('0' < s2[j] && s2[j] <= '9') --s2[j];
else if (s2[j] == '0') s2[j] = '9';
}
break;
}
}
cout << s2 << endl;
}
} |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<n;i++)
#define loop(i,a,n) for(i=a;i<n;i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
typedef vector<int> vi;
typedef pair<int,int> pii;
int main(void) {
int i,j,k;
int n;
cin>>n;
rep(i,n){
string ord,s;
cin>>ord;
cin>>s;
int len=s.size();
for(j=ord.size()-1;j>=0;j--){
if(ord[j]=='C'){
string tmp="";
tmp.push_back(s[0]);
s.erase(s.begin());
s+=tmp;
}else if(ord[j]=='J'){
string tmp="";
tmp.push_back(s[len-1]);
s.erase(s.end()-1);
s=tmp+s;
}else if(ord[j]=='A'){
reverse(all(s));
}else if(ord[j]=='E'){
rep(k,len/2)
swap(s[k],s[(len+1)/2+k]);
}else if(ord[j]=='M'){
rep(k,len)
if(s[k]<='8' && s[k]>='0')s[k]++;
else if(s[k]=='9')s[k]='0';
}else{
rep(k,len)
if(s[k]<='9' && s[k]>'0')s[k]--;
else if(s[k]=='0')s[k]='9';
}
}
cout<<s<<endl;
}
} |
#include <iostream>
#include <algorithm>
#include <string.h>
#include <cstdio>
#include <map>
#include <queue>
#define INF 10000000
using namespace std;
int main(){
int n;
string str,odr;
cin >> n;
while(n--){
cin >> odr;
cin >> str;
int size = str.size();
string tmp = "";
for(int i = odr.size()-1 ; i >= 0 ; i-- ){
switch(odr[i]){
case 'A':
reverse(str.begin(),str.end());
break;
case 'C':
tmp = "";
for(int i = 1 ; i < size ; i++ ){
tmp += str[i];
}
str = tmp+str[0];
break;
case 'J':
tmp = "";
for(int i = 0 ; i < size-1 ; i++ ){
tmp += str[i];
}
str = str[size-1] + tmp;
break;
case 'M':
for(int i = 0 ; i < size ; i++ ){
if('0' <= str[i] && str[i] <= '8'){
str[i] = char(str[i]+1);
}else if(str[i] == '9'){
str[i] = '0';
}
}
break;
case 'P':
for(int i = 0 ; i < size ; i++ ){
if('1' <= str[i] && str[i] <= '9'){
str[i] = char(str[i]-1);
}else if(str[i] == '0'){
str[i] = '9';
}
}
break;
case 'E':
if(size%2==1){
str = str.substr((size/2)+1,size - size/2)+ str[size/2] + str.substr(0,(size/2));
}else {
str = str.substr((size/2),size - size/2) + str.substr(0,(size/2));
}
break;
}
}
cout << str << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
using i64 = int64_t;
string J(string s){
char c = s.back();
s.pop_back();
return c + s;
}
string C(string s){
char c = s[0];
s = s.substr(1, s.size()-1);
return s + c;
}
string E(string s){
string left = s.substr(0, s.size()/2);
string right = s.substr(s.size()/2 + s.size()%2, s.size()/2);
string res = right;
if(s.size() % 2)res += s[s.size()/2];
res += left;
return res;
}
string A(string s){
reverse(s.begin(), s.end());
return s;
}
string P(string s){
string res;
for(auto c: s){
if(c >= '0' && c <= '9'){
if(c == '0')c = '9';
else c--;
}
res.push_back(c);
}
return res;
}
string M(string s){
string res;
for(auto c: s){
if(c >= '0' && c <= '9'){
if(c == '9')c = '0';
else c++;
}
res.push_back(c);
}
return res;
}
int main(){
int n;
cin >> n;
for(int i=0;i<n;++i){
string s;
cin >> s;
string mes;
cin >> mes;
reverse(s.begin(), s.end());
for(auto c: s){
if(c == 'J'){
mes = J(mes);
}else if(c == 'C'){
mes = C(mes);
}else if(c == 'E'){
mes = E(mes);
}else if(c == 'A'){
mes = A(mes);
}else if(c == 'P'){
mes = P(mes);
}else{
mes = M(mes);
}
}
cout << mes << endl;
}
return 0;
}
|
#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;
//// < "D:\D_Download\Visual Studio 2015\Projects\programing_contest_c++\Debug\a.txt"
int main() {
int N; cin >> N;
while (N--) {
string st; cin >> st;
string aa; cin >> aa;
for (int i = 0; i < st.size(); ++i) {
char c = st[st.size() - 1 - i];
if (c == 'A') {
reverse(aa.begin(), aa.end());
}
else if (c == 'C') {
rotate(aa.begin(), aa.begin() + 1, aa.end());
}
else if (c == 'M') {
for (auto& ac : aa) {
if (isdigit(ac))ac = (ac - '0' + 1) % 10 + '0';
}
}
else if (c == 'P') {
for (auto& ac : aa) {
if (isdigit(ac))ac = (ac - '0' + 9) % 10 + '0';
}
}
else if (c == 'E') {
string from = aa.substr(0,aa.size() / 2);
string to = aa.substr(aa.size()-aa.size() / 2,aa.size() / 2);
if (aa.size() % 2)aa = to + aa[aa.size() / 2] + from;
else aa = to + from;
}
else if (c == 'J') {
rotate(aa.begin(), aa.begin() + aa.size()-1, aa.end());
}
}
cout << aa << endl;
}
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
#include <cctype>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main()
{
int n;
cin >> n;
REP(i,n){
string o, m;
cin >> o >> m;
reverse(o.begin(), o.end());
REP(j,(int)o.size()){
if(o[j] == 'J'){
m = m[m.size()-1] + m.substr(0,m.size()-1);
}else if(o[j] == 'C'){
m = m.substr(1,m.size()-1) + m[0];
}else if(o[j] == 'E'){
int x = m.size()/2;
if(m.size() & 1)
m = m.substr(x+1,x) + m[x] + m.substr(0,x);
else
m = m.substr(x,x) + m.substr(0,x);
}else if(o[j] == 'A'){
reverse(m.begin(), m.end());
}else if(o[j] == 'P'){
REP(k,(int)m.size()){
if(isdigit(m[k])){
m[k]--;
if(!isdigit(m[k]))
m[k] = '9';
}
}
}else if(o[j] == 'M'){
REP(k,(int)m.size()){
if(isdigit(m[k])){
m[k]++;
if(!isdigit(m[k]))
m[k] = '0';
}
}
}
}
cout << m << endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
string J(const string& s)
{
int lasti = s.size() - 1;
return s[lasti] + s.substr(0, lasti);
}
string C(const string& s)
{
return s.substr(1) + s[0];
}
string E(const string& s)
{
int size = s.size();
int hsize = size / 2;
if(size&1) return s.substr(hsize+1) + s[hsize] + s.substr(0, hsize);
else return s.substr(hsize) + s.substr(0, hsize);
}
string A(const string& s)
{
return string(s.rbegin(), s.rend());
}
string P(const string& s)
{
string r;
for(basic_string<char>::const_iterator i=s.begin(); i!=s.end(); i++)
{
r.push_back(('0'<=*i && *i<='9') ? (*i - '0' + 9) % 10 + '0' : *i);
}
return r;
}
string M(const string& s)
{
string r;
for(basic_string<char>::const_iterator i=s.begin(); i!=s.end(); i++)
{
r.push_back(('0'<=*i && *i<='9') ? (*i - '0' + 1) % 10 + '0' : *i);
}
return r;
}
int main()
{
string (*op[128])(const string&);
op['J'] = J;
op['C'] = C;
op['E'] = E;
op['A'] = A;
op['P'] = P;
op['M'] = M;
int n;
cin >> n;
while(n--)
{
string cmd, text;
cin >> cmd >> text;
for(basic_string<char>::reverse_iterator i=cmd.rbegin(); i!=cmd.rend(); i++)
{
text = op[*i](text);
}
cout << text << endl;
}
} |
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
int main()
{
int n;
cin >> n;
while(--n >= 0){
string order, s;
cin >> order >> s;
int m = s.size();
for(int i=order.size()-1; i>=0; --i){
if(order[i] == 'J'){
rotate(s.begin(), s.end()-1, s.end());
}else if(order[i] == 'C'){
rotate(s.begin(), s.begin()+1, s.end());
}else if(order[i] == 'E'){
string s1, s2, s3;
s1 = s.substr(0, m/2);
s3 = s.substr((m+1)/2);
if(m % 2 == 1)
s2 = s[m/2];
s = s3 + s2 + s1;
}else if(order[i] == 'A'){
reverse(s.begin(), s.end());
}else if(order[i] == 'P'){
for(int j=0; j<m; ++j){
if('1' <= s[j] && s[j] <= '9')
-- s[j];
else if(s[j] == '0')
s[j] = '9';
}
}else{
for(int j=0; j<m; ++j){
if('0' <= s[j] && s[j] <= '8')
++ s[j];
else if(s[j] == '9')
s[j] = '0';
}
}
}
cout << s << endl;
}
return 0;
} |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
//メッセージ復元
string back(string s, char c){
string t="";
if(c=='J'){
char t1=s[s.size()-1];
string t2=s.substr(0, s.size()-1);
t+=t1+t2;
}
else if(c=='C'){
char t1=s[0];
string t2=s.substr(1, s.size()-1);
t+=t2+t1;
}
else if(c=='E'){
int size=s.size();
char mid;
if(size%2==1) mid=s[size/2];
string t1=s.substr(0, size/2);
string t2=s.substr((size+1)/2, size/2);
t+=t2;
if(size%2==1) t+=mid;
t+=t1;
}
else if(c=='A'){
t=s;
reverse(t.begin(), t.end());
}
else if(c=='P'){
for(int i=0; i<s.size(); ++i){
if('0'<=s[i] && s[i]<='9'){
if(s[i]=='0') t+='9';
else t+=s[i]-1;
}
else t+=s[i];
}
}
else if(c=='M'){
for(int i=0; i<s.size(); ++i){
if('0'<=s[i] && s[i]<='9'){
if(s[i]=='9') t+='0';
else t+=s[i]+1;
}
else t+=s[i];
}
}
return t;
}
int main(){
long n;
scanf(" %ld", &n);
for(long i=0; i<n; ++i){
string o; //order of the messenger
string m; //message given to the king
cin >> o >> m;
for(int j=o.size()-1; j>=0; --j)
m=back(m, o[j]);
cout << m <<endl;
}
return 0;
} |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#define between(a,x,b) ((a)<=(x)&&(x)<=(b))
#define F first
#define S second
#define INF 1 << 30
int main(){
int n, half;
scanf("%d", &n);
string l, r, h, ts;
while(n--){
string key, res;
cin >> key >> res;
char tmp;
for(int i = key.size()-1; i >= 0; i--){ // rep(i, key.size()){
switch(key[i]){
case 'C': // case 'J':
tmp = res[0];
res.erase(res.begin());
res += tmp;
break;
case 'J': // case 'C':
tmp = res[res.size()-1];
res.erase(res.begin()+res.size()-1);
res.insert(res.begin(), 1, tmp);
break;
case 'E':
half = (int)res.size()/2;
l = res.substr(0, half);
r = res.substr(res.size()-half, half);
h = "";
if((int)res.size()%2) h = res[half];
res = r + h + l;
break;
case 'A':
ts = "";
for(int i = res.size()-1; i >= 0; i--) ts += res[i];
res = ts;
break;
case 'M': // case 'P':
rep(i, res.size()) if(isdigit(res[i])) res[i] = (res[i]=='9')?'0':res[i]+1;
break;
case 'P': // case 'M':
rep(i, res.size()) if(isdigit(res[i])) res[i] = (res[i]=='0')?'9':res[i]-1;
break;
}
}
cout << res << endl;
}
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
#include <cctype>
using namespace std;
void dec(string& a)
{
for(int i=0; i<a.size(); i++) {
if(isdigit(a[i])) {
a[i] = (a[i] - '0' + 9) % 10 + '0';
}
}
}
void inc(string& a)
{
for(int i=0; i<a.size(); i++) {
if(isdigit(a[i])) {
a[i] = (a[i] - '0' + 1) % 10 + '0';
}
}
}
void half(string& a)
{
int N = a.size();
for(int i=0; i<N/2; i++) swap(a[i], a[N/2+i+N%2]);
}
int main()
{
int N;
cin >> N;
while(N--) {
string cmd, str;
cin >> cmd;
reverse(cmd.begin(), cmd.end());
cin >> str;
for(int i=0; i<cmd.size(); i++) {
if(cmd[i] == 'A') reverse(str.begin(), str.end());
if(cmd[i] == 'M') inc(str);
if(cmd[i] == 'P') dec(str);
if(cmd[i] == 'C') rotate(str.begin(), str.begin() + 1, str.end());
if(cmd[i] == 'J') rotate(str.begin(), str.end() - 1, str.end());
if(cmd[i] == 'E') half(str);
}
cout << str << endl;
}
} |
#include <iostream>
using namespace std;
int main()
{
int n;
string intro,str;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> intro >> str;
for (int j = intro.length() - 1; j >= 0; j--) {
switch (intro[j])
{
case 'A': {
string res;
res.reserve(str.length());
for (int k = str.length() - 1; k >= 0; k--) {
res.push_back(str[k]);
}
str = res;
}
break;
case 'C': {
string res;
res.reserve(str.length());
for (int k = 0; k < str.length(); k++) {
res.push_back(str[(k + 1) % str.length()]);
}
str = res;
}
break;
case 'E': {
string res;
res.reserve(str.length());
for (int k = 0; k < str.length(); k++) {
if (k < str.length() / 2) {
res.push_back(str[k + str.length() - str.length() / 2]);
}
else if (k >= str.length() - str.length() / 2) {
res.push_back(str[k - (str.length() - str.length() / 2)]);
}
else {
res.push_back(str[k]);
}
}
str = res;
}
break;
case 'J': {
string res;
res.reserve(str.length());
for (int k = 0; k < str.length(); k++) {
res.push_back(str[(k + str.length() - 1) % str.length()]);
}
str = res;
}
break;
case 'M': {
for (int k = 0;k < str.length(); k++) {
if (str[k] <= '9' && str[k] >= '0') {
str[k] = '0' + (str[k] - '0' + 1) % 10;
}
}
}
break;
case 'P': {
for (int k = 0; k < str.length(); k++) {
if (str[k] <= '9' && str[k] >= '0') {
str[k] = '0' + (str[k] - '0' + 9) % 10;
}
}
}
break;
}
}
cout << str << endl;
}
return 0;
} |
#include<iostream>
#include<cstring>
using namespace std;
string p(string s){
for(int i=0;i<s.length();i++){
if('0'<=s[i] && s[i]<='9'){
s[i]=s[i] -1;
if(s[i]=='0'-1)s[i]='9';
}
}
return s;
}
string m(string s){
for(int i=0;i<s.length();i++){
if('0'<=s[i] && s[i]<='9'){
s[i]=(s[i] -'0'+1)%10 + '0';
}
}
return s;
}
string a(string s){
string res=s;
for(int i=0;i<s.length()/2;i++){
res[i]=s[s.length()-1-i];
res[s.length()-1-i]=s[i];
}
return res;
}
string e(string s){
int half=s.length()/2;
string first,latter;
first=s.substr(0,half);
latter=s.substr(s.length()-half,s.length());
if(s.length()%2==0){
return latter + first;
}else{
return latter + s[half] + first;
}
}
string j(string s){
char tmp=s[s.length()-1];
for(int i=s.length()-1;i>0;i--){
s[i]=s[i-1];
}
s[0]=tmp;
return s;
}
string c(string s){
char tmp=s[0];
for(int i=0;i<s.length()-1;i++){
s[i]=s[i+1];
}
s[s.length()-1]=tmp;
return s;
}
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
string mg,mes;
cin>>mg>>mes;
for(int i=mg.length()-1;i>=0;i--){
if(mg[i]=='A'){
mes=a(mes);
}else if(mg[i]=='J'){
mes=j(mes);
}else if(mg[i]=='C'){
mes=c(mes);
}else if(mg[i]=='E'){
mes=e(mes);
}else if(mg[i]=='P'){
mes=p(mes);
}else if(mg[i]=='M'){
mes=m(mes);
}
}
cout << mes << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
while ( n-- ) {
string ord, mes;
cin >> ord >> mes;
int l = (int)mes.size();
for ( int i = (int)ord.size()-1; i >= 0; i-- ) {
if ( ord[i] == 'J' ) {
int c = mes[l-1];
for ( int i = l-1; i > 0; i-- ) mes[i] = mes[i-1];
mes[0] = c;
} else if ( ord[i] == 'C' ) {
int c = mes[0];
for ( int i = 0; i < l-1; i++ ) mes[i] = mes[i+1];
mes[l-1] = c;
} else if ( ord[i] == 'E' ) {
string a = "", b = "", c = "";
for ( int i = 0; i < l; i++ ) {
if ( l%2 && i == l/2 ) b += mes[i];
else if ( i < l/2 ) c += mes[i];
else a += mes[i];
}
mes = a+b+c;
} else if ( ord[i] == 'A' ) {
reverse(mes.begin(), mes.end());
} else if ( ord[i] == 'P' ) {
for ( int i = 0; i < l; i++ ) {
if ( mes[i] == '0' ) mes[i] = '9';
else if ( isdigit(mes[i]) ) mes[i]--;
}
} else {
for ( int i = 0; i < l; i++ ) {
if ( mes[i] == '9' ) mes[i] = '0';
else if ( isdigit(mes[i]) ) mes[i]++;
}
}
}
cout << mes << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstring>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main() {
int n;
cin >> n;
while(n--) {
string order, message;
cin >> order >> message;
for(int i=order.length()-1; i>=0; i--) {
switch(order[i]) {
case 'J':
message = message[message.length()-1] + message.substr(0,message.length()-1);
break;
case 'C':
message = message.substr(1,message.length()-1) + message[0];
break;
case 'E':
if(message.length()%2) {
message = message.substr(message.length()/2+1,message.length()/2) + message[message.length()/2] + message.substr(0,message.length()/2);
} else {
message = message.substr(message.length()/2,message.length()/2) + message.substr(0,message.length()/2);
}
break;
case 'A':
reverse(message.begin(), message.end());
break;
case 'P':
for(int i=0; i<message.length(); i++) {
if('0'<=message[i] && message[i]<='9') {
message[i] = ((message[i]-'0'+9)%10)+'0';
}
}
break;
case 'M':
for(int i=0; i<message.length(); i++) {
if('0'<=message[i] && message[i]<='9') {
message[i] = ((message[i]-'0'+1)%10)+'0';
}
}
break;
}
}
cout << message << endl;
}
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main()
{
int n;
cin >> n;
rep(loop, n) {
string messengers;
string message;
cin >> messengers >> message;
rep(i, messengers.size()) {
switch (messengers[messengers.size() - 1 - i]) {
case 'J':
message = message.substr(message.size() - 1, 1) + message.substr(0, message.size() - 1);
break;
case 'C':
message = message.substr(1) + message.substr(0, 1);
break;
case 'E':
if (message.size() % 2 == 0) {
message = message.substr(message.size() / 2, message.size() / 2) + message.substr(0, message.size() / 2);
}
else {
message = message.substr(message.size() / 2 + 1, message.size() / 2) + message.substr(message.size() / 2, 1) + message.substr(0, message.size() / 2);
}
break;
case 'A':
rep(j, message.size() / 2) {
swap(message[j], message[message.size() - 1 - j]);
}
break;
case 'P':
rep(j, message.size()) {
if (message[j] == '0') {
message[j] = '9';
}
else if (message[j] >= '1'&&message[j] <= '9') {
message[j]--;
}
}
break;
case 'M':
rep(j, message.size()) {
if (message[j] == '9') {
message[j] = '0';
}
else if (message[j] >= '0'&&message[j] <= '8') {
message[j]++;
}
}
break;
}
}
cout << message << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) (v).begin(),(v).end()
#define int long long
typedef pair<int,int> P;
//-----------------------------------------------------------------------
void decode(string &s,char c)
{
int l=s.size();
if(c=='J'){
if(l>0) s=s[l-1]+s.substr(0,l-1);
}
else if(c=='C'){
if(l>0) s=s.substr(1)+s[0];
}
else if(c=='E'){
if(l%2==0) s=s.substr(l/2)+s.substr(0,l/2);
else s=s.substr(l/2+1)+s[l/2]+s.substr(0,l/2);
}
else if(c=='A'){
reverse(ALL(s));
}
else if(c=='P'){
REP(i,s.size()){
if(isdigit(s[i])) s[i]=(s[i]-'0'+9)%10+'0';
}
}
else{
REP(i,s.size()){
if(isdigit(s[i])) s[i]=(s[i]-'0'+1)%10+'0';
}
}
}
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin>>n;
REP(i,n){
string s,msg;
cin>>s>>msg;
for(int i=s.size()-1;i>=0;i--){
decode(msg,s[i]);
}
cout<<msg<<endl;
}
}
|
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
using namespace std;
#define REP(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for(int i = a; i < (int)b; i++)
#define pb push_back
#define mp make_pair
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef long long ll;
const int INF = 1<<28;
const ll MOD = 1000000007;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
void j(string &s) {
s = s[s.size()-1] + s;
s.erase(s.end()-1);
}
void c(string &s) {
s = s + s[0];
s.erase(s.begin());
}
void e(string &s) {
if(s.size()%2)
REP(i, s.size()/2)
swap(s[i], s[s.size()/2+i+1]);
else
REP(i, s.size()/2)
swap(s[i], s[s.size()/2+i]);
}
void a(string &s) {
reverse(s.begin(), s.end());
}
void p(string &s) {
REP(i, s.size())
if(isdigit(s[i]))
s[i] = s[i] == '0' ? '9' : s[i]-1;
}
void m(string &s) {
REP(i, s.size())
if(isdigit(s[i]))
s[i] = s[i] == '9' ? '0' : s[i]+1;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n; cin >> n;
REP(_, n) {
string x, y;
cin >> x >> y;
reverse(x.begin(), x.end());
REP(i, x.size()) {
if(x[i] == 'J') j(y);
if(x[i] == 'C') c(y);
if(x[i] == 'E') e(y);
if(x[i] == 'A') a(y);
if(x[i] == 'P') p(y);
if(x[i] == 'M') m(y);
}
cout << y << endl;
}
return 0;
} |
#include <algorithm>
#include <cctype>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
while(n--) {
string ope, message;
cin >> ope >> message;
const int l = message.size();
for(int i = ope.size() - 1; i >= 0; --i) {
switch(ope[i]) {
case 'A':
reverse(message.begin(), message.end());
break;
case 'C':
rotate(message.begin(), message.begin() + 1, message.end());
break;
case 'E':
message = message.substr((l + 1) / 2)
+ (l & 1 ? string(1, message[l / 2]) : "")
+ message.substr(0, l / 2);
break;
case 'J':
rotate(message.begin(), message.begin() + l - 1, message.end());
break;
case 'M':
for(int j = 0; j < (int)message.size(); ++j)
if(isdigit(message[j]))
message[j] = (message[j] - '0' + 1) % 10 + '0';
break;
case 'P':
for(int j = 0; j < (int)message.size(); ++j)
if(isdigit(message[j]))
message[j] = (message[j] - '0' + 10 - 1) % 10 + '0';
}
}
cout << message << endl;
}
return EXIT_SUCCESS;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.