text stringlengths 49 983k |
|---|
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1240
#include <iostream>
#include <string>
#include <algorithm>
#include <cctype>
using namespace std;
int main() {
int N;
cin >> N;
for (int i=0; i<N; i++) {
string S, O;
cin >> O >> S;
reverse(O.begin(), O.end());
for (auto i=0; i<O.size(); i++) {
switch(O[i]) {
case 'J':
S = S[S.size()-1] + S.substr(0, S.size()-1);
break;
case 'C':
S = S.substr(1) + S[0];
break;
case '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);
}
break;
case 'A':
reverse(S.begin(), S.end());
break;
case 'P':
for (auto i=0; i<S.size(); i++) {
if (isdigit(S[i])) {
S[i] = (char)((((int)S[i] - '0')+10 -1)%10 + '0');
}
}
break;
case 'M':
for (auto i=0; i<S.size(); i++) {
if (isdigit(S[i])) {
S[i] = (char)((((int)S[i] - '0')+10 +1)%10 + '0');
}
}
break;
default:
break;
}
}
cout << S << endl;
}
} |
#include <iostream>
#include <cstring>
using namespace std;
int main(){
int n;
cin >> n;
for(int i = 0; i < n; i++){
string p,str,tmp;
cin >> p >> str;
for(int i = p.size()-1; i >= 0; i--){
if(p[i] == 'J'){
tmp = str;
str[0] = tmp[str.size()-1];
for(int j = 1; j < str.size(); j++) str[j] = tmp[j-1];
} else if(p[i] == 'C'){
tmp = str;
for(int j = 0; j < str.size()-1; j++) str[j] = tmp[j+1];
str[str.size()-1] = tmp[0];
} else if(p[i] == 'E'){
tmp = str;
if(str.size()%2==0){
for(int j = 0; j < str.size()/2; j++) str[j] = tmp[j+str.size()/2];
for(int j = str.size()/2; j < str.size(); j++) str[j] = tmp[j-str.size()/2];
} else{
for(int j = 0; j < str.size()/2; j++) str[j] = tmp[j+str.size()/2+1];
for(int j = str.size()/2+1; j < str.size(); j++) str[j] = tmp[j-str.size()/2-1];
}
} else if(p[i] == 'A'){
tmp = str;
for(int j = 0; j < str.size(); j++){
str[j] = tmp[str.size()-1-j];
}
} else if(p[i] == 'P'){
for(int j = 0; j < str.size(); j++){
if(0<=str[j]-'0'&&str[j]-'0'<=9){
if(str[j]-'0' == 0) str[j] = '9';
else str[j]--;
}
}
} else if(p[i] == 'M'){
for(int j = 0; j < str.size(); j++){
if(0<=str[j]-'0'&&str[j]-'0'<=9){
if(str[j]-'0' == 9) str[j] = '0';
else str[j]++;
}
}
}
}
cout << str << endl;
}
} |
#include<cstdio>
#include<string>
#include<iostream>
using namespace std;
string A(string str){
char tmp;
for(int i=0,j=str.length()-1;i<j;i++,j--){
tmp=str[i];
str[i]=str[j];
str[j]=tmp;
}
return str;
}
string J(string str){
char tmp;
tmp=str[str.length()-1];
for(int i=str.length()-1;i>0;i--)
str[i]=str[i-1];
str[0]=tmp;
return str;
}
string C(string str){
char tmp;
tmp=str[0];
for(int i=0;i<str.length()-1;i++)
str[i]=str[i+1];
str[str.length()-1]=tmp;
return str;
}
string E(string str){
string tmp,str2;
if(str.length()%2){
tmp=str.substr(0,str.length()/2);
str2.assign(&str[str.length()/2+1],&str[str.length()]);
str2+=str[str.length()/2];
str2+=tmp;
}else{
tmp=str.substr(0,str.length()/2);
str2.assign(&str[str.length()/2],&str[str.length()]);
str2+=tmp;
}
return str2;
}
string P(string str){
string num=("9012345678");
for(int i=0;i<str.length();i++)
if(str[i]>=0x30 && str[i]<=0x39)
str[i]=num[str[i]-0x30];
return str;
}
string M(string str){
string num=("1234567890");
for(int i=0;i<str.length();i++)
if(str[i]>=0x30 && str[i]<=0x39)
str[i]=num[str[i]-0x30];
return str;
}
int main(){
int n;
string str1,str2;
scanf("%d",&n);
for(int i=0;i<n;i++){
cin>> str1 >>str2;
for(int i=str1.length()-1;i>=0;i--){
switch(str1[i]){
case 'A': str2=A(str2); break;
case 'J': str2=J(str2); break;
case 'C': str2=C(str2); break;
case 'E': str2=E(str2); break;
case 'P': str2=P(str2); break;
case 'M': str2=M(str2); break;
}
}
cout<< str2<< endl;
}
return 0;
} |
#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<vector>
#include<functional>
#include<algorithm>
using namespace std;
int main() {
int n;
cin >> n;
for (int z = 0; z < n; z++) {
string a, b;
cin >> a >> b;
for (int i = a.length() - 1; i >= 0; i--) {
string c = "";
if (a[i] == 'C') {
for (int i = 1; i < b.length(); i++) c += b[i];
c += b[0];
b = c;
}
if (a[i] == 'J') {
c += b[b.length() - 1];
for (int i = 0; i < b.length() - 1; i++) c += b[i];
b = c;
}
if (a[i] == 'E') {
int d = floor(b.length() / 2.0);
string e = "", f = "", g = "";
int h;
if (b.length() % 2 == 0) h = b.length()/ 2;
else h = d+1;
for (int i = 0; i < d; i++) {
e += b[i];
}
if(b.length()%2!=0)f = b[d];
for (int i = h; i < b.length(); i++) {
g += b[i];
}
c += g += f += e;
b = c;
}
if (a[i] == 'A') {
for (int i = b.length() - 1; i >= 0; i--) c += b[i];
b = c;
}
if (a[i] == 'M') {
for (int i = 0; i < b.length(); i++) {
if (b[i] >= '0'&&b[i] <= '8') {
int e = (int)b[i] - '0';
e++;
b[i] = (char)e + '0';
}
else if (b[i] == '9') {
b[i] = '0';
}
}
}
if (a[i] == 'P') {
for (int i = 0; i < b.length(); i++) {
if (b[i] >= '1'&&b[i] <= '9') {
int e = (int)b[i] - '0';
e--;
b[i] = (char)e + '0';
}
else if (b[i] == '0') {
b[i] = '9';
}
}
}
}
cout << b << endl;
}
} |
#include <cstdio>
#include <utility>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#define REP(i,n) for(int i=0;i<n;i++)
typedef long long ll;
using namespace std;
typedef vector<ll> vl;
typedef pair<ll,ll> pll;
typedef vector<pll> vpll;
typedef vector<string> vs;
int main()
{
int n;
cin >> n;
cin.ignore();
REP(i,n){
string s,c;
getline(cin,s);
getline(cin,c);
char a[10]={'0','1','2','3','4','5','6','7','8','9'};
REP(j,s.length()){
switch(s[s.length()-1-j]){
case 'C':
rotate(c.begin(),c.begin()+1,c.begin()+c.length());
break;
case 'J':
rotate(c.begin(),c.begin()+c.length()-1,c.begin()+c.length());
break;
case 'E':{
string tmp1="";string tmp2="";string tmp3="";
REP(k,c.length()/2){tmp1+=c[k];}
REP(k,c.length()/2){tmp3+=c[c.length()-c.length()/2+k];}
if(c.length()%2==1){tmp2+=c[c.length()/2];}
c = tmp3+tmp2+tmp1;}
break;
case 'A':
reverse(c.begin(),c.end());
break;
case 'M':
REP(k,c.length()){REP(l,10){if(a[l]==c[k]){c[k]=a[(l+1+10)%10];break;}}}
break;
case 'P':
REP(k,c.length()){REP(l,10){if(a[l]==c[k]){c[k]=a[(l-1+10)%10];break;}}}
break;
}
}
cout << c << endl;
}
return 0;
} |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
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()
const int INF = 1<<29;
string func(string message, char type) {
int m = message.size();
string res = message;
if (type == 'J') {
res = string(1, message[m-1]) + message.substr(0, m-1);
} else if (type == 'C') {
res = message.substr(1) + string(1, message[0]);
} else if (type == 'E') {
res = message.substr((m+1)/2) + (m%2?string(1, message[m/2]):"") + message.substr(0, m/2);
} else if (type == 'A') {
reverse(ALL(res));
} else if (type == 'P') {
REP(i, m)
if (isdigit(message[i]))
res[i] = (message[i] == '0') ? '9' : message[i]-1;
} else if (type == 'M') {
REP(i, m)
if (isdigit(message[i]))
res[i] = (message[i] == '9') ? '0' : message[i]+1;
}
return res;
}
int main() {
int n;
cin >> n;
while(n--) {
string order, message;
cin >> order >> message;
for (int i=order.size()-1; i>=0; --i) {
message = func(message, order[i]);
}
cout << message << endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
void f(string &ss,char c) {
if(c == 'C') {
char t = ss[0];
rep(i,ss.size()-1) ss[i] = ss[i+1];
ss[ss.size()-1] = t;
}
else if(c=='J') {
char t = ss[ss.size()-1];
for(int i = ss.size()-1; i>=1; i--) ss[i] = ss[i-1];
ss[0] = t;
}
else if(c=='E') {
string l = ss.substr(0,ss.size()/2);
string r = ss.substr((ss.size()+1)/2,ss.size()/2);
string center = "";
if(ss.size()&1) {
center = ss[ss.size()/2];
}
ss = r + center + l;
}
else if(c=='A') {
reverse(ss.begin(), ss.end());
}
else if(c=='M') {
rep(i,ss.size()) {
if('0'<=ss[i]&&ss[i]<='9') {
if('9'==ss[i]) ss[i] = '0';
else ss[i]++;
}
}
}
else if(c=='P') {
rep(i,ss.size()) {
if('0'<=ss[i]&&ss[i]<='9') {
if('0'==ss[i]) ss[i] = '9';
else ss[i]--;
}
}
}
}
int main() {
int n;
cin>>n;
rep(i,n) {
string ss1,ss2;
cin>>ss1>>ss2;
reverse(ss1.begin(),ss1.end());
rep(j,ss1.size()) f(ss2,ss1[j]);
cout<<ss2<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define repp(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perr(i, l, r) for(int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(),(x).end()
#define MOD 1000000007
#define IINF 1000000000
#define LINF 1000000000000000000
#define SP <<" "<<
#define CYES cout<<"Yes"<<endl
#define CNO cout<<"No"<<endl
#define CFS cin.tie(0);ios::sync_with_stdio(false)
typedef long long LL;
typedef long double LD;
int main(){
int q;
cin >> q;
rep(t,q){
string m;
string s;
cin >> m >> s;
reverse(all(m));
rep(i,m.length()){
if(m[i]=='J'){
char tmp = s[s.length()-1];
perr(j,1,s.length()){
s[j]=s[j-1];
}
s[0]=tmp;
}else if(m[i]=='C'){
char tmp = s[0];
rep(j,s.length()-1){
s[j]=s[j+1];
}
s[s.length()-1]=tmp;
}else if(m[i]=='E'){
if(s.length()%2){
s = s.substr(s.length()/2+1,s.length()/2)+s.substr(s.length()/2,1)+s.substr(0,s.length()/2);
}else{
s = s.substr(s.length()/2,s.length()/2)+s.substr(0,s.length()/2);
}
}else if(m[i]=='A'){
reverse(all(s));
}else if(m[i]=='P'){
rep(j,s.length()){
if('0'<=s[j]&&s[j]<='9'){
s[j]=((s[j]-'0')+9)%10+'0';
}
}
}else{
rep(j,s.length()){
if('0'<=s[j]&&s[j]<='9'){
s[j]=((s[j]-'0')+1)%10+'0';
}
}
}
}
cout << s << endl;
}
return 0;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin>>n;
for(int i=0; i<n; i++){
string order, message;
cin>>order>>message;
reverse(order.begin(), order.end());
for(char c : order){
if(c == 'J'){
rotate(message.rbegin(), message.rbegin()+1, message.rend());
}else if(c == 'C'){
rotate(message.begin(), message.begin()+1, message.end());
}else if(c == 'E'){
if(message.size()%2 == 0){
message = message.substr(ceil(message.size()/2.0), message.size()) + message.substr(0, message.size()/2);
}else{
int index = message.size()/2;
message = message.substr(ceil(message.size()/2.0), message[index]) + message[index] + message.substr(0, message.size()/2);
}
}else if(c == 'A'){
reverse(message.begin(), message.end());
}else if(c == 'P'){
for(int j=0; j<message.size(); j++){
if(isdigit(message[j])){
int digit = stoi(message.substr(j,1).c_str());
message[j] = to_string(digit == 0 ? 9 : digit-1)[0];
}
}
}else{
for(int j=0; j<message.size(); j++){
if(isdigit(message[j])){
int digit = stoi(message.substr(j,1).c_str());
message[j] = to_string((digit+1)%10)[0];
}
}
}
}
cout << message << endl;
}
}
|
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double ESP=1e-10;
using namespace std;
int main(){
int n;
cin>>n;
while(n--){
string a,s;
cin>>a>>s;
reverse(all(a));
rep(i,a.size()){
if(a[i]=='A')
reverse(all(s));
else if(a[i]=='J')
s=s.substr(s.size()-1)+s.substr(0,s.size()-1);
else if(a[i]=='M'){
rep(j,s.size())if(isdigit(s[j])){
s[j]++;
if(s[j]=='9'+1)s[j]='0';
}
}else if(a[i]=='P'){
rep(j,s.size())if(isdigit(s[j])){
s[j]--;
if(s[j]=='0'-1)s[j]='9';
}
}else if(a[i]=='C')
s=s.substr(1)+s.substr(0,1);
else if(a[i]=='E'){
string tmp="";
int t=0;
if(s.size()%2){t=1;tmp=s[s.size()/2];}
s=s.substr(s.size()/2+t)+tmp+s.substr(0,s.size()/2);
}
}
cout<<s<<endl;
}
} |
#include <cstdio>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
int n;
int main(void){
scanf("%d",&n);
for(int i=0;i<n;i++){
string a,b;
cin >> a;
cin >> b;
for(int j=a.size();j>=0;j--){
if(a[j]=='C'){
string c=b.substr(1)+b[0];
b=c;
}
if(a[j]=='J'){
string c=b[b.size()-1]+b.substr(0,b.size()-1);
b=c;
}
if(a[j]=='E'){
for(int k=0;k<b.size()/2;k++){
swap(b[k],b[k+(b.size()+1)/2]);
}
}
if(a[j]=='M'){
for(int k=0;k<b.size();k++){
if(b[k]>='0' && b[k]<='9'){
if(b[k]=='9')b[k]='0';
else b[k]++;
}
}
}
if(a[j]=='P'){
for(int k=0;k<b.size();k++){
if(b[k]>='0' && b[k]<='9'){
if(b[k]=='0')b[k]='9';
else b[k]--;
}
}
}
if(a[j]=='A'){
reverse(b.begin(),b.end());
}
}
cout << b << endl;
}
return 0;
} |
#include <iostream>
#include <algorithm>
#include <cctype>
#include <string>
using namespace std;
string oom, mes;
void rJ() {
const string tmp = mes;
mes = tmp[tmp.length()-1] + tmp.substr(0, tmp.length()-1);
}
void rC() {
const string tmp = mes;
mes = tmp.substr(1) + tmp[0];
}
void rE() {
string l = mes.substr(0, mes.length()/2);
string r = mes.substr((mes.length()+1)/2);
if(mes.length() % 2 != 0) {
mes = r + mes[mes.length()/2] + l;
} else {
mes = r + l;
}
}
void rA() {
reverse(mes.begin(), mes.end());
}
void rP() {
for(int i = 0; i < mes.length(); ++i) {
if(isdigit(mes[i])) {
mes[i] = (mes[i]-'0'+9)%10+'0';
}
}
}
void rM() {
for(int i = 0; i < mes.length(); ++i) {
if(isdigit(mes[i])) {
mes[i] = (mes[i]-'0'+1)%10+'0';
}
}
}
void solve() {
reverse(oom.begin(), oom.end());
for(int i = 0; i < oom.length(); ++i) {
switch(oom[i]) {
case 'J': rJ(); break;
case 'C': rC(); break;
case 'E': rE(); break;
case 'A': rA(); break;
case 'P': rP(); break;
case 'M': rM(); break;
}
}
cout << mes << endl;
}
int main() {
int n;
cin >> n;
for(int i = 0; i < n; ++i) {
cin >> oom;
cin >> mes;
solve();
}
} |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
string J(string str) {
string a;
a+= str[str.size()-1];
for(int i=0;i<str.size()-1;i++) a += str[i];
return a;
}
string C(string str){
string a;
for(int i=1;i<str.size();i++) a+=str[i];
a += str[0];
return a;
}
string E(string str) {
string a = str;
for(int i=0;i<str.size()/2;i++)
a[i] = str[str.size()-str.size()/2+i],a[str.size()-str.size()/2+i]=str[i];
return a;
}
string P(string str){
for(int i=0;i<str.size();i++)
if('0' <= str[i] && str[i] <= '9') str[i] = (str[i]-'0'-1+10)%10+'0';
return str;
}
string M(string str){
for(int i=0;i<str.size();i++)
if('0' <= str[i] && str[i] <= '9') str[i] = (str[i]-'0'+1)%10+'0';
return str;
}
int main() {
int n;
cin >>n;
for(int q=0;q<n;q++) {
string order;
cin >> order;
reverse(order.begin(),order.end());
string str;
cin >> str;
for(int i=0;i<order.size();i++){
if(order[i] == 'J') str = J(str);
else if(order[i] == 'C') str=C(str);
else if(order[i] == 'E') str = E(str);
else if(order[i] == 'A') reverse(str.begin(),str.end());
else if(order[i] == 'P') str = P(str);
else if(order[i] == 'M') str = M(str);
}
cout << str << endl;
}
return 0;
} |
#include <iostream>
#include <string>
using namespace std;
int main(){
int n;
while(cin >> n){
for(int i=0;i<n;i++){
string hito;
string data;
cin >> hito;
cin >> data;
for(int j=hito.size()-1;j>=0;j--){
//cout << data << endl;
if(hito[j]=='J'){
string tmp=data;
data="";
data+=tmp[tmp.size()-1];
for(int k=0;k<tmp.size()-1;k++){
data+=tmp[k];
}
}else if(hito[j]=='C'){
string tmp=data;
data="";
for(int k=1;k<tmp.size();k++){
data+=tmp[k];
}
data+=tmp[0];
}else if(hito[j]=='E'){
string left="", right="";
if(data.size()%2==0){
for(int k=0;k<data.size()/2;k++){
left+=data[k];
right+=data[k+data.size()/2];
}
}else{
for(int k=0;k<data.size()/2;k++){
left+=data[k];
right+=data[k+data.size()/2+1];
}
right+=data[data.size()/2];
}
data="";
data+=right;
data+=left;
}else if(hito[j]=='A'){
string tmp=data;
for(int k=0;k<tmp.size();k++){
data[k]=tmp[tmp.size()-1-k];
}
}else if(hito[j]=='P'){
for(int k=0;k<data.size();k++){
if(data[k]>='0' && data[k]<='9'){
if(data[k]=='0') data[k]='9';
else data[k]=data[k]-1;
}
}
}else if(hito[j]=='M'){
for(int k=0;k<data.size();k++){
if(data[k]>='0' && data[k]<='9'){
if(data[k]=='9') data[k]='0';
else data[k]=data[k]+1;
}
}
}
}
cout << data << endl;
}
}
return 0;
} |
//37
#include<iostream>
#include<string>
#include<algorithm>
#include<cctype>
using namespace std;
int main(){
int n;
cin>>n;
while(n--){
string r,m;
cin>>r>>m;
for(int i=r.size()-1;i>=0;i--){
switch(r[i]){
case 'J':
if(m.size()>1){
rotate(m.begin(),m.end()-1,m.end());
}
break;
case 'C':
if(m.size()>1){
rotate(m.begin(),m.begin()+1,m.end());
}
break;
case 'E':
{
string n;
n=m.substr((m.size()+1)/2);
if(m.size()%2){
n+=m[m.size()/2];
}
n+=m.substr(0,m.size()/2);
m=n;
}
break;
case 'A':
reverse(m.begin(),m.end());
break;
case 'P':
case 'M':
for(int j=0;j<m.size();j++){
if(isdigit(m[j])){
m[j]=(m[j]-'0'+(r[i]=='M')-(r[i]=='P')+10)%10+'0';
}
}
break;
}
}
cout<<m<<endl;
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<stack>
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 <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
using namespace std;
#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second
#define PI acos(-1.0)
#define INF 10e9+9
#define EPS 1e-10
#define MAX_N 100100
#define MAX_M 100100
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
typedef pair<P, char> PC;
int n;
string s, ans;
int main(){
cin >> n;
REP(k, n){
cin >> s >> ans;
reverse(ALL(s));
REP(i,s.size()){
if (s[i] == 'J'){
ans = ans[ans.size() - 1] + ans.substr(0, ans.size() - 1);
}
else if (s[i] == 'C'){
ans = ans.substr(1, ans.size() - 1) + ans[0];
}
else if (s[i] == 'E'){
int num = ans.size() / 2;
if (ans.size() % 2 == 1){
ans = ans.substr(num + 1) + ans[num] + ans.substr(0, num);
}
else{
ans = ans.substr(num) + ans.substr(0, num);
}
}
else if (s[i] == 'A'){
reverse(ALL(ans));
}
else if (s[i] == 'P'){
REP(j, ans.size()){
if (ans[j] >= '1'&&ans[j] <= '9'){
ans[j] = (char)(ans[j] - 1);
}
else if (ans[j] == '0'){
ans[j] = '9';
}
}
}
else{
REP(j, ans.size()){
if (ans[j] >= '0'&&ans[j] <= '8'){
ans[j] = (char)(ans[j] + 1);
}
else if (ans[j] == '9'){
ans[j] = '0';
}
}
}
}
cout << ans << endl;
}
} |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#define REP(i,n) for (int i=0;i<(n);i++)
#define ll long long
#define ull unsigned long long
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
using namespace std;
string invJ(string s){//???????????????
rotate(s.rbegin(),s.rbegin() + 1,s.rend());
return s;
}
string invC(string s){//left????????????
rotate(s.begin(),s.begin() + 1,s.end());
return s;
}
string invE(string s){
if((s.size() + 1) & 1)
rotate(s.begin(),s.begin() + s.size()/2,s.end());
else{
string tmp;
tmp = s;
s.replace(0,s.size()/2,s.substr(s.size()/2 + 1,s.size()/2));
s.replace(s.size()/2 + 1,s.size()/2,tmp.substr(0,s.size()/2));
}
return s;
}
string invA(string s){
reverse(s.begin(),s.end());
return s;
}
string invP(string s){
REP(i,s.size()){
if(s[i] == '0')
s[i] = '9';
else if(s[i] > '0' && s[i] <= '9')
s[i]--;
}
return s;
}
string invM(string s){
REP(i,s.size()){
if(s[i] == '9')
s[i] = '0';
else if(s[i] >= '0' && s[i] < '9')
s[i]++;
}
return s;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
while(n--){
string command,s;
cin >> command >> s;
for(int i = command.size()-1;i>=0;i--){
if(command[i] == 'J')s = invJ(s);
else if(command[i] == 'C')s = invC(s);
else if(command[i] == 'E')s = invE(s);
else if(command[i] == 'A')s = invA(s);
else if(command[i] == 'P')s = invP(s);
else if(command[i] == 'M')s = invM(s);
}
cout << s << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int n;
string s,name;
string solve();
int main(){
cin >> n;
for(int i = 0;i < n; ++i){
cin >> name >> s;
cout << solve() << endl;
}
return 0;
}
string solve(){
reverse(name.begin(),name.end());
int nsize = name.size(), ssize = s.size(), half = s.size() / 2;
for(int i = 0;i < nsize;++i){
string tmp;
switch(name[i]){
case 'J':
tmp = s[ssize-1] + s;
tmp.pop_back();
s = tmp;
break;
case 'C':
for(int j = 1;j < ssize;++j)tmp += s[j];
tmp += s[0];
s = tmp;
break;
case 'E':
for(int j = 0;j < half;++j)tmp += s[half + ssize % 2 + j];
if(ssize%2)tmp += s[half];
for(int j = 0;j < half;++j)tmp += s[j];
s = tmp;
break;
case 'A':
reverse(s.begin(),s.end());
break;
case 'P':
for(int j = 0;j < ssize;++j)
if(s[j] >= '0' && s[j] <= '9')
s[j] = '0' + (s[j] - '0' + 9) % 10;
break;
case 'M':
for(int j = 0;j < ssize;++j)
if(s[j] >= '0' && s[j] <= '9')
s[j] = '0' + (s[j] - '0' + 1) % 10;
break;
default:
assert(0);
break;
}
}
return s;
}
|
#include <iostream>
#include <algorithm>
#include <cctype>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int n;
cin >> n;
rep(tt,n){
string m,s;
cin >> m >> s;
rep(ii,m.size()){
int i=m.size()-1-ii;
if(m[i]=='A'){
reverse(s.begin(),s.end());
}
if(m[i]=='C'){
s+=s[0];
s=s.substr(1,s.size()-1);
}
if(m[i]=='J'){
s=s[s.size()-1]+s;
s=s.substr(0,s.size()-1);
}
if(m[i]=='E'){
string l,r;
if(s.size()%2==0){
l=s.substr(0,s.size()/2),r=s.substr(s.size()/2,s.size()/2);
s=r+l;
}else{
l=s.substr(0,s.size()/2),r=s.substr(s.size()/2+1,s.size()/2);
s=r+s[s.size()/2]+l;
}
}
if(m[i]=='P'){
rep(j,s.size()){
if(isdigit(s[j])){
if(s[j]=='0') s[j]='9';
else s[j]--;
}
}
}
if(m[i]=='M'){
rep(j,s.size()){
if(isdigit(s[j])){
if(s[j]=='9') s[j]='0';
else s[j]++;
}
}
}
}
cout << s << endl;
}
} |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
void deTransform(const char op, string& str) {
switch (op) {
case 'J':
str = str.at(str.length() - 1) + str.substr(0, str.length() - 1);
break;
case 'C':
str = str.substr(1, str.length() - 1) + str.at(0);
break;
case 'E':
if (str.length() % 2 == 0) {
str = str.substr(str.length() / 2, str.length() / 2) + str.substr(0, str.length() / 2);
} else {
unsigned int middle = str.length() / 2;
str = str.substr(middle + 1, middle) + str.at(middle) + str.substr(0, middle);
}
break;
case 'A':
reverse(str.begin(), str.end());
break;
case 'P':
for (string::iterator it = str.begin(); it != str.end(); it++) {
if (*it == '0') {
*it = '9';
} else if ('0' < *it && *it <= '9') {
(*it)--;
}
}
break;
case 'M':
for (string::iterator it = str.begin(); it != str.end(); it++) {
if (*it == '9') {
*it = '0';
} else if ('0' <= *it && *it < '9') {
(*it)++;
}
}
break;
}
}
int main() {
int n;
cin >> n;
while (n--) {
string messengers, message;
cin >> messengers >> message;
for (string::reverse_iterator rit = messengers.rbegin(); rit != messengers.rend(); rit++) {
deTransform(*rit, message);
}
cout << message << endl;
}
} |
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
#define el endl
#define fd fixed
#define INF INT_MAX/2-1
#define pb push_back
using namespace std;
string num = "0123456789";
string mrj(string s) {
return s[s.length()-1] + s.substr(0, s.length()-1);
}
string missc(string s) {
return s.substr(1, s.length()-1) + s[0];
}
string mre(string s) {
if (s.length() % 2 == 1) return s.substr(s.length()/2+1, s.length()/2) + s[s.length()/2] + s.substr(0, s.length()/2);
else return s.substr(s.length()/2, s.length()/2) + s.substr(0, s.length()/2);
}
string mra(string s) {
string res = "";
for (int i = s.length()-1; i >= 0; i--) {
res += s[i];
}
return res;
}
string drp(string s) {
for (int i = 0; i < s.length(); i++) {
int index = (int)num.find(s[i]);
if (index >= 0) {
s[i] = num[(index+9)%10];
}
}
return s;
}
string mrm(string s) {
for (int i = 0; i < s.length(); i++) {
int index = (int)num.find(s[i]);
if (index >= 0) {
s[i] = num[(index+1)%10];
}
}
return s;
}
int main() {
int n;
string order, message;
cin >> n;
while (n--) {
cin >> order >> message;
for (int i = order.length()-1; i >= 0; i--) {
if (order[i] == 'J') message = mrj(message);
if (order[i] == 'C') message = missc(message);
if (order[i] == 'E') message = mre(message);
if (order[i] == 'A') message = mra(message);
if (order[i] == 'P') message = drp(message);
if (order[i] == 'M') message = mrm(message);
}
cout << message << el;
}
} |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
int main() {
int q;
cin >> q;
while(q--){
string s, t;
cin >> s >> t;
int m = t.size();
reverse(s.begin(),s.end());
for (auto &&i : s) {
string tt(t);
if(i == 'J'){
for (int j = 0; j < m; ++j) {
tt[j] = t[(j+m-1)%m];
}
}else if(i == 'C'){
for (int j = 0; j < m; ++j) {
tt[j] = t[(j+1)%m];
}
}else if(i == 'E'){
for (int j = 0; j < m/2; ++j) {
tt[j+(m+1)/2] = t[j];
tt[j] = t[j+(m+1)/2];
}
}else if(i == 'A'){
reverse(tt.begin(),tt.end());
}else if(i == 'P') {
for (int j = 0; j < m; ++j) {
if('0' <= tt[j] && tt[j] <= '9'){
tt[j] = '0' + (tt[j]-'0'+9)%10;
}
}
}else {
for (int j = 0; j < m; ++j) {
if('0' <= tt[j] && tt[j] <= '9'){
tt[j] = '0' + (tt[j]-'0'+1)%10;
}
}
}
t = tt;
}
cout << t << "\n";
}
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <cctype>
#include <stack>
#include <queue>
#include <cstring>
#include <map>
using namespace std;
string J(string s){
int n=s.size();
string t;
for(int i=0;i<n;i++){
t+=s[(n-1+i)%n];
}
return t;
}
string C(string s){
int n=s.size();
string t;
for(int i=0;i<n;i++){
t+=s[(1+i)%n];
}
return t;
}
string E(string s){
string t;
if(s.size()%2){
string left=s.substr(0,s.size()/2);
char mid=s[s.size()/2];
string right=s.substr(s.size()/2+1);
t=right+mid+left;
}else{
string left=s.substr(0,s.size()/2);
string right=s.substr(s.size()/2);
t=right+left;
}
return t;
}
string A(string s){
string t=s;
reverse(t.begin(),t.end());
return t;
}
string P(string s){
string t=s;
for(int i=0;i<t.size();i++){
if( '0'<=t[i] && t[i]<='9' ){
if(t[i]=='0') t[i]='9';
else t[i]--;
}
}
return t;
}
string M(string s){
string t=s;
for(int i=0;i<t.size();i++){
if( '0'<=t[i] && t[i]<='9' ){
if(t[i]=='9') t[i]='0';
else t[i]++;
}
}
return t;
}
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
string t,s;
cin>>t>>s;
for(int j=t.size()-1;j>=0;j--){
if(t[j]=='J') s=J(s);
else if(t[j]=='C') s=C(s);
else if(t[j]=='E') s=E(s);
else if(t[j]=='A') s=A(s);
else if(t[j]=='P') s=P(s);
else if(t[j]=='M') s=M(s);
}
cout<<s<<endl;
}
return 0;
} |
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <functional>
using namespace std;
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define peri(i,a,b) for(int i=int(b);i-->int(a);)
#define rep(i,n) repi(i,0,n)
#define per(i,n) peri(i,0,n)
int main()
{
unordered_map<char,function<string(string)>> inv;
inv['J']=[](string s){
rotate(s.begin(),s.end()-1,s.end());
return s;
};
inv['C']=[](string s){
rotate(s.begin(),s.begin()+1,s.end());
return s;
};
inv['E']=[](string s){
rep(i,s.size()/2) swap(s[i],s[(s.size()+1)/2+i]);
return s;
};
inv['A']=[](string s){
return string(s.rbegin(),s.rend());
};
inv['P']=[](string s){
char ds[]="9012345678";
rep(i,s.size()) if(isdigit(s[i])) s[i]=ds[s[i]-'0'];
return s;
};
inv['M']=[](string s){
char ds[]="1234567890";
rep(i,s.size()) if(isdigit(s[i])) s[i]=ds[s[i]-'0'];
return s;
};
int tc; cin>>tc;
while(tc--){
string m,s; cin>>m>>s;
per(i,m.size()) s=inv[m[i]](s);
cout<<s<<endl;
}
return 0;
} |
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double ESP=1e-10;
using namespace std;
int main(){
int n;
cin>>n;
while(n--){
string in,s;
cin>>in>>s;
for(int i=in.size()-1;i>=0;i--){
if(in[i]=='C')
s=s.substr(1)+s[0];
else if(in[i]=='A')
reverse(all(s));
else if(in[i]=='E'){
//cout<<s.size()<<endl;
int tmp=s.size();
if(!(tmp%2))
s=s.substr(tmp/2)+s.substr(0,tmp/2);
else
s=s.substr(tmp/2+1)+s[tmp/2]+s.substr(0,tmp/2);
}else if(in[i]=='J')
s=s[s.size()-1]+s.substr(0,s.size()-1);
else if(in[i]=='M'){
rep(j,s.size())if(isdigit(s[j])){
s[j]++;
if(s[j]>'9')s[j]='0';
}
}else if(in[i]=='P'){
rep(j,s.size())if(isdigit(s[j])){
s[j]--;
if(s[j]<'0')s[j]='9';
}
}
//cout<<s<<endl;
}
cout<<s<<endl;
}
} |
#include<iostream>
#include<string>
using namespace std;
string V,W;
int n;
string J(string S) {
string T = "";
T = S[S.size() - 1] + S.substr(0, S.size() - 1);
return T;
}
string C(string S) {
string T = "";
T = S.substr(1, S.size() - 1) + S[0];
return T;
}
string E(string S) {
string T = "";
T += S.substr(S.size() - (S.size() / 2), S.size() / 2);
if (S.size() % 2 == 1) { T += S[S.size() / 2]; }
T += S.substr(0, S.size() / 2);
return T;
}
string A(string S) {
string T = "";
for (int k = S.size() - 1; k >= 0; k--) {
T += S[k];
}
return T;
}
string P(string S) {
string T = "";
for (int k = 0; k < S.size(); k++) {
if (isdigit(S[k])) {
T += (S[k] - 1);
if (T[k] < '0') {
T[k] += 10;
}
}
else {
T += S[k];
}
}
return T;
}
string M(string S) {
string T = "";
for (int k = 0; k < S.size(); k++) {
if (isdigit(S[k])) {
T += (S[k] + 1);
if (T[k] > '9') {
T[k] -= 10;
}
}
else {
T += S[k];
}
}
return T;
}
string message(string S, string T) {
for (int j = S.size() - 1; j >= 0; j--) {
if (S[j] == 'J') {
T = J(T);
}
if (S[j] == 'C') {
T = C(T);
}
if (S[j] == 'E') {
T = E(T);
}
if (S[j] == 'A') {
T = A(T);
}
if (S[j] == 'P') {
T = P(T);
}
if (S[j] == 'M') {
T = M(T);
}
}
return T;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> V >> W;
cout << message(V, W) << endl;
}
} |
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
string turn1(string S)
{
return S.substr(1, S.size() - 1) + S[0];
}
string turn2(string S)
{
return S[S.size() - 1] + S.substr(0, S.size() - 1);
}
string turn3(string S)
{
string T;
if (S.size() % 2 == 1)
{
T = S.substr(S.size() / 2 + 1, S.size() / 2) + S[S.size() / 2] + S.substr(0, S.size() / 2);
}
else
{
T = S.substr(S.size() / 2, S.size() / 2) + S.substr(0, S.size() / 2);
}
return T;
}
string turn4(string S)
{
reverse(S.begin(), S.end());
return S;
}
string turn5(string S)
{
for (int i = 0; i < S.size(); i++)
{
if (isdigit(S[i]))
{
if (S[i] == '9')
{
S[i] = '0';
}
else
{
S[i]++;
}
}
}
return S;
}
string turn6(string S)
{
for (int i = 0; i < S.size(); i++)
{
if (isdigit(S[i]))
{
if (S[i] == '0')
{
S[i] = '9';
}
else
{
S[i]--;
}
}
}
return S;
}
int main()
{
int n; string S, T;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> S >> T;
for (int i = S.size() - 1; i >= 0; i--)
{
switch (S[i])
{
case 'C': T = turn1(T); break;
case 'J': T = turn2(T); break;
case 'E': T = turn3(T); break;
case 'A': T = turn4(T); break;
case 'M': T = turn5(T); break;
case 'P': T = turn6(T); break;
}
}
cout << T << endl;
}
return 0;
} |
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
for(int i=0;i<n;++i){
string m;
string pat;
cin >> m >> pat;
reverse(m.begin(), m.end());
int sz = pat.size();
for(int j=0;j<m.size();j++){
if(m[j] == 'A'){
reverse(pat.begin(), pat.end());
}else if(m[j] == 'M'){
for(int k=0;k<pat.size();++k){
if(pat[k] == '9'){
pat[k] = '0';
}else if('0' <= pat[k] && pat[k] <= '8'){
pat[k]++;
}
}
}else if(m[j] == 'P'){
for(int k=0;k<pat.size();++k){
if(pat[k] == '0'){
pat[k] = '9';
}else if('1' <= pat[k] && pat[k] <= '9'){
pat[k]--;
}
}
}else if(m[j] == 'C'){
pat += pat[0];
pat = pat.substr(1,sz);
}else if(m[j] == 'J'){
string tmp = "";
tmp += pat[sz-1];
tmp += pat.substr(0,sz-1);
pat = tmp;
}else if(m[j] == 'E'){
string pre="",suf="", mid="";
for(int k=0;k<sz/2;++k){
pre += pat[k];
}
if(sz % 2 == 1){
mid += pat[sz/2];
}
for(int k=(sz+1)/2;k<sz;++k){
suf += pat[k];
}
pat = suf + mid + pre;
}
}
cout << pat << endl;
}
} |
//pku 2041
//std::stringのれんしぅでしゅ
#include <iostream>
#include <algorithm>
#define between(n,x,m) (((n)<=(x))&&((x)<=(m)))
using namespace std;
void J(string &str){rotate(str.begin(),str.begin()+(str.size()-1),str.end());}
void C(string &str){rotate(str.begin(),str.begin()+1,str.end());}
void E(string &str){
int i=(str.size())/2;
string tmp=str;
str.replace(0,i,tmp,str.length()-i,i);
str.replace(str.length()-i,i,tmp,0,i);
}
void A(string &str){reverse(str.begin(),str.end());}
void P(string &str){
int i=str.size();
for(;i>=0;--i){
if(between('0',str[i],'9')){
str[i]--;
if(str[i]=='/')str[i]='9';
}
}
}
void M(string &str){
int i=str.size();
for(;i>=0;--i){
if(between('0',str[i],'9')){
str[i]++;
if(str[i]==':')str[i]='0';
}
}
}
struct x{
string &str;
x(string &_str):str(_str){}
void operator()(char c){
switch(c){
case 'J': J(str);break;
case 'C': C(str);break;
case 'E': E(str);break;
case 'A': A(str);break;
case 'P': P(str);break;
default: M(str);break;
}
}
};
int main(){
string filter,str;
int n;
for(cin>>n;n--;cout<<str<<endl){
cin>>filter>>str;
for_each(filter.rbegin(), filter.rend(), x(str));
}
} |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int n;
cin>>n;
for(int cnt=0;cnt<n;cnt++){
string com,s;
cin>>com>>s;
reverse(com.begin(),com.end());
for(int i=0;i<com.size();i++){
string s0;
if(com[i]=='C'){
for(int j=1;j<s.size();j++) s0.push_back(s[j]);
s0+=s[0];
}
else if(com[i]=='J'){
s0+=s[s.size()-1];
for(int j=0;j<s.size()-1;j++) s0.push_back(s[j]);
}
else if(com[i]=='E'){
int sLen=s.size();
//cout<<sLen<<endl;
if(sLen%2) sLen++;
sLen/=2;
for(int j=sLen;j<s.size();j++) s0.push_back(s[j]);
if(s.size()%2) s0.push_back(s[s.size()/2]);
for(int j=0;j<s.size()/2;j++) s0.push_back(s[j]);
}
else if(com[i]=='A'){
reverse(s.begin(),s.end());
s0=s;
}
else if(com[i]=='M'){
for(int j=0;j<s.size();j++){
if('0'<=s[j]&&s[j]<='8') s[j]++;
else if(s[j]=='9') s[j]='0';
}
s0=s;
}
else if(com[i]=='P'){
for(int j=0;j<s.size();j++){
if('1'<=s[j]&&s[j]<='9') s[j]--;
else if(s[j]=='0') s[j]='9';
}
s0=s;
}
s=s0;
// cout<<com[i]<<" "<<s<<endl;
}
cout<<s<<endl;
}
return 0;
} |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int main() {
int n; cin >> n;
rep(i, n) {
string m, s; cin >> m >> s;
reverse(m.begin(), m.end());
for (char c : m) {
switch (c) {
case'C':rotate(s.begin(), ++s.begin(), s.end()); break;
case'J':rotate(s.begin(), --s.end(), s.end()); break;
case'E':s = s.substr((int)s.size() / 2 + (int)s.size() % 2) + s.substr((int)s.size() / 2, (int)s.size() % 2) + s.substr(0, (int)s.size() / 2); break;
case'A':reverse(s.begin(), s.end()); break;
case'M':transform(s.begin(), s.end(), s.begin(), [](char c) {
if (c == '9')return'0';
if ('0' <= c&&c < '9')return ++c;
return c;
}); break;
case'P':transform(s.begin(), s.end(), s.begin(), [](char c) {
if (c == '0')return'9';
if ('0' < c&&c <= '9')return --c;
return c;
}); break;
}
}
cout << s << endl;
}
} |
#include<iostream>
#include<algorithm>
#include<string>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int cs,s;string ord,st;
void op(char o){
if(o=='A')reverse(st.begin(),st.end());
if(o=='J')rotate(st.rbegin(),st.rbegin()+1,st.rend());
if(o=='C')rotate(st.begin(),st.begin()+1,st.end());
if(o=='E')swap_ranges(st.begin(),st.begin()+s/2,st.begin()+(s+1)/2);
if(o=='P'||o=='M')rep(i,s)if('0'<=st[i]&&st[i]<='9')
st[i]=(st[i]-'0'+(o=='P'?9:1))%10+'0';
}
int main(){
cin>>cs;
while(cs--){
cin>>ord>>st;s=st.size();
rep(i,ord.size())op(ord[ord.size()-1-i]);
cout<<st<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string number = "0123456789";
int n;
cin >> n;
while(n--){
string order, message;
cin >> order >> message;
for(int i = order.size()-1; i >= 0; i--){
if(order[i] == 'M'){
for(int j = 0; j < message.size(); j++){
if('0' <= message[j] && message[j] <= '9'){
int idx = number.find(message[j]);
message[j] = number[(idx+1)%number.size()];
}
}
} else if(order[i] == 'P'){
for(int j = 0; j < message.size(); j++){
if('0' <= message[j] && message[j] <= '9'){
int idx = number.find(message[j]);
message[j] = number[(idx-1+number.size())%number.size()];
}
}
} else if(order[i] == 'A'){
reverse(message.begin(), message.end());
} else if(order[i] == 'E'){
for(int i = 0; i < message.size() / 2; i++){
swap(message[i], message[i + (message.size()+1) / 2]);
}
} else if(order[i] == 'C'){
message = message.substr(1, message.size()-1) + message[0];
} else if(order[i] == 'J'){
message = message[message.size()-1] + message.substr(0, message.size()-1);
}
}
cout << message << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
for(int i = 0;i < n;i++){
string s, t;
cin >> t >> s;
int sz = s.size();
for(int j = t.size()-1;j >= 0;j--){
string ns;
if(t[j] == 'J'){
ns += s[sz-1];
ns += s.substr(0, sz-1);
}
if(t[j] == 'C'){
ns += s.substr(1, sz-1);
ns += s[0];
}
if(t[j] == 'E'){
int hf = sz / 2;
ns += s.substr((sz+1)/2, hf);
if(sz % 2) ns += s[hf];
ns += s.substr(0, hf);
}
if(t[j] == 'A'){
reverse(s.begin(), s.end());
ns = s;
}
if(t[j] == 'P'){
for(int k = 0;k < sz;k++){
if(s[k] >= '0' && s[k] <= '9'){
if(s[k] == '0'){
s[k] = '9';
}else{
s[k]--;
}
}
}
ns = s;
}
if(t[j] == 'M'){
for(int k = 0;k < sz;k++){
if(s[k] >= '0' && s[k] <= '9'){
if(s[k] == '9'){
s[k] = '0';
}else{
s[k]++;
}
}
}
ns = s;
}
s = ns;
// cout << t[j] << endl;
// cout << s << endl;
}
cout << s << endl;
}
return 0;
} |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long int;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll gcd(ll a,ll b) {return b ? gcd(b,a%b):a;}
ll lcm(ll c,ll d){return c/gcd(c,d)*d;}
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
int main(){
int t;
cin>>t;
while(t--){
string q;
cin>>q;
string s;
cin>>s;
int n=q.size(),m=s.size();
reverse(all(q));
for(int i=0;i<n;i++){
string tmp={};
if(q[i]=='J'){
for(int j=0;j<m;j++){
tmp.push_back(s[(j-1+m)%m]);
}
s=tmp;
}
if(q[i]=='C'){
for(int j=0;j<m;j++){
tmp.push_back(s[(j+1)%m]);
}
s=tmp;
}
if(q[i]=='E'){
for(int j=(m+1)/2;j<m;j++){
tmp.push_back(s[j]);
}
if(m%2==1)tmp.push_back(s[m/2]);
for(int j=0;j<m/2;j++){
tmp.push_back(s[j]);
}
s=tmp;
}
if(q[i]=='A'){
reverse(all(s));
}
if(q[i]=='P'){
for(int j=0;j<m;j++){
if(int(s[j]-'0')<=10){
s[j]=char((int(s[j]-'0')+9)%10+'0');
}
}
}
if(q[i]=='M'){
for(int j=0;j<m;j++){
if(int(s[j]-'0')<=10){
s[j]=char((int(s[j]-'0')+1)%10+'0');
}
}
}
}
cout<<s<<"\n";
}
}
|
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
string A(string s){
reverse(s.begin(), s.end());
return s;
}
string C(string s){
return s.substr(1, s.length() - 1) + s[0];
}
string J(string s){
return s.back() + s.substr(0, s.length() - 1);
}
string E(string s){
string res = s.substr((s.length() + 1)/2);
if(s.length()%2 != 0)res += s[s.length()/2];
res += s.substr(0, s.length()/2);
return res;
}
string M(string s){
string res = s;
for (int i = 0; i < s.length(); i++) {
if('0' <= res[i] and res[i] < '9'){
res[i]++;
}else if(res[i] == '9'){
res[i] = '0';
}
}
return res;
}
string P(string s){
string res = s;
for (int i = 0; i < s.length(); i++) {
if('0' < res[i] and res[i] <= '9'){
res[i]--;
}else if(res[i] == '0'){
res[i] = '9';
}
}
return res;
}
int main(){
int n;
std::cin >> n;
for (int roop = 0; roop < n; roop++) {
string ope, s;
std::cin >> ope >> s;
reverse(ope.begin(), ope.end());
for (int i = 0; i < ope.length(); i++) {
if(ope[i] == 'A'){
s = A(s);
}else if(ope[i] == 'E'){
s = E(s);
}else if(ope[i] == 'C'){
s = C(s);
}else if(ope[i] == 'J'){
s = J(s);
}else if(ope[i] == 'M'){
s = M(s);
}else if(ope[i] == 'P'){
s = P(s);
}else{
std::cerr << "hoge" << std::endl;
}
}
std::cout << s << std::endl;
}
return 0;
} |
#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
using namespace std;
#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)
#define REP(i,n) FOR(i,0,n)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
template<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<" "; cout<<endl; }
typedef long long ll;
const int INF = 100000000;
const double EPS = 1e-8;
const int MOD = 1000000007;
int main(){
int n;
cin>>n;
while(n--){
string s,t;
cin>>s>>t;
for(int i = s.size() - 1; i >= 0; i--){
if(s[i] == 'C') t = t.substr(1) + t.substr(0, 1);
if(s[i] == 'J') t = t.substr(t.size()-1) + t.substr(0, t.size()-1);
if(s[i] == 'E'){
if(t.size() % 2) t = t.substr(t.size() / 2 + 1) + t.substr(t.size()/2, 1) + t.substr(0, t.size()/2);
else t = t.substr(t.size()/2) + t.substr(0, t.size()/2);
}
if(s[i] == 'A') reverse(t.begin(), t.end());
if(s[i] == 'M') REP(j, t.size())if(isdigit(t[j])) t[j] = (t[j]-'0' + 1) % 10 + '0';
if(s[i] == 'P') REP(j, t.size())if(isdigit(t[j])) t[j] = (t[j]-'0' + 9) % 10 + '0';
}
cout<<t<<endl;
}
return 0;
} |
//1240
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
char table[10]={'0','1','2','3','4','5','6','7','8','9'};
string now;
void A(){
reverse(now.begin(),now.end());
}
void J(){
char tmp=now[0];
for(int i=0;i<now.size()-1;i++)now[i]=now[i+1];
now[now.size()-1]=tmp;
}
void E(){
string a="",b="",c="";
for(int i=0;i<now.size();i++){
if(i<now.size()/2)a.push_back(now[i]);
else if(i==now.size()/2&&now.size()%2==1)c.push_back(now[i]);
else b.push_back(now[i]);
}
//reverse(a.begin(),a.end());
//reverse(b.begin(),b.end());
now=b+c+a;
}
void C(){
char tmp=now[now.size()-1];
for(int i=now.size()-1;i>0;i--)now[i]=now[i-1];
now[0]=tmp;
}
void P(){
for(int i=0;i<now.size();i++){
if(now[i]-'0'==0)now[i]='9';
else if(now[i]-'0'==1)now[i]='0';
else if(now[i]-'0'==2)now[i]='1';
else if(now[i]-'0'==3)now[i]='2';
else if(now[i]-'0'==4)now[i]='3';
else if(now[i]-'0'==5)now[i]='4';
else if(now[i]-'0'==6)now[i]='5';
else if(now[i]-'0'==7)now[i]='6';
else if(now[i]-'0'==8)now[i]='7';
else if(now[i]-'0'==9)now[i]='8';
}
}
void M(){
for(int i=0;i<now.size();i++){
if(now[i]-'0'==0)now[i]='1';
else if(now[i]-'0'==1)now[i]='2';
else if(now[i]-'0'==2)now[i]='3';
else if(now[i]-'0'==3)now[i]='4';
else if(now[i]-'0'==4)now[i]='5';
else if(now[i]-'0'==5)now[i]='6';
else if(now[i]-'0'==6)now[i]='7';
else if(now[i]-'0'==7)now[i]='8';
else if(now[i]-'0'==8)now[i]='9';
else if(now[i]-'0'==9)now[i]='0';
}
}
int main(){
int n;
cin>>n;
for(int kki=0;kki<n;kki++){
string a;
cin>>a>>now;
for(int i=a.size();i>=0;i--){
if(a[i]=='A')A();
if(a[i]=='C')J();
if(a[i]=='P')P();
if(a[i]=='M')M();
if(a[i]=='E')E();
if(a[i]=='J')C();
//cout<<now<<endl;
}
cout<<now<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MP make_pair
#define PB push_back
#define MOD 1000000007
#define INF (1LL<<30)
#define LLINF (1LL<<60)
#define PI 3.14159265359
#define EPS 1e-12
#define int ll
signed main(void)
{
int n;
cin >> n;
REP(i, n) {
string s, t;
cin >> t >> s;
for(int j=t.size()-1; j>=0; --j) {
if(t[j] == 'C') {
string tmp;
FOR(i, 1, s.size()) tmp += s[i];
tmp += s[0];
s = tmp;
} else if(t[j] == 'J') {
string tmp;
tmp += s[s.size()-1];
REP(i, s.size()-1) tmp += s[i];
s = tmp;
} else if(t[j] == 'E') {
string tmp;
FOR(i, s.size()/2 + !!(s.size()%2), s.size()) tmp += s[i];
if(s.size()%2) tmp += s[s.size()/2];
REP(i, s.size()/2) tmp += s[i];
s = tmp;
} else if(t[j] == 'A') {
REP(i, s.size()/2) swap(s[i], s[s.size()-1-i]);
} else if(t[j] == 'M') {
REP(i, s.size()) {
if('0' <= s[i] && s[i] <= '8') s[i]++;
else if(s[i] == '9') s[i] = '0';
}
} else if(t[j] == 'P') {
REP(i, s.size()) {
if('1' <= s[i] && s[i] <= '9') s[i]--;
else if(s[i] == '0') s[i] = '9';
}
}
//cout << j << " " << t[j] << " " << s << endl;
}
cout << s << endl;
}
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(void)
{
int i1,i2,i3;
int n;
string order;
string s;
char c;
string temp1,temp2,temp3;
cin >> n;
for(i1=0;i1<n;i1++){
cin >> order;
cin >> s;
reverse(order.begin(), order.end());
for(i2=0;i2<order.size();i2++){
if(order[i2]=='J'){
c = s[s.size()-1];
s = s.substr(0,s.size()-1);
s = c + s;
}
else if(order[i2]=='C'){
c = s[0];
s = s.substr(1);
s = s + c;
}
else if(order[i2]=='E'){
temp2 = "";
temp3 = s.substr(0,(s.size()/2));
if(s.size()%2==1){
temp2 = s.substr((s.size()/2),1);
temp1 = s.substr((s.size()/2+1));
}
else temp1 = s.substr(s.size()/2);
//cout << temp1 << " " << temp2 << " " << temp3 << endl;
s = temp1 + temp2 + temp3;
}
else if(order[i2]=='A'){
reverse(s.begin(), s.end());
}
else if(order[i2]=='P'){
for(i3=0;i3<s.size();i3++){
if(s[i3] >= '1' && s[i3] <= '9'){
s[i3] = s[i3] - 1;
}
else if(s[i3]=='0'){
s[i3] = '9';
}
}
}
else if(order[i2]=='M'){
for(i3=0;i3<s.size();i3++){
if(s[i3] >= '0' && s[i3] <= '8'){
s[i3] = s[i3] + 1;
}
else if(s[i3]=='9'){
s[i3] = '0';
}
}
}
}
cout << s << endl;
}
return 0;
} |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main(){
int n;
cin >> n;
for(int i=0; i<n; i++){
string order, m;
cin >> order >> m;
int len = m.length();
for(int j=order.length()-1; j>=0; j--){
switch(order[j]){
case 'J':
m = m.substr(len-1,1) + m.substr(0,len-1);
break;
case 'C':
m = m.substr(1, len-1) + m.substr(0,1);
break;
case 'E':
if(len%2==0){
m = m.substr((len+1)/2, len/2)
+ m.substr(0, len/2);
}else{
m = m.substr((len+2)/2, (len-1)/2)
+ m.substr(len/2, 1)
+ m.substr(0, (len-1)/2);
}
break;
case 'A':
reverse(m.begin(), m.end());
break;
case 'P':
for(int d=0; d<len; d++){
if(m[d] >= '1' && m[d] <= '9'){
m[d]--;
}else if(m[d] == '0'){
m[d] = '9';
}
}
break;
case 'M':
for(int d=0; d<len; d++){
if(m[d] >= '0' && m[d] <= '8'){
m[d]++;
}else if(m[d] == '9'){
m[d] = '0';
}
}
break;
}
}
cout << m << endl;
}
return 0;
} |
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main(){
int n;
cin>>n;
while(n--){
string messengers;
string message;
cin>>messengers;
cin>>message;
for(int i=(int)messengers.size()-1;i>=0;i--){
if(messengers[i]=='J'){
char first=message[(int)message.size()-1];
for(int i=(int)message.size()-1;i>=1;i--){
message[i]=message[i-1];
}
message[0]=first;
}else if(messengers[i]=='C'){
char last=message[0];
for(int i=0;i<(int)message.size()-1;i++){
message[i]=message[i+1];
}
message[(int)message.size()-1]=last;
}else if(messengers[i]=='E'){
string sleft=message.substr(0,(message.size())/2);
string sright=message.substr((message.size()+1)/2);
for(int i=0;i<int(message.size()/2);i++){
message[i]=sright[i];
message[i+(message.size()+1)/2]=sleft[i];
}
}else if(messengers[i]=='A'){
reverse(message.begin(),message.end());
}else if(messengers[i]=='P'){
for(int i=0;i<(int)message.size();i++){
if('0'<=message[i] && message[i]<='9'){
if(message[i]=='0') message[i]='9';
else message[i]--;
}
}
}else{
for(int i=0;i<(int)message.size();i++){
if('0'<=message[i]&&message[i]<='9'){
if(message[i]=='9') message[i]='0';
else message[i]++;
}
}
}
}
cout<<message<<endl;
}
return 0;
} |
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int main() {
int N,i,j,k,q;char T[50],c[9];scanf("%d",&N);while (N--) {
scanf("%s%s",&c,&T);j=strlen(c),k=strlen(T)-1;
while (j--) {
if (c[j]=='P') {
for (i=k;i>=0;i--) {if (T[i]>='1' && T[i]<='9') T[i]--; else if (T[i]=='0') T[i]='9';}
} else if (c[j]=='M') {
for (i=k;i>=0;i--) {if (T[i]>='0' && T[i]<='8') T[i]++; else if (T[i]=='9') T[i]='0';}
} else if (c[j]=='E') {
for (i=k,q=(k-1)/2;q>=0;i--,q--) swap(T[i],T[q]);
} else if (c[j]=='A') {
for (i=0,q=k;i<q;i++,q--) swap(T[i],T[q]);
} else if (c[j]=='J') {
c[8]=T[k];for (i=k;i>0;i--) T[i]=T[i-1];T[0]=c[8];
} else {
c[8]=T[0];for (i=0;i<k;i++) T[i]=T[i+1];T[k]=c[8];
}
}
puts(T);
}
} |
#include <bits/stdc++.h>
using namespace std;
string o, m;
void solve() {
int len = (int)o.size();
int sz = (int)m.size();
for (int i = len - 1; i >= 0; i--) {
switch (o[i]) {
case 'J':
m = m[sz - 1] + m.substr(0, sz - 1);
break;
case 'C':
m = m.substr(1, sz - 1) + m[0];
break;
case 'E':
if (sz % 2) {
m = m.substr(sz / 2 + 1, sz / 2) + m[sz / 2] + m.substr(0, sz / 2);
} else {
m = m.substr(sz / 2, sz / 2) + m.substr(0, sz / 2);
}
break;
case 'A':
reverse(m.begin(), m.end());
break;
case 'P':
for (int i = 0; i < sz; i++) {
if ('1' <= m[i] && m[i] <= '9') {
char c = m[i] - 1;
m[i] = c;
} else if (m[i] == '0') m[i] = '9';
}
break;
case 'M':
for (int i = 0; i < sz; i++) {
if ('0' <= m[i] && m[i] <= '8') {
char c = m[i] + 1;
m[i] = c;
} else if (m[i] == '9') m[i] = '0';
}
break;
default:
break;
}
}
cout << m << endl;
}
int main() {
int n; cin >> n;
for (int i = 0; i < n; i++) {
cin >> o;
cin >> m;
solve();
}
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
for(int i=0; i<n; ++i) {
string order, message;
cin >> order >> message;
reverse(order.begin(), order.end());
for(int j=0; j<order.size(); ++j) {
if(order[j] == 'J') {
message = message.substr(message.size()-1, 1) + message.substr(0, message.size()-1);
} else if(order[j] == 'C') {
message = message.substr(1, message.size()-1) + message.substr(0, 1);
} else if(order[j] == 'E') {
string left = message.substr(0, message.size()/2);
string right = message.substr((message.size()+1)/2, message.size()/2);
if(message.size()%2 == 0) {
message = right + left;
} else {
string mid = message.substr(message.size()/2, 1);
message = right + mid + left;
}
} else if(order[j] == 'A') {
reverse(message.begin(), message.end());
} else if(order[j] == 'P') {
for(int k=0; k<message.size(); ++k) {
char c = message[k];
if('0' <= c && c <= '9') {
message[k] = '0' + (c-'0'+9)%10;
}
}
} else if(order[j] == 'M') {
for(int k=0; k<message.size(); ++k) {
char c = message[k];
if('0' <= c && c <= '9') {
message[k] = '0' + (c-'0'+1)%10;
}
}
}
}
cout << message << endl;
}
}
|
#include<iostream>
#include<string>
using namespace std;
void Mr_J(string *str){
string s1,s2;
s1=(*str).substr(0,1);
s2=(*str).substr(1);
(*str)=s2+s1;
}
void Miss_C(string *str){
string s1,s2;
s1=(*str).substr(0,(*str).size()-1);
s2=(*str).substr((*str).size()-1);
(*str)=s2+s1;
}
void Mr_E(string *str){
string s1,s2,s3;
if((*str).size() % 2 == 0){
s1=(*str).substr(0,(*str).size()/2);
s2=(*str).substr((*str).size()/2);
(*str)=s2+s1;
}else{
s1=(*str).substr(0,(*str).size()/2);
s2=(*str).substr(((*str).size()/2)+1);
s3=(*str).substr((*str).size()/2,1);
(*str)=s2+s3+s1;
}
}
void Mr_A(string *str){
string s1;
s1="";
for(int i=(*str).size()-1 ; i >= 0 ; i--){
s1+=(*str)[i];
}
(*str)=s1;
}
void Dr_P(string *str){
for(int i=0 ; i < (*str).size() ; i++){
if((*str)[i] >= '0' && (*str)[i] <= '9'){
(*str)[i]=(*str)[i]+1;
if((*str)[i] > '9')(*str)[i]='0';
}
}
}
void Mr_M(string *str){
for(int i=0 ; i < (*str).size() ; i++){
if((*str)[i] >= '0' && (*str)[i] <= '9'){
(*str)[i]=(*str)[i]-1;
if((*str)[i] < '0')(*str)[i]='9';
}
}
}
int main(){
int n;
cin >>n;
for(int i=0 ; i < n ; i++){
string key,str;
cin >>key;
cin >>str;
for(int j=key.size()-1 ; j >= 0; j--){
switch(key[j]){
case 'J':
Miss_C(&str);
break;
case 'C':
Mr_J(&str);
break;
case 'E':
Mr_E(&str);
break;
case 'A':
Mr_A(&str);
break;
case 'P':
Mr_M(&str);
break;
case 'M':
Dr_P(&str);
break;
}
}
cout <<str<<endl;
}
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
int n, len;
cin >> n;
string msg, srv;
while (cin >> srv >> msg, n--) {
len = msg.size();
for (int i = srv.size() - 1; i >= 0; --i) {
if (srv[i] == 'J') {
rotate(msg.begin(), msg.end() - 1, msg.end());
} else if (srv[i] == 'C') {
rotate(msg.begin(), msg.begin() + 1, msg.end());
} else if (srv[i] == 'E') {
if (len % 2)
msg = msg.substr(len / 2 + 1) + msg[len / 2] + msg.substr(0, len / 2);
else
msg = msg.substr(len / 2) + msg.substr(0, len / 2);
} else if (srv[i] == 'A') {
reverse(msg.begin(), msg.end());
} else if (srv[i] == 'P') {
for (int j = 0; j < len; ++j) {
if (msg[j] >= '0' && msg[j] <= '9')
msg[j] = (msg[j] - '0' + 9) % 10 + '0';
}
} else {
for (int j = 0; j < len; ++j) {
if (msg[j] >= '0' && msg[j] <= '9')
msg[j] = (msg[j] - '0' + 1) % 10 + '0';
}
}
}
cout << msg << endl;
}
return 0;
} |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
char a[7],ans[26],b[26],x=0,y=0;
scanf("%s",a);
x=strlen(a);
scanf("%s",ans);
y=strlen(ans);
for(int j=0;j<y;j++)
b[j]=ans[j];
for(int k=x-1;k>=0;k--){
if(a[k]=='C'){//??????
b[y-1]=ans[0];
for(int j=1;j<y;j++) b[j-1]=ans[j];
}
else if(a[k]=='J'){//??????
b[0]=ans[y-1];
for(int j=0;j<y-1;j++) b[j+1]=ans[j];
}
else if(a[k]=='E'){//swap
if(y%2==0)
for(int j=0;j<y/2;j++)
swap(b[j],b[j+(y/2)]);
else
for(int j=0;j<y/2;j++)
swap(b[j],b[j+(y/2)+1]);
}
else if(a[k]=='A'){//????????????
int o=y;
while(1){
if(o==0)break;
for(int j=0;j<y;j++){
b[j]=ans[o-1];
o--;
}
}
}
else if(a[k]=='M'){//+1
for(int j=0;j<y;j++)
if(ans[j]>='0'&&ans[j]<='8') b[j]=ans[j]+1;
else if(ans[j]=='9') b[j]=ans[j]-9;
}
else if(a[k]=='P')//-1
for(int j=0;j<y;j++)
if(ans[j]>='1'&&ans[j]<='9') b[j]=ans[j]-1;
else if(ans[j]=='0') b[j]=ans[j]+9;
for(int j=0;j<y;j++)
ans[j]=b[j];
}
for(int j=0;j<y;j++)
cout<<ans[j];
cout<<endl;
}
return 0;
} |
#include<iostream>
#include<string>
#include<algorithm>
#include<cctype>
using namespace std;
int main(){
int n;
cin >> n;
while(n--){
string done,message;
cin >> done >> message;
reverse(done.begin(),done.end());
for(int i = 0 ; i < done.size() ; i++ ){
switch(done[i]){
case 'J':
rotate(message.begin(),message.begin()+message.size()-1,message.end());
break;
case 'C':
rotate(message.begin(),message.begin()+1,message.end());
break;
case 'E':
for(int j = 0 ; j < message.size() / 2 ; j++ ){
swap(message[j],message[(message.size()+1)/2+j]);
}
break;
case 'A':
reverse(message.begin(),message.end());
break;
case 'P':
for(int j = 0 ; j < message.size() ; j++ ){
if(isdigit(message[j])) message[j] = (message[j]-'0'+9)%10+'0';
}
break;
case 'M':
for(int j = 0 ; j < message.size() ; j++ ){
if(isdigit(message[j])) message[j] = (message[j]-'0'+1)%10+'0';
}
break;
}
//cout << message << endl;
}
cout << message << endl;
}
} |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int n,l;
string o,k;
cin>>n;
while(n--){
cin>>o>>k;
int l=k.size();
for(int i=o.size()-1;i>=0;i--){
if(o[i]=='J')
k=k[l-1]+k.substr(0,l-1);
else if(o[i]=='C')
k=k.substr(1,l-1)+k[0];
else if(o[i]=='E'){
if(l%2)
k=k.substr(l/2+1)+k[l/2]+k.substr(0,l/2);
else
k=k.substr(l/2)+k.substr(0,l/2);
}
else if(o[i]=='A')
reverse(k.begin(),k.end());
else if(o[i]=='P'){
for(int j=0;j<l;j++){
if('1'<=k[j]&&k[j]<='9')
k[j]--;
else if(k[j]=='0')
k[j]='9';
}
}
else if(o[i]=='M'){
for(int j=0;j<l;j++){
if('0'<=k[j]&&k[j]<='8')
k[j]++;
else if(k[j]=='9')
k[j]='0';
}
}
}
cout<<k<<endl;
}
return 0;
} |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
int n;
string s, m;
cin >> n;
for(int i = 0; i < n; i++)
{
cin >> m >> s;
for(int j = m.length() - 1; j >= 0; j--)
{
switch(m[j])
{
case 'C':
s = s.substr(1, s.length() - 1) + s[0];
break;
case 'J':
s = s[s.length() - 1] + s.substr(0, s.length() - 1);
break;
case 'E':
{
int a = s.length() / 2, b = s.length() % 2;
s = s.substr(a + b, a) + s.substr(a, b) + s.substr(0, a);
}
break;
case 'A':
reverse(s.begin(), s.end());
break;
case 'M':
for(int k = 0; k < s.length(); k++)
if(s[k] >= '0' && s[k] <= '9')
s[k] = (s[k] - '0' + 1) % 10 + '0';
break;
case 'P':
for(int k = 0; k < s.length(); k++)
if(s[k] >= '0' && s[k] <= '9')
s[k] = (s[k] - '0' + 9) % 10 + '0';
break;
}
}
cout << s << endl;
}
} |
//????¨???????????????????????????????????????????.
//????????????????????????????????°??????.
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int n;
string people;
string result;
string rshift(string s) {
string ret;
ret += s[s.length() - 1];
for (int i = 0; i < s.length() - 1; i++) ret += s[i];
return ret;
}
string lshift(string s) {
string ret;
for (int i = 1; i < s.length(); i++) ret += s[i];
ret += s[0];
return ret;
}
string swaplr(string s) {
string pre, suf;
for (int i = 0; i < s.length() / 2; i++) pre += s[i];
for (int i = 0; i < s.length() / 2; i++) suf += s[s.length() / 2 + s.length() % 2 + i];
if (s.length() % 2) return suf + s[s.length() / 2] + pre;
return suf + pre;
}
string reverse(string s) {
int l = 0, r = s.length() - 1;
while (l < r) {
swap(s[l], s[r]);
l++;
r--;
}
return s;
}
string decrements(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]--;
}
}
return s;
}
string increments(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]++;
}
}
return s;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> people >> result;
for (int j = people.length() - 1; j >= 0; j--) {
char c = people[j];
if (c == 'J') result = rshift(result);
if (c == 'C') result = lshift(result);
if (c == 'E') result = swaplr(result);
if (c == 'A') result = reverse(result);
if (c == 'P') result = decrements(result);
if (c == 'M') result = increments(result);
}
cout << result << endl;
}
return 0;
} |
#include <iostream>
#include <algorithm>
#include <string>
#include <cctype>
using namespace std;
char dec(char c) {
if(isdigit(c)) {
int d = c - '0';
d = (d - 1 + 10) % 10;
return '0' + d;
}
return c;
}
char inc(char c) {
if(isdigit(c)) {
int d = c - '0';
d = (d + 1) % 10;
return '0' + d;
}
return c;
}
int main() {
int N; cin >> N;
while(N--) {
string op; cin >> op;
reverse(op.begin(), op.end());
string s; cin >> s;
for(char c : op) {
if(c == 'J') s = s.substr(s.length() - 1) + s.substr(0, s.length() - 1);
if(c == 'C') s = s.substr(1) + s.substr(0, 1);
if(c == 'E') {
if(s.length() & 1) {
s = s.substr(s.length() / 2 + 1) + s.substr(s.length() / 2, 1) + s.substr(0, s.length() / 2);
}
else {
s = s.substr(s.length() / 2) + s.substr(0, s.length() / 2);
}
}
if(c == 'A') reverse(s.begin(), s.end());
if(c == 'P') for(int i = 0; i < (int)s.length(); i++) s[i] = dec(s[i]);
if(c == 'M') for(int i = 0; i < (int)s.length(); i++) s[i] = inc(s[i]);
}
cout << s << endl;
}
} |
#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;
int main(void) {
ll N;
cin >> N;
vector<string> order(N), message(N);
REP(i, 0, N) cin >> order[i] >> message[i];
REP(i, 0, N) {
string s(message[i]);
ll l = message[i].length();
REP(j, 0, order[i].size()) {
char c = order[i][order[i].size() - j - 1];
string t(s);
if(c == 'J') {
REP(k, 0, l) t[(k + 1 + l) % l] = s[k];
}
if(c == 'C') {
REP(k, 0, l) t[(k - 1 + l) % l] = s[k];
}
if(c == 'E') {
REP(k, 0, l / 2) swap(t[k], t[k + l / 2 + l % 2]);
}
if(c == 'A') {
reverse(t.begin(), t.end());
}
if(c == 'P') {
REP(k, 0, l) if('0' <= t[k] && t[k] <= '9') {
t[k] = (t[k] - 1 - '0' + 10) % 10 + '0';
}
}
if(c == 'M') {
REP(k, 0, l) if('0' <= t[k] && t[k] <= '9') {
t[k] = (t[k] + 1 - '0' + 10) % 10 + '0';
}
}
swap(s, t);
}
cout << s << endl;
}
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
string a, b;
string p1 = "98765432109";
string p2 = "01234567890";
cin >> n;
getline(cin, a);
for (int i = 0; i < n; i++) {
getline(cin, a);
getline(cin, b);
for (int j = a.size()-1; j >= 0; j--) {
if (a[j] == 'J') {
string c = "";
c += b[b.size()-1];
b = b.substr(0, b.size()-1);
c += b;
b = c;
} else if (a[j] == 'C') {
string c = "";
c = b.substr(1);
c += b[0];
b = c;
} else if (a[j] == 'E') {
string c1 = b.substr(0, b.size()/2);
if (b.size() % 2 == 0) {
string c2 = b.substr(b.size()/2);
b = c2+c1;
} else {
string c2 = b.substr(b.size()/2+1);
string c3 = "";
c3 += b[b.size()/2];
b = c2+c3+c1;
}
} else if (a[j] == 'A') {
string c = "";
for (int k = b.size()-1; k >= 0; k--) {
c += b[k];
}
b = c;
} else if (a[j] == 'P') {
for (int k = 0; k < b.size(); k++) {
if (0 <= b[k]-'0' && b[k]-'0' <= 9) {
for (int l = 0; l < p1.size()-1; l++) {
if (b[k] == p1[l]) {
b[k] = p1[l+1];
break;
}
}
}
}
} else {
for (int k = 0; k < b.size(); k++) {
if (0 <= b[k]-'0' && b[k]-'0' <= 9) {
for (int l = 0; l < p2.size()-1; l++) {
if (b[k] == p2[l]) {
b[k] = p2[l+1];
break;
}
}
}
}
}
}
cout << b << endl;
}
return 0;
} |
#include<iostream>
#include<string>
#include<algorithm>
#include<cctype>
#define all(c) (c).begin(),(c).end()
using namespace std;
void J(string &s){
string a="";
a+=s.substr(1,s.size()-1);
a+=s[0];
s=a;
}
void C(string &s){
string a="";
a+=s[s.size()-1];
a+=s.substr(0,s.size()-1);
s=a;
}
void E(string &s){
string a="";
if(s.size()%2==1){
a+=s.substr(s.size()/2+1,s.size()/2);
a+=s[s.size()/2];
a+=s.substr(0,s.size()/2);
}
else {
a+=s.substr(s.size()/2,s.size()/2);
a+=s.substr(0,s.size()/2);
}
s=a;
}
void A(string &s){
reverse(all(s));
}
void P(string &s){
for(int i=0;i<s.size();i++){
if(s[i]=='9')s[i]='0';
else if(isdigit(s[i]))s[i]++;
}
}
void M(string &s){
for(int i=0;i<s.size();i++){
if(s[i]=='0')s[i]='9';
else if(isdigit(s[i]))s[i]--;
}
}
int main(void){
int n;
string s,com;
cin >> n;
while(n--){
cin >> com >> s;
A(com);
for(int i=0;i<com.size();i++){
if(com[i]=='J')C(s);
else if(com[i]=='C')J(s);
else if(com[i]=='E')E(s);
else if(com[i]=='A')A(s);
else if(com[i]=='P')M(s);
else P(s);
}
cout << s << endl;
}
return 0;
} |
#include<iostream>
#include<string>
#include<map>
#include<algorithm>
#include<cctype>
using namespace std;
string A(string s){
return string(s.rbegin(),s.rend());
}
string C(string s){
return s[s.size()-1]+string(s.begin(),s.end()-1);
}
string J(string s){
return string(s.begin()+1,s.end())+s[0];
}
string E(string s){
for(int i=0;i<s.size()/2;i++)swap(s[i],s[i+(s.size()+1)/2]);
return s;
}
string M(string s){
for(int i=0;i<s.size();i++){
if(!isdigit(s[i]))continue;
s[i]='0'+(s[i]-'0'-1+10)%10;
}
return s;
}
string P(string s){
for(int i=0;i<s.size();i++){
if(!isdigit(s[i]))continue;
s[i]='0'+(s[i]-'0'+1)%10;
}
return s;
}
int main(){
map<char,string (*)(string) > ifunc;
ifunc['A']=A;ifunc['E']=E;
ifunc['J']=C;ifunc['C']=J;
ifunc['M']=P;ifunc['P']=M;
int n;
cin>>n;
while(n--){
string ord,mes;
cin>>ord>>mes;
for(int i=ord.size()-1;i>=0;i--)
mes=(*ifunc[ord[i]])(mes);
cout<<mes<<endl;
}
return 0;
} |
#include <iostream>
#include <vector>
#include <cstring>
#include <string>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <cassert>
using namespace std;
string J(string s) {
return s.back() + s.substr(0, s.size() - 1);
}
string C(string s) {
return s.substr(1, s.size() - 1) + s.front();
}
string E(string s) {
string ret;
if(s.size() % 2) {
for(int i = s.size() / 2 + 1; i < s.size(); i++) {
ret += s[i];
}
ret += s[s.size() / 2];
for(int i = 0; i < s.size() / 2; i++) {
ret += s[i];
}
}
else {
for(int i = s.size() / 2; i < s.size(); i++) {
ret += s[i];
}
for(int i = 0; i < s.size() / 2; i++) {
ret += s[i];
}
}
return ret;
}
string A(string s) {
reverse(s.begin(), s.end());
return s;
}
string P(string s) {
for(int i = 0; i < s.size(); i++) {
if(!isalpha(s[i])) {
s[i] = '0' + (s[i] - '0' + 9) % 10;
}
}
return s;
}
string M(string s) {
for(int i = 0; i < s.size(); i++) {
if(!isalpha(s[i])) {
s[i] = '0' + (s[i] - '0' + 1) % 10;
}
}
return s;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
for(int loop = 0; loop < n; loop++) {
string s, t;
cin >> s >> t;
for(int i = s.size() - 1; i >= 0; i--) {
char c = s[i];
if(c == 'J') t = J(t);
if(c == 'C') t = C(t);
if(c == 'E') t = E(t);
if(c == 'A') t = A(t);
if(c == 'P') t = P(t);
if(c == 'M') t = M(t);
}
cout << t << endl;
}
} |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++){
string ord,mes;
cin>>ord>>mes;
reverse(ord.begin(),ord.end());
for(int j=0;j<ord.size();j++){
char c=ord[j];
if(c=='J'){
rotate(mes.begin(),mes.begin()+mes.size()-1,mes.end());
}else if(c=='C'){
rotate(mes.begin(),mes.begin()+1,mes.end());
}else if(c=='E'){
string x,y,z;
for(int k=0;k<mes.size()/2;k++){
x.push_back(mes[k]);
}
if(mes.size()%2==1) y.push_back(mes[mes.size()/2]);
for(int k=mes.size()/2+(mes.size()%2?1:0);k<mes.size();k++){
z.push_back(mes[k]);
}
mes=z+y+x;
}else if(c=='A'){
reverse(mes.begin(),mes.end());
}else if(c=='P'){
for(int k=0;k<mes.size();k++){
if('1'<=mes[k]&&mes[k]<='9') mes[k]-=1;
else if(mes[k]=='0') mes[k]='9';
}
}else if(c=='M'){
for(int k=0;k<mes.size();k++){
if('0'<=mes[k]&&mes[k]<='8') mes[k]+=1;
else if(mes[k]=='9') mes[k]='0';
}
}
}
cout<<mes<<endl;
}
}
|
#include<iostream>
#include<vector>
#include<string>
#define rep(i,a,b) for(int i=a;i<b;i++)
using namespace std;
int main(void){
int n;
cin>>n;
for(int k=0;k<n;k++){
string s,o;
cin>>o>>s;
int t=o.size(),si=s.size();
for(int i=t-1;i>=0;i--){
if(o[i]=='J'){
char temp=s[si-1];
rep(j,1,si){
s[si-j]=s[si-j-1];
}
s[0]=temp;
}else if(o[i]=='C'){
char temp=s[0];
rep(j,0,si-1){
s[j]=s[j+1];
}
s[si-1]=temp;
}else if(o[i]=='A'){
rep(j,0,si/2){
swap(s[j],s[si-1-j]);
}
}else if(o[i]=='E'){
string b,m,e;
rep(j,0,si/2){
b+=s[j];
}
int l=0;
if(si%2==1){
m=s[si/2];
l++;
}
rep(j,si/2+l,si){
e+=s[j];
}
s=e;
s+=m;
s+=b;
}else if(o[i]=='P'){
rep(j,0,si){
if(s[j]>='0'&&s[j]<='9'){
s[j]--;
if(s[j]<'0'){
s[j]='9';
}
}
}
}else{
rep(j,0,si){
if(s[j]>='0'&&s[j]<='9'){
s[j]++;
if(s[j]>'9'){
s[j]='0';
}
}
}
}
}
cout<<s<<endl;
}
return 0;
} |
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, int> ppi;
#define INF 1000000000
int main(){
int n;
cin>>n;
rep(repeat, n){
char rule[10];
scanf("%s", rule);
string s;
cin>>s;
int sz=s.size();
for(int i=strlen(rule)-1; i>=0; i--){
switch(rule[i]){
case 'J':
s = s.substr(sz-1,1) + s.substr(0, sz-1);
break;
case 'C':
s = s.substr(1, sz-1) + s.substr(0,1);
break;
case 'E':
s = s.substr((sz+1)/2, sz/2) + s.substr(sz/2, sz%2)
+ s.substr(0, sz/2);
break;
case 'A':
reverse(all(s));
break;
case 'P':
rep(j,sz){
if(s[j]>='1' && s[j]<='9') s[j]--;
else if(s[j]=='0') s[j]='9';
}
break;
case 'M':
rep(j,sz){
if(s[j]>='0' && s[j]<='8') s[j]++;
else if(s[j]=='9') s[j]='0';
}
break;
default:
cout<<"BUG"<<endl;
}
}
cout<<s<<endl;
}
return 0;
} |
#include <iostream>
#include <algorithm>
#include <ctype.h>
using namespace std;
int main(){
int n,t;
string type,s,a,b,c;
cin >> n;
while(n--){
cin >> type >> s;
reverse(type.begin(),type.end());
for(int i=0;i<type.length();i++){
switch(type[i]){
case 'J':
rotate(s.begin(),s.begin()+s.length()-1,s.end());
break;
case 'C':
rotate(s.begin(),s.begin()+1,s.end());
break;
case 'E':
t = s.length();
a = s.substr(0,t/2);
b = s.substr(t/2+t%2,t/2);
c = "";if(t%2)c = s[t/2];
s = b+c+a;
break;
case 'A':
reverse(s.begin(),s.end());
break;
case 'P':
for(int j=0;j<s.length();j++){
if( isdigit(s[j]) ){
s[j] = '0'+(s[j]-'0'+9)%10;
}
}
break;
case 'M':
for(int j=0;j<s.length();j++){
if( isdigit(s[j]) ){
s[j] = '0'+(s[j]-'0'+1)%10;
}
}
break;
}
}
cout << s << endl;
}
} |
#include<iostream>
#include<string>
using namespace std;
int main(){
int n;
cin >> n;
for(int k=0;k<n;k++){
string order,str,buf;
cin >> order >> str;
for(int i=order.size()-1;i>=0;i--){
int s=str.size();
switch(order[i]) {
case 'J' :
buf=str;
for(int j=0;j<s;j++)
str[j+1]=buf[j];
str[0]=buf[s-1];
break;
case 'C' :
buf=str;
for(int j=0;j<s;j++)
str[j]=buf[j+1];
str[s-1]=buf[0];
break;
case 'E' :
buf=str;
for(int j=0;j<s/2;j++){
str[j]=buf[j+s-s/2];
}
for(int j=s-s/2;j<s;j++){
str[j]=buf[j-s+s/2];
}
break;
case 'A' :
buf=str;
for(int j=0;j<s/2;j++){
str[j]=buf[s-1-j];
str[s-1-j]=buf[j];
}
break;
case 'P' :
for(int j=0;j<s;j++){
if(str[j]=='0') str[j]='9';
else if('0'<str[j]&&str[j]<='9') str[j]--;
}
break;
case 'M' :
for(int j=0;j<s;j++){
if(str[j]=='9') str[j]='0';
else if('0'<=str[j]&&str[j]<'9') str[j]++;
}
break;
}
}
cout << str << endl;
}
return 0;
} |
#include <iostream>
#include <string>
using namespace std;
int main() {
long long int n;
cin >> n;
for ( long long int i = 0; i < n; i++ ) {
string o, in;
cin >> o >> in;
for ( long long int j = o.size() - 1; j >= 0; j-- ) {
if ( o[j] == 'J' ) {
in = in[ in.size() - 1 ] + in.substr( 0, in.size() - 1 );
}else if ( o[j] == 'C' ) {
in = in.substr( 1, in.size() - 1 ) + in[0];
}else if ( o[j] == 'E' ) {
long long int k = in.size() / 2;
if ( ( in.size() % 2 ) == 0 ) {
in = in.substr( k, k ) + in.substr( 0, k );
}else {
in = in.substr( k + 1, k ) + in[k] + in.substr( 0, k );
}
}else if ( o[j] == 'A' ) {
string s = "";
for ( long long int x = in.size() - 1; x >= 0; x-- ) {
s += in[x];
}
in = s;
}else if ( o[j] == 'M' ) {
for ( long long int x = 0; x < in.size(); x++ ) {
if ( in[x] >= '0' && in[x] < '9' ) {
in[x]++;
}else if ( in[x] == '9' ) {
in[x] = '0';
}
}
}else if ( o[j] == 'P' ) {
for ( long long int x = 0; x < in.size(); x++ ) {
if ( in[x] > '0' && in[x] <= '9' ) {
in[x]--;
}else if ( in[x] == '0' ) {
in[x] = '9';
}
}
}
}
cout << in << endl;
}
return 0;
} |
#include<cstdio>
#include<vector>
#include<algorithm>
#include<iostream>
#include<string>
#include<cctype>
using namespace std;
int main(){
int n;
cin>>n;
while(n--){
string p,s;
cin>>p>>s;
reverse(p.begin(),p.end());
for(int i=0;i<p.length();i++){
if(p[i]=='C')rotate(s.begin(),s.begin()+1,s.end());
else if(p[i]=='J')rotate(s.begin(),s.begin()+s.length()-1,s.end());
else if(p[i]=='E'){
for(int j=0;j<s.length()/2;j++)swap(s[j],s[j+(s.length()+1)/2]);
}
else if(p[i]=='A'){
reverse(s.begin(),s.end());
}
else if(p[i]=='M'){
for(int i=0;i<s.length();i++){
if(!isdigit(s[i]))continue;
s[i]=((s[i]-'0')+1)%10+'0';
}
}
else{
for(int i=0;i<s.length();i++){
if(!isdigit(s[i]))continue;
s[i]=((s[i]-'0')+9)%10+'0';
}
}
}
cout<<s<<endl;
}
return 0;
} |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
while(n--) {
string MSer, MS; cin >> MSer >> MS;
int len = MS.length();
for(int i = (int)MSer.length() - 1; i >= 0; i--) {
if(MSer[i] == 'J') {
for(int i = len - 1; i > 0; i--) {
swap(MS[i-1], MS[i]);
}
}
if(MSer[i] == 'C') {
FOR(i,1,len) {
swap(MS[i-1], MS[i]);
}
}
if(MSer[i] == 'E') {
string ms1 = "", ms2 = "";
FOR(i,0,len) {
if(i < len / 2) {
ms1 += MS[i];
} else if(len % 2 == 1 && i == len / 2) {
ms1 = MS[i] + ms1;
} else {
ms2 += MS[i];
}
}
MS = ms2 + ms1;
}
if(MSer[i] == 'A') {
reverse(MS.begin(), MS.end());
}
if(MSer[i] == 'P') {
FOR(i,0,len) {
if(isdigit(MS[i])){
int x = MS[i] - '0';
x = (x - 1 + 10) % 10;
char y = x + '0';
MS[i] = y;
}
}
}
if(MSer[i] == 'M') {
FOR(i,0,len) {
if(isdigit(MS[i])){
int x = MS[i] - '0';
x = (x + 1) % 10;
char y = x + '0';
MS[i] = y;
}
}
}
}
cout << MS << endl;
}
return 0;
} |
#include<iostream>
#include<algorithm>
using namespace std;
int n;
int main()
{
cin>>n;
for(;n--;)
{
string s,t;
cin>>t>>s;
for(int i=t.size();i--;)
{
if(t[i]=='J')
{
s=s[s.size()-1]+s.substr(0,s.size()-1);
}
else if(t[i]=='C')
{
s=s.substr(1,s.size()-1)+s[0];
}
else if(t[i]=='E')
{
if(s.size()%2)
s=s.substr(s.size()/2+1,s.size()/2)+s[s.size()/2]+s.substr(0,s.size()/2);
else s=s.substr(s.size()/2,s.size()/2)+s.substr(0,s.size()/2);
}
else if(t[i]=='A')
{
reverse(s.begin(),s.end());
}
else if(t[i]=='P')
{
for(int j=0;j<s.size();j++)
if(s[j]>='0'&&s[j]<='9')
{
s[j]--;
if(s[j]<'0')s[j]='9';
}
}
else if(t[i]=='M')
{
for(int j=0;j<s.size();j++)
if(s[j]>='0'&&s[j]<='9')
{
s[j]++;
if(s[j]>'9')s[j]='0';
}
}
}
cout<<s<<endl;
}
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <cstring>
using namespace std;
typedef long long int ll;
void solve(){
string s,t; cin >> s >> t;
reverse(s.begin(),s.end());
int n=t.size();
for(char c:s){
if(c=='J'){
t=t.substr(n-1,1)+t.substr(0,n-1);
}
if(c=='C'){
t=t.substr(1,n-1)+t.substr(0,1);
}
if(c=='E'){
t=t.substr(t.size()-t.size()/2)+t.substr(t.size()/2,t.size()%2)+t.substr(0,t.size()/2);
}
if(c=='A'){
reverse(t.begin(),t.end());
}
if(c=='P'){
for(int i=0;i<n;i++){
if('0'<=t[i]&&t[i]<='9'){
if(t[i]=='0')t[i]+=9;
else t[i]--;
}
}
}
if(c=='M'){
for(int i=0;i<n;i++){
if('0'<=t[i]&&t[i]<='9'){
if(t[i]=='9')t[i]-=9;
else t[i]++;
}
}
}
}
cout << t << endl;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int q; cin >> q;
while(q--){
solve();
}
}
|
#include<cctype>
#include<string>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n; cin>>n;
while(n--){
string s,m; cin>>s>>m;
int len=m.length();
for(int i=s.length()-1;i>=0;i--){
if (s[i]=='J') rotate(m.begin(),m.begin()+len-1,m.end());
else if(s[i]=='C') rotate(m.begin(),m.begin()+1,m.end());
else if(s[i]=='E'){
if(len%2==0) m=m.substr(len/2)+m.substr(0,len/2);
else m=m.substr(len/2+1)+m[len/2]+m.substr(0,len/2);
}
else if(s[i]=='A') reverse(m.begin(),m.end());
else if(s[i]=='P'){
for(int j=0;j<len;j++){
if(isdigit(m[j])) m[j]=(m[j]-'0'+9)%10+'0';
}
}
else if(s[i]=='M'){
for(int j=0;j<len;j++){
if(isdigit(m[j])) m[j]=(m[j]-'0'+1)%10+'0';
}
}
}
cout<<m<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
scanf("%d", &n);
while (n--){
char s[128], tmp[128];
string t;
scanf("%s", s);
scanf("%s", tmp);
t = (string)tmp;
for (int i = strlen(s) - 1; i >= 0; i--){
if (s[i] == 'J')
t = t[t.size() - 1] + t.substr(0, t.size() - 1);
else if (s[i] == 'C')
t = t.substr(1, t.size() - 1) + t[0];
else if (s[i] == 'E'){
string t1 = t.substr(0, t.size() / 2), t2 = t.substr((t.size() + 1) / 2, t.size() / 2);
string e = "";
t = t2 + ((t.size() & 1) ? string(1, t[t.size() / 2]) : e) + t1;
}
else if (s[i] == 'A')
reverse(t.begin(), t.end());
else if (s[i] == 'P'){
for (int j = 0; j < t.size(); j++){
if (isdigit(t[j])){
if (t[j] == '0') t[j] = '9';
else t[j]--;
}
}
}
else {
for (int j = 0; j < t.size(); j++){
if (isdigit(t[j])){
if (t[j] == '9') t[j] = '0';
else t[j]++;
}
}
}
}
printf("%s\n", t.c_str());
}
return (0);
} |
#include <iostream>
#include <string>
#include <algorithm>
#include <cctype>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define all(c) (c).begin(), (c).end()
void J(string& s){
rotate(s.begin(), s.end() - 1, s.end());
}
void C(string& s){
rotate(s.begin(), s.begin() + 1, s.end());
}
void E(string& s){
int n = (int)s.size();
swap_ranges(s.begin(), s.begin() + (n >> 1), s.begin() + (n >> 1) + (n & 1));
}
void A(string& s){
reverse(all(s));
}
void P(string& s){
rep(i, (int)s.size())if(isdigit(s[i]))s[i] = (s[i] + 9 - '0') % 10 + '0';
}
void M(string& s){
rep(i, (int)s.size())if(isdigit(s[i]))s[i] = (s[i] + 1 - '0') % 10 + '0';
}
int main(){
int n;
cin >> n; cin.ignore();
while(n--){
string order, mes;
cin >> order >> mes;
reverse(all(order));
rep(i, (int)order.size()){
if(order[i] == 'J')J(mes);
if(order[i] == 'C')C(mes);
if(order[i] == 'E')E(mes);
if(order[i] == 'A')A(mes);
if(order[i] == 'P')P(mes);
if(order[i] == 'M')M(mes);
}
cout << mes << '\n';
}
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cctype>
// BEGIN CUT HERE
#ifdef _MSC_VER
#include <agents.h>
#endif
// END CUT HERE
#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define REV(v) v.rbegin(), v.rend()
#define MEMSET(v, s) memset(v, s, sizeof(v))
#define MP make_pair
#define MT make_tuple
#define X first
#define Y second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
int main(){
ios::sync_with_stdio(false);
int n;
cin >> n;
while(n--){
string ppl, mes;
cin >> ppl >> mes;
reverse(ALL(ppl));
for (auto ch : ppl){
string nxt;
int m;
switch (ch){
case 'J':
nxt = mes.back() + mes.substr(0, mes.size() - 1);
break;
case 'C':
nxt = mes.substr(1) + mes[0];
break;
case 'E':
m = mes.size() / 2;
if (mes.size() & 1){
nxt = mes.substr(m+1) + mes[m] + mes.substr(0, m);
}
else{
nxt = mes.substr(m) + mes.substr(0, m);
}
break;
case 'A':
nxt = string(REV(mes));
break;
case 'M':
for (auto c : mes){
if ('0' <= c && c <= '8') ++c;
else if (c == '9') c = '0';
nxt += c;
}
break;
case 'P':
for (auto c : mes){
if ('1' <= c && c <= '9') --c;
else if (c == '0') c = '9';
nxt += c;
}
break;
}
mes = nxt;
}
cout << mes << endl;
}
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int n;
cin>>n;
while(n--){
string ord, mes;
cin>>ord>>mes;
reverse(ord.begin(), ord.end());
int m=mes.size();
for(int i=0; i<ord.size(); ++i){
char c=ord[i];
if(c=='J'){
rotate(mes.begin(), mes.end()-1, mes.end());
}
else if(c=='C'){
rotate(mes.begin(), mes.begin()+1, mes.end());
}
else if(c=='E'){
if(m%2==1)
mes = mes.substr(m/2+1) + mes[m/2] + mes.substr(0,m/2);
else
mes = mes.substr(m/2) + mes.substr(0,m/2);
}
else if(c=='A'){
reverse(mes.begin(), mes.end());
}
else if(c=='M'){
for(int i=0; i<m; ++i){
if('0'<=mes[i] && mes[i]<='9')
mes[i] = mes[i]=='9'?'0':(mes[i]+1);
}
}
else if(c=='P'){
for(int i=0; i<m; ++i){
if('0'<=mes[i] && mes[i]<='9')
mes[i] = mes[i]=='0'?'9':(mes[i]-1);
}
}
}
cout << mes << endl;
}
return 0;
} |
// 2017-02-21
#include <iostream>
#include <string>
#include <list>
using namespace std;
int main() {
int n;
cin >> n;
for (; n > 0; n--) {
string s, t;
list<char> l;
cin >> s >> t;
for (int i = 0; i < t.length(); i++) {
l.push_back(t[i]);
}
for (int i = s.length() - 1; i >= 0; i--) {
if (s[i] == 'J') {
char c = l.back();
l.pop_back();
l.push_front(c);
} else if (s[i] == 'C') {
char c = l.front();
l.pop_front();
l.push_back(c);
} else if (s[i] == 'E') {
list<char> m;
int a = l.size();
while (l.size() > a / 2) {
char c = l.front();
l.pop_front();
m.push_back(c);
}
if (a % 2 != 0) {
char c = m.back();
m.pop_back();
l.push_back(c);
}
while (!m.empty()) {
char c = m.front();
m.pop_front();
l.push_back(c);
}
} else if (s[i] == 'A') {
l.reverse();
} else if (s[i] == 'P') {
for (auto it = begin(l); it != end(l); it++) {
if (*it >= '0' && *it <= '9') {
*it = (*it - '0' + 9) % 10 + '0';
}
}
} else if (s[i] == 'M') {
for (auto it = begin(l); it != end(l); it++) {
if (*it >= '0' && *it <= '9') {
*it = (*it - '0' + 1) % 10 + '0';
}
}
}
}
for (auto it = begin(l); it != end(l); it++) {
cout << *it;
}
cout << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define BIG 1000000010
#define EPS 1e-9
#define fst first
#define scd second
#define debug(x) cout<<x<<endl;
#define repi(i,x,n) for(int i=x;i<n;i++)
#define rep(i,n) repi(i,0,n)
#define repn(i,n) for(int i=n;i>=0;i--)
#define int long long
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin>>n;
string s,t;
char c;
rep(i,n){
cin>>s>>t;
repn(j,s.size()-1 ){
// cout<<s[j]<<endl;
//cout<<t<<endl;
if(s[j]=='J'){
t=t[t.size() -1]+t.substr(0,t.size()-1);
}
if(s[j]=='C'){
t=t.substr(1,t.size() -1)+t[0];
}
if(s[j]=='E'){
if(t.size() % 2 ==0) t=t.substr((1+t.size())/2)+t.substr(0,t.size()/2);
else t=t.substr((1+t.size())/2)+t[t.size()/2]+t.substr(0,t.size()/2);
}
if(s[j]=='A') reverse(t.begin(),t.end());
if(s[j]=='M'){
rep(k,t.size() ){
if(t[k]>=48 && t[k]<57){
t[k]++;
}
else if(t[k]==57) t[k]-=9;
}
}
if(s[j]=='P'){
rep(k,t.size() ){
if(t[k]>48 && t[k]<=57){
t[k]--;
}
else if(t[k]==48) t[k]+=9;
}
}
}
cout<<t<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define mp(a,b) make_pair(a,b)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt(x) bitset<32>(x).count()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;
#define INF INT_MAX/3
#define MAX_N 1000
int n;
string f(string s,bool flag){
string res="";
rep(i,s.length()){
if(isdigit(s[i])){
char c=s[i];
if(flag)c++;
else c--;
if(c>'9')c='0';
if(c<'0')c='9';
res+=c;
}else res+=s[i];
}
return res;
}
int main(){
cin.sync_with_stdio(false);
cin>>n;
rep(h,n){
string s,op;
cin>>op>>s;
reverse(all(op));
int l=s.length();
string res;
rep(i,op.length()){
if(op[i]=='C'){
s=s.substr(1,l-1)+s[0];
}else if(op[i]=='J'){
s=s[l-1]+s.substr(0,l-1);
}else if(op[i]=='E'){
if(l%2==1)s=s.substr(l/2+1,l/2)+s[l/2]+s.substr(0,l/2);
else s=s.substr(l/2,l/2)+s.substr(0,l/2);
}else if(op[i]=='A'){
reverse(all(s));
}else if(op[i]=='P'){
s=f(s,false);
}else if(op[i]=='M'){
s=f(s,true);
}
}
cout<<s<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int n;
char buf[114514];
string C(string s) {
return s.substr(1) + s[0];
}
string J(string s) {
int k = s.length()-1;
return s[k] + s.substr(0, k);
}
string E(string s) {
int n = s.length();
if (n%2 == 1) {
return s.substr(n/2+1) + s[n/2] + s.substr(0, n/2);
}
return s.substr(n/2) + s.substr(0, n/2);
}
string A(string s) {
reverse(s.begin(), s.end());
return s;
}
string M(string s) {
int n = s.length();
for (int i=0; i<n; i++) {
char c = s[i];
if ('0' <= c && c <= '9') s[i] = '0' + (c-'0'+1)%10;
}
return s;
}
string P(string s) {
int n = s.length();
for (int i=0; i<n; i++) {
char c = s[i];
if ('0' <= c && c <= '9') s[i] = '0' + (c-'0'+9)%10;
}
return s;
}
int main() {
scanf("%d", &n);
while (n--) {
scanf(" %s", buf);
string order(buf);
scanf(" %s", buf);
string msg(buf);
reverse(order.begin(), order.end());
for (int i=0; i<order.size(); i++) {
if (order[i] == 'A') msg = A(msg);
if (order[i] == 'J') msg = J(msg);
if (order[i] == 'E') msg = E(msg);
if (order[i] == 'P') msg = P(msg);
if (order[i] == 'M') msg = M(msg);
if (order[i] == 'C') msg = C(msg);
}
printf("%s\n", msg.c_str());
}
} |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n; cin >> n;
while(n--){
string order, message;
cin >> order >> message;
reverse(order.begin(), order.end());
for(int pos = 0; pos < order.length(); pos++){
int len = message.length();
if(order[pos] == 'C'){
char c = message[0];
for(int i=0; i < len-1; i++){
message[i] = message[i+1];
}
message[len-1] = c;
}
if(order[pos] == 'J'){
char c = message[len-1];
for(int i=len-1; i >= 1; i--){
message[i] = message[i-1];
}
message[0] = c;
}
if(order[pos] == 'E'){
if(len % 2 == 0){
message = message.substr(len/2, len/2) + message.substr(0, len/2);
}else{
message = message.substr(len/2 + 1, len/2) + message.substr(len/2, 1) + message.substr(0, len/2);
}
}
if(order[pos] == 'A'){
reverse(message.begin(), message.end());
}
if(order[pos] == 'M'){
for(int i = 0; i < len; i++){
if(isdigit(message[i])){
if(message[i] - '0' == 9) message[i] = '0';
else{
message[i] = message[i] - '0' + 1 + '0';
}
}
}
}
if(order[pos] == 'P'){
for(int i = 0; i < len; i++){
if(isdigit(message[i])){
if(message[i] - '0' == 0) message[i] = '9';
else{
message[i] = message[i] - '0' - 1 + '0';
}
}
}
}
}
cout << message << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
for(int i=0;i<n;i++) {
string order,mes;
cin>>order>>mes;
for(int i=order.size()-1;i>=0;i--) {
if(order[i]=='C') {
mes=mes.substr(1)+mes.substr(0,1);
}else if(order[i]=='J') {
mes=mes.substr(mes.size()-1,1)+mes.substr(0,mes.size()-1);
}else if(order[i]=='E') {
if(mes.size()%2) {
mes=mes.substr(mes.size()/2+1)+mes.substr(mes.size()/2,1)+mes.substr(0,mes.size()/2);
}else {
mes=mes.substr(mes.size()/2)+mes.substr(0,mes.size()/2);
}
}else if(order[i]=='A') {
reverse(mes.begin(),mes.end());
}else if(order[i]=='P') {
for(int i=0;i<mes.size();i++) {
if(isdigit(mes[i])) {
mes[i]=(mes[i]-'0'+9)%10+'0';
}
}
}else if(order[i]=='M') {
for(int i=0;i<mes.size();i++) {
if(isdigit(mes[i])) {
mes[i]=(mes[i]-'0'+1)%10+'0';
}
}
}
}
cout<<mes<<endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
while(n--){
string s,ss;
cin>>s>>ss;
for(int i=s.size()-1;i>=0;i--){
if(s[i]=='P')
for(int j=0;j<ss.size();j++)
if(ss[j]>='0'&&ss[j]<='9')
ss[j]=(ss[j]-'0'+9)%10+'0';
if(s[i]=='M')
for(int j=0;j<ss.size();j++)
if(ss[j]>='0'&&ss[j]<='9')
ss[j]=(ss[j]-'0'+1)%10+'0';
if(s[i]=='A')reverse(ss.begin(),ss.end());
if(s[i]=='E')for(int k=0;k<ss.size()/2;k++)swap(ss[k],ss[(ss.size()+1)/2+k]);
if(s[i]=='J')ss=ss[ss.size()-1]+ss.substr(0,ss.size()-1);
if(s[i]=='C')ss=ss.substr(1,ss.size()-1)+ss[0];
}
cout<<ss<<endl;
}
} |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>
using namespace std;
//Mr. J ???????????????
void decJ(string& s)
{
string res;
for(int i=0;i<s.size();i++) res+=s[(s.size()-1+i)%s.size()];
s=res;
}
//Miss C ???????????????
void decC(string& s)
{
string res;
for(int i=0;i<s.size();i++) res+=s[(1+i)%s.size()];
s=res;
}
//Mr.E ???????????\????????????
void decE(string& s)
{
if(s.size()%2){
string left=s.substr(0,s.size()/2);
char mid=s[s.size()/2];
string right=s.substr(s.size()/2+1);
s=right+mid+left;
}else{
string left=s.substr(0,s.size()/2);
string right=s.substr(s.size()/2);
s=right+left;
}
}
//Mr.A ?????¢
void decA(string& s)
{
reverse(s.begin(),s.end());
}
//Dr. P ??°???++
void decP(string &s)
{
for(int i=0;i<s.size();i++){
if(s[i]=='0') s[i]='9';
else if('0'<=s[i] && s[i]<='9' ) s[i]--;
}
}
//Mr.M ??°???--
void decM(string &s)
{
for(int i=0;i<s.size();i++){
if(s[i]=='9') s[i]='0';
else if('0'<=s[i] && s[i]<='9' ) s[i]++;
}
}
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++){
string order,given;
cin>>order>>given;
//JCEAPM
for(int j=order.size()-1;j>=0;j--){
if(order[j]=='J') decJ(given);
else if(order[j]=='C') decC(given);
else if(order[j]=='E') decE(given);
else if(order[j]=='A') decA(given);
else if(order[j]=='P') decP(given);
else decM(given);
}
cout<<given<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string s, t;
cin >> s >> t;
reverse(s.begin(), s.end());
int sz = s.size(), tz = t.size();
for (int j = 0; j < sz; j++) {
if (s[j] == 'C') {
t = t.substr(1, tz - 1) + t[0];
} else if (s[j] == 'J') {
t = t[tz - 1] + t.substr(0, tz - 1);
} else if (s[j] == 'E') {
string a = t.substr(0, tz / 2), b = t.substr((tz + 1) / 2, tz / 2);
if (tz & 1) t = t[tz / 2];
else t = "";
t = b + t + a;
} else if (s[j] == 'A') {
reverse(t.begin(), t.end());
} else if (s[j] == 'M') {
for (int k = 0; k < tz; k++) {
if (!isdigit(t[k])) continue;
t[k] = (t[k] - '0' + 1) % 10 + '0';
}
} else {
for (int k = 0; k < tz; k++) {
if (!isdigit(t[k])) continue;
t[k] = (t[k] - '0' - 1 + 10) % 10 + '0';
}
}
}
cout << t << endl;
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
#define INF 999999999
int main(){
int n;
cin>>n;
rep(i,n){//JCEAPM
string member,str;
cin>>member>>str;
reverse(all(member));
rep(i,member.size()){
// cout<<str<<endl;
if(member[i] == 'J'){
str = string(1,str[str.size()-1])+str.substr(0,str.size()-1);
}else if(member[i] == 'C'){
str = str.substr(1,str.size()-1)+string(1,str[0]);
}else if(member[i] == 'E'){
if(str.size()%2==0){
str = str.substr(str.size()/2,str.size()/2)+str.substr(0,str.size()/2);
}
else{
str = str.substr(str.size()/2+1,str.size()/2)+str[str.size()/2]+str.substr(0,str.size()/2);
}
}else if(member[i] == 'A'){
reverse(all(str));
}else if(member[i] == 'P'){
rep(j,str.size()){
if(isdigit(str[j])){
if(str[j] == '0')str[j] ='9';
else str[j]--;
}
}
}else if(member[i] == 'M'){
rep(j,str.size()){
if(isdigit(str[j])){
if(str[j] == '9')str[j] = '0';
else str[j]++;
}
}
}
}
cout<<str<<endl;
}
} |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (int) (n); i++)
#define ALL(v) (v).begin(), (v).end()
#define INF 1e9
using namespace std;
char alphabet[52];
int main(){
int n;
cin >> n;
REP(counter, n) {
string messenger; cin >> messenger;
string message; cin >> message;
string recon = message;
REP(i, messenger.size()){
char target = messenger[messenger.size()-1-i];
if(target == 'J'){
REP(j, message.size()) recon[j] = message[(j-1+message.size()) % message.size()];
}else if(target == 'C'){
REP(j, message.size()) recon[j] = message[(j+1) % message.size()];
}else if(target == 'E'){
REP(j, message.size()/2) swap(recon[j], recon[j+message.size()/2+message.size()%2]);
}else if(target == 'A'){
reverse(ALL(recon));
}else if(target == 'P'){
REP(j, message.size()){
if('0' <= message[j] and message[j] <= '9'){
int digit = message[j] - '0';
digit = (digit - 1 + 10) % 10;
recon[j] = digit + '0';
}
}
}else if(target == 'M'){
REP(j, message.size()){
if('0' <= message[j] and message[j] <= '9'){
int digit = message[j] - '0';
digit = (digit + 1) % 10;
recon[j] = digit + '0';
}
}
}
message = recon;
}
cout << message << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
int main()
{
int n;
cin >> n;
vector<string> ans;
while (n--)
{
string messengers, message;
cin >> messengers >> message;
reverse(messengers.begin(), messengers.end());
int len = message.size();
for (int i = 0; i < messengers.size(); ++i)
{
if (messengers[i] == 'J')
{
rotate(message.rbegin(), message.rbegin() + 1, message.rend());
}
else if (messengers[i] == 'C')
{
rotate(message.begin(), message.begin() + 1, message.end());
}
else if (messengers[i] == 'E')
{
string tmp = "";
tmp += message.substr(len % 2 == 0 ? len / 2 : len / 2 + 1, len / 2);
if (len % 2 == 1)
tmp += message[len / 2];
tmp += message.substr(0, len / 2);
message = tmp;
}
else if (messengers[i] == 'A')
{
reverse(message.begin(), message.end());
}
else if (messengers[i] == 'P')
{
for (int j = 0; j < len; ++j)
{
if ('0' <= message[j] && message[j] <= '9')
message[j] = char((10 + message[j] - 1 - '0') % 10 + '0');
}
}
else if (messengers[i] == 'M')
{
for (int j = 0; j < len; ++j)
{
if ('0' <= message[j] && message[j] <= '9')
message[j] = char((message[j] + 1 - '0') % 10 + '0');
}
}
}
ans.push_back(message);
}
for (auto &e : ans)
cout << e << endl;
return 0;
}
|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
int main() {
int n; cin >> n;
while (n--) {
string s, t; cin >> t >> s;
int m = s.length();
reverse(t.begin(), t.end());
for (int j = 0; j < t.size(); j++)
switch (t[j]) {
case 'J':
s = s[m - 1] + s.substr(0, m - 1);
break;
case 'C':
s = s.substr(1) + s[0];
break;
case 'E':
if (m % 2 == 0) s = s.substr(m / 2) + s.substr(0, m / 2);
else s = s.substr(m / 2 + 1) + s[m / 2] + s.substr(0, m / 2);
break;
case 'A':
reverse(s.begin(), s.end());
break;
case 'P':
for (int i = 0; i < m; i++)
if (s[i] >= '0' && s[i] <= '9')
s[i] = '0' + (s[i] - '0' + 9) % 10;
break;
case 'M':
for (int i = 0; i < m; i++)
if (s[i] >= '0' && s[i] <= '9')
s[i] = '0' + (s[i] - '0' + 1) % 10;
break;
}
cout << s << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
while(n--){
string q,s;
cin>>q>>s;
for(int i=q.size()-1;0<=i;i--){
if(q[i]=='C')s=s.substr(1,s.size()-1)+s[0];
if(q[i]=='J')s=s[s.size()-1]+s.substr(0,s.size()-1);
if(q[i]=='E')
for(int j=0;j<s.size()/2;j++)swap(s[j],s[(s.size()+1)/2+j]);
if(q[i]=='A')reverse(s.begin(),s.end());
if(q[i]=='P')
for(int j=0;j<s.size();j++)
if(isdigit(s[j]))s[j]=((s[j]-'0'+10)-1)%10+'0';
if(q[i]=='M')
for(int j=0;j<s.size();j++)
if(isdigit(s[j]))s[j]=((s[j]-'0')+1)%10+'0';
}
cout<<s<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
bool solve(){
string s, t;
cin >> s >> t;
reverse(s.begin(), s.end());
for(auto c : s){
if(c == 'J'){
t.insert(t.begin(), t.back());
t.pop_back();
}
if(c == 'C'){
t.push_back(t.front());
t.erase(t.begin());
}
if(c == 'E'){
string tmp;
tmp.insert(tmp.end(),t.begin()+(t.size()+1)/2,t.end());
if(int(t.size())%2) tmp.push_back(t[t.size()/2]);
tmp.insert(tmp.end(),t.begin(), t.begin()+t.size()/2);
t = tmp;
}
if(c == 'A'){
reverse(t.begin(), t.end());
}
if(c == 'P'){
for(auto& d : t){
if(d >= '0' && d <= '9') d = (d-'0'+9)%10+'0';
}
}
if(c == 'M'){
for(auto& d : t){
if(d >= '0' && d <= '9') d = (d-'0'+1)%10+'0';
}
}
}
cout << t << endl;
return true;
}
int main(){
int t; cin >> t; for(;t>0;t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP((i), 0, (n))
#define REP(i, a, n) for(int i=(a); i<(n); i++)
void j_inv(string& s) {
s = s.back() + s.substr(0, s.size()-1);
}
void c_inv(string& s) {
s = s.substr(1, s.size()-1) + s[0];
}
void e_inv(string& s) {
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);
}
void a_inv(string& s) {
reverse(s.begin(), s.end());
}
void p_inv(string& s) {
rep(i, s.size())
if(isdigit(s[i])) s[i] = (s[i]=='0'? '9':s[i]-1);
}
void m_inv(string& s) {
rep(i, s.size())
if(isdigit(s[i])) s[i] = (s[i]=='9'? '0':s[i]+1);
}
int main() {
int n; cin >> n;
rep(_, n) {
string m; cin >> m;
string s; cin >> s;
for(int j=m.size()-1; j>=0; j--) {
switch(m[j]) {
case 'J': j_inv(s); break;
case 'C': c_inv(s); break;
case 'E': e_inv(s); break;
case 'A': a_inv(s); break;
case 'P': p_inv(s); break;
case 'M': m_inv(s); break;
}
}
cout << s << endl;
}
}
|
#include <iostream>
using namespace std;
int main(void){
int n;cin>>n;
for(int i=0;i<n;++i){
string proc,mes;
cin>>proc>>mes;
for(int j=proc.size()-1;j>=0;--j){
if(proc[j]=='J'){
mes = mes[mes.size()-1] + mes.substr(0,mes.size()-1);
}else if(proc[j]=='C'){
mes = mes.substr(1,mes.size()-1) + mes[0];
}else if(proc[j]=='E'){
int len = mes.size();
string centre;
if(len%2) centre = mes[len/2];
string lft = mes.substr(0, len/2);
string rgt = mes.substr(len-len/2, len/2);
mes = rgt + centre + lft;
}else if(proc[j]=='A'){
string tmp;
for(int k=mes.length()-1;k>=0;--k)tmp+=mes[k];
mes = tmp;
}else if(proc[j]=='P'){
for(int k=0;k<mes.length();++k){
if('0'<=mes[k] && mes[k]<='9') mes[k]=(9+mes[k]-'0')%10+'0';
}
}else if(proc[j]=='M'){
for(int k=0;k<mes.length();++k){
if('0'<=mes[k] && mes[k]<='9') mes[k]=(1+mes[k]-'0')%10+'0';
}
}
}
cout<<mes<<endl;
}
return 0;
} |
#include <iostream>
#include <string>
#include <cstdlib>
#include <algorithm>
using namespace std;
int main () {
int n;
cin >> n;
for( int i = 0; i < n; i++ ) {
string commands, mes;
cin >> commands >> mes;
int len = commands.length();
int meslen = mes.length();
for( int j = len - 1; j >= 0; j-- ) {
switch( commands[ j ] ) {
case 'C':
mes = mes.substr( 1 ) + mes[ 0 ];
break;
case 'J':
mes = mes[ meslen - 1 ] + mes.substr( 0, meslen - 1 );
break;
case 'E':
if( meslen % 2 == 1 ) {
mes =
mes.substr( meslen / 2 + 1 ) +
mes[ meslen / 2 ] +
mes.substr( 0, meslen / 2 );
}else{
mes =
mes.substr( meslen / 2 ) +
mes.substr( 0, meslen / 2 );
}
break;
case 'A':
reverse( mes.begin(), mes.end() );
break;
case 'M':
for( int k = 0; k < meslen; k++ ) {
if( '0' <= mes[ k ] && mes[ k ] <= '8' ){
mes[ k ]++;
}else if( mes[ k ] == '9' ){
mes[ k ] = '0';
}
}
break;
case 'P':
for( int k = 0; k < meslen; k++ ) {
if( '1' <= mes[ k ] && mes[ k ] <= '9' ){
mes[ k ]--;
}else if( mes[ k ] == '0' ){
mes[ k ] = '9';
}
}
break;
}
}
cout << mes << endl;
}
return EXIT_SUCCESS;
} |
#include<bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int main(){ _;
int n;
string oom, mkg;
cin>>n;
REP(z,n){
cin>>oom>>mkg;
for(int j=oom.size()-1;j>=0;j--){
char p=oom[j];
switch(p){
case 'J':
for(int i=(int)mkg.size()-2;i>=0;i--)
swap(mkg[i],mkg[i+1]);
break;
case 'C':
for(int i=0;i<=(int)mkg.size()-2;i++)
swap(mkg[i],mkg[i+1]);
break;
case 'E':{
int offset=mkg.size()-mkg.size()/2;
for(int i=0;i<(int)mkg.size()/2;i++)
swap(mkg[i],mkg[i+offset]);
break;
}
case 'A':
for(int i=0;i<(int)mkg.size()/2;i++)
swap(mkg[i],mkg[mkg.size()-1-i]);
break;
case 'P':
for(char& c:mkg)
if(c>='1'&&c<='9') c--;
else if(c=='0') c='9';
break;
case 'M':
for(char& c:mkg)
if(c>='0'&&c<='8') c++;
else if(c=='9') c='0';
break;
}
}
cout<<mkg<<endl;
}
} |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
string correctJ(string st){
int len = st.size();
string cst = st.substr(len-1,1);
cst += st.substr(0,len-1);
return cst;
}
string correctC(string st){
int len = st.size();
string cst = st.substr(1);
cst += st.substr(0,1);
return cst;
}
string correctE(string st){
int len = st.size();
string cst = st.substr(len - (len)/2);
if(len % 2 != 0){
cst += st.substr(len/2,1);
}
cst += st.substr(0,len/2);
return cst;
}
string correctA(string st){
string cst = st;
reverse(cst.begin(),cst.end());
return cst;
}
string correctP(string st){
string cst = st;
for(int i = 0;i < cst.size();i++){
if(cst[i] - '0' < 10 && cst[i] != '0'){
cst[i] = cst[i] - 1;
}else if(cst[i] == '0'){
cst[i] = '9';
}
}
return cst;
}
string correctM(string st){
string cst = st;
for(int i = 0;i < cst.size();i++){
if(cst[i] - '0' < 9){
cst[i] = cst[i] + 1;
}else if(cst[i] == '9'){
cst[i] = '0';
}
}
return cst;
}
int main(){
vector<string> ans;
int n;
cin >> n;
for(int i = 0;i < n;i++){
string ser;
cin >> ser;
string mes;
cin >> mes;
string cmes = mes;
for(int j = ser.size()-1;j >= 0;j--){
if(ser[j] == 'J'){
cmes = correctJ(cmes);
}else if(ser[j] == 'C'){
cmes = correctC(cmes);
}else if(ser[j] == 'E'){
cmes = correctE(cmes);
}else if(ser[j] == 'A'){
cmes = correctA(cmes);
}else if(ser[j] == 'P'){
cmes = correctP(cmes);
}else if(ser[j] == 'M'){
cmes = correctM(cmes);
}
}
ans.push_back(cmes);
}
for(int i = 0;i < ans.size();i++){
cout << ans[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
while(T--) {
string s,t;
cin >> t >> s;
int n=s.size();
for(int j=t.size()-1; j>=0; j--) {
if(t[j]=='C') rotate(s.begin(),s.begin()+1,s.end());
if(t[j]=='J') rotate(s.begin(),s.end()-1,s.end());
if(t[j]=='E') {
if(s.size()%2) s=s.substr(n/2+1)+s[n/2]+s.substr(0,n/2);
else s=s.substr(n/2)+s.substr(0,n/2);
}
if(t[j]=='A') reverse(s.begin(),s.end());
if(t[j]=='M') {
for(int i=0; i<n; i++) {
if(!isdigit(s[i])) continue;
if(s[i]=='9') s[i]='0';
else s[i]++;
}
}
if(t[j]=='P') {
for(int i=0; i<n; i++) {
if(!isdigit(s[i])) continue;
if(s[i]=='0') s[i]='9';
else s[i]--;
}
}
}
cout << s << endl;
}
return 0;
}
|
#include <cstdio>
#include <algorithm>
using std::swap;
void J(char s[], int len){
char tmp = s[len-1];
for(int i=len-1;i>0;i--){
s[i] = s[i-1];
}s[0] = tmp;
}
void C(char s[], int len){
char tmp = s[0];
for(int i=0;i<len-1;i++){
s[i] = s[i+1];
}s[len-1] = tmp;
}
void E(char s[], int len){
int mid = len/2;
for(int i=0;i<mid;i++){
swap(s[i], s[len-mid+i]);
}
}
void A(char s[], int len){
char tmp = s[len-1];
for(int i=0;i<len-1-i;i++){
swap(s[i], s[len-1-i]);
}
}
void P(char s[], int len){
for(int i=0;i<len;i++){
if('0'<=s[i] && s[i]<='9'){
s[i] = '0'+(s[i]-'0'+9)%10;
}
}
}
void M(char s[], int len){
for(int i=0;i<len;i++){
if('0'<=s[i] && s[i]<='9'){
s[i] = '0'+(s[i]-'0'+1)%10;
}
}
}
int main(){
int N;
scanf("%d", &N);
while(N--){
char s1[50], s2[50];
scanf("%s %s", s1, s2);
int len1;
for(len1=0 ; s1[len1]!='\0' ; len1++);
int len2;
for(len2=0 ; s2[len2]!='\0' ; len2++);
for(int i=len1-1;i>=0;i--){
if(s1[i] == 'J') J(s2, len2);
if(s1[i] == 'C') C(s2, len2);
if(s1[i] == 'E') E(s2, len2);
if(s1[i] == 'A') A(s2, len2);
if(s1[i] == 'P') P(s2, len2);
if(s1[i] == 'M') M(s2, len2);
}
printf("%s\n", s2);
}
return 0;
} |
#include <cstdio>
#include <cassert>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <array>
using namespace std;
#define all(c) begin(c), end(c)
#define dump(c) cerr << "> " << #c << " = " << (c) << endl
#define REP(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
const int INF = 1001001001;
const double EPS = 1e-10;
template<typename T1,typename T2>
ostream& operator<<(ostream& os, const pair<T1,T2>& p){
return os << '(' << p.first <<',' << p.second << ')';
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& a){
os << '[';
rep(i,a.size()) os << (i ? " " : "") << a[i];
return os << ']';
}
int main() {
int N; cin >> N;
while(N--) {
string O, M; cin >> O >> M;
reverse(all(O));
for(char o : O) {
if(o == 'J') {
M = M.substr(M.size() - 1) + M.substr(0, M.size() - 1);
}
if(o == 'C') {
M = M.substr(1) + M.substr(0, 1);
}
if(o == 'E') {
int h = M.size() / 2;
M = M.substr(M.size() - h) + M.substr(h, M.size() & 1) + M.substr(0, h);
}
if(o == 'A') {
reverse(all(M));
}
if(o == 'P') {
for(char &c : M) if(isdigit(c)) c = (c - '0' - 1 + 10) % 10 + '0';
}
if(o == 'M') {
for(char &c : M) if(isdigit(c)) c = (c - '0' + 1) % 10 + '0';
}
}
cout << M << endl;
}
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <cctype>
using namespace std;
int main(){
int T;
cin >> T;
while(T--){
string a, b;
cin >> a >> b;
for(int i = a.size() - 1; i >= 0; --i){
if(a[i] == 'J'){
b = b.substr(b.size() - 1) + b.substr(0, b.size() - 1);
}else if(a[i] == 'C'){
b = b.substr(1) + b.substr(0, 1);
}else if(a[i] == 'E'){
int half = b.size() / 2;
for(int j = 0; j < half; ++j){
swap(b[j], b[b.size() - half + j]);
}
}else if(a[i] == 'A'){
reverse(b.begin(), b.end());
}else if(a[i] == 'P'){
for(int j = 0; j < b.size(); ++j){
if(!isdigit(b[j])){ continue; }
b[j] = (b[j] == '0' ? '9' : (b[j] - 1));
}
}else if(a[i] == 'M'){
for(int j = 0; j < b.size(); ++j){
if(!isdigit(b[j])){ continue; }
b[j] = (b[j] == '9' ? '0' : (b[j] + 1));
}
}
}
cout << b << endl;
}
return 0;
} |
#include <iostream>
#include <string>
using namespace std;
int main(){
int n;
string a="0123456789";
cin>>n;
for(int i=0;i<n;i++){
string er,ki,ori;
cin>>er>>ki;
int m=er.size();
int len=ki.size();
ori=ki;
for(int j=m-1;j>=0;j--){
if(er[j]=='J'){
for(int k=0;k<len;k++){
ori[k]=ki[(k+len-1)%len];
}
}
else if(er[j]=='C'){
for(int k=0;k<len;k++){
ori[k]=ki[(k+1)%len];
}
}
else if(er[j]=='E'){
if(len%2==0){
for(int k=0;k<len/2;k++){
ori[k]=ki[k+len/2];
ori[k+len/2]=ki[k];
}
}
else{
int naka=len/2;
for(int k=0;k<naka;k++){
ori[k]=ki[k+naka+1];
ori[k+naka+1]=ki[k];
}
}
}
else if(er[j]=='A'){
for(int k=0;k<len;k++){
ori[k]=ki[len-k-1];
}
}
else if(er[j]=='P'){
for(int k=0;k<len;k++){
for(int h=0;h<10;h++){
if(ki[k]==a[h]){
ori[k]=a[(h+9)%10];
}
}
}
}
else if(er[j]=='M'){
for(int k=0;k<len;k++){
for(int h=0;h<10;h++){
if(ki[k]==a[h]){
ori[k]=a[(h+1)%10];
}
}
}
}
ki=ori;
}
cout<<ori<<endl;
}
return 0;
} |
#include <iostream>
#include <string>
using namespace std;
void C(string& str)
{
string temp;
for(int i = 1; i < str.size(); ++i)
{
temp += str[i];
}
temp += str[0];
str = temp;
}
void J(string& str)
{
string temp;
temp += str[str.size() - 1];
for(int i = 0; i < str.size() - 1; ++i)
{
temp += str[i];
}
str = temp;
}
void E(string& str)
{
string temp;
int n;
if(str.size() % 2)
{
n = str.size() / 2 + 1;
}
else
{
n = str.size() / 2;
}
for(int i = n; i < str.size(); ++i)
{
temp += str[i];
}
if(str.size() % 2)
{
--n;
temp += str[n];
}
for(int i = 0; i < n; ++i)
{
temp += str[i];
}
str = temp;
}
void A(string& str)
{
string temp;
for(int i = str.size() - 1; i >= 0; --i)
{
temp += str[i];
}
str = temp;
}
void M(string& str)
{
for(int i = 0; i < str.size(); ++i)
{
if('0' <= str[i] && str[i] <= '8')
{
str[i] = str[i] + 1;
}
else if(str[i] == '9')
{
str[i] = '0';
}
}
}
void P(string& str)
{
for(int i = 0; i < str.size(); ++i)
{
if('1' <= str[i] && str[i] <= '9')
{
str[i] = str[i] - 1;
}
else if(str[i] == '0')
{
str[i] = '9';
}
}
}
void solve()
{
int n;
cin >> n;
while(n--)
{
string command, input;
cin >> command >> input;
for(int i = command.size() - 1; i >= 0; --i)
{
switch(command[i])
{
case 'J':
J(input);break;
case 'C':
C(input);break;
case 'E':
E(input);break;
case 'A':
A(input);break;
case 'P':
P(input);break;
case 'M':
M(input);break;
}
}
cout << input << endl;
}
}
int main()
{
solve();
return(0);
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.