text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string s;
int c;
int N;
string f() {
string ret;
int p = 0;
while(c < N && s[c] != ']') {
if(s[c] == '[') {
c++;
string res = f();
reverse(res.begin(), res.end());
ret += res;
assert(s[c] == ']');
c++;
}
else if(s[c] == '+') {
p++;
c++;
}
else if(s[c] == '-') {
p--;
c++;
}
else {
if(s[c] == '?') {
ret += "A";
}
else {
while(p < 0) p += 26;
ret.push_back('A' + (s[c] - 'A' + p) % 26);
}
p = 0;
c++;
}
}
return ret;
}
void solve() {
N = s.size();
c = 0;
cout << f() << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
while(cin >> s, s != ".") {
solve();
}
} |
#include<bits/stdc++.h>
#define N 100
#define M 26
using namespace std;
string s;
int p,len;
string bnf(bool rev){
string res;
int cnt=0;
while(p!=len){
if(s[p]=='+')p++,cnt++;
if(s[p]=='-')p++,cnt--;
if('A'<=s[p]&&s[p]<='Z')
res+=((s[p++]+cnt+M*N)-'A')%M+'A',cnt=0;
if(s[p]=='?')res+=s[p++],cnt=0;
if(s[p]=='[')p++,res+=bnf(true);
if(s[p]==']'){
p++;
break;
}
}
if(rev)reverse(res.begin(),res.end());
return res;
}
int main(){
while(1){
cin>>s;
if(s==".")break;
len=s.size();
p=0;
string ans=bnf(false);
for(int i=0;i<(int)ans.size();i++)
if(ans[i]=='?')ans[i]='A';
cout<<ans<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
string input;
while(cin >> input, input != "."){
string ret;
for(int i=input.size()-1; 0 <= i; i--){
if(input[i] != '+' && input[i] != '-'){
if(input[i] == '?'){
ret = 'A'+ret; i--;
while(input[i] == '+' || input[i] == '-') i--;
i++;
} else {
ret = input[i]+ret;
}
} else {
if(input[i] == '+'){
if(ret[0] == 'Z') ret[0] = 'A';
else ret[0]++;
}
else {
if(ret[0] == 'A') ret[0] = 'Z';
else ret[0]--;
}
}
}
input = ret;
while(true){
bool is = false;
for(int i=0; i < input.size(); i++){
if(input[i] == '['){
is = true;
int p = 0, count = 1;
for(int j=i+1; j< input.size(); j++){
if(input[j] == '[') count++;
else if(input[j] == ']') count--;
if(count == 0){p = j; break;}
}
string a, b, c;
a = input.substr(0, i);
b = input.substr(i+1, p-i-1);
c = input.substr(p+1);
reverse(b.begin(), b.end());
for(int j=0; j < b.size(); j++){
if(b[j] == '[') b[j] = ']';
else if(b[j] == ']') b[j] = '[';
}
input = a+b+c;
break;
}
}
if(!is) break;
}
cout << input << endl;
}
} |
#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 repr(i,n) for(int i=(int)(n-1);i>=0;i--)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout << #x" = " << x << endl
#define print(x) cout << 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<int, P> PIP;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;
typedef set<int> S;
#define INF INT_MAX/3
#define MAX_N 1000000001
string dfs(string s) {
string ss = "", tmp;
int i = 0;
while(i < s.length()) {
if (s[i] == '[') {
int flag = 1, j = i;
while(j < s.length() && flag != 0) {
j++;
if (s[j] == '[') flag++;
else if (s[j] == ']') flag--;
}
tmp = dfs(s.substr(i + 1, j - i - 1));
reverse(all(tmp));
ss += tmp;
i = j;
} else if (s[i] == '+' || s[i] == '-') {
int flag = 0, j = i;
while(j < s.length() && s[j] == '+' || s[j] == '-') {
if (s[j] == '+') flag++;
else if (s[j] == '-') flag--;
j++;
}
if (s[j] == '?') ss += 'A';
else ss += (char)((s[j] - 'A' + flag + 104) % 26 + 'A');
i = j;
} else {
if (s[i] == '?') ss += 'A';
else ss += s[i];
}
i++;
}
return ss;
}
int main(){
cin.sync_with_stdio(false);
string s;
while(cin >> s, s[0] != '.') {
cout << dfs(s) << endl;
}
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
string s;
string parseCypher(int &p);
char parseLetter(int &p)
{
char ret;
if(s[p] == '+'){
p++;
ret = parseLetter(p);
if(ret != '?'){
ret++;
if(ret > 'Z') ret = 'A';
}
}
else if(s[p] == '-'){
p++;
ret = parseLetter(p);
if(ret != '?'){
ret--;
if(ret < 'A') ret = 'Z';
}
}
else{
ret = s[p];
p++;
}
return ret;
}
string parseString(int &p)
{
string ret;
while(1){
if(s[p] == '#' || s[p] == ']') break;
if(s[p] == '['){
p++;
string t = parseCypher(p);
reverse(t.begin(), t.end());
ret += t;
p++;
}
else ret += parseLetter(p);
}
return ret;
}
string parseCypher(int &p)
{
string ret;
while(1){
if(s[p] == '#' || s[p] == ']') break;
ret += parseString(p);
}
return ret;
}
int main(void)
{
while(1){
cin >> s;
if(s == ".") break;
s += "#";
int p = 0;
string ans = parseCypher(p);
for(int i = 0; i < ans.size(); i++) if(ans[i] == '?') ans[i] = 'A';
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#define CK(N,A,B) (A<=N&&N<B)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define RREP(i,a,b) for(int i=(b-1);a<=i;i--)
#define F first
#define S second
#define ll long long;
const int INF = 1e9;
const long long LLINF = 1e15;
using namespace std;
char alp[26] = {'A','B','C','D','E','F','G','H','I','J','K','L','M',
'N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
int ind;
string S;
string dfs(){
string ret = "";
char c = S[ind];
if(c == '['){
ind++;
string rev = dfs();
ind++;
reverse(rev.begin(), rev.end());
ret += rev;
ret += dfs();
}else if(('A'<=S[ind] && S[ind]<='A'+26) || S[ind]=='?'){
char ac;
if(S[ind]=='?') ac = 'A';
else ac = S[ind];
ret += ac;
ind++;
ret += dfs();
}else if(S[ind] == '+' || S[ind] == '-'){
int cnt = 0;
while(S[ind] == '+' || S[ind] == '-'){
if(S[ind] == '+') cnt++;
else cnt--;
ind++;
}
if(S[ind]=='?') ret += 'A';
else ret += alp[( (S[ind]-'A') + cnt + 26000) % 26];
ind++;
ret += dfs();
}
return ret;
}
int main() {
while(1){
cin>>S;
if(S==".") break;
ind = 0;
cout<<dfs()<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(),(a).end()
using State = string::const_iterator;
State en;
string String(State &begin);
char Letter(State &begin);
char Alpha(State &begin);
string Cipher(State &begin){
string ret;
while(begin != en and *begin != ']'){
ret += String(begin);
}
return ret;
}
string String(State &begin){
string ret;
if(*begin == '['){
++begin;
ret = Cipher(begin);
reverse(all(ret));
++begin;
}else{
ret = {Letter(begin)};
}
return ret;
}
char Letter(State &begin){
int pm = 0;
int ret;
while(1){
if(*begin == '+'){
pm++;
++begin;
}else if(*begin == '-'){
pm--;
++begin;
}else{
ret = Alpha(begin);
break;
}
}
if(ret == '?') return 'A';
ret += pm;
while('Z' < ret) ret -= 26;
while(ret < 'A') ret += 26;
return ret;
}
char Alpha(State &begin){
char ret = *begin;
++begin;
return ret;
}
signed main(){
string s;
while(cin >> s, s != "."){
en = s.end();
State beg = s.begin();
cout << Cipher(beg) << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) a.begin(), a.end()
#define MS(m,v) memset(m,v,sizeof(m))
#define D10 fixed<<setprecision(10)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
const int MOD = 1000000007;
const int INF = MOD + 1;
const ld EPS = 1e-10;
template<class T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<class T> T &chmax(T &a, const T &b) { return a = max(a, b); }
/*--------------------template--------------------*/
string s;
int p;
char let()
{
char c = s[p];
p++;
while (p<s.size()&&(s[p] == '+' || s[p] == '-'))
{
if (s[p] == '+') c++;
else c--;
if (c < 'A') c += 26;
if (c > 'Z') c -= 26;
p++;
}
return c;
}
string solve()
{
string ans;
while (1)
{
if (p >= s.size()) return ans;
while (p < s.size() && (isalpha(s[p]) || s[p] == '?'))
{
if (isalpha(s[p])) ans += let();
if (s[p] == '?')
{
ans += 'A';
p++;
while (s[p] == '+' || s[p] == '-')
{
p++;
}
}
}
if (p >= s.size() || s[p] == '[')
{
p++;
return ans;
}
if (s[p] == ']')
{
p++;
string t = solve();
reverse(ALL(t));
ans += t;
}
}
}
int main()
{
while (cin >> s, s != ".")
{
reverse(ALL(s));
p = 0;
string ans = solve();
reverse(ALL(ans));
cout << ans << endl;
}
return 0;
} |
#include<bits/stdc++.h>
#define REP(i,n,N) for(int i=(n);i<(int)(N);i++)
#define p(s) cout<<(s)<<endl
#define ck(n,a,b) (a<=(n)&&(n)<=b)
using namespace std;
int main(){
string s;
while(cin>>s){
if(s==".") break;
string ans="";
stack<int> st;
int diff=0;
REP(pos,0,s.size()){
if(ck(s[pos],'A','Z')){
ans+=(char) (s[pos]-'A'+diff)%26 + 'A';
diff=0;
}
else if(s[pos]=='+') diff++;
else if(s[pos]=='-') diff--;
else if(s[pos]=='[') st.push(ans.size());
else if(s[pos]==']'){
reverse(ans.begin()+st.top(),ans.end());
st.pop();
}else if(s[pos]=='?'){
ans+='A';
diff=0;
}
diff=(diff+26)%26;
}
p(ans);
}
return 0;
} |
#include <iostream>
#include <algorithm>
#include <string>
#include <cctype>
using namespace std;
typedef string::const_iterator State;
string Cipher(State &begin, State &end);
string String(State &begin, State &end);
string Letter(State &begin);
string Cipher(State &begin, State &end)
{
if (begin == end)
{
return "";
}
string ret;
string str = String(begin, end);
if (str.empty())
{
return "";
}
ret += str;
ret += Cipher(begin, end);
return ret;
}
string String(State &begin, State &end)
{
string ret;
if (*begin == '[')
{
++begin;
ret = Cipher(begin, end);
reverse(ret.begin(), ret.end());
++begin;
}
else
{
ret = Letter(begin);
}
return ret;
}
string Letter(State &begin)
{
int d = 0;
while (true)
{
if (*begin == '+')
{
++d;
}
else if (*begin == '-')
{
--d;
}
else
{
break;
}
++begin;
}
int c = *begin;
if (c == '?')
{
c = 'A';
}
else if (isupper(c))
{
d %= 26;
c += d;
if ('Z' < c)
{
c -= 26;
}
else if (c < 'A')
{
c += 26;
}
}
else
{
return "";
}
++begin;
return string(1, c);
}
int main()
{
string line;
while (getline(cin, line), line != ".")
{
State begin = line.begin();
State end = line.end();
cout << Cipher(begin, end) << endl;
}
return 0;
} |
#include <bits/stdc++.h>
#define show(x) cerr << #x << " = " << (x) << endl
using namespace std;
string S;
int pos;
string Cipher();
int PM()
{
int ans = 0;
for (; pos < S.size() and (S[pos] == '+' or S[pos] == '-'); pos++) { ans += (S[pos] == '+' ? 1 : -1); }
return (26 + ans % 26) % 26;
}
string Letter()
{
string ans;
for (int sf = 0; pos < S.size() and (isalpha(S[pos]) or S[pos] == '+' or S[pos] == '-'); pos++) { sf = PM(), ans.push_back('A' + (S[pos] - 'A' + sf) % 26); }
return ans;
}
string String()
{
if (S[pos] == '[') {
string ans;
return pos++, ans = Cipher(), reverse(ans.begin(), ans.end()), pos++, ans;
} else {
return Letter();
}
}
string Cipher()
{
string ans;
for (; pos < S.size() and S[pos] != ']'; ) { ans += String(); }
return ans;
}
int main()
{
while (true) {
cin >> S;
string s;
if (S == ".") { break; }
for (int i = S.size() - 1, hatena = false; i >= 0; i--) {
if (S[i] == '?') {
hatena = true, s.push_back('A');
} else if (not hatena or not(S[i] == '+' or S[i] == '-')) {
hatena = false, s.push_back(S[i]);
}
}
reverse(s.begin(), s.end());
S = s;
pos = 0;
cout << Cipher() << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
string st;
string rev(int);
int main(){
while(1){
cin >> st;
if(st==".")break;
st+=']';
string an=rev(0);
cout << an;
cout << endl;
}
return 0;
}
string rev(int I){
int c=0;
int kc=0;
string re="";
while(I<st.size()){
//cout << I<< endl;;
if(st[I]==']'){
kc--;
if(kc==-1)return re;
}
else if(st[I]=='['){
kc++;
if(kc==1){
string rst=rev(I+1);
for(int i=rst.size()-1;i>=0;i--){
re+=rst[i];
}
}
//cout << re << endl;
}
else if(kc){I++;continue;}
else if(st[I]=='+')c++;
else if(st[I]=='-')c--;
else if('A'<=st[I]&&st[I]<='Z'){
int ch=st[I]+c;
while(ch>'Z')ch-=26;
while(ch<'A')ch+=26;
c=0;
re+=(char)ch;
}
else if(st[I]=='?'){
re+='A';
c=0;
}
I++;
}
} |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
string parse(int &p, string &s){
string ret;
while(s[p] != ']' && p < (int)s.length()){
if(s[p] == '['){
string tmp = parse(++p, s);
reverse(tmp.begin(), tmp.end());
ret += tmp;
}else{
int diff = 0;
while(s[p] == '+' || s[p] == '-'){
if(s[p] == '+'){
diff++;
}else{
diff--;
}
p++;
}
if(s[p] == '?'){
ret += 'A';
}else{
ret += 'A' +(s[p]-'A'+diff+2600)%26;
}
p++;
}
}
p++;
return ret;
}
int main(){
while(1){
string s;
cin >> s;
if(s == ".") break;
int p = 0;
cout << parse(p, s) << endl;
}
return 0;
}
|
#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
using namespace std;
#define REP(i, j) for(int i = 0; i < (int)(j); ++i)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
typedef complex<double> P;
string solve(string str){
//cout <<"! " <<str <<endl;
int cnt = 0, l = str.length(), r = -1;
char tar = ' ';
stringstream ss;
for(int i = (int)str.length() - 1; i >= 0; --i){
if(str[i] == ']') {
if(tar != ' ') ss << (tar == '?' ? 'A' : tar);
tar = ' ';
--cnt; r = max(r, i);
}
else if(str[i] == '[') { ++cnt; l = min(l, i); }
if(cnt == 0 && r == -1){
if(str[i] == '?' || isalpha(str[i])){
if(tar != ' ') ss << (tar == '?' ? 'A' : tar);
tar = str[i];
}
if(tar != '?' && str[i] == '+') { ++tar; if(tar > 'Z') tar = 'A'; }
if(tar != '?' && str[i] == '-') { --tar; if(tar < 'A') tar = 'Z'; }
}
if(cnt == 0 && r != -1){
if(tar != ' ') { ss << (tar == '?' ? 'A' : tar); tar = ' '; }
string a = solve(str.substr(l + 1, r - l - 1));
ss << a;
l = str.length(); r = -1;
}
}
if(tar != ' ') ss << (tar == '?' ? 'A' : tar);
string res = ss.str();
REVERSE(res);
//cout <<" res " <<res <<endl;
return res;
}
int main() {
string s;
while(cin >>s && s != ".") cout <<solve(s) <<endl;
return 0;
} |
#include <iostream>
#include <algorithm>
#define REP(i, a, n) for(int i = (a); i < (n); i++)
using namespace std;
char letter();
string str();
string chipher();
string S;
int p;
char letter() {
char ret;
if(S[p] == '+') {
p++;
ret = letter();
if('A' <= ret && ret <= 'Z') ret = ((ret - 'A') + 1) % 26 + 'A';
} else if(S[p] == '-') {
p++;
ret = letter();
if('A' <= ret && ret <= 'Z') ret = ((ret - 'A') + 25) % 26 + 'A';
} else {
ret = S[p++];
}
return ret;
}
string str() {
string ret = "";
if(S[p] == '[') {
p++;
ret = chipher();
reverse(ret.begin(), ret.end());
p++;
} else {
ret += letter();
}
return ret;
}
string chipher() {
string ret = "";
while(p < S.length() && S[p] != ']') ret += str();
return ret;
}
int main(void) {
while(cin >> S, S != ".") {
p = 0;
string ans = chipher();
REP(i, 0, S.length()) if(ans[i] == '?') ans[i] = 'A';
cout << ans << endl;
}
} |
#include <bits/stdc++.h>
namespace perse {
char nxt(char c){
return c == 'Z' ? 'A' : c + 1;
}
char prv(char c){
return c == 'A' ? 'Z' : c - 1;
}
typedef std::string::const_iterator Iterator;
std::string cipher(Iterator&);
std::string string(Iterator&);
char letter(Iterator&);
std::string eval(const std::string &s)
{
Iterator it = std::begin(s);
return cipher(it);
}
std::string cipher(Iterator &it){
std::string res;
while (*it != '\0' && *it != ']'){
res += string(it);
}
return res;
}
std::string string(Iterator &it){
if (*it == '['){
++it;
std::string res = cipher(it);
++it;
std::reverse(std::begin(res), std::end(res));
return res;
}
return std::string(1, letter(it));
}
char letter(Iterator &it){
if (*it == '+'){
++it;
return nxt(letter(it));
}
else if (*it == '-'){
++it;
return prv(letter(it));
}
else if (isalpha(*it)){
char c = *it;
++it;
return c;
}
else assert(false);
}
}
using namespace std;
int main()
{
string s;
while (cin >> s, s != "."){
vector<string::iterator> v;
char c[3];
for (auto it = begin(s); it != end(s); ++it){
if (*it == '?') v.push_back(it);
}
string res(100, 'Z');
for (c[0] = 'A'; c[0] <= 'Z'; c[0]++){
for (c[1] = 'A'; c[1] <= 'Z'; c[1]++){
for (c[2] = 'A'; c[2] <= 'Z'; c[2]++){
for (int i = 0; i < v.size(); i++){
*v[i] = c[i];
}
res = min(res, perse::eval(s));
}
}
}
cout << res << endl;
}
} |
#include <algorithm>
#include <functional>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <climits>
#define all(c) (c).begin(), (c).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second
const int INF=100000000;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
using namespace std;
typedef pair<int ,int > P;
typedef long long ll;
string s;
string alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
void f1() {
s += "Z";
int cnt = 0;
for(int i=0; i<s.size(); i++) {
if(isalpha(s[i])) {
while(cnt<0) cnt+=26;
cnt %= 26;
cnt += s[i]-'A';
cnt %= 26;
s[i] = alphabet[cnt];
cnt = 0;
}
else if(s[i] == '+') cnt++;
else if(s[i] == '-') cnt--;
else if(s[i] == '?') cnt=0;
}
string ret = "";
rep(i,s.size()-1) {
if(isalpha(s[i]) || s[i]=='[' || s[i]==']' || s[i]=='?') ret += s[i];
}
s = ret;
}
void str_reverse(int s0, int t0) {
string ret = "";
for(int i=t0; i>=s0; i--) ret += s[i];
// cout<<"hoge : "<<ret<<endl;
// cout<<s.substr(0,s0)<<endl;
// cout<<s.substr(t0+1,s.size()-t0)<<endl;
s = s.substr(0,s0) + ret + s.substr(t0+1,s.size()-t0);
}
void f2() {
stack<int> st;
rep(i,s.size()) {
if(s[i] == '[') {
st.push(i);
}
else if(s[i] == ']') {
int top = st.top();
st.pop();
// cout<<top<<","<<i<<endl;
// cout<<s<<endl;
str_reverse(top, i);
// s[top] = '.';
// s[i] = '.';
// cout<<s<<endl;
// s = s.erase(top,1);
// s = s.erase(i-1,1);
// cout<<s<<endl;
}
}
}
void f3() {
string ret = "";
rep(i,s.size()) {
if(isalpha(s[i])) ret += s[i];
else if(s[i] == '?') ret += "A";
}
s = ret;
}
void solve() {
f1();
rep(i,s.size()) {
if(s[i] == '?') s[i] = 'A';
}
f2();
f3();
cout<<s<<endl;
}
int main() {
while(cin>>s) {
if(s==".") break;
solve();
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
while (s != ".") {
int gap = 0;
stack<int> st;
string ans = "";
for (int i = 0; i < s.size(); ++i) {
char c = s[i];
if (c == '[') {
st.push(ans.size());
} else if (c == '+') {
gap++;
} else if (c == '-') {
gap--;
} else if (c == '?') {
ans += 'A';
gap = 0;
} else if (c == ']') {
int from = st.top();
st.pop();
reverse(ans.begin() + from, ans.end());
} else {
ans += (c - 'A' + gap + 104) % 26 + 'A';
gap = 0;
}
}
cout << ans << endl;
cin >> s;
}
return 0;
}
|
#include<iostream>
#include<string>
#include<stack>
using namespace std;
int main()
{
string s;
while( cin >> s )
{
if( s == "." )
break;
string t = "";
int cnt = 0;
for( int i = 0; i < s.size(); i++ )
{
if( s[i] == '+' )
{
cnt++;
if( cnt > 25 )
cnt = 0;
}
else if( s[i] == '-' )
{
cnt--;
if( cnt < 0 )
cnt = 25;
}
else if( s[i] == '[' || s[i] == ']' )
t += s[i];
else if( s[i] == '?' )
{
cnt = 0;
t += s[i];
}
else
{
if( s[i] + cnt > 'Z' )
t += s[i] + cnt - 'Z' + 'A' - 1;
else if( s[i] + cnt < 'A' )
t += s[i] + cnt - 'A' + 'Z' + 1;
else
t += s[i] + cnt;
cnt = 0;
}
}
stack<char> st;
for( int i = 0; i < t.size(); i++ )
{
if( t[i] == ']' )
{
string u = "";
while( st.top() != '[' )
{
u += st.top();
st.pop();
}
st.pop();
for( int j = 0; j < u.size(); j++ )
st.push(u[j]);
}
else
st.push(t[i]);
}
string res = "";
while( !st.empty() )
{
res += st.top();
st.pop();
}
for( int i = res.size() - 1; i >= 0; i-- )
{
if( res[i] == '?' )
cout << 'A';
else
cout << res[i];
}
cout << endl;
}
return 0;
}
|
#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
#include <tuple>
#include <bitset>
#include <ciso646>
using namespace std;
inline bool cheak(int x, int y, int xMax, int yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; }
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef long long ll;
typedef unsigned long long ull;
#define For(i,a,b) for(ll (i) = (a);i < (b);(i)++)
#define rep(i,n) For(i,0,n)
#define clr(a) memset((a), 0 ,sizeof(a))
#define mclr(a) memset((a), -1 ,sizeof(a))
#define all(a) (a).begin(),(a).end()
#define sz(a) (sizeof(a))
#define Fill(a,v) fill((int*)a,(int*)(a+(sz(a)/sz(*(a)))),v)
const int dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int mod = 1000000007;
const int INF = 1e9;
string s;
int t;
string cip();
string str();
char let();
string cip(){
string ret;
while (t < s.size() && s[t] != ']'){
ret += str();
}
return ret;
}
string str(){
string ret;
if (s[t] == '['){
t++; ret = cip(); t++;
reverse(ret.begin(), ret.end());
return ret;
}
else{
return string(1,let());
}
}
char let(){
if (s[t] == '+'){
t++; char c = let();
if (c == 'Z')c = 'A';
else c++;
return c;
}else
if (s[t] == '-'){
t++; char c = let();
if (c == 'A')c = 'Z';
else c--;
return c;
}
else{
t++;
return s[t-1];
}
}
string dfs(int n){
if (n == s.size()){
t = 0;
return cip();
}
string ret(90,'Z'+1);
if (s[n] == '?'){
for (char c = 'A'; c <= 'Z'; c++){
s[n] = c;
ret = min(ret,dfs(n+1));
}
s[n] = '?';
}
else{
ret = dfs(n + 1);
}
return ret;
}
int main(){
while (cin >> s && s != "."){
cout << dfs(0) << endl;
}
return 0;
} |
#include<iostream>
#include<stack>
#include<algorithm>
#include<vector>
using namespace std;
#define inRange(x,a,b) (a <= x && x <= b)
int main(){
string s;
while(cin >> s, s != "."){
string t = "";
int i = 0;
while(i < s.length()){
if(s[i] == '-' || s[i] == '+'){
int cnt = 0;
while(i < s.length() && (s[i] != '?' && !inRange(s[i], 'A', 'Z'))){
cnt += s[i++] == '-' ? -1 : 1;
}
if(s[i] == '?') t += 'A';
else t += (char)('A' + (s[i]-'A'+cnt+26*100)%26);
}else{
t += (s[i] != '?' ? s[i] : 'A');
}
i++;
}
stack<char> q;
for(i = 0; i < t.length(); i++){
if(t[i] == ']'){
vector<char> r;
while(q.top() != '[') r.push_back(q.top()), q.pop();
q.pop();
for(char c : r) q.push(c);
}else{
q.push(t[i]);
}
}
string ans = "";
while(!q.empty()){
ans += q.top(); q.pop();
}
reverse(ans.begin(), ans.end());
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long int ll;
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define endl "\n"
const double EPS = 1e-7;
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
const double PI = acos(-1);
const int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
using State = string::const_iterator;
//-------------------------------------
string s;
char pre(char c) {
if(c == '?') {
return c;
} else {
return (c == 'A' ? 'Z' : c - 1);
}
}
char nxt(char c) {
if(c == '?') {
return c;
} else {
return (c == 'Z' ? 'A' : c + 1);
}
}
string Cipher(State &);
string String(State &);
char Letter(State &);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
while(1) {
cin >> s;
if(s == ".") {
break;
}
State now = s.begin();
string ans = Cipher(now);
for(int i = 0; i < ans.size(); i++) {
if(ans[i] == '?') {
ans[i] = 'A';
}
}
cout << ans << endl;
}
}
string Cipher(State &now) {
string res = String(now);
while(now != s.end() && *now != ']') {
res += String(now);
}
return res;
}
string String(State &now) {
string res;
if(*now == '[') {
res = Cipher(++now);
reverse(ALL(res));
now++;
return res;
} else {
res = Letter(now);
return res;
}
}
char Letter(State &now) {
char res;
if(*now == '+') {
return nxt(Letter(++now));
} else if(*now == '-') {
return pre(Letter(++now));
} else {
return *(now++);
}
}
|
#define NDEBUG
#include <algorithm>
#include <cassert>
#include <cstdlib>
#include <iostream>
using namespace std;
#define ALL(x) begin(x), end(x)
char Letter(string::const_iterator&);
string String(string::const_iterator&);
string Cipher(string::const_iterator&);
char Letter(string::const_iterator &it) {
if(*it == '+') {
++it;
char res = Letter(it);
if(res != '?' && ++res > 'Z') res = 'A';
return res;
}
else if(*it == '-') {
++it;
char res = Letter(it);
if(res != '?' && --res < 'A') res = 'Z';
return res;
}
else if(isupper(*it) || *it == '?') {
const char res = *it;
++it;
return res;
}
assert(false);
}
string String(string::const_iterator &it) {
if(*it == '[') {
++it;
string res = Cipher(it);
assert(*it == ']');
++it;
reverse(ALL(res));
return res;
}
return string(1, Letter(it));
}
string Cipher(string::const_iterator &it) {
string res = "";
while(*it != '\0' && *it != ']') {
res += String(it);
}
return res;
}
string parse(const string &text) {
auto it = text.cbegin();
string res = Cipher(it);
assert(it == text.cend());
for(auto &e : res) {
if(e == '?') e = 'A';
}
return res;
}
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
for(string text; cin >> text && text != ".";) {
cout << parse(text) << endl;
}
return EXIT_SUCCESS;
} |
#include <bits/stdc++.h>
using namespace std;
int idx,size;
string s;
string parse(){
string res;
if(idx >= size || s[idx] == ']'){ return res; }
if(isupper(s[idx])){
while(idx < size && isupper(s[idx])){
res += s[idx++];
}
}else if(s[idx] == '['){
idx++;
string str = parse();
idx++;
reverse(str.begin(),str.end());
res += str;
}else if(s[idx] == '?'){
res += 'A'; idx++;
}else if(s[idx] == '+' || s[idx] == '-'){
int p[85] = {0}, N = 0;
while(idx < size && (s[idx] == '+' || s[idx] == '-')){
if(s[idx] == '+'){
p[N++] = 1;
}else{
p[N++] = -1;
}
idx++;
}
if(isupper(s[idx])){
int x = s[idx];
for(int i = 0 ; i < N ; i++){
x += p[i];
if(x > 'Z'){ x = 'A'; }
else if(x < 'A'){ x = 'Z'; }
}
res += (char)x;
}else if(s[idx] == '?'){
res += 'A';
}
idx++;
}
return res + parse();
}
int main(){
while(cin >> s, s != "."){
idx = 0; size = s.size();
cout << parse() << endl;
}
return 0;
} |
#include <iostream>
#include <climits>
#include <set>
#include <string>
#include <algorithm>
#include <vector>
#define MAX 1000000007
using namespace std;
#define ll long long
#define dbg if(0)
#define ISRANGE(val,lo,hi) ((lo<=val)&&(val<hi))
//ABCDEFGHIJKLMNOPQRSTUVWXYZ
string decode(string s){
string ans="";
ll diff=0;
for(int i=0;i<s.size();i++){
if (s[i]-'A'<26 && s[i]-'A'>=0){//文字確定
ans+=(char)(((int)((s[i]-65)+diff)+26*8)%26+65);
diff=0;
}
if (s[i]-'?'==0){//文字確定
ans+=(char)(65);
diff=0;
}
if (s[i]-'+'==0){//+
diff++;
}
if (s[i]-'-'==0){//+
diff--;
}
if(s[i]-'['==0){//[
ll count=1;
ll pos=i;
while(count>0){
pos++;
if(s[pos]-'['==0)count++;
if(s[pos]-']'==0)count--;
}
string rev=decode(s.substr(i+1,(pos-i-1)));
reverse(rev.begin(),rev.end());
ans+=rev;
i=pos;
}
}
return ans;
}
int main(){
ll ans;
string s;
while(true){
cin >>s;
if(s==".")break;
for(int i=0;i<s.size();i++){
}
cout << decode(s)<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string inde(string s){
string ret;
int c=0;
for(auto x:s){
if(x == '[') ret += '[';
else if(x == ']') ret += ']';
else if(x == '+') c++;
else if(x == '-') c--;
else if(x == '?'){
ret += 'A';
c = 0;
} else {
c %= 26;
ret += (x - 'A' + c + 26)%26 + 'A';
c = 0;
}
}
return ret;
}
string rev(string s){
int nest = 0;
int start = 0;
string ret;
for(int i=0;i<s.size();i++){
if(s[i] == '['){
if(nest == 0) start = i+1;
nest++;
}
else if(s[i] == ']'){
nest--;
if(nest == 0) {
string rstr = rev(s.substr(start,i-start));
ret += string(rstr.rbegin(),rstr.rend());
}
}
else if(nest == 0){
ret += s[i];
}
}
return ret;
}
int main(){
string s;
while(cin >> s,s != "."){
cout << rev(inde(s)) << endl;
}
return 0;
}
|
#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<cmath>
using namespace std;
#define mind(a,b) (a>b?b:a)
#define maxd(a,b) (a>b?a:b)
#define absd(x) (x<0?-(x):x)
#define pow2(x) ((x)*(x))
#define rep(i,n) for(int i=0; i<n; ++i)
#define repr(i,n) for(int i=n-1; i>=0; --i)
#define repl(i,s,n) for(int i=s; i<=n; ++i)
#define replr(i,s,n) for(int i=n; i>=s; --i)
#define repf(i,s,n,j) for(int i=s; i<=n; i+=j)
#define repe(e,obj) for(auto e : obj)
#define SP << " " <<
#define COL << " : " <<
#define COM << ", " <<
#define ARR << " -> " <<
#define PNT(STR) cout << STR << endl
#define POS(X,Y) "(" << X << ", " << Y << ")"
#define DEB(A) " (" << #A << ") " << A
#define DEBREP(i,n,val) for(int i=0; i<n; ++i) cout << val << " "; cout << endl
#define ALL(V) (V).begin(), (V).end()
#define INF 1000000007
#define INFLL 10000000000000000007LL
#define EPS 1e-9
typedef unsigned int uint;
typedef unsigned long ulong;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
//typedef pair<ll, ll> P;
typedef pair<P, int> PI;
typedef pair<int, P> IP;
typedef pair<P, P> PP;
typedef priority_queue<P, vector<P>, greater<P> > pvqueue;
vector<int> ps;
string s;
int cur = 0;
char letter() {
int c;
int pl = 0;
while(cur < s.size()) {
c = s[cur++];
if(c == '+' || c == '-') {
pl += (c == '+' ? 1 : -1);
} else {
// alphabet
break;
}
}
if(c == '?') return '?';
c += pl;
while(c < 'A') c += 26;
while('Z' < c) c -= 26;
return c;
}
string cipher() {
char c;
string res = "";
while(cur < s.size()) {
c = s[cur];
if(c == '[') {
++cur;
string rev = cipher();
repr(i, rev.size()) res += rev[i];
} else if(c == ']') {
++cur;
break;
} else {
res += letter();
}
}
return res;
}
int main() {
while(cin >> s && s[0] != '.') {
cur = 0;
string res = cipher();
rep(i, res.length()) {
if(res[i] == '?') res[i] = 'A';
}
cout << res << endl;
}
return 0;
} |
#include <iostream>
#include <string>
using namespace std;
string reverse(string b) {
if (b.size() == 1) {
return b;
} else {
return reverse(b.substr(1))+b[0];
}
}
int main() {
string a;
string abc = "ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ";
string zyx = "ZYXWVUTSRQPONMLKJIHGFEDCBAZYXWVUTSRQPONMLKJIHGFEDCBA";
while (cin >> a) {
if (a == ".") {
break;
}
int counter = 0;
string b;
for (int i = 0; i < a.size(); i++) {
if (a[i] == '+') {
counter++;
} else if (a[i] == '-') {
counter--;
} else if (a[i] != '[' && a[i] != ']') {
if (counter > 0 && counter > 25) {
counter %= 26;
} else if (counter < 0 && counter < -25) {
counter = -((-counter)%26);
}
if (counter == 0 || a[i] == '?') {
b += a[i];
} else if (counter > 0) {
for (int j = 0; ; j++) {
if (a[i] == abc[j]) {
b += abc[j+counter];
break;
}
}
} else {
for (int j = 0; ; j++) {
if (a[i] == zyx[j]) {
b += zyx[j-counter];
break;
}
}
}
counter = 0;
} else {
b += a[i];
}
}
while (b.find('[') != string::npos) {
int f = 0;
int t = b.size();
t--;
for (int i = 0; i < b.size(); i++) {
if (b[i] == '[') {
f = i;
} else if (b[i] == ']') {
t = i;
break;
}
}
b = b.substr(0, f) + reverse(b.substr(f+1, t-f-1)) + b.substr(t+1);
}
for (int i = 0; i < b.size(); i++) {
if (b[i] == '?') {
b[i] = 'A';
}
}
cout << b << endl;
}
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2584&lang=jp
string Chiper(int& x, string& S);
char Letter(int& x, string& S);
string Chiper(int& x, string& S) {
string ret = "";
for (; x < S.length();x++) {
if (S[x] == ']')return ret;
if (S[x] == '[') {
x++;
string temp = Chiper(x, S);
reverse(temp.begin(), temp.end());
ret += temp;
}
else {
ret += Letter(x, S);
}
}
return ret;
}
char Letter(int& x, string& S) {
int cnt = 0;
char ret = '\n';
for (;x < S.length();x++) {
if (S[x] == '+') { cnt++; continue; }
if (S[x] == '-') { cnt--; continue; }
if (S[x] == '?') { return 'A'; }
ret = (S[x] - 'A' + cnt + 26 * 5) % 26 + 'A';
return ret;
}
return ret;
}
int main() {
cin.tie(0); ios::sync_with_stdio(false);
string S;
while (cin >> S) {
if (S == ".")break;
int x = 0;
cout << Chiper(x, S) << endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
string e;
int p;
string A();
string B();
string C();
string A(){
string w = B();
while( e[p] != ']') w += B();
return w;
}
string B(){
if( e[p] == '[' ){
p++;
string r = A();
if( e[p] != ']' ) throw "BUG";
p++;
reverse(r.begin(),r.end());
return r;
}else{
if( e[p] == ']' ) throw "BUG2";
return C();
}
}
string C(){
if( e[p] == '+' ){
p++;
string h = C();
h[0] = (h[0]-'A'+1)%26+'A';
return h;
}else if( e[p] == '-' ){
p++;
string h = C();
h[0] = (h[0]-'A'+25)%26+'A';
return h;
}else{
if( e[p] == '[' || e[p] == ']' ) throw "><";
return string(1,e[p++]);
}
}
string solve(string s){
string table = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string syori = "~";
for(int i = 0 ; i < table.size() ; i++)
for(int j = 0 ; j < table.size() ; j++){
for(int k = 0 ; k < table.size() ; k++){
string w = s;
char tb[3] = {table[i],table[j],table[k]};
int f = 0;
for(int o = 0 ; o < s.size() ; o++)
if( s[o] == '?' ) w[o] = tb[f++];
w += "]";
e = w;
p = 0;
try{
string a = A();
if( e.size() != p+1 ) throw ";";
syori = min(syori,a);
}catch(const char *msg){
}
}
}
return syori;
}
int main(){
string s;
while( cin >> s && s != "." ){
cout << solve(s) << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
while(cin>>s&&s!="."){
string an;
for(int i=0,c;i<s.size();i++){
c=0;
while(s[i]=='+'||s[i]=='-'){
if(s[i]=='+')c++;
else c--;
i++;
}
if(s[i]=='['||s[i]==']')an+=s[i];
else if(s[i]=='?')an+='A';
else an+=(char)(((s[i]-'A'+c)%26+26)%26+'A');
}
stack<int> st;
for(int i=0;i<an.size();i++){
if(an[i]=='[')st.push(i);
if(an[i]==']'){
int t=st.top();
st.pop();
reverse(an.begin()+t,an.begin()+i);
}
}
for(int i=0;i<an.size();i++){
if(an[i]=='['||an[i]==']')continue;
cout<<an[i];
}
cout<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P3;
const ll MOD = 1000000007;
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(1e4 + 5);
const double EPS = 1e-8;
const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define SORT(v) sort((v).begin(), (v).end())
#define ALL(v) (v).begin(), (v).end()
string rec(string &s, int &pos){
string res ="";
int inc = 0;
for(;pos < s.size();pos++){
if(s[pos]=='+') inc++;
if(s[pos]=='-') inc--;
if(s[pos] >= 'A' && s[pos] <= 'Z'){
char c = 'A'+(s[pos]-'A'+inc+26*5)%26;
res.push_back(c);
inc = 0;
}
if(s[pos]=='?'){
res.push_back('A');
inc = 0;
}
if(s[pos]=='['){
pos++;
string tmp = rec(s,pos);
reverse(ALL(tmp));
res += tmp;
}
else if(s[pos]==']'){
break;
}
}
return res;
}
int main() {
string s;
while(cin >> s, s!="."){
string ans="";
REP(i,s.size()) ans += rec(s,i);
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
string C(string x);
string D(string x);
string S(string x);
string L(string x);
int main()
{
string s;
while(cin >>s,(s!="."))
{
string ans=C(s);
rep(i,s.size())
{
if(ans[i]=='?') ans[i]='A';
}
cout << ans <<endl;
}
return 0;
}
string C(string x)
{
if(x[0]=='[')
{
int br=0;
int idx=0;
while(idx<x.size())
{
if(x[idx]=='[') ++br;
else if(x[idx]==']') --br;
if(br==0) break;
++idx;
}
string a=S(x.substr(0,idx+1));
string b="";
if(idx+1!=x.size()) b=D(x.substr(idx+1));
return a+b;
}
else
{
//Letter
int idx=0;
while(idx<x.size())
{
if(x[idx]=='?' || ('A'<=x[idx] && x[idx]<='Z')) break;
++idx;
}
string a=S(x.substr(0,idx+1));
string b=D(x.substr(idx+1));
return a+b;
}
}
string D(string x)
{
if(x=="") return x;
return C(x);
}
string S(string x)
{
if(x[0]=='[')
{
//reverse
string r=C(x.substr(1,x.size()-2));
reverse(all(r));
return r;
}
else return L(x);
}
string L(string x)
{
if(x[0]=='+')
{
string r=L(x.substr(1));
if(r[0]!='?')
{
if(r[0]=='Z') r[0]='A';
else ++r[0];
}
return r;
}
else if(x[0]=='-')
{
string r=L(x.substr(1));
if(r[0]!='?')
{
if(r[0]=='A') r[0]='Z';
else --r[0];
}
return r;
}
else return x;
} |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define each(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define exist(s,e) ((s).find(e)!=(s).end())
#define range(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) range(i,0,n)
#define clr(a,b) memset((a), (b) ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
const double eps = 1e-10;
const double pi = acos(-1.0);
const ll INF =1LL << 62;
const int inf =1 << 29;
string s;
int cur=0;
char Letter();
string String();
string Cipher();
char Letter(){
int val=0;
while(!isupper(s[cur])){
if(s[cur]=='?'){
cur++;
return 'A';
}
if(s[cur]=='+')
val++;
if(s[cur]=='-')
val--;
cur++;
val=(val+26)%26;
}
int idx=s[cur++]-'A';
return (idx+val+26)%26+'A';
}
string String(){
int n=s.size();
string res="";
while(cur<n){
if(s[cur]=='['){
cur++;
res=Cipher();
cur++;
reverse(res.begin(),res.end());
return res;
}else{
res+=Letter();
return res;
}
}
return res;
}
string Cipher(){
int n=s.size();
string res="";
while(cur<n){
if(s[cur]==']')
break;
res+=String();
}
return res;
}
int main(void){
while(cin >> s){
if(s==".")
break;
cur=0;
cout << Cipher() << endl;
}
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
string parse(string str){
string ret;
int i=0,j,cnt,acc=0;
for(;i<str.size();i++){
if(str[i]=='['){
cnt=1;
for(j=i+1;cnt;j++){
if(str[j]=='[')cnt++;
if(str[j]==']')cnt--;
}
string x=parse(str.substr(i+1,(j-1)-(i+1)));
reverse(x.begin(),x.end());
ret+=x;
i=j-1;
}else if(str[i]=='+'){
acc++;
}else if(str[i]=='-'){
acc--;
}else{
ret+=str[i]=='?'?'A':( ((str[i]-'A'+acc)%26+26)%26+'A' );
acc=0;
}
}
return ret;
}
int main(){
string line;
for(;getline(cin,line),line!=".";){
line=parse(line);
cout<<line<<endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
string str;
string solve(){
string res;
for(int i=0;i<str.size();i++){
int cnt=0;
while(str[i]=='+'||str[i]=='-')cnt+=(str[i]=='+')-(str[i]=='-'),i++;
cnt%=('Z'-'A'+1);
if(cnt) res+=((str[i]-'A')+cnt+('Z'-'A')+1)%('Z'-'A'+1)+'A';
else res += str[i];
if(str[i]=='?')res[res.size()-1]='A';
}
for(int i=0;i<res.size();i++){
if(res[i]=='['){
int c=1,j=i+1;
while(c) c+=(res[j]=='[')-(res[j]==']'),j++;
reverse(res.begin()+i,res.begin()+j);
for(int k=i;k<j;k++)
if(res[k]=='[')res[k]=']';
else if(res[k]==']')res[k]='[';
res.erase(res.begin()+j-1),res.erase(res.begin()+i);
i--;
}
}
return res;
}
int main(){
while(1){
str.clear();
cin>>str;
if(str==".")break;
cout <<solve()<<endl;
}
return 0;
} |
//
// main.cpp
// 2584 Broken Cipher Generator
//
// Created by 13B15237 on 2015/06/18.
// Copyright (c) 2015??´ 13B15237. All rights reserved.
//
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int getRevEndPos(string str) {
int indent = 0;
for (int i = 1; i < str.length(); ++i) {
if (str[i] == '[') {
++indent;
}
else if (str[i] == ']') {
if (!indent) return i;
else --indent;
}
}
return 0;
}
string decode(string cipher, bool reverse)
{
if (cipher.empty()) return cipher;
if (cipher[0] == '[') {
int end = getRevEndPos(cipher);
string c1 = cipher.substr(1, end - 1);
string c2 = cipher.substr(end + 1, cipher.size());
string d1 = decode(c1, !reverse);
string d2 = decode(c2, reverse);
string d1rev(d1.rbegin(), d1.rend());
return d1rev + d2;
}
int i = 0;
int offset = 0;
char ch;
while (1) {
if (cipher[i] == '+') {
++offset;
}
else if (cipher[i] == '-') {
--offset;
}
else {
ch = cipher[i];
break;
}
++i;
}
while (1) {
if (offset < 0) offset += 26;
else if (offset >= 26) offset -= 26;
else break;
}
if (ch == '?') {
ch = 'A';
} else {
ch = 'A' + (ch - 'A' + offset) % 26;
}
string c1(" ");
c1[0] = ch;
string c2 = cipher.substr(i + 1, cipher.size());
string d2 = decode(c2, reverse);
return c1 + d2;
}
string str;
bool input() {
cin >> str;
if (str == ".") return false;
return true;
}
bool solve() {
cout << decode(str, false) << endl;
return true;
}
int main(int argc, const char * argv[]) {
while (input()) {
solve();
}
return 0;
} |
#include<bits/stdc++.h>
#define N 100
#define M 26
using namespace std;
string s;
int p,len;
string bnf(){
string res;
int c=0;
while(p!=len){
char t=s[p];
if(t=='+')p++,c++;
if(t=='-')p++,c--;
if('A'<=t&&t<='Z')
res+=((s[p++]+c+M*N)-'A')%M+'A',c=0;
if(t=='?')res+=s[p++],c=0;
if(t=='[')p++,res+=bnf();
if(t==']'){
p++;
reverse(res.begin(),res.end());
break;
}
}
return res;
}
int main(){
while(1){
cin>>s;
if(s==".")break;
len=s.size();
p=0;
string ans=bnf();
for(int i=0;i<(int)ans.size();i++)
if(ans[i]=='?')ans[i]='A';
cout<<ans<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
typedef vector<int> vi;
string parse(string x, int &i)
{
if (x.length() == i) return "";
if ('A' <= x[i] && x[i] <= 'Z')
{
char c = x[i];
i++;
return c + parse(x, i);
}
else if (x[i] == ']')
{
i++;
return "";
}
i++;
string s = parse(x, i);
reverse(s.begin(), s.end());
return s + parse(x, i);
}
string pre(string x)
{
int d = 0;
string ret = "";
rep(i, 0, x.length())
{
if ('A' <= x[i] && x[i] <= 'Z')
{
int j = x[i] - 'A';
while (d < 0) d += 26;
j = (j + d) % 26;
ret += char('A' + j);
d = 0;
}
else if (x[i] == '?')
{
d = 0;
ret += "A";
}
else if (x[i] == '+')
d++;
else if (x[i] == '-')
d--;
else
ret += x[i];
}
return ret;
}
int main()
{
while (1)
{
string s; cin >> s;
if (s[0] == '.') return 0;
int i = 0;
string ans = parse(pre(s), i);
cout << ans << endl;
}
} |
#include<iostream>
#include<string>
#include<algorithm>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[]={0, 0, 1, -1, 1, 1, -1, -1};
int dx[]={1, -1, 0, 0, 1, -1, -1, 1};
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define mp make_pair
#define fi first
#define sc second
int d[500];
string s;
string ps(string s) {
string ret = "";
for(int i = 0;i < s.size();i++) {
if(s[i] >= 'A' && s[i] <= 'Z'){
ret.pb(s[i]);
}else if(s[i] == '?')ret.pb('A');
else if(s[i] == '+' || s[i] == '-') {
int j = 0;
while(s[i] == '+' || s[i] == '-') {
j += d[s[i]];
i++;
}
if(s[i] == '?') {
ret.pb('A');
}else {
s[i] -= 'A';
j = (j + 26 * 100) % 26;
s[i] = (s[i] + j + 26) % 26;
s[i] += 'A';
ret.pb(s[i]);
}
}else {
int cou = 1;
int start = i + 1;
while(cou > 0) {
i++;
if(s[i] == '[') {
cou++;
}else if(s[i] == ']') {
cou--;
}
}
if(i - start > 0) {
string t = s.substr(start,i - start);
/*for(auto &c : t) {
if(c == '[') c = ']';
else if(c == ']') c = '[';
}*/
//cerr << "aaa " << t << endl;
t = ps(t);
reverse(t.begin(),t.end());
ret += t;
}
}
}
return ret;
}
int main(){
while(1) {
cin >> s;
if(s == ".")break;
d['+'] = 1;
d['-'] = -1;
cout << ps(s) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int idx,size;
string s;
string parse(){
string res;
if(idx >= size || s[idx] == ']') return res;
if(isupper(s[idx])){
while(idx < size && isupper(s[idx])){
res += s[idx++];
}
}else if(s[idx] == '['){
idx++;
string str = parse();
idx++;
reverse(str.begin(),str.end());
res += str;
}else if(s[idx] == '?'){
res += 'A'; idx++;
}else if(s[idx] == '+' || s[idx] == '-'){
int p[85] = {0}, N = 0;
while(idx < size && (s[idx] == '+' || s[idx] == '-')){
if(s[idx] == '+'){
p[N++] = 1;
}else{
p[N++] = -1;
}
idx++;
}
if(isupper(s[idx])){
int x = s[idx];
for(int i = 0 ; i < N ; i++){
x += p[i];
if(x > 'Z'){ x = 'A'; }
else if(x < 'A'){ x = 'Z'; }
}
res += (char)x;
}else if(s[idx] == '?'){
res += 'A';
}
idx++;
}
return res + parse();
}
int main(){
while(cin >> s, s != "."){
idx = 0; size = s.size();
cout << parse() << endl;
}
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
int main() {
string g, h;
int i = 0;
vector<int>ireko;
bool LeftKakko = false;
int k = 0;
while ((cin >> g), g != ".") {
for (int l = 0; l < g.size();++l) {
char a = g[l];
if (a == 43) {
i++;
}
else if (a == 45) {
i--;
}
else if (a == 91) {
ireko.push_back(k);
}
else if (a == 93) {
reverse(h.begin() + ireko.back(), h.end());
ireko.pop_back();
}
else if (a == 63) {
h += 65;
i = 0;
++k;
}
else {
int w;
for (w = a + i; 64 >= w || w >= 91; (w >= 91) ? w -= 26 : w += 26){}
h.push_back(w);
i = 0;
++k;
}
}
cout << h << endl;
h.erase();
k = 0;
}
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
const int INF = 1<<30;
const int MOD = 1e9 + 7;
string s;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
while(cin >> s)
{
if(s == ".") break;
string t = "";
int cnt = 0;
for(int i = 0; i < s.size(); i++)
{
if(s[i] == '+') cnt++;
else if(s[i] == '-') cnt--;
else if(s[i] == ']')
{
string tmp = "";
while(t.size())
{
char ch = t.back(); t.pop_back();
if(ch == '[') break;
tmp += ch;
}
t += tmp;
}
else if(s[i] == '[') t += s[i];
else if(s[i] == '?')
{
t += 'A';
cnt = 0;
}
else
{
char ch = s[i] + cnt % 26;
if(ch > 'Z') ch = (ch - 'Z') % 26 + 'A' - 1;
else if(ch < 'A') ch = 'Z' - ('A' - ch) % 26 + 1;
t += ch;
cnt = 0;
}
}
cout << t << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr,__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
char letter(string& s, int& idx, int d) {
switch (s[idx]) {
case '+':
idx++;
return letter(s, idx, d+1);
case '-':
idx++;
return letter(s, idx, d-1);
case '?':
idx++;
return 'A';
default:
return (s[idx++] - 'A' + d + 26*10) % 26 + 'A';
}
assert(0);
}
string cipher(string& s, int& idx) {
stringstream ss;
for (; idx < (int)s.length();) {
switch (s[idx]) {
case '[': {
idx++;
string r = cipher(s, idx);
for (int i = r.length()-1; i >= 0; i--) ss << r[i];
break;
}
case ']':
idx++;
return ss.str();
default:
ss << letter(s, idx, 0);
}
}
return ss.str();
}
int main() {
string s;
while (cin >> s, s != ".") {
int idx = 0;
//s = "-----A";
//cout << letter(s, idx, 1) << endl;
cout << cipher(s, idx) << endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
typedef string::const_iterator State;
class ParseError {};
string s, t;
string Cipher(State &begin);
string String(State &begin);
string Letter(State &begin);
string Cipher(State &begin){
// cout << *begin << endl;
string ret = "";
if(*begin == ']') return ret;
if(begin >= s.end()) return ret;
ret += String(begin);
if(begin >= s.end()) return ret;
ret += Cipher(begin);
return ret;
}
string String(State &begin){
string ret = "";
if(*begin == '['){
begin++;
ret += Cipher(begin);
begin++;
reverse(ret.begin(), ret.end());
}else{
ret += Letter(begin);
}
return ret;
}
string Letter(State &begin){
string ret = "";
if(*begin == '+'){
begin++;
string tmp = Letter(begin);
char now = 'A' + (tmp[0] - 'A' + 1) % 26;
ret += now;
}else if(*begin == '-'){
begin++;
string tmp = Letter(begin);
char now = 'A' + (tmp[0] - 'A' + 25) % 26;
ret += now;
}else{
ret += *begin;
begin++;
}
return ret;
}
vector<string> vs;
void dfs(int k, string now){
if(k == t.size()) vs.push_back(now);
else if(t[k] != '?') dfs(k + 1, now + t[k]);
else{
for(int i = 0; i < 26; i++) dfs(k + 1, now + (char)('A' + i));
}
}
int main(){
while(1){
cin >> t;
if(t == ".") break;
vs.clear();
dfs(0, "");
vector<string> ans;
for(int i = 0; i < vs.size(); i++){
s = vs[i];
State begin = s.begin();
string tmp = Cipher(begin);
ans.push_back(tmp);
}
sort(ans.begin(), ans.end());
cout << ans[0] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
while (cin >> S)
{
if (S == ".")
return 0;
int n = S.size();
string T = "";
int cnt = 0;
for (int i = 0; i < n; i++)
{
if ('A' <= S[i] && S[i] <= 'Z')
{
if (cnt < 0)
cnt = (104 + cnt) % 26;
S[i] = (S[i] - 'A' + cnt) % 26 + 'A';
T += S[i];
cnt = 0;
}
else if (S[i] == '+')
cnt++;
else if (S[i] == '-')
cnt--;
else if (S[i] == '?')
{
T += 'A';
cnt = 0;
}
else
{
T += S[i];
cnt = 0;
}
}
n = T.size();
stack<int> st;
vector<pair<int, int>> v;
for (int i = 0; i < n; i++)
{
if (T[i] == '[')
st.push(i);
else if (T[i] == ']')
{
v.push_back({st.top(), i});
st.pop();
}
}
for (auto p : v)
{
reverse(T.begin() + p.first + 1, T.begin() + p.second);
}
S = "";
for (char c : T)
{
if (c == '[' || c == ']')
continue;
S += c;
}
cout << S << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef string::iterator state;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
//const ll mod = 1000000007;
string f(state &itr) {
//cerr << *itr << endl;
if(*itr == '#') return "";
if(*itr == ']') return "";
if(*itr == '[') {
itr++;
string tmp;
while(*itr != ']') {
tmp += f(itr);
}
reverse(tmp.begin(), tmp.end());
itr++;
return tmp + f(itr);
}
if(*itr == '+') {
itr++;
string tmp = f(itr);
//cerr << "TMP: " << tmp << endl;
if(tmp[0] == '?') return tmp;
if(tmp[0] != 'Z') tmp[0]++;
else tmp[0] = 'A';
return tmp;
}
if(*itr == '-') {
itr++;
string tmp = f(itr);
if(tmp[0] == '?') return tmp;
if(tmp[0] != 'A') tmp[0]--;
else tmp[0] = 'Z';
return tmp;
}
string tmp;
tmp.push_back(*itr);
itr++;
return tmp + f(itr);
}
int main() {
//cout.precision(10);
cin.tie(0);
ios::sync_with_stdio(false);
while(true) {
string S;
cin >> S;
if(S == ".") break;
S = S + "#";
state itr = S.begin();
string ans = f(itr);
for(int i = 0; i < ans.size(); i++) if(ans[i] == '?') ans[i] = 'A';
cout << ans << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#define N 100
#define M 26
using namespace std;
string s,a;
int p,l,c;
string bnf(){
string r;
c=0;
while(p!=l){
char t=s[p];
if(t=='+')p++,c++;
if(t=='-')p++,c--;
if('A'<=t&&t<='Z')
r+=((s[p++]+c+M*N)-'A')%M+'A',c=0;
if(t=='?')r+=s[p++],c=0;
if(t=='[')p++,r+=bnf();
if(t==']'){
p++;
reverse(r.begin(),r.end());
break;
}
}
return r;
}
int main(){
while(1){
cin>>s;
if(s==".")break;
l=s.size();
p=0;
a=bnf();
for(int i=0;i<a.size();i++)
if(a[i]=='?')a[i]='A';
cout<<a<<endl;
}
return 0;
} |
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<utility>
using namespace std;
pair<string,bool> solve(string str){
bool check = false;
vector<char> strv(str.begin(), str.end());
stack<char> inside;
int count = 0;
int left = 0, right = 0;
for(char ch:strv){
inside.push(ch);
if(ch == '['){
left = count;
stack<char> empty;
swap(inside, empty);
}
if(ch == ']'){
check = true;
right = count;
inside.pop();
strv.erase(strv.begin()+left);
strv.erase(strv.begin()+right-1);
int i = 0;
while(!inside.empty()){
strv[left+i] = inside.top();
inside.pop();
i++;
}
break;
}
count++;
}
string res(strv.begin(), strv.end());
pair<string,bool> result = make_pair(res, check);
return result;
}
char reading(char c, int &count){
if(c == '+') count++;
else if(c == '-') count--;
else if(c != '[' && c != ']' && c != '?'){
int zover = count / ('Z'-'A');
count -= ('Z'-'A'+1)*zover;
char newchar = (char)c+count;
while(newchar>'Z') newchar = 'A' + newchar - 'Z' - 1;
while(newchar<'A') newchar = 'Z' - ('A' - newchar)+1;
count = 0;
return (char)newchar;
}else if(c == '?'){
count = 0;
return 'A';
}else return c;
return 0;
}
int main(){
string str;
while(cin >> str,str != "."){
int count = 0;
vector<char> res;
for(char s:str){
char ch = reading(s, count);
if(ch != 0) res.push_back(ch);
}
bool check = true;
string finals(res.begin(), res.end());
while(check){
pair<string, bool> pair_res = solve(finals);
finals = pair_res.first;
check = pair_res.second;
}
cout << finals << endl;
}
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
string cipher(string const& s, int& p, bool rev);
string str(string const& s, int& p, bool rev);
string letter(string const& s, int& p, bool rev, int cnt);
string cipher(string const& s, int& p, bool rev) {
string res;
while(p < s.size() && s[p] != ']') {
res += str(s, p, rev);
}
return res;
}
string str(string const& s, int& p, bool rev) {
string res;
if(s[p] == '[') {
res = cipher(s, ++p, !rev);
reverse(res.begin(), res.end());
++p;
} else {
res = letter(s, p, rev, 0);
}
return res;
}
string letter(string const& s, int& p, bool rev, int cnt) {
if(s[p] == '+') {
return letter(s, ++p, rev, cnt+1);
} else if(s[p] == '-') {
return letter(s, ++p, rev, cnt-1);
} else {
string res;
if(s[p] == '?') {
res += 'A';
++p;
} else {
int off = s[p] - 'A' + cnt;
while(off < 0) {
off += 26;
}
res += 'A' + (off % 26);
++p;
}
return res;
}
}
int main() {
string s;
while(cin >> s, s != ".") {
int p = 0;
cout << cipher(s, p, false) << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
string parse_letter(string &S, int &p);
string parse_string(string &S, int &p);
string parse_cipher(string &S, int &p);
string parse_letter(string &S, int &p){
if (S[p] == '+'){
p++;
string ans = parse_letter(S, p);
if (ans == "?"){
return "?";
} else if (ans == "Z"){
return "A";
} else {
ans[0]++;
return ans;
}
} else if (S[p] == '-'){
p++;
string ans = parse_letter(S, p);
if (ans == "?"){
return ans;
} else if (ans == "A"){
return "Z";
} else {
ans[0]--;
return ans;
}
} else {
string ans = "";
ans += S[p];
p++;
return ans;
}
}
string parse_string(string &S, int &p){
if (S[p] == '['){
p++;
string ans = parse_cipher(S, p);
p++;
reverse(ans.begin(), ans.end());
return ans;
} else {
string ans = parse_letter(S, p);
return ans;
}
}
string parse_cipher(string &S, int &p){
string ans;
while (S[p] != ']'){
ans += parse_string(S, p);
if (p == S.size()){
break;
}
}
return ans;
}
int main(){
while (1){
string S;
cin >> S;
if (S == "."){
break;
}
int p = 0;
string T = parse_cipher(S, p);
int N = T.size();
for (int i = 0; i < N; i++){
if (T[i] == '?'){
cout << 'A';
} else {
cout << T[i];
}
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=(x);i<(y);++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define dump(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define dump(x)
#endif
typedef long long int ll;
typedef pair<int,int> pii;
//template<typename T> using vec=std::vector<T>;
const int inf=1<<30;
const long long int infll=1LL<<58;
const double eps=1e-9;
const int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){
os << "[";
for (const auto &v : vec) {
os << v << ",";
}
os << "]";
return os;
}
typedef string::const_iterator state;
string cipher(state& begin);
string str(state& begin);
string letter(state& begin);
string cipher(state& begin){
string res;
while(*begin=='+' or *begin=='-' or ('A'<=*begin and *begin<='Z') or *begin=='?' or *begin=='[') res+=str(begin);
return res;
}
string str(state& begin){
string res;
if(*begin=='['){
++begin;
res=cipher(begin);
++begin;
reverse(res.begin(),res.end());
}else res=letter(begin);
return res;
}
string letter(state& begin){
int x=0;
string res;
while(true){
if(*begin=='+'){
++x;
++begin;
}else if(*begin=='-'){
--x;
++begin;
}else if(*begin=='?'){
res='A';
++begin;
break;
}else{
res='A'+(*begin-'A'+x+26*100)%26;
++begin;
break;
}
}
return res;
}
void solve(){
while(true){
string s;
cin >> s;
if(s==".") break;
state begin=s.begin();
cout << cipher(begin) << endl;
}
}
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
solve();
return 0;
} |
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;
int main()
{
for(;;){
string s;
cin >> s;
if(s == ".")
return 0;
int n = s.size();
string ans;
stack<int> stk;
int d = 0;
for(int i=0; i<n; ++i){
switch(s[i]){
case '+':
++ d;
break;
case '-':
-- d;
break;
case '[':
stk.push(ans.size());
break;
case ']':
reverse(ans.begin() + stk.top(), ans.end());
stk.pop();
break;
case '?':
ans += 'A';
d = 0;
break;
default:
char c = ((s[i] - 'A' + d) % 26 + 26) % 26 + 'A';
ans += c;
d = 0;
break;
}
}
cout << ans << endl;
}
} |
#include <iostream>
#include <algorithm>
#include <string>
#include <cctype>
using namespace std;
typedef string::const_iterator iter;
string expr(iter& p);
string term(iter& p);
string factor(iter& p);
// flag == false -> min
// flag == true -> max
string expr(iter& p) {
string res = term(p);
while(*p != '$' && *p != ']') {
res += term(p);
}
return res;
}
string term(iter& p) {
if(*p == '[') {
++p; // skip '['
string s = expr(p);
reverse(s.begin(), s.end());
++p; // skip ']'
return s;
}
return factor(p);
}
string factor(iter& p) {
int inc = 0;
while(*p == '+' || *p == '-') {
if(*p == '+') inc++;
if(*p == '-') inc--;
++p;
}
char c = *p;
++p;
if(c == '?') {
string res;
res.push_back('A');
return res;
}
while(inc < 0) inc += 26;
string res;
res.push_back((c - 'A' + inc) % 26 + 'A');
return res;
}
int main() {
// add $
while(true) {
string s; cin >> s;
if(s == ".") break;
s.push_back('$');
iter p = s.begin();
cout << expr(p) << endl;
}
} |
#include <cstdio>
#include <cstdlib>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <bitset>
#include <complex>
using namespace std;
typedef unsigned uint;
// typedef long long Int;
const int INF = 1001001001;
// const Int INFLL = 1001001001001001001LL;
string s;
int p;
string cipher(void);
string str(void);
string letter(void);
string decr(string c);
string incr(string c);
string cipher(void){
string r;
while (s.size() != p && s[p] != ']'){
r += str();
}
return r;
}
string str(void)
{
string r;
if (s[p] == '['){
p++;
string tmp = cipher();
reverse(tmp.begin(), tmp.end());
// cout << tmp << endl;
r += tmp;
p++;
}
else {
return letter();
}
return r;
}
string letter(void)
{
string tmp = "";
if (isalpha(s[p]) || s[p] == '?'){
tmp += s[p++];
return (tmp);
}
if (s[p] == '-'){
p++;
tmp += decr(letter());
return tmp;
}
if (s[p] == '+'){
p++;
tmp += incr(letter());
return tmp;
}
}
string decr(string c)
{
if (c[0] == '?') return (c);
if (c[0] == 'A'){
c[0] = 'Z';
return (c);
}
c[0] -= 1;
return (c);
}
string incr(string c)
{
if (c[0] == '?') return (c);
if (c[0] == 'Z'){
c[0] = 'A';
return (c);
}
c[0] += 1;
return (c);
}
int main(void)
{
while (cin >> s){
if (s == ".") return 0;
p = 0;
string ret = cipher();
for (int i = 0; i < ret.size(); i++){
if (ret[i] == '?') ret[i] = 'A';
}
cout << ret << endl;
}
} |
// Author :
// Date :
// Problem:
// Solution:
// Comment:
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#define pp push
#define pb push_back
#define mp make_pair
#define xx first
#define yy second
using namespace std;
string play(string str){
string ans;
string q;
int d = 0;
//cout << str << endl;
for(int i = 0 ; i < str.size() ; i++){
if(str[i] == '['){
string strr,strrr;
int cnt = 1;
while(cnt > 0){
i++;
if(str[i] == '[') cnt++;
else if(str[i] == ']') cnt--;
if(cnt > 0) strr = strr + str[i];
}
//cout << "strr " << strr << endl;
strr = play(strr);
for(int j = strr.size()-1 ; j >= 0 ; j--) strrr += strr[j];
ans += strrr;
}
if(str[i] >= 'A' && str[i] <= 'Z'){
while(d < -(26)) d+=26;
ans += (str[i] + d + 26 - 'A') % 26 + 'A';
d = 0;
}
if(str[i] == '-') d--;
else if(str[i] == '+') d++;
if(str[i] == '?'){
d = 0;
ans += 'A';
}
}
//cout << "ans" << ans << endl;
return ans;
}
int main(){
string str;
while(cin >> str){
if(str[0] == '.') break;
cout << play(str) << endl;
}
#ifdef GEREL
for(;;);
#endif
return 0;
} |
#include<iostream>
#include<string>
using namespace std;
string bnf(string s, int& pos){
string ans = "";
while(pos < s.length()){
int temp = 0;
//printf("%d ", pos);
if(s[pos] == '+' || s[pos] == '-'){
while(!((s[pos] >= 'A' && s[pos] <= 'Z') || s[pos] == '?')){
if(s[pos] == '+') temp++;
if(s[pos] == '-') temp--;
pos++;
}
}
if(s[pos] == '?'){
ans += 'A';
pos++;
temp = 0;
}
if(s[pos] >= 'A' && s[pos] <= 'Z'){
ans += (s[pos] - 'A' + temp % 26 + 26) % 26 + 'A';
pos++;
}
if(s[pos] == '['){
string y = bnf(s,++pos);
string z(y.rbegin(), y.rend());
ans += z;
}
if(s[pos] == ']'){
pos++;
return ans;
}
}
return ans;
}
int main(){
string s;
while(1){
cin >> s;
if(s==".")break;
int pos = 0;
cout << bnf(s,pos) << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
string reverse(string s) {
string converted = "";
for (int i = 0; i < (int)s.length(); ++i) {
converted += s[s.length() - i - 1];
}
return converted;
}
string decrypt(string cipher) {
int begin;
int nest = 0;
int rot = 0;
string plain = "";
for (int i = 0; i < (int)cipher.length(); ++i) {
if (cipher[i] == '[') {
if (nest == 0) {
begin = i;
}
++nest;
} else if (cipher[i] == ']') {
--nest;
if (nest == 0) {
plain += reverse(decrypt(cipher.substr(begin + 1, i - begin - 1)));
}
} else if (nest == 0) {
switch (cipher[i]) {
case '+':
rot = (rot + 1) % 26;
break;
case '-':
rot = (rot + 25) % 26;
break;
case '?':
plain += '?';
rot = 0;
break;
default:
plain += (cipher[i] - 'A' + rot) % 26 + 'A';
rot = 0;
}
}
}
return plain;
}
int main() {
string cipher, plain;
while (true) {
cin >> cipher;
if (cipher == ".") {
return 0;
}
plain = decrypt(cipher);
for (int i = 0; i < (int)plain.length(); ++i) {
if (plain[i] == '?') {
plain[i] = 'A';
}
}
cout << plain << endl;
}
} |
#define _CRT_SECURE_NO_WARNINGS
#pragma comment (linker, "/STACK:526000000")
#include "bits/stdc++.h"
using namespace std;
typedef string::const_iterator State;
#define eps 1e-11L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL
#define MOD 998244353LL
#define seg_size 262144 * 4LL
#define pb push_back
#define mp make_pair
typedef long long ll;
#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))
#define ALL(x) (x).begin(),(x).end()
unsigned long xor128() {
static unsigned long x = 123456789, y = 362436069, z = 521288629, w = time(NULL);
unsigned long t = (x ^ (x << 11));
x = y; y = z; z = w;
return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
void init() {
iostream::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
#define int ll
string Cipher(State &a);
string String(State &a);
string Letter(State &a);
string Cipher(State &a) {
string s;
for (;*a != ')'&&*a != ']';) {
s += String(a);
}
return s;
}
string String(State &a) {
string ans;
if (*a == '[') {
a++;
ans = Cipher(a);
a++;
reverse(ALL(ans));
}
else {
ans = Letter(a);
}
return ans;
}
string Letter(State& a) {
string b;
int now = 0;
while (!((*a >= 'A' && *a <= 'Z')||(*a == '?'))) {
if (*a == '+')now++;
else now--;
a++;
}
now += 2600;
now += *a - 'A';
now %= 26;
if (*a == '?') {
now = 0;
}
a++;
b.push_back(now + 'A');
return b;
}
void solve(){
while (true) {
string s;
cin >> s;
if (s == ".") return;
s.push_back(')');
State begin = s.begin();
cout << Cipher(begin) << endl;
}
}
#undef int
int main() {
init();
solve();
}
|
#include <iostream>
using namespace std;
class Parser{
public:
string s;
size_t i;
string parse(){
i = 0;
return Cipher();
}
string Cipher(){
//cout << "Cipher : " << i << endl;
string t;
while(i < s.size() && s[i] != ']'){
t += String();
}
return t;
}
string String(){
//cout << "String : " << i << endl;
if(s[i] == '['){
++i;
string u = Cipher(), v;
++i;
for(int j = u.length()-1; j >= 0; --j){
v += u[j];
}
return v;
}else{
char c = Letter();
++i;
return string(1,c);
}
}
char Letter(){
//cout << "Letter : " << i << endl;
if(s[i] == '+'){
++i;
char c = Letter();
if(c == '?') return c;
else return (c-'A'+1)%26+'A';
}else if(s[i] == '-'){
++i;
char c = Letter();
if(c == '?') return c;
else return (c-'A'+25)%26+'A';
}else{
return s[i];
}
}
};
int main(){
string S;
while(cin >> S, S != "."){
//cout << solve(S) << endl;
Parser p;
p.s = S;
string s = p.parse();
for(int i = 0; i < s.length(); ++i){
if(s[i] == '?') cout << "A";
else cout << s[i];
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(a) a.begin(),a.end()
const long long MOD = 1e9+7, INF = 1e18;
template<class T>inline bool chmax(T& a,T b){if(a<b){a=b;return true;}return false;}
template<class T>inline bool chmin(T& a,T b){if(a>b){a=b;return true;}return false;}
string s;
int now = 0,cnt = 0;
string solve(){
string t="";
cnt = 0;
while(now<s.size()&&s[now]!=']'){
if(s[now]=='+')cnt++;
else if(s[now]=='-')cnt--;
else if(s[now]=='['){
now++;
string tmp = solve();
reverse(all(tmp));
t+=tmp;
cnt = 0;
}else{
if(s[now]=='?')t+='A';
else t+=(char)'A'+(s[now]-'A'+cnt%26+26)%26;
cnt = 0;
}
now++;
}
return t;
}
signed main(){
vector<string>ans;
while(cin>>s,s!="."){
ans.push_back(solve());
now = 0;
}
for(auto e:ans)cout<<e<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
using result = pair<string,int>;
result st(int p);
result le(int p);
result ci(int p);
result le(int p){
int k=0;
while(true){
if(s[p]=='+') k++;
else if(s[p]=='-') k--;
else break;
p++;
}
if(s[p]=='?') return make_pair("A",p+1);
int ret = s[p]-'A'+k;
while(ret<0) ret+=26;
ret%=26;
string ans="A";
ans[0]+=ret;
return make_pair(ans,p+1);
}
result st(int p){
if(s[p]=='['){
result ret = ci(p+1);
ret.second++;//skip ']'
reverse(ret.first.begin(),ret.first.end());
return ret;
}else{
return le(p);
}
}
result ci(int p){
string ans;
while(p<s.size() and s[p]!=']'){
result ret=st(p);
p=ret.second;
ans+=ret.first;
}
return make_pair(ans,p);
}
int main(void){
ios::sync_with_stdio(false);
//cin.tie(0);
//cout.tie(0);
while(cin>>s){
if(s==".")break;
cout<<ci(0).first<<"\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> pos(4,-1);
string s;
string ans;
int n;
template <class T>
void chmin(T &x, T y)
{
x=min(x,y);
}
string parse()
{
string ret;
vector<string> tmp;
int add=0;
for(char ch: s)
{
if(ch=='[')
{
tmp.emplace_back("");
}
else if(ch==']')
{
string t=tmp.back();
reverse(begin(t),end(t));
tmp.pop_back();
if(tmp.empty())
{
ret+=t;
}
else
{
tmp.back()+=t;
}
}
else if(ch=='+')
{
add++;
}
else if(ch=='-')
{
add--;
}
else
{
int dif=(ch-'A'+add)%26;
if(dif<0) dif+=26;
ch='A'+dif;
add=0;
if(tmp.empty()) ret+=ch;
else tmp.back()+=ch;
}
}
return ret;
}
void dfs(int step)
{
if(pos[step]<0) chmin(ans,parse());
else
{
s[pos[step]]='A';
for(char &ch=s[pos[step]]; ch<='Z'; ch++)
{
dfs(step+1);
}
}
}
int main()
{
for(;;)
{
cin>>s;
if(s==".") break;
ans=string(1,'Z'+1);
n=s.size();
for(int i=0,j=0; i<n; ++i)
{
if(s[i]=='?')
{
pos[j++]=i;
}
}
dfs(0);
cout << ans << "\n";
pos=vector<int>(4,-1);
}
}
|
#include<iostream>
using namespace std;
int it;
string s;
char add(char a)
{
if(a=='Z')
return 'A';
else if(a=='?')
return a;
else
return a+1;
}
char sub(char a)
{
if(a=='A')
return 'Z';
else if(a=='?')
return a;
else
return a-1;
}
char letter()
{
if(s[it]=='+')
{
it++;
return add(letter());
}
else if(s[it]=='-')
{
it++;
return sub(letter());
}
else
{
it++;
return s[it-1];
}
}
string smake()
{
string a;
while(it<s.size() && s[it]!=']')
{
if(s[it]=='[')
{
string tmp;
it++;
while(s[it]!=']')
{
tmp+=smake();
}
it++;
for(int x=tmp.size()-1;x>=0;x--)
a+=tmp[x];
}
else
a+=letter();
}
return a;
}
string parse()
{
string a;
while(it<s.size())
{
a+= smake();
}
return a;
}
int main()
{
for(;cin>>s,s!=".";)
{
it=0;
string ans = parse();
// cout<<ans<<endl;
for(int i=0;i<ans.size();i++)
{
if(ans[i]=='?')
cout<<'A';
else
cout<<ans[i];
}
cout<<endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
int pos;
string s, ans;
string Letter() {
int cnt = 0;
while(!isalpha(s[pos])) {
if(s[pos] == '+') ++cnt;
else --cnt;
++pos;
}
int a = (((s[pos++]-'A') + cnt) % 26 + 26) % 26;
return string(1, (char)(a + 'A'));
}
string Chipher() {
string res;
while(s[pos] != ']' && s[pos] != '$') {
if(s[pos] == '[') {
++pos;
string t = Chipher();
++pos;
reverse(t.begin(), t.end());
res += t;
} else {
res += Letter();
}
}
return res;
}
void rec(int k) {
if(s[k] == '$') {
pos = 0;
string tmp = Chipher();
if(ans == "" || ans > tmp) ans = tmp;
return;
}
if(s[k] == '?') {
for(char c = 'A'; c <= 'Z'; ++c) {
s[k] = c;
rec(k+1);
}
s[k] = '?';
} else {
rec(k+1);
}
}
int main() {
while(cin >> s && s != ".") {
s += '$';
ans = "";
rec(0);
cout << ans << endl;
}
return 0;
} |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
string s,b,n;
while(cin>>s,s!="."){
bool f=true;
int i,j,k,o,m;
b="";
while(f){
f=false;
o=0;m=0;
for(i=0;i<s.size();i++){
if(s[i]=='[') {
o++;
m=max(m,o);
}
if(s[i]==']') o--;
}
for(i=0;i<s.size();i++){
if(s[i]>='A'&&s[i]<='Z'){
k=1;j=(s[i]-'A');
while(i-k>=0){
if(s[i-k]=='+') {
j++;
s[i-k]=' ';
k++;
continue;
}
if(s[i-k]=='-') {
j--;
s[i-k]=' ';
k++;
continue;
}
break;
}
s[i]='A'+(104+j)%26;
}
if(s[i]=='?'){
k=1;
while(i-k>=0){
if(s[i-k]=='+'||s[i-k]=='-') {
s[i-k]=' ';
k++;
continue;
}
break;
}
s[i]='A';
}
}
b="";
for(i=0;i<s.size();i++) if(s[i]!=' ') b+=s[i];
if(s.size()>b.size()) f=true;
s=b;
o=0;
for(i=0;i<s.size();i++){
if(s[i]=='['){
o++;
if(o==m){
k=1;
while(s[i+k]!=']') k++;
n=s.substr(i+1,k-1);
//cout << n << endl;
reverse(n.begin(),n.end());
s.replace(i+1,k-1,n);
s[i]=' ';s[i+k]=' ';
o--;
}
}
if(s[i]==']') o--;
}
b="";
for(i=0;i<s.size();i++) if(s[i]!=' ') b+=s[i];
if(s.size()>b.size()) f=true;
s=b;
//cout << s << endl;
}
cout << s << endl;
s="";
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
string s;
string rec(int &pos){
string res = "";
while(1){
// end
if(pos >= int(s.size()) || s[pos] == ']'){
return res;
}
// begin Cipher
if(s[pos]=='['){
pos++;
string tmp = rec(pos);
reverse(tmp.begin(), tmp.end());
res += tmp;
pos++;
continue;
}
int cnt = 0;
// count +-
while(1){
if(s[pos]=='+') cnt++;
else if(s[pos]=='-') cnt--;
else break;
pos++;
}
// Add Letter
if(s[pos] == '?') res.push_back('A');
else res.push_back(char('A'+((s[pos]-'A')+cnt%26+26)%26));
pos++;
}
}
int main() {
while(cin >> s, s!="."){
int i=0;
cout << rec(i) << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
string solve(const string& s){
if(s.size() == 0)
return "";
char head = s[0];
string tail = s.substr(1);
int p = 0;
int c = 0;
//cout << "head" << head << endl;
if(head == '['){
int b = 1;
int i = 1;
while(b > 0){ // XXX
if(s[i] == '[')
b++;
else if(s[i] == ']')
b--;
i++;
}
string res1 = solve(s.substr(1, i - 2));
reverse(begin(res1), end(res1));
return res1 + solve(s.substr(i));
}else if(head == '+'){
string res2 = solve(tail);
if(res2[0] == '?')
return "?" + res2.substr(1); //XXX
else{
if(res2[0] == 'Z'){
return "A" + res2.substr(1);
}else{
return string({(char)(res2[0] + 1)}) + res2.substr(1);
}
}
}else if(head == '-'){
//cout << "-" << endl;
string res3 = solve(tail);
if(res3[0] == '?')
return "?" + res3.substr(1); //XXX
else{
//cout << res3[0] << endl;
if(res3[0] == 'A'){
//cout << "hoeg" << endl;
return "Z" + res3.substr(1);
}else{
return string({(char)(res3[0] - 1)}) + res3.substr(1);
}
}
}else if(head == '?'){
return "?" + solve(tail);
}else{
return head + solve(tail);
}
}
int main(){
string s;
while(cin >> s, s != "."){
string res = solve(s);
for(int i = 0; i < s.size(); i++){
if(res[i] == '?')
res[i] = 'A';
}
cout << res << '\n';
}
return 0;
} |
#include<cstdio>
#include<algorithm>
#include<stack>
using namespace std;
char s[100];
char ans[100];
char change(char c, int plus, int minas) {
int t = (int)c - (int)'A' + plus - minas + ((int)'Z' - (int)'A' + 1) * 100;
t %= ((int)'Z' - (int)'A' + 1);
return 'A' + (char)t;
}
void reverse(int b, int g) {
ans[b++] = '!';
ans[g--] = '!';
for (; b < g; b++, g--) swap(ans[b], ans[g]);
}
int main() {
while (1) {
scanf("%s", s);
if (s[0] == '.') break;
int cNum = 0;
int plus = 0;
int minas = 0;
stack<int> stc;
for (int i = 0; s[i] != 0; i++) {
if (s[i] == '+') {
plus++;
} else if (s[i] == '-') {
minas++;
} else {
if ('A' <= s[i] && s[i] <= 'Z') {
ans[cNum++] = change(s[i], plus, minas);
} else {
ans[cNum++] = s[i];
if (s[i] == '[') stc.push(cNum - 1);
if (s[i] == ']') {
reverse(stc.top(), cNum - 1);
stc.pop();
}
}
plus = minas = 0;
}
}
for (int i = 0; i < cNum; i++) {
if ('A' <= ans[i] && ans[i] <= 'Z') printf("%c", ans[i]);
if (ans[i] == '?') printf("A");
}
printf("\n");
}
}
|
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <complex>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <functional>
#include <cassert>
typedef long long ll;
using namespace std;
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 100010
string parse(string s){
stack<char> st;
for(int i=0;i<s.size();i++){
if(s[i] == '+' || s[i] == '-' || s[i] == '['){
st.push(s[i]);
}else if(s[i] == ']'){
string t;
while(st.top() != '['){
t += st.top();
st.pop();
}
st.pop();
for(int i=0;i<t.size();i++) st.push(t[i]);
}else{
while(st.size() && (st.top() == '-' || st.top() == '+')){
char c = st.top(); st.pop();
if(c == '-') s[i] = (s[i] - 'A' + 25)%26 + 'A';
else s[i] = (s[i] - 'A' + 1)%26 + 'A';
}
st.push(s[i]);
}
}
string ans = "";
while(st.size()){
ans = st.top() + ans;
st.pop();
}
return ans;
}
bool solve(){
string s, ans;
cin >> s;
if(s == ".") return false;
for(int i=0;i<s.size();i++) ans += 'Z';
for(int i=0;i<26*26*26;i++){
int k = 1;
string t;
for(int j=0;j<s.size();j++){
if(s[j] != '?'){
t += s[j];
}else{
t += (i/k)%26 + 'A';
k *= 26;
}
}
ans = min(ans, parse(t));
}
cout << ans << endl;
return true;
}
int main(){
while(solve());
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string calc(string s){
map<int, char> mp;
for(int i = 0 ; i < 26 ; i++) mp[i] = 'A' + i;
string ret = "";
int cnt = 0;
for(int i = 0 ; i < (int)s.size() ; i++){
if(s[i] == '+') cnt++;
if(s[i] == '-') cnt--;
if(s[i] == '[' || s[i] == ']') ret += s[i];
if(s[i] == '?'){
ret += 'A';
cnt = 0;
}
if(isalpha(s[i])){
int n = (s[i] - 'A') + cnt;
n %= 26;
if(n < 0) n += 26;
ret += 'A' + n;
cnt = 0;
}
}
return ret;
}
string solve(string s){
stack<int> st;
for(int i = 0 ; i < (int)s.size() ; i++){
if(s[i] == '[') st.push(i);
if(s[i] == ']'){
int from = st.top(); st.pop();
int to = i;
string t = "";
for(int j = from ; j <= to ; j++)
if(isalpha(s[j])) t += s[j];
reverse(t.begin(), t.end());
for(int j = from, cnt = 0 ; j <= to ; j++)
if(isalpha(s[j])) s[j] = t[cnt++];
}
}
string t = "";
for(int i = 0 ; i < (int)s.size() ; i++)
if(isalpha(s[i])) t += s[i];
return t;
}
int main(){
string s;
while(cin >> s){
if(s == ".") break;
s = calc(s);
cout << solve(s) << endl;
}
return 0;
} |
#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<stack>
using namespace std;
#define int long long
#define rep(i,n) for(int i = 0; i < (n); i++)
#define INF ((long long)1e18)
#define MOD ((int)1e9+7)
#define endl "\n"
#define yn(f) ((f)?"Yes":"No")
#define YN(f) ((f)?"YES":"NO")
#define MAX
string JAG(string str){
string res;
pair<int,string> hoge = {};
stack<pair<int,string>> sta;
int num = 0;
sta.push(hoge);
for(int i = 0; i < str.size(); i++){
if(str[i] == '?'){
num = 0;
str[i] = 'A';
}
if(str[i] == '-') num--;
else if(str[i] == '+') num++;
else if('A' <= str[i] && str[i] <= 'Z'){
int temp = str[i]-'A';
num += 26*100;
temp = (26+temp+num)%26;
pair<int,string> fuga;
fuga = sta.top(); sta.pop();
fuga.second += (char)('A'+temp);
sta.push(fuga);
num = 0;
} else if(str[i] == '['){
sta.push(hoge);
} else if(str[i] == ']'){
pair<int,string> fuga, fuga2;
fuga = sta.top(); sta.pop();
fuga2 = sta.top(); sta.pop();
reverse(fuga.second.begin(), fuga.second.end());
fuga2.second += fuga.second;
sta.push(fuga2);
}
}
hoge = sta.top();
return hoge.second;
}
string solve(string str){
return JAG(str);
}
signed main(){
// cin.tie(0);
// ios::sync_with_stdio(false);
cout<<fixed<<setprecision(10);
while(true){
string s;
cin>>s;
if(s == ".") break;
cout<<solve(s)<<endl;
}
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <stack>
#include <queue>
#include <string.h>
#define MAX_N 1000
using namespace std;
char str[100], res[100];
void reverse(char *str, char *res){
for (int i = 0; i < strlen(str); i++)
{
res[i] = str[strlen(str)-i-1];
}
res[strlen(str)] = '\0';
}
void dfs(int l, int r, char *res){
int prel = l;
char tmp1[100], tmp2[100], count = 0;
res[0] = '\0';
if(l + 1 == r){
res[0] = str[l];
if(res[0] == '?') res[0] ='A';
res[1] = '\0';
return;
}
for (int i = l; i < r; )
{
if(str[i] == '+' || str[i] == '-' || (str[i] >= 'A' && str[i] <= 'Z') || str[i] == '?'){
int j = i;
while(str[j] == '+' || str[j] == '-') j++;
if(i == l && j == r-1){
res[0] = str[r-1];
if(res[0] == '?'){
res[0] = 'A';
}else{
for(int k = l; k < r-1; k++){
if(str[k] == '+'){
res[0]++;
if(res[0] > 'Z'){
res[0] = 'A';
}
}else{
res[0]--;
if(res[0] < 'A'){
res[0] = 'Z';
}
}
}
}
res[1] = '\0';
break;
}else{
dfs(i, j+1, tmp1);
strcat(res, tmp1);
i = j+1;
}
}
if(str[i] == '['){
int j, count = 0;
for (j = i; j < r; j++)
{
if(str[j] == '['){
count++;
}else if(str[j] == ']'){
count--;
}
if(count == 0) break;
}
dfs(i+1, j, tmp1);
reverse(tmp1, tmp2);
strcat(res, tmp2);
i = j+1;
}
}
}
int main(){
while(1){
cin >> str;
if(str[0] == '.') break;
dfs(0, strlen(str), res);
cout << res << endl;
}
return 0;
} |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
constexpr int inf=1e9+7;
constexpr ll longinf=1LL<<60 ;
constexpr ll mod=1e9+7 ;
string cipher(string& s, int& i);
string st(string& s, int& i);
char ch(string& s, int& i);
string cipher(string& s, int& i){
string res=st(s,i);
while(i!=s.size()&&s[i]!=']'){
res+=st(s,i);
}
return res;
}
string st(string& s,int& i){
if(s[i]=='['){
i++;
string ret=cipher(s,i);
i++;
reverse(ret.begin(),ret.end());
return ret;
}
else {
char res=ch(s,i);
string ret;
ret+=res;
return ret;
}
}
char ch(string& s, int& i){
if(s[i]=='+'){
++i;
char res=ch(s,i);
if(res=='?')return '?';
if(res=='Z')return 'A';
else return char(++res);
}
if(s[i]=='-'){
++i;
char res=ch(s,i);
if(res=='?')return '?';
if(res=='A')return 'Z';
else return char(--res);
}
return s[i++];
}
void solve(string s){
int i=0;
string ans=cipher(s, i);
for(auto& c:ans)if(c=='?')c='A';
cout<<ans<<endl;
}
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s;
while(cin>>s,s!=".")solve(s);
return 0;
}
|
#include<bits/stdc++.h>
#define N 100
#define M 26
using namespace std;
string s;
int p,len;
string bnf(bool rev){
string res;
int c=0;
while(p!=len){
char t=s[p];
if(t=='+')p++,c++;
if(t=='-')p++,c--;
if('A'<=t&&t<='Z')
res+=((s[p++]+c+M*N)-'A')%M+'A',c=0;
if(t=='?')res+=s[p++],c=0;
if(t=='[')p++,res+=bnf(true);
if(t==']'){
p++;
break;
}
}
if(rev)reverse(res.begin(),res.end());
return res;
}
int main(){
while(1){
cin>>s;
if(s==".")break;
len=s.size();
p=0;
string ans=bnf(false);
for(int i=0;i<(int)ans.size();i++)
if(ans[i]=='?')ans[i]='A';
cout<<ans<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define llong long long
using namespace std;
string C(string str){
string ret = "";
int cnt = 0;
for(size_t i = 0; i < str.size(); i++){
if(str[i] == '+'){
cnt++;
}
else if(str[i] == '-'){
cnt--;
}
else if(str[i] == '['){
int j = 0, d = 1;
while(d > 0){
if(str[i+j+1] == '[')d++;
if(str[i+j+1] == ']')d--;
j++;
}
// cerr << "rev:" << str.substr(i+1,j-1) << endl;;
string tmp = C(str.substr(i+1,j-1));
// cerr << "tmp:" << tmp << endl;
reverse(ALL(tmp));
ret += tmp;
i+=j;
}
else if(str[i] == '?'){
ret.push_back('A');
cnt = 0;
}
else if(isalpha(str[i])){
if(cnt > 0){
ret.push_back((str[i]-'A'+cnt)%26 + 'A');
cnt = 0;
}
else if(cnt < 0){
ret.push_back((str[i]-'A'+cnt+26*4)%26 + 'A');
cnt = 0;
}
else{
ret.push_back(str[i]);
}
}
}
return ret;
}
signed main(){
while(true){
string str; cin >> str;
if(str == ".")break;
cout << C(str) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0; i<(int)(n); ++i)
using namespace std;
int k;
string s;
void pass(char c) {
assert(s[k++] == c);
}
string str();
string letter();
string cipher() {
string res;
while(k < s.size() && s[k] != ']') {
res += str();
}
if(k < s.size()) {
pass(']');
}
return res;
}
string str() {
if(s[k] == '[') {
pass('[');
string t = cipher();
reverse(t.begin(), t.end());
return t;
}
return letter();
}
string letter() {
int add = 0;
while(!('A' <= s[k] && s[k] <= 'Z') && s[k] != '?') {
if(s[k] == '+') {
add += 1;
} else if(s[k] == '-') {
add -= 1;
} else {
assert(false);
}
k++;
}
string t = s.substr(k, 1);
pass(t[0]);
if(t[0] != '?') {
t[0] = (t[0] - 'A' + add + 26 * 1000) % 26 + 'A';
}
return t;
}
int main(){
while(cin >> s && s != ".") {
k = 0;
string t = cipher();
for(char& c : t) if(c == '?') c = 'A';
cout << t << endl;
}
return 0;
} |
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<cmath>
#include<functional>
#include<algorithm>
#define INF (1<<29)
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
string form(const string &s){
string res;
int p=0,m=0;
rep(i,s.size()){
if(s[i]=='+')p++;
else if(s[i]=='-')m++;
else if(isalnum(s[i])){
res+=(s[i]-'A'+p-m+26*100)%26+'A';
p=m=0;
}
else if(s[i]=='?'){
res+='?';
p=m=0;
}
else res+=s[i];
}
return res;
}
int p;
string rev(const string &s){
if(p==s.size())return "";
string t;
char c=s[p++];
if(c=='['){
t=rev(s);
reverse(t.begin(),t.end());
return t+rev(s);
}else if(c==']'){
return "";
}else {
return c+rev(s);
}
}
int main(){
string s;
while(cin>>s&&s!="."){
p=0;
s=form(s);
string t=rev(s);
rep(i,t.size())if(t[i]=='?')t[i]='A';
cout<<t<<endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef string::const_iterator Cursol;
string Cipher(Cursol& c);
string str;
char Letter(Cursol& c){
char ci;
switch(*c){
case '+':
ci = Letter(++c);
if(ci == '?') return '?';
else return (ci + 1 - 'A') % 26 + 'A';
case '-':
ci = Letter(++c);
if(ci == '?') return '?';
else return (ci - 'A' + 25) % 26 + 'A';
case '?':
return '?';
default:
return *c;
}
}
string String(Cursol& c){
string s;
switch(*c){
case '[':
c++;
s = Cipher(c);
reverse(s.begin(), s.end());
return s;
default:
s.resize(1);
s[0] = Letter(c);
return s;
}
}
string Cipher(Cursol& c){
string s;
while(c != str.end() && *c != ']'){
s += String(c);
c++;
}
return s;
}
int main(){
Cursol c;
while(cin >> str, str != "."){
string s = Cipher(c = str.begin());
for(int i = 0; i < s.size(); i++){
if(s[i] == '?') s[i] = 'A';
}
cout << s << endl;
}
return 0;
} |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
using namespace std;
string s;
string solve(int l, int r) {
int pos = l;
string ret = "";
for(pos=l; pos<r; pos++) {
int cnt = 0;
while(s[pos] == '-' || s[pos] == '+') {
if(s[pos] == '-') cnt = (cnt - 1 + 26) % 26;
if(s[pos] == '+') cnt = (cnt + 1 + 26) % 26;
pos++;
}
if(isalpha(s[pos])) {
char c = (char)('A' + (s[pos] - 'A' + cnt) % 26);
ret += c;
}
else if(s[pos] == '?') ret += 'A';
else if(s[pos] == '[') {
int par = 0, tmp_l = pos+1;
while(1) {
if(s[pos] == '[') par++;
if(s[pos] == ']') {
par--;
if(par == 0) {
int tmp_r = pos;
string tmp = solve(tmp_l, tmp_r);
reverse(tmp.begin(), tmp.end());
ret += tmp;
break;
}
}
pos++;
}
}
}
return ret;
}
int main() {
while(cin >> s) {
if(s == ".") break;
int N = s.length();
cout << solve(0, N) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
const string lts = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
pair<string, int> parse(const string &, int);
pair<string, int> letter(const string &s, int i) {
if (i >= s.size()) throw "last";
if (s[i] == '+') {
auto res = letter(s, i+1);
if (res.first[0] != 'Z')
++res.first[0];
else
res.first[0] = 'A';
return res;
} else if (s[i] == '-') {
auto res = letter(s, i+1);
if (res.first[0] != 'A')
--res.first[0];
else
res.first[0] = 'Z';
return res;
}
if ('A' <= s[i] && s[i] <= 'Z')
return make_pair(string(1, s[i]), i+1);
else
throw "bad";
}
pair<string, int> str(const string &s, int i) {
if (i >= s.size()) throw "last";
if (s[i] == '[') {
auto res = parse(s, i+1);
reverse(begin(res.first),end(res.first));
if (res.second >= s.size() || s[res.second] != ']') throw "bad";
++res.second;
return res;
}
return letter(s, i);
}
pair<string, int> parse(const string &s, int i) {
auto res = str(s, i);
while(res.second < s.size() && s[res.second] != ']'){
auto res2 = str(s, res.second);
res.first += res2.first;
res.second = res2.second;
}
return res;
}
string search(string &s, int i = 0) {
if (i >= s.size()) {
try {
//cout<<s<<':';
return parse(s, 0).first;
} catch(...) {
return "";
}
}
if (s[i] != '?') return search(s, i+1);
string res = "";
for (char c:lts){
if(!c) break;
s[i] = c;
string t = search(s, i+1);
//cout<<t<<endl;
if ((t != "" && t < res) || res == "") {
res = t;
}
}
s[i] = '?';
return res;
}
int main() {
while(1){
string s;
cin>>s;
if(s==".") break;
cout << search(s) << endl;
}
return 0;
} |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#define CK(N,A,B) (A<=N&&N<B)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define RREP(i,a,b) for(int i=(b-1);a<=i;i--)
#define F first
#define S second
#define ll long long;
const int INF = 1e9;
const long long LLINF = 1e15;
using namespace std;
int ind;
string S;
string dfs(){
string ret = "";
char c = S[ind];
if(c == '['){
ind++;
string rev = dfs();
ind++;
reverse(rev.begin(), rev.end());
ret += rev;
ret += dfs();
}else if(('A'<=S[ind] && S[ind]<='A'+26) || S[ind]=='?'){
char ac;
if(S[ind]=='?') ac = 'A';
else ac = S[ind];
ret += ac;
ind++;
ret += dfs();
}else if(S[ind] == '+' || S[ind] == '-'){
int cnt = 0;
while(S[ind] == '+' || S[ind] == '-'){
if(S[ind] == '+') cnt++;
else cnt--;
ind++;
}
if(S[ind]=='?') ret += 'A';
else ret += 'A' + (S[ind]-'A'+cnt+2600)%26;
ind++;
ret += dfs();
}
return ret;
}
int main() {
while(1){
cin>>S;
if(S==".") break;
ind = 0;
cout<<dfs()<<endl;
}
return 0;
} |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <stack>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
int main() {
string in;
while(cin >> in, in[0]!='.') {
string res="?";
rep(i, 26) {
string str = in;
/*
rep(j, str.length()) {
if(str[j]=='?') {
str[j] = (char)('A'+i);
}
}
*/
int diff = 0;
stack<int> rev_s;
string out = "";
rep(i, str.length()) {
if(str[i]=='+')
diff++;
else if(str[i]=='-')
diff--;
else if(str[i]=='[') {
rev_s.push(out.length());
} else if(str[i]==']') {
reverse(out.begin()+rev_s.top(), out.end());
rev_s.pop();
} else if('A'<=str[i] && str[i]<='Z') {
out += ('A'+(str[i]-'A'+26*4+diff)%26);
diff = 0;
} else {
out += 'A';
diff = 0;
}
}
if(res[0]=='?' || out < res) {
res = out;
}
}
cout << res << endl;
}
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
string Cipher(int &pos, string &S);
string String(int &pos, string &S);
char Letter(int &pos, string &S);
string Cipher(int &pos, string &S) {
string ret = "";
while (1) {
ret += String(pos, S);
if (S[pos] == ']' || pos >= S.size()) break;
}
return ret;
}
string String(int &pos, string &S) {
if (S[pos] == '[') {
pos++;
string s = Cipher(pos, S);
pos++;
reverse(s.begin(), s.end());
return s;
}
else {
char ch = Letter(pos, S);
return string(1, ch);
}
}
char Letter(int &pos, string &S) {
if (S[pos] == '+') {
pos++;
char ch = Letter(pos, S);
if (ch == '?') return ch;
ch -= 'A';
(ch += 1) %= 26;
return ch + 'A';
}
else if (S[pos] == '-') {
pos++;
char ch = Letter(pos, S);
if (ch == '?') return ch;
ch -= 'A';
(ch += 25) %= 26;
return ch + 'A';
}
char ch = S[pos];
pos++;
return ch;
}
int main() {
string S;
while (cin >> S, S != ".") {
int pos = 0;
string T = Cipher(pos, S);
for (int i = 0; i < T.size(); i++) if (T[i] == '?') T[i] = 'A';
cout << T << endl;
}
}
|
#include <iostream>
#include <iomanip>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <memory>
#include <cstring>
#include <cassert>
#include <numeric>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cctype>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define REP2(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define REP(i, n) REP2(i, 0, n)
#define ALL(S) (S).begin(), (S).end()
typedef long long ll;
string best;
string Cipher(const string &str, size_t &cur);
char Letter(const string &str, size_t &cur){
char c = str[cur++];
if (isupper(c)){
return c;
} else {
char res = Letter(str, cur);
if (c == '-'){
res = res == 'A' ? 'Z' : (res - 1);
} else {
res = res == 'Z' ? 'A' : (res + 1);
}
return res;
}
}
string String(const string &str, size_t &cur){
if (str[cur] == '['){
cur++;
string res = Cipher(str, cur);
cur++;
reverse(ALL(res));
return res;
} else {
return string(1, Letter(str, cur));
}
}
string Cipher(const string &str, size_t &cur){
string res;
while (str[cur] != ']' && cur < str.size()){
res += String(str, cur);
}
return res;
}
string decrypt(const string &str){
size_t cur = 0;
return Cipher(str, cur);
}
void rec(string &str, size_t pos){
if (pos == str.size()){
if (best == ""){
best = decrypt(str);
} else {
best = min(best, decrypt(str));
}
} else if (str[pos] != '?'){
rec(str, pos + 1);
} else {
for (char c = 'A'; c <= 'Z'; c++){
str[pos] = c;
rec(str, pos + 1);
}
str[pos] = '?';
}
}
int main(){
ios::sync_with_stdio(false);
string str;
while (cin >> str && str != "."){
best = "";
rec(str, 0);
cout << best << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
string cipher(int &p,string& s);
char incl(char x){
if(x=='Z') return 'A';
else return x+1;
}
char decl(char x){
if(x=='A') return 'Z';
else return x-1;
}
char letter(int &p,string &s){
char x=s[p++];
if(x=='+') return incl(letter(p,s));
else if(x=='-') return decl(letter(p,s));
return x;
}
string parseStr(int &p,string& s){
if(s[p]=='['){
p++;
string ret=cipher(p,s);
assert(s[p++]==']');
reverse(ret.begin(),ret.end());
return ret;
}
else{
return string{letter(p,s)};
}
}
string cipher(int &p,string& s){
string res;
while(p!=s.size() && s[p]!=']'){
res+=parseStr(p,s);
}
return res;
}
string dfs(int idx,string& str){
if(idx==str.size()){
int p=0;
return cipher(p,str);
}
if(str[idx]!='?') return dfs(idx+1,str);
string res="";
for(char x='A';x<='Z';x++){
str[idx]=x;
string ret=dfs(idx+1,str);
if(res=="") res=ret;
else res=min(res,ret);
}
str[idx]='?';
return res;
}
string solve(string str){
return dfs(0,str);
}
int main(){
string s;
while(cin>>s,s!="."){
cout<<solve(s)<<endl;
}
return 0;
}
|
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<utility>
#include<queue>
#include<string.h>
#include<string>
#include<set>
using namespace std;
char s[100];int it;
using namespace std;
string Read(){
string c;
if(s[it]=='+'){
it++;
c=Read();
if(c[0]=='Z'){
c[0]='A';
}else if(c[0]!='?'){
c[0]++;
}
return c;
}
else if(s[it]=='-'){
it++;
c=Read();
if(c[0]=='A'){
c[0]='Z';
}else if(c[0]!='?'){
c[0]--;
}
return c;
}
else if(s[it]=='['){
it++;
while(s[it]!=']'){
c+=Read();
}
it++;
reverse(c.begin(), c.end());
return c;
}
else if(s[it]==']'){
it++;
return "";
}
else {
c += s[it];
it++;
return c;
}
};
int main(){
while(scanf("%s",s),s[0]!='.'){
it=0;
string ans;
while(s[it]!='\0'){
ans+=Read();
}
for(int i=0;i<ans.length();i++){
if(ans[i]=='?'){
ans[i]='A';
}
}
printf(ans.c_str());
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define abs(a) max((a),-(a))
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repe(i,n) rep(i,(n)+1)
#define per(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define pere(i,n) rep(i,(n)+1)
#define all(x) (x).begin(),(x).end()
#define SP <<" "<<
#define RET return 0
#define MOD 1000000007
#define INF 1000000000000000000
typedef long long LL;
typedef long double LD;
string s;
pair<int,string> solve(int idx){
string ans="";
bool ok=true;
int c=0;
pair<int,string> ret;
for(;idx<s.length();idx++){
if(s[idx]=='['){
if(!ok) return {-1,"{"};
ret=solve(idx+1);
if(ret.second=="{") return {-1,"{"};
reverse(ret.second.begin(),ret.second.end());
ans+=ret.second;
idx=ret.first;
}else if(s[idx]==']'){
if(ok) return {idx,ans};
else return {-1,"{"};
}else if(s[idx]=='+'){
ok=false;
c=(c+1)%26;
}else if(s[idx]=='-'){
ok=false;
c=(c+25)%26;
}else{
if(s[idx]=='?'){
ans+=string(1,'?');
}else{
ans+=string(1,'A'+((s[idx]-'A')+c)%26);
}
ok=true;
c=0;
}
}
return {s.length(),ans};
}
int main(){
while(1){
cin >> s;
if(s==".") return 0;
pair<int,string> ret;
ret=solve(0);
for(int i=0;i<ret.second.length();i++) if(ret.second[i]=='?') ret.second[i]='A';
cout << ret.second << endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int idx;
string s;
string cipher(){
if(s.size() <= idx) return "";
string res = "";
while(idx < s.size() && s[idx] != ']'){
if(s[idx] == '['){
idx++;
string tmp = cipher();
reverse(tmp.begin(), tmp.end());
res += tmp;
idx++;
}
else{
int add = 0;
while(s[idx] == '+' || s[idx] == '-'){
if(s[idx] == '+') add = (add + 1) % 26;
else add = (add + 25) % 26;
idx++;
}
if(s[idx] == '?')
res += '?';
else
res += (char)((s[idx] - 'A' + add) % 26) + 'A';
idx++;
}
}
return res;
}
int main(){
while(cin >> s, s != "."){
idx = 0;
string ts = cipher();
for(int i = 0; i < ts.size(); i++){
if(ts[i] == '?'){
cout << 'A';
}
else{
cout << ts[i];
}
}
cout << endl;
}
} |
#include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <list>
#include <cstring>
#include <stack>
using namespace std;
string solve(string s)
{
string ans = "";
int plusnum = 0;
for(int i = 0; i < s.length(); i++){
if(s[i] == '+'){
plusnum++;
} else if(s[i] == '-'){
plusnum--;
} else if(s[i] == '['){
string news = "";
int kakkonum = 1;
i++;
while(kakkonum != 0){
if(s[i] == ']') kakkonum--;
if(kakkonum == 0) break;
if(s[i] == '[') kakkonum++;
news += s[i];
i++;
}
// cout << news << endl;
news = solve(news);
// cout << news << endl;
reverse(news.begin(), news.end());
ans += news;
} else {
if(s[i] == '?'){
ans += 'A';
} else {
int tmp = s[i] - 'A' + plusnum;
while(tmp < 0) tmp += 26;
while(tmp > 25) tmp -= 26;
// cout << (char)tmp + 'A' << endl;
ans += (char)tmp + 'A';
}
plusnum = 0;
}
}
return ans;
}
int main()
{
string s;
while(1){
cin >> s;
if(s == ".") break;
cout << solve(s) << endl;
}
return 0;
} |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
string str(string&, int&);
char let(string&, int&);
string cip(string&s, int&i) {
string v = str(s, i);
while (i < s.size() && s[i] != ']') {
v += str(s, i);
}
return v;
}
string str(string&s, int&i) {
if (s[i] == '[') {
i++; string v = cip(s, i); i++;
reverse(v.begin(), v.end());
return v;
}
string v; v += let(s, i); i++;
return v;
}
char let(string&s, int&i) {
if (s[i] == '?' || isalpha(s[i]))return s[i];
if (s[i] == '+') {
i++; char v = let(s, i);
if (v == '?')return v;
return ((v - 'A') + 1) % 26 + 'A';
}
i++; char v = let(s, i);
if (v == '?')return v;
return ((v - 'A') + 25) % 26 + 'A';
}
int main() {
string s;
while (cin >> s, s != ".") {
int i = 0;
string t = cip(s, i);
replace(t.begin(), t.end(), '?', 'A');
cout << t << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
#define INF (1<<28)
#define DEKAI 1000000007
#define lp(i,n) for(int i=0;i<n;i++)
#define int long long
string removerev(string s){
int stat=0;
stack<int> st;
lp(i,s.size()){
if(s[i]=='[') st.push(i);
if(s[i]==']'){
int bef=st.top();
st.pop();
reverse(s.begin()+bef+1,s.begin()+i);
s.erase(s.begin()+i);
s.erase(s.begin()+bef);
//cout<<s<<endl;
i-=2;
}
}
return s;
}
string calcs(string s){
int n=0;
lp(i,s.size()){
if(s[i]==']'||s[i]=='[') continue;
else if(s[i]=='+') n++;
else if(s[i]=='-') n--;
else{
if(s[i]=='?') s[i]='A';
else{
char c=s[i];
c+=n%26;
while(1){
if(c<'A') c+=26;
else if(c>'Z') c-=26;
else break;
}
s[i]=c;
}
n=0;
}
}
return s;
}
signed main(){
while(1){
string s;
cin>>s;
if(s==".") break;
s=calcs(s);
s=removerev(s);
lp(i,s.size()){
if('A'<=s[i]&&s[i]<='Z'){
cout<<s[i];
}
}
cout<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) begin(v), end(v)
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for(int i = (int)(s); i < (int)(n); i++)
const int inf = 1LL << 55;
const int mod = 1e9 + 7;
string s;
int idx;
char up(char c)
{
if(c == 'Z') c = 'A';
else if(c != '?') c = (char)(c + 1);
return c;
}
char down(char c)
{
if(c == 'A') c = 'Z';
else if(c != '?') c = (char)(c - 1);
return c;
}
char get()
{
if(s[idx] == '+') { idx++; return up(get()); }
if(s[idx] == '-') { idx++; return down(get()); }
return s[idx];
}
string solve(bool rev)
{
string ret = "";
for(; idx < s.size(); idx++) {
if(s[idx] == '[') idx++, ret += solve(true);
else if(s[idx] == ']') {
reverse(all(ret));
return ret;
}
else ret += get();
}
return ret;
}
signed main()
{
cin.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(12);
while(cin >> s, s != ".") {
idx = 0;
string ans = solve(false);
replace(all(ans), '?', 'A');
cout << ans << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
string s;
int p;
string readChipher();
string readString();
string readLetter();
string readChipher(){
string res="";
while(p<s.length() && s[p]!=']'){
res+=readString();
}
return res;
}
string readString(){
string res="";
if(s[p]=='['){
p++;//'['???
res+=readChipher();
p++;//']'???
reverse(res.begin(), res.end());
}
else{
res+=readLetter();
}
return res;
}
string readLetter(){
string res="";
int cnt=0;
while(s[p]=='+' || s[p]=='-'){
if(s[p]=='+')cnt++;
if(s[p]=='-')cnt--;
p++;
}
char tmp=s[p];
p++;
if(tmp=='?')res+="A";
else res+=(((tmp-'A')+(26*4)+cnt)%26+'A');
return res;
}
int main(){
while(cin>>s, s!="."){
p=0;
cout<<readChipher()<<endl;
}
return 0;
} |
#include <algorithm>
#include <queue>
#include <stack>
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#include <iostream>
#include <set>
using namespace std;
char makeChr(char c, int p){
const int len = ('Z' - 'A' + 1);
return 'A' + (int)(c - 'A' + p + len * 100) % len;
}
int main(){
string s;
while(cin >> s, s != "."){
vector<char> ans;
int p = 0;
stack<int> st;
REP(i,s.size()){
if(s[i] == '+') p++;
else if(s[i] == '-') p--;
else if(s[i] == '[') st.push(ans.size());
else if(s[i] == ']'){
reverse(ans.begin() + st.top(), ans.end());
st.pop();
}else{
if(s[i] == '?') ans.push_back('A');
else ans.push_back(makeChr(s[i], p));
p = 0;
}
}
cout << string(ans.begin(), ans.end()) << endl;
}
return 0;
} |
#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
string s; vector<int> v;
string Letter(int, int);
string String(int, int);
string Cipher(int, int);
string Letter(int l, int r) {
string ret(1, s[r - 1]);
for (int i = l; i < r - 1; i++) {
if (s[i] == '+') ret[0] = (ret[0] - 65 + 1) % 26 + 65;
if (s[i] == '-') ret[0] = (ret[0] - 65 + 25) % 26 + 65;
}
return ret;
}
string String(int l, int r) {
if (s[l] == '[') {
string ret = Cipher(l + 1, r - 1);
reverse(ret.begin(), ret.end());
return ret;
}
return Letter(l, r);
}
string Cipher(int l, int r) {
string ret;
int d = 0, pl = l;
for (int i = l; i < r; i++) {
if (s[i] == '[') d++;
if (s[i] == ']') {
d--;
if (d == 0) {
ret += String(pl, i + 1);
pl = i + 1;
}
}
if (d == 0 && 'A' <= s[i] && s[i] <= 'Z') {
ret += String(pl, i + 1);
pl = i + 1;
}
}
return ret;
}
string solve(int pos, string t) {
if (pos == v.size()) {
s = t;
return Cipher(0, s.size());
}
string ret = "~";
for (int i = 0; i < 26; i++) {
t[v[pos]] = i + 65;
ret = min(ret, solve(pos + 1, t));
}
return ret;
}
int main() {
string t;
while (cin >> t, t != ".") {
v.clear();
for (int i = 0; i < t.size(); i++) {
if (t[i] == '?') v.push_back(i);
}
cout << solve(0, t) << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef pair<string,string>P;
#define pb(a,b) push_back(P( a , b ))
string Replace(string S,string from,string to){
int p=S.find(from);
while(p!=string::npos){
S.replace(p,from.size(),to);
p=S.find(from,p+to.size());
}
return S;
}
vector<P>V;
void init(){
for(char c='A';c<'Z';c++){
string tmp="+",tmp2="";tmp+=c;tmp2+=(c+1);
V.pb(tmp,tmp2);
}
V.pb("+Z","A");
V.pb("+?","?");
for(char c='Z';c>'A';c--){
string tmp="-",tmp2="";tmp+=c;tmp2+=(c-1);
V.pb(tmp,tmp2);
}
V.pb("-A","Z");
V.pb("-?","?");
}
string Rep(string S){
for(string tmp;true;){
tmp=S;
for(int i=0;i<V.size();i++){
S=Replace(S,V[i].first,V[i].second);
}
if(tmp==S)break;
}
return S;
}
string Rev(string s){
string S="";
for(int i=0;i<s.size();i++){
if(s[i]=='['){
string tmp="";
int flg=1;
for(;true;i++){
tmp+=s[i];
if(s[i]==']')break;
if(s[i+1]=='['){
flg=0;
break;
}
}
if(flg){
for(int j=tmp.size()-2;j>0;j--)S+=tmp[j];
}
else{
S+=tmp;
}
}
else{
S+=s[i];
}
}
return S;
}
int main(){
init();
for(string s;cin>>s,s!=".";){
while(s.find("+")!=string::npos || s.find("-")!=string::npos || s.find("[")!=string::npos){
s=Rep(s);
s=Rev(s);
}
cout<<Replace(s,"?","A")<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char next(char c,int n)
{
if(c=='?') return c;
c+=n%26;
if(c<'A') c+=26;
if(c>'Z') c-=26;
return c;
}
string cip(const string& s,int& i);
string str(const string& s,int& i);
string let(const string& s,int& i);
string cip(const string& s,int& i)
{
string t=str(s,i);
while(i<s.size() && s[i]!=']')
t+=str(s,i);
return t;
}
string str(const string& s,int& i)
{
if(s[i]=='['){
string t=cip(s,++i);
reverse(begin(t),end(t));
i++;
return t;
}
return let(s,i);
}
string let(const string& s,int& i)
{
if(s[i]=='+' || s[i]=='-'){
char op=s[i];
string t=let(s,++i);
if(op=='+') t[0]=next(t[0],1);
if(op=='-') t[0]=next(t[0],-1);
return t;
}
return s.substr(i++,1);
}
int main()
{
for(string s;cin>>s && s!=".";){
int i=0;
string t=cip(s,i);
replace(begin(t),end(t),'?','A');
cout<<t<<endl;
}
} |
#include <bits/stdc++.h>
typedef long long LL;
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
using namespace std;
string s;
int ind;
char let(){
if(s[ind]=='+'){
++ind;
char tmp=let();
if(tmp=='?') return '?';
else if(tmp=='Z') return 'A';
else return ++tmp;
}else if(s[ind]=='-'){
++ind;
char tmp=let();
if(tmp=='?') return '?';
else if(tmp=='A') return 'Z';
else return --tmp;
}else{
char tmp=s[ind];
++ind;
return tmp;
}
}
string cip(){
string tmp="";
if(ind>=s.size()||s[ind]==']') return "";
else if(s[ind]=='['){
++ind;
string rev=(cip());
++ind;
tmp+=string(rev.rbegin(),rev.rend());
}else{
char tc=let();
if(tc=='?') tc='A';
tmp.push_back(tc);
}
return tmp+cip();
}
int main(void)
{
for(;;){
cin >> s;
ind = 0;
if(s==".") return 0;
cout << cip() << endl;
}
} |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<deque>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespace std;
typedef string::const_iterator state;
class parse_error {};
void cmpinc(state &it, char expected) {
if (*it == expected) {
it++;
}
else {
cerr << "Expected '" << expected << "',";
cerr << "got '" << *it << "'";
cout << endl;
throw parse_error();
}
}
char az(char c) {
return (c - 'A' + 26) % 26 + 'A';
}
/*
EBNF
cipher = {string};
string = letter | '[' cipher ']';
letter = ['+'|'-'](( 'a' - 'Z' ) | '?');
*/
char c;//?????°??¨
string cipher(state &it);
string str(state &it);
char letter(state &it);
bool flag; //?????????????
string cipher(state &it) {
string ret = "";
while (*it != '$' && *it != ']') {
ret += str(it);
}
return ret;
}
string str(state &it) {
string ret = "";
string t;
flag = false;
switch (*it) {
case '[':
it++;
t = cipher(it);
reverse(t.begin(), t.end());
ret = t;
cmpinc(it, ']');
break;
default:
ret = letter(it);
break;
}
return ret;
}
char letter(state &it) {
char ret = '\0';
switch (*it) {
case '+':
it++;
ret = az(letter(it) + 1);
if (flag)ret = '?';
break;
case '-':
it++;
ret = az(letter(it) - 1);
if (flag)ret = '?';
break;
case '?':
flag = true;
ret = *it;
it++;
break;
default:
if (*it >= 'A'&&*it <= 'Z') {
ret = *it;
it++;
}
break;
}
return ret;
}
int main() {
for (string s; getline(cin, s), s != "."; ) {
s += "$";
state it = s.begin();
string ans = cipher(it);
for (size_t f = ans.find("?"); f != string::npos; f = ans.find("?")) {
ans.replace(f, 1, "A");
}
cout << ans << endl;
}
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.