text stringlengths 49 983k |
|---|
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;
char p(char c){
if(c=='?') return c;
if(c=='Z') return 'A';
return c+1;
}
char m(char c){
if(c=='?') return c;
if(c=='A') return 'Z';
return c-1;
}
string calc(string s){
ll idx = 0;
string ret = "";
ll num = 0;
while(idx<s.size()){
if(s[idx]=='['){
//]を探して再帰
ll cnt = 0;
for(int i=idx;i<s.size();i++){
if(s[i]=='[') cnt++;
else if(s[i]==']'){
cnt--;
if(cnt==0){
string k = "";
for(int j=idx+1;j<i;j++) k += s[j];
string tmp = calc(k);
reverse(all(tmp));
ret += tmp;
idx = i+1;
break;
}
}
}
}else if(s[idx]=='-'){
num--;
idx++;
}else if(s[idx]=='+'){
num++;
idx++;
}else{
char tmp = s[idx];
if(num>0) for(int i=0;i<num;i++) tmp = p(tmp);
else for(int i=0;i<abs(num);i++) tmp = m(tmp);
ret += tmp;
num = 0;
idx++;
}
}
return ret;
}
bool solve(){
string s;std::cin >> s;
if(s==".") return false;
string t = calc(s);
for(int i=0;i<t.size();i++){
if(t[i]=='?') t[i] = 'A';
}
std::cout << t << '\n';
return true;
}
// ----? みたいなのは?にして良い
int main(int argc, char const *argv[]) {
while(true) if(!solve()) break;
return 0;
}
|
#include<iostream>
#include<iomanip>
#include<math.h>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#define INF 1000000000ll
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i,m) for(long long i=0; i<m; i++)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define DUMP(a) for(long long dump=0; dump<(ll)a.size(); dump++) { cout<<a[dump]; if(dump!=(ll)a.size()-1) cout<<" "; else cout<<endl; }
#define ALL(v) v.begin(),v.end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef long double ld;
ll roc=0;
string s;
char letter();
string str();
string cipher();
char letter() {
int ofs=0;
while(!((s[roc]>='A'&&s[roc]<='Z')||s[roc]=='?')) {
if(s[roc]=='+') ofs++;
else ofs--;
roc++;
}
if(s[roc]=='?') return '?';
return 'A'+(((int)(s[roc]-'A')+ofs)%26+26)%26;
}
string str() {
if(s[roc]=='[') {
roc++;
string ret=cipher();
roc++;
reverse(ALL(ret));
return ret;
} else {
string ret="";
ret+=letter();
roc++;
return ret;
}
}
string cipher() {
string ret="";
while(roc<(ll)s.size()&&s[roc]!=']') {
ret+=str();
}
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
while(1) {
roc=0;
cin>>s;
if(s==".") break;
string ret=cipher();
REP(i,(ll)ret.size()) {
if(ret[i]=='?') ret[i]='A';
}
cout<<ret<<endl;
}
} |
#include <bits/stdc++.h>
#define mod 26
#define S str[i]
using namespace std;
string str;
string solve(){
string res;
stack <int> st;
for(int i=0;i<str.size();i++){
int cnt=0;
while(S=='+'||S=='-')cnt+=(S=='+')-(S=='-'),i++;
if(cnt) res+=((S-'A')+cnt%mod+mod)%mod+'A';
else if(S!='['&&S!=']')res += S;
if(S=='?')res[res.size()-1]='A';
if(S=='[')st.push(res.size());
if(S==']'){
reverse(res.begin()+st.top(),res.end());
st.pop();
}
}
return res;
}
int main(){
while(1){
cin>>str;
if(str==".")break;
cout <<solve()<<endl;
}
return 0;
} |
#include<iostream>
#include<algorithm>
using namespace std;
string s;
string rep="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int id;
char g();
string f()
{
string ans="";
while(id<s.size()&&s[id]!=']')
{
if(s[id]=='[')
{
id++;
string t=f();
id++;
reverse(t.begin(),t.end());
ans+=t;
}
else
{
ans+=g();
}
}
return ans;
}
char g()
{
if(s[id]=='+'||s[id]=='-')
{
bool f=s[id]=='+';
id++;
char a=g();
if(a=='~')return a;
else if(f)
{
return a<'Z'?a+1:'A';
}
else
{
return a>'A'?a-1:'Z';
}
}
else
{
return s[id++];
}
}
int main()
{
while(cin>>s,s!=".")
{
string ans="~";
int id1=-1,id2=-1,id3=-1;
for(int i=0;i<s.size();i++)
{
if(s[i]=='?')
{
if(id1<0)id1=i;
else if(id2<0)id2=i;
else id3=i;
}
}
if(id1<0)
{
id=0;
ans=f();
}
else
{
for(int i1=0;i1<rep.size();i1++)
{
s[id1]=rep[i1];
if(id2<0)
{
id=0;
ans=min(ans,f());
}
else
{
for(int i2=0;i2<rep.size();i2++)
{
s[id2]=rep[i2];
if(id3<0)
{
id=0;
ans=min(ans,f());
}
else
{
for(int i3=0;i3<rep.size();i3++)
{
s[id3]=rep[i3];
id=0;
ans=min(ans,f());
}
}
}
}
}
}
cout<<ans<<endl;
}
}
|
#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
int n = 0;
string check(const string st) {
int plus = 0;
string nowst="";
while (st.size()>n) {
if (st[n] == '[') {
n++;
string ast(check(st));
reverse(ast.begin(), ast.end());
nowst+=(ast);
}
else if (st[n] == '-') {
plus--;
if (plus < 0)plus += 26;
n++;
}
else if (st[n] == '+') {
plus++;
if (plus > 26)plus -= 26;
n++;
}
else if (st[n] == ']') {
n++;
return nowst;
}
else if (isalpha(st[n])) {
char ch = st[n] + plus;
while (ch > 'Z')ch -= 26;
while (ch < 'A')ch += 26;
nowst.push_back(ch);
plus = 0;
n++;
}
else {
assert(st[n] == '?');
nowst.push_back('?');
n++;
plus = 0;
}
}
return nowst;
}
int main() {
while (1) {
n = 0;
string st; cin >> st;
if (st == ".")break;
string ans(check(st));
for (int i = 0; i < ans.size(); ++i) {
if (ans[i] == '?')ans[i] = 'A';
}
cout << ans << endl;
}
return 0;
} |
#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(s[i] != '?'){
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;
ans = parse(s);
for(int i=0;i<ans.size();i++){
if(ans[i] == '?') ans[i] = 'A';
}
cout << ans << endl;
return true;
}
int main(){
while(solve());
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
char buf[100];
int cnt;
int N;
string calc_p(string c){
if( c[0] == '?' ) return c;
c[0]-='A';
c[0]++;
c[0]%=26;
c[0]+='A';
return c;
}
string calc_m(string c){
if( c[0] == '?' ) return c;
c[0]-='A';
c[0]+=25;
c[0]%=26;
c[0]+='A';
return c;
}
string Letter();
string String();
string Cipher();
string Letter(){
if( buf[cnt] == '+' ) {
cnt++;
return calc_p(Letter());
} else if (buf[cnt] == '-' ){
cnt++;
return calc_m(Letter());
} else {
string ret = ""; ret += buf[cnt];
cnt++;
return ret;
}
}
string String(){
if( buf[cnt] == '[' ){
cnt++;
string ret = Cipher();
reverse(ret.begin(),ret.end());
cnt++;
return ret;
} else {
return Letter();
}
}
string Cipher(){
string s = String();
while( cnt < N ){
if( buf[cnt] == ']' ) break;
s+=String();
}
return s;
}
int main(){
while( cin >> buf ){
if( buf[0] == '.' ) break;
cnt = 0;
N = strlen(buf);
string res = Cipher();
for(int i=0;i<(int)res.size();i++){
if( res[i] == '?' ) cout << 'A';
else cout << res[i];
}
cout << endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
while (true) {
string s;
cin >> s;
if (s == ".") return 0;
int it = 0, keep = 0;
vector<vector<char>> x(40);
for (int i = 0; i < s.size(); i++) {
if (s[i] == '[') {
it++;
}
else if (s[i] == ']') {
reverse(x[it].begin(), x[it].end());
for (int j = 0; j < x[it].size(); j++) {
x[it - 1].emplace_back(x[it][j]);
}
x[it].clear();
it--;
}
else if (s[i] == '+') {
keep++;
}
else if (s[i] == '-') {
keep--;
}
else if (s[i] == '?') {
x[it].emplace_back('A');
keep = 0;
}
else {
keep += s[i];
while (keep < 65) keep += 26;
while (keep > 90) keep -= 26;
x[it].emplace_back((char) keep);
keep = 0;
}
}
for (int i = 0; i < x[it].size(); i++) cout << x[it][i];
cout << '\n';
}
}
|
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
char letter(const string &s, int &p);
string srting(const string &s, int &p);
string cipher(const string &s, int &p);
char letter(const string &s, int &p) {
if (s[p] == '?' || s[p] >= 'A' && s[p] <= 'Z') {
p++;
return s[p - 1];
}
int q = p;
p++;
char l = letter(s, p);
if (s[q] == '+') {
return l == '?' ? '?' : l != 'Z' ? l + 1 : 'A';
}
if (s[q] == '-') {
return l == '?' ? '?' : l != 'A' ? l - 1 : 'Z';
}
}
string srting(const string &s, int &p) {
if (s[p] != '[') {
return string() + letter(s, p);
}
p++;
string c = cipher(s, p);
p++;
std::reverse(c.begin(), c.end());
return c;
}
string cipher(const string &s, int &p) {
string c = srting(s, p);
if (s[p] == ']' || p == s.size()) {
return c;
}
c += cipher(s, p);
return c;
}
int main() {
string s;
while (cin >> s, s != ".") {
int p = 0;
string c = cipher(s, p);
replace(c.begin(), c.end(), '?', 'A');
cout << c << endl;
}
return 0;
} |
#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define IN(a, b, x) (a<=x&&x<b)
#define MP make_pair
#define PB push_back
#ifdef int
const ll INF = (1LL<<60);
#else
const int INF = (1LL<<30);
#endif
const double PI = 3.14159265359;
const double EPS = 1e-12;
const int MOD = 1000000007;
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
out<<'('<<a.first<<','<<a.second<<')';
return out;
}
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
typedef string::const_iterator State;
string str(State&);
char letter(State&);
string s;
string cipher(State& begin) {
// cout << "c:" << *begin << endl;
string ret = "";
while(begin != s.end() && *begin != ']') {
ret += str(begin);
// cout << ret << endl;
}
return ret;
}
string str(State& begin) {
// cout << "s:" << *begin << endl;
string ret;
if(*begin == '[') {
begin++;
ret = cipher(begin);
begin++;
reverse(ALL(ret));
} else {
ret = letter(begin);
}
return ret;
}
char letter(State& begin) {
// cout << "l:" << *begin << endl;
int tmp = 0;
while(*begin == '+' || *begin == '-') {
if(*begin == '+') tmp++;
else tmp--;
begin++;
}
char ret = *begin;
begin++;
if(ret == '?') return 'A';
while(tmp > 0) ret = ret=='Z'?'A':ret+1, tmp--;
while(tmp < 0) ret = ret=='A'?'Z':ret-1, tmp++;
return ret;
}
signed main(void)
{
while(true) {
cin >> s;
if(s == ".") break;
State begin = s.begin();
cout << cipher(begin) << endl;
}
return 0;
} |
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
pair<string, int> cipher(const string& s, int pos = 0);
pair<char, int> letter(const string& s, int pos) {
if (s[pos] == '+') {
char res;
tie(res, pos) = letter(s, pos+1);
if (res == '?') {
return make_pair(res, pos);
} else if (res == 'Z') {
return make_pair('A', pos);
} else {
return make_pair(res+1, pos);
}
} else if (s[pos] == '-') {
char res;
tie(res, pos) = letter(s, pos+1);
if (res == '?') {
return make_pair(res, pos);
} else if (res == 'A') {
return make_pair('Z', pos);
} else {
return make_pair(res-1, pos);
}
} else {
return make_pair(s[pos], pos+1);
}
}
pair<string, int> string_p(const string& s, int pos) {
if (s[pos] == '[') {
string res;
tie(res, pos) = cipher(s, pos+1);
reverse(begin(res),end(res));
return make_pair(res, pos+1);
} else {
auto res = letter(s, pos);
return make_pair(string(1, res.first), res.second);
}
}
pair<string, int> cipher(const string& s, int pos) {
string res;
string str;
do {
tie(str, pos) = string_p(s, pos);
res += str;
} while(pos < s.size() && s[pos] != ']');
return make_pair(res, pos);
}
string convert(const string& s) {
auto p = cipher(s).first;
replace(begin(p),end(p),'?','A');
return p;
}
int main() {
while(1){
string s;
cin>>s;
if (s == ".") break;
cout << convert(s) << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
string answer(string s){
string ans;
for(char a:s){
if(a=='?'){
ans+='A';
}
else ans+=a;
}
return ans;
}
string rev(string s){
reverse(s.begin(),s.end());
return s;
}
string es(string s){
string ans;
for(int i=0;i<s.size();i++){
if(s[i]=='['){
int count=1;
bool sw=true;
for(int j=i+1;sw;j++){
if(s[j]=='[')count++;
if(s[j]==']')count--;
if(!count){
ans+=rev(es(s.substr(i+1,j-i-1)));
i=j;
sw=false;
}
}
}
if(s[i]=='+'||s[i]=='-'){
bool sw=true;
for(int j=i+1;sw;j++){
if(!(s[j]=='+'||s[j]=='-')){
char c;
int count=0;
for(int k=i;k<j;k++){
if(s[k]=='+')count++;
else count--;
}
count=(count+26)%26;
c=(s[j]=='?'?'?':(char)(s[j]+count));
while(c-'Z'>0){
c=(char)(c-26);
}
ans+=c;
i=j;
sw=false;
}
}
}
else if(s[i]=='?'||(s[i]-'A'>=0&&'Z'-s[i]>=0)){
ans+=s[i];
}
}
return ans;
}
void solve(string s){
cout<<answer(es(s))<<endl;
}
int main(){
string s;
while(cin>>s,s!="."){
solve(s);
}
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<numeric>
#include<queue>
#include<stack>
#define reps(i,j,k) for(int i=(j);i<=(k);++i)
#define rep(i,j) reps(i,0,(j)-1)
#define fs first
#define sc second
#define pb push_back
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
string eval(const string str){
stack<char> s;
string ret="";
int len = str.length();
rep(i,len){
if('A' <= str[i] && str[i] <= 'Z'){
char c = str[i] - 'A';
while(!s.empty()){
char op = s.top();
if(op=='+') c = (c+1)%26;
else if(op=='-') c = (c+25)%26;
else break;
s.pop();
}
s.push(c + 'A');
}else if(str[i]==']'){
string tmp="";
while(!s.empty()){
char c = s.top();
if(c=='['){
s.pop();
break;
}
else tmp += c;
s.pop();
}
rep(j,tmp.length()){
s.push(tmp[j]);
}
}else{
s.push(str[i]);
}
}
while(!s.empty()){
ret += s.top();
s.pop();
}
reverse(ret.begin(), ret.end());
return ret;
}
vector<string> hoge(string str, int p){
vector<string> ret;
bool flag = false;
reps(i,p,str.length()-1){
if(str[i]=='?'){
reps(j,'A','Z'){
str[i] = j;
vector<string> tmp = hoge(str, i+1);
rep(k,tmp.size()) ret.pb(tmp[k]);
}
flag = true;
break;
}
}
if(!flag) ret.pb(str);
return ret;
}
int main(){
string s;
while(cin >> s){
if(s[0]=='.') break;
vector<string> v = hoge(s, 0);
vector<string> ans;
rep(i,v.size()){
ans.pb(eval(v[i]));
// cout << v[i] << endl;
}
sort(ans.begin(), ans.end());
cout << ans[0] << endl;
}
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
string decrypt(string cr)
{
string ret;
for(int i=0;i<cr.size();i++)
{
//1文字のずらすやつの場合
if(cr[i]=='+' || cr[i]=='-')
{
int cnt=0;
while(cr[i]=='+' || cr[i]=='-')
{
if(cr[i]=='+')
cnt++;
if(cr[i]=='-')
cnt--;
i++;
}
//ずらす個数に従ってずらす
ret+=(char)((((cr[i]-'A')+cnt)+130)%26+'A');
}else if(cr[i]=='['){
//反転の場合
string tmp;
int para=1;
i++;
while(para!=0)
{
tmp+=cr[i];
if(cr[i]=='[')
para++;
if(cr[i]==']')
para--;
i++;
}
i--;
tmp.resize(tmp.size()-1);
//cerr<<tmp<<endl;
tmp=decrypt(tmp);
reverse(tmp.begin(),tmp.end());
ret+=tmp;
}else if(cr[i]>='A' && cr[i]<='Z'){
//ただの文字
ret+=cr[i];
}
}
return ret;
}
string dfs(string cr,vector<int> q,int now)
{
string tmp=cr;
string ret="ZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZ";
if(now==q.size())
return decrypt(tmp);
for(int i=0;i<26;i++)
{
tmp[q[now]]=(char)('A'+i);
ret=min(ret,dfs(tmp,q,now+1));
}
return ret;
}
int main()
{
while(1)
{
string s;
string ans;
cin>>s;
if(s==".")
break;
//?の位置を調べる
vector<int> q;
for(int i=0;i<s.size();i++)
{
if(s[i]=='?')
q.push_back(i);
}
//?にすべての文字を入れる全探索
if(q.size()==0)
ans=decrypt(s);
else
ans=dfs(s,q,0);
cout<<ans<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll<<50;
template<typename T>
void printv(const vector<T>& s) {
for(int i=0;i<(int)(s.size());++i) {
cout << s[i];
if(i == (int)(s.size())-1) cout << endl;
else cout << " ";
}
}
pair<int, string> parse(string s, int st) {
string res = "";
int cnt = 0;
for(int i=st;i<(int)(s.size());++i) {
if(s[i] == '[') {
pair<int, string> tmp = parse(s, i+1);
i = tmp.first;
res += tmp.second;
} else if(s[i] == '+') {
cnt++;
} else if(s[i] == '-') {
cnt--;
} else if(s[i] == ']') {
reverse(res.begin(), res.end());
return {i, res};
} else if(s[i] == '?') {
res.push_back('A');
cnt = 0;
} else {
res.push_back((s[i] - 'A' + cnt + 26 * 4) % 26 + 'A');
cnt = 0;
}
}
return {(int)(s.size()), res};
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
while(1) {
string s; cin >> s;
if(s == ".") break;
cout << parse(s, 0).second << endl;
}
}
|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
string f(string& s, int& i) {
string res;
int x = 0;
i++;
for (;;) {
if (s[i] == '[') {
string t = f(s, i);
reverse(t.begin(), t.end());
res += t;
}
else if (s[i] == ']') return res;
else if (s[i] == '+') x++;
else if (s[i] == '-') x--;
else {
char c = s[i];
if (c != '?') c = 'A' + (c - 'A' + x + 104) % 26;
if (c == '?') c = 'A';
res += c;
x = 0;
}
i++;
}
}
int main() {
for (;;) {
string s; cin >> s;
if (s == ".") break;
int i = 0;
s = "[" + s + "]";
cout << f(s, i) << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define all(v) (v).begin(),(v).end()
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define pb push_back
#define fi first
#define se second
template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}
string S;
string dfs(int &cur,int v){
if(v==0){
if(S[cur]=='['){
cur++;
string ret=dfs(cur,1);
cur++;
reverse(all(ret));
return ret;
}
string ret="A";
int d=0;
while(true){
if(S[cur]=='+'){
cur++;
d++;
continue;
}
if(S[cur]=='-'){
cur++;
d--;
continue;
}
if(S[cur]=='?'){
cur++;
ret[0]='?';
break;
}
ret[0]=(S[cur]-'A'+d+114514*26)%26+'A';
cur++;
break;
}
return ret;
}
else{
string ret=dfs(cur,0);
while(S[cur]!=']'&&S[cur]!='='){
ret+=dfs(cur,0);
}
return ret;
}
}
void solve(){
S+="=";
int cur=0;
S=dfs(cur,1);
rep(i,S.size())if(S[i]=='?')S[i]='A';
cout<<S<<endl;
}
signed main(){
while(cin>>S,S!=".")solve();
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
const int atoz = 26;
string parse(string str){
string ret="";
int ptr=0;
while(ptr<(int)str.length()){
int plus = 0;
while(str[ptr]=='+' || str[ptr]=='-'){
if(str[ptr]=='+') plus++;
if(str[ptr]=='-') plus+=atoz-1;
ptr++;
}
if(str[ptr]=='?'){
ret += "A";
ptr++;
}else if('A' <= str[ptr] && str[ptr] <= 'Z'){
ret += (char)((str[ptr]-'A'+plus)%atoz +'A');
ptr++;
}else{
ptr++;
int depth = 1;
int memptr = ptr;
while(depth!=0){
if(str[ptr]=='[') depth++;
if(str[ptr]==']') depth--;
ptr++;
}
string retsub = parse(str.substr(memptr, ptr-memptr-1));
reverse(retsub.begin(), retsub.end());
ret += retsub;
}
}
return ret;
}
int main(){
while(1){
string str;
cin >> str;
if(str==".") break;
cout << parse(str) << endl;
}
return 0;
} |
#include <bits/stdc++.h>
#define ll long long
#define p pair<int, int>
using namespace std;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
int main() {
string s;
while (cin >> s) {
if (s == ".") break;
string ans = "";
int cnt = 0;
stack<int> st;
for (int i = 0; i < s.size(); i++) {
if(s[i] == '['){
st.push(ans.size());
}else if(s[i] == '+'){
cnt++;
} else if (s[i] == '-') {
cnt--;
}else if(s[i] == '?'){
ans += 'A';
cnt = 0;
}else if(s[i] == ']'){
int from = st.top();
st.pop();
reverse(ans.begin() + from, ans.end());
}else{
ans += (s[i] - 'A' + cnt + 104) % 26 + 'A';
cnt = 0;
}
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cassert>
using namespace std;
string S;
char step(char ch, int offset) {
if (ch == '?') return 'A';
return ((ch - 'A') + offset + 26*1000) % 26 + 'A';
}
pair<string, int> parse(int idx) {
string res = "";
while (idx < S.size()) {
if (S[idx] == ']') {
reverse(res.begin(), res.end());
idx ++;
break;
}
if (S[idx] == '[') {
pair<string, int> sub = parse(idx+1);
res += sub.first;
idx = sub.second;
continue;
}
int offset = 0;
while (S[idx] == '+' || S[idx] == '-') {
offset += (S[idx] == '+') ? 1 : -1;
++idx;
}
res += string(1, step(S[idx], offset));
idx++;
}
return make_pair(res, idx);
}
void solve(){
string res;
pair<string, int> pr = parse(0);
cout << pr.first << endl;
}
int main(){
while(1){
cin >> S;
if (S == ".") break;
solve();
}
}
|
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
char next(char x){
if(x == '?')return x;
if(x == 'Z')return 'A';
return x+1;
}
char before(char x){
if(x == '?')return x;
if(x == 'A')return 'Z';
return x-1;
}
string rev(string x){
string res = "";
for(int i = x.size() - 1;i >= 0;i--)res += x[i];
return res;
}
char getletter(string &str, int &pos){
if(str[pos] == '+'){
pos++;
return next(getletter(str, pos));
}
if(str[pos] == '-'){
pos++;
return before(getletter(str, pos));
}
return str[pos++];
}
string perse(string &str, int &pos);
string getstring(string &str, int &pos){
if(str[pos] == '['){
pos++;
return rev(perse(str, pos));
}
string x = "";
x += getletter(str, pos);
return x;
}
string perse(string &str, int &pos){
if(pos == str.size() || str[pos] == ']'){
if(pos != str.size())pos++;
return "";
}
string res = getstring(str, pos);
return res + perse(str, pos);
}
int main(){
string str;
while(cin >> str, str != "."){
int p = 0;
str = perse(str, p);
for(int i = 0;i < str.size();i++){
if(str[i] == '?')cout << 'A';
else cout << str[i];
}
cout << endl;
}
return 0;
} |
#include<iostream>
#include<algorithm>
using namespace std;
string s,t;
int id;
string f()
{
string ret="";
while(id<t.size()&&t[id]!=']')
{
if(t[id]=='[')
{
id++;
string now=f();
reverse(now.begin(),now.end());
ret+=now;
}
else
{
ret+=t[id];
id++;
}
}
id++;
return ret;
}
int main()
{
while(cin>>s,s!=".")
{
t="";
int x=0;
for(int i=0;i<s.size();i++)
{
if(s[i]=='['||s[i]==']')
{
t+=s[i];
}
else if(s[i]=='+'||s[i]=='-')
{
x+=s[i]=='+'?1:-1;
}
else
{
if(s[i]=='?')t+='A';
else
{
int now=s[i]-'A';
now+=x;
now=(now%26+26)%26;
t+=(char)(now+'A');
}
x=0;
}
}
id=0;
cout<<f()<<endl;
}
}
|
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
pair<string, int> cipher(const string& s, int pos = 0);
pair<string, int> letter(const string& s, int pos) {
if (s[pos] == '+') {
string res;
tie(res, pos) = letter(s, pos+1);
if (res == "?") {
return make_pair(res, pos);
} else if (res == "Z") {
res[0] = 'A';
return make_pair(res, pos);
} else {
++res[0];
return make_pair(res, pos);
}
} else if (s[pos] == '-') {
string res;
tie(res, pos) = letter(s, pos+1);
if (res == "?") {
return make_pair(res, pos);
} else if (res == "A") {
res[0] = 'Z';
return make_pair(res, pos);
} else {
--res[0];
return make_pair(res, pos);
}
} else {
return make_pair(s.substr(pos, 1), pos+1);
}
}
pair<string, int> string_p(const string& s, int pos) {
if (s[pos] == '[') {
string res;
tie(res, pos) = cipher(s, pos+1);
reverse(begin(res),end(res));
return make_pair(res, pos+1);
} else {
return letter(s, pos);
}
}
pair<string, int> cipher(const string& s, int pos) {
string res;
string str;
do {
tie(str, pos) = string_p(s, pos);
res += str;
} while(pos < s.size() && s[pos] != ']');
return make_pair(res, pos);
}
string convert(const string& s) {
auto p = cipher(s).first;
replace(begin(p),end(p),'?','A');
return p;
}
int main() {
while(1){
string s;
cin>>s;
if (s == ".") break;
cout << convert(s) << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<LL,LL> P;
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; }
template<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
const LL mod=1000000007;
const LL LINF=1LL<<62;
const int INF=1<<30;
int dx[]={1,0,-1,0,1,-1,1,-1};
int dy[]={0,1,0,-1,1,-1,-1,1};
string s;
string dfs(int l,int r){
int cnt = 0;
int idx = -1;
int p = 0;
string ret = "";
for (int i = l; i < r; i++) {
if(s[i] == '['){
if(cnt == 0) idx = i;
cnt++;
}
else if(s[i] == ']'){
cnt--;
if(cnt == 0){
auto r = dfs(idx+1,i);
reverse(ALL(r));
ret += r;
}
}
else if(s[i] == '+'){
if(cnt) continue;
p = (p + 1)%26;
}
else if(s[i] == '-'){
if(cnt) continue;
p = (p + 25)%26;
}
else{
if(cnt) continue;
int t = s[i] - 'A';
if(0<=t&&t<26){
t = (t + p)%26;
ret += (char) (t + 'A');
p = 0;
}
else{
ret += s[i];
p = 0;
}
}
}
return ret;
}
int main(){
while(cin >> s){
if(s==".") return 0;
auto r = dfs(0,s.length());
for (int i = 0; i < r.length(); i++) {
if(r[i] == '?') r[i] = 'A';
}
cout << r << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
string chars = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string ana;
int now;
string Cipher();
string String();
char Letter();
string Cipher() {
string ret = "";
while (now < ana.size()) {
if (ana[now] == ']') break;
ret += String();
}
return ret;
}
string String() {
char c = ana[now];
if (c == '[') {
++now;
string ret = Cipher();
reverse( ret.begin(), ret.end() );
++now;
return ret;
}
else {
string ret = "";
ret += Letter();
return ret;
}
}
char Letter() {
string ret = "";
char c = ana[now++];
if (c == '+') {
return (char)((Letter()-'A'+1)%26 + 'A');
}
else if (c == '-') {
return (char)((Letter()-'A'-1+26)%26 + 'A');
}
else {
return c;
}
}
string GetCipher(string str) {
ana = str;
now = 0;
return Cipher();
}
string f(string str) {
int pos = -1;
for (int i = 0; i < str.size(); ++i) {
if (str[i] == '?') {
pos = i;
break;
}
}
if (pos < 0) {
return GetCipher(str);
}
else {
vector<string> v(chars.size());
for (int i = 0; i < chars.size(); ++i) {
str[pos] = chars[i];
v[i] = f(str);
}
string ret = v[0];
for (int i = 0; i < v.size(); ++i) {
if (v[i] < ret) ret = v[i];
}
return ret;
}
}
int main() {
string str;
while ( cin >> str, str != "." ) {
cout << f(str) << endl;
}
} |
#define D(x) cout << #x " = " << x << endl
#define DD(x, y) cout << "(" #x ", " #y ") = (" << x << ", " << y << ")" << endl
#define DDD(x, y, z) cout << "(" #x ", " #y ", " #z ") = (" << x << ", " << y << ", " << z << ")" << endl
#define DV(v) for (auto __macro_vi : v){ cout << __macro_vi << " ";} cout << endl;
#define DA(a, n) for (int __macro_i = 0; __macro_i < n; ++__macro_i) { cout << a[__macro_i] << " "; } cout << endl;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define ALL(v) (v).begin(), (v).end()
#include<iostream>
#include<vector>
#include<cassert>
#include<cmath>
#include<string>
#include<algorithm>
using namespace std;
using State = string::iterator;
string s;
string parse_cipher(State& begin);
char parse_letter(State& begin) {
char ret;
if (*begin == '+') {
begin++;
char c = parse_letter(begin);
ret = c == '?' ? '?' : ((c - 'A') + 1) % 26 + 'A';
} else if (*begin == '-') {
begin++;
char c = parse_letter(begin);
ret = c == '?' ? '?' : ((c - 'A') + 25) % 26 + 'A';
} else {
ret = *begin;
begin++;
}
return ret;
}
string parse_string(State& begin) {
string ret;
if (*begin == '[') {
begin++;
ret = parse_cipher(begin);
begin++;
reverse(ret.begin(), ret.end());
} else {
ret = parse_letter(begin);
}
return ret;
}
string parse_cipher(State& begin) {
string ret;
while (begin != s.end() && *begin != ']') {
ret += parse_string(begin);
}
return ret;
}
int main()
{
while(1) {
cin >> s;
if (s == ".") break;
State begin = s.begin();
string ret = parse_cipher(begin);
REP(i, ret.size()) ret[i] = ret[i] == '?' ? 'A' : ret[i];
cout << ret << endl;
}
}
|
#include<iostream>
#include<algorithm>
#include<string>
#include<stack>
#define rep(i,n) for(int i=0;i<(int)n;i++)
using namespace std;
int main(){
string cipher;
while(cin >> cipher){
if(cipher==".")break;
int cnt = 0;
rep(i,cipher.size()){
while(cipher[i] == '+' || cipher[i] == '-'){
cnt += (cipher[i] == '+')? 1 : -1;
cipher.erase(cipher.begin()+i);
}
if(cnt != 0){
if(cipher[i] != '?'){
cipher[i] = 'A' + ( (cipher[i]-'A' + cnt) % 26 + 26) % 26;
}
cnt = 0;
}
}
stack<int> open;
rep(i,cipher.size()){
if(cipher[i] == '[')open.push(i);
else if(cipher[i] == ']'){
int start = open.top(); open.pop();
string rev = cipher.substr(start+1,i-start-1);
reverse(rev.begin(), rev.end());
cipher = cipher.substr(0,start) + rev + cipher.substr(i+1);
i -= 2;
}
}
rep(i,cipher.size()){
if(cipher[i] == '?')cipher[i] = 'A';
}
cout << cipher << endl;
}
} |
//#include<bits/stdc++.h>
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<string>
#include<cmath>
#include<cassert>
#include<cstdint>
//#include<>
using namespace std;
typedef int64_t i64;typedef int32_t i32;
typedef int16_t i16;typedef int8_t i8;
typedef uint64_t ui64;typedef uint32_t ui32;
typedef uint16_t ui16;typedef uint8_t ui8;
typedef i64 int__;
#define rep(i,j) for(int__ i=0;i<j;i++)
#define repeat(i,j,k) for(int__ i=(j);i<(k);i++)
#define all(v) begin(v),end(v)
const i32 INF=1<<30;//10E10
int main()
{
while(true){
string s;
cin>>s;
if(s==".")break;
string tmp="";
int cntr=0;
for(auto ch : s){
if(ch=='['||ch==']')tmp+=ch;
else if(ch=='+')cntr++;
else if(ch=='-')cntr--;
else if(ch=='?'){
cntr=0;
tmp+='A';
}
else{
int chi=ch-'A';
while(cntr<0)cntr+=26;
chi=(chi+cntr )% 26;
tmp+=chi+'A';
cntr=0;
}
}
stack<int> stk;
// [ ] 対応
rep(i,tmp.size()){
if(tmp[i]=='[')stk.push(i);
else if(tmp[i]==']'){
int beg=stk.top();stk.pop();
reverse(&tmp[beg]+1,&tmp[i]);
}
}
string ans="";
for(auto ch : tmp){
if(ch=='['||ch==']')continue;
ans+=ch;
}
cout<<ans<<endl;
}
return 0;
} |
#include<stdio.h>
#include<algorithm>
#include<string>
using namespace std;
char str[120];
string ans;
int cur;
string ci();
string st();
char le();
string ci(){
string ret=st();
while(str[cur]&&str[cur]!=']'){
ret+=st();
//printf("ci %d: %s\n",cur,ret.c_str());
}
return ret;
}
string st(){
if(str[cur]=='['){
cur++;
string tmp=ci();
cur++;
reverse(tmp.begin(),tmp.end());
return tmp;
}
char res=le();
//printf("st %d: %c\n",cur,res);
char r[2];
r[0]=res;r[1]=0;
string q=r;
return q;
}
char le(){
if(str[cur]=='+'){
cur++;
char res=le();
if(res=='Z')res='A';
else res++;
return res;
}
if(str[cur]=='-'){
cur++;
char res=le();
if(res=='A')res='Z';
else res--;
return res;
}
cur++;
return str[cur-1];
}
void solve(){
bool p=false;
for(int i=0;str[i];i++)if(str[i]=='?'){
p=true;
for(int j=0;j<26;j++){
str[i]='A'+j;
solve();
}
str[i]='?';
return ;
}
cur=0;
string res=ci();
ans=min(ans,res);
}
int main(){
while(1){
scanf("%s",str);
//printf("%s\n",str);
if(str[0]=='.')return 0;
ans="ZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZ";
solve();
printf("%s\n",ans.c_str());
}
} |
#include<iostream>
#include<string>
using namespace std;
string rev(string str){
for(int i=0;i<str.length();i++){
if(str[i]=='['){
int j;
int co=1;
for(j=i+1;j<str.length();j++){
if(str[j]=='[')co++;
if(str[j]==']')co--;
if(co==0)break;
}
string n=rev(str.substr(i+1,j-i-1));
str=str.substr(0,i)+n+str.substr(j+1,str.length()-j-1);
}
}
string tem="";
for(int i=0;i<str.length();i++)
tem+=str[str.length()-1-i];
return tem;
}
string pm(string str){
char c=str[str.length()-1];
for(int i=0;i<str.length()-1;i++){
if(str[i]=='+'){
if(c=='Z')
c='A';
else c++;
}
if(str[i]=='-'){
if(c=='A')
c='Z';
else c--;
}
}
string tem="";
tem+=c;
return tem;
}
int main(){
while(1){
string str;
cin>>str;
if(str==".")break;
for(int i=0;i<str.length();i++){
if(str[i]=='+'||str[i]=='-'){
int j;
for(j=i+1;str[j]=='+'||str[j]=='-';j++);
string n;
if(str[j]=='?')n="A";
else n=pm(str.substr(i,j-i+1));
str=str.substr(0,i)+n+str.substr(j+1,str.length()-j-1);
}
if(str[i]=='?')str[i]='A';
// cout<<str<<endl;
}
for(int i=0;i<str.length();i++){
if(str[i]=='['){
int j;
int co=1;
for(j=i+1;j<str.length();j++){
if(str[j]=='[')co++;
if(str[j]==']')co--;
if(co==0)break;
}
string n=rev(str.substr(i+1,j-i-1));
//cout<<n<<endl;
str=str.substr(0,i)+n+str.substr(j+1,str.length()-j-1);
}
}
cout<<str<<endl;
}
} |
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <queue>
using namespace std;
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
//container util
//------------------------------------------
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#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 SORT(c) sort((c).begin(),(c).end())
//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
int sz;
string S;
char add(char c, int d){
d = (d+26*5) % 26;
while(c+d > 'Z')
d -= 26;
return c+d;
}
string conv(int s, int e){
if(s >= e) return "";
if(S[s] == '['){
int cnt = 0, j = s;
for(;j<e;++j){
if(S[j] == '[') ++cnt;
else if(S[j] == ']'){
if(--cnt == 0) break;
}
}
string res1 = conv(s+1,j);
string res2 = conv(j+1, e);
reverse(ALL(res1));
return res1 + res2;
}
int d = 0;
for(;;++s){
if('A' <= S[s] && S[s] <= 'Z'){
string res(1, add(S[s],d));
res += conv(s+1,e);
return res;
}
else if(S[s] == '+') ++d;
else --d;
}
}
string dfs(int i){
if(i == SZ(S)){
return conv(0, sz);
}
if(S[i] != '?') return dfs(i+1);
string res(100, 'Z');
for(char c='A';c<='Z';++c){
S[i] = c;
res = min(res, dfs(i+1));
}
S[i] = '?';
return res;
}
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
while(cin>>S, S!="."){
sz = SZ(S);
cout << dfs(0) << endl;
}
return 0;
} |
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <iostream>
using namespace std;
typedef string::const_iterator State;
string expression(State &begin);
string letter(State &begin);
string letter(State &begin){
int next=0;
while(*begin=='+' || *begin=='-'){
if(*begin=='+')next++;
else next--;
begin++;
}
next=(next+*begin-'A'+26000)%26;
string res="";
res+=next+'A';
begin++;
return res;
}
string expression(State &begin){
string str="";
while(1){
if(*begin=='+' || *begin=='-' || (*begin>='A' && *begin<='Z')){
str+=letter(begin);
}else if(*begin=='['){
begin++;
string st=expression(begin);
begin++;
reverse(st.begin(),st.end());
str+=st;
}else break;
}
return str;
}
bool flag=false;
string str,res;
void dfs(int v){
if(v==str.size()){
State begin=str.begin();
string kt=expression(begin);
if(!flag || kt<res){
res=kt;
flag=true;
}
}else{
if(str[v]=='?'){
for(int i=0;i<26;i++){
str[v]='A'+i;
dfs(v+1);
}
str[v]='?';
}else dfs(v+1);
}
}
int main(void){
while(1){
cin >> str;
if(str==".")break;
flag=false;
dfs(0);
cout << res << endl;
}
return 0;
} |
#define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <iostream>
#include <cstdio>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
#include <cctype>
#include <utility>
using namespace std;
typedef long long ll;
typedef pair <int,char> PC;
typedef pair <int,string> PS;
static const double EPS = 1e-8;
int tx[] = {0,1,0,-1};
int ty[] = {-1,0,1,0};
PS Cipher(int pos,const string& str);
PS String(int pos,const string& str);
PC Letter(int pos,const string& str);
PS Cipher(int pos,const string& str){
string res="";
while(pos < str.size() && str[pos] != ']'){
PS p = String(pos,str);
pos = p.first;
res += p.second;
}
return PS(pos,res);
}
PC Letter(int pos,const string& str){
if(str[pos] == '+'){
PC p1 = Letter(pos+1,str);
p1.second = ((p1.second - 'A') + 1) % ('Z' - 'A' + 1) + 'A';
return p1;
}
else if(str[pos] == '-'){
PC p2 = Letter(pos+1,str);
p2.second = ((p2.second - 'A') + ('Z' - 'A')) % ('Z' - 'A' + 1) + 'A';
return p2;
}
else if(isalpha(str[pos])){
return PC(pos+1,str[pos]);
}
}
PS String(int pos,const string& str){
if(str[pos] == '['){
PS p1 = Cipher(pos+1,str);
reverse(p1.second.begin(),p1.second.end());
p1.first++;
return p1;
}
else{
string tmp = "";
PC p2 = Letter(pos,str);
tmp += p2.second;
return PS(p2.first,tmp);
}
}
string dfs(string str,
const vector<int>& question_pos,int idx){
if(idx == question_pos.size()){
return Cipher(0,str).second;
}
string res = string(500,'Z');
for(char i = 'A'; i <= 'Z'; i++){
str[question_pos[idx]] = i;
res = min(res,dfs(str,question_pos,idx+1));
}
return res;
}
int main(){
string str;
while(cin >> str){
if(str == ".") break;
vector<int> question_pos;
for(int i=0;i<str.size();i++){
if(str[i] == '?'){
question_pos.push_back(i);
}
}
cout << dfs(str,question_pos,0) << endl;
}
} |
#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <cmath>
#include <algorithm>
#include <functional>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define rep1(i,n) for(int i=1;i<=(n);++i)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
string s;
string ci(int &be);
string St(int &be){
if(s[be]=='['){
be++;
string a=ci(be);
be++;
reverse(all(a));
return a;
}else{
int cnt=0;
while(s[be]=='+'||s[be]=='-'){
if(s[be]=='+') cnt++;
else cnt--;
be++;
}
string l;
if(s[be]!='?') l=(s[be]-'A'+cnt+2600000)%26+'A';
else l="?";
be++;
return l;
}
}
string ci(int &be){
string ret;
while(s[be]!=']') ret+=St(be);
return ret;
}
int main(){
while(true){
cin>>s;
if(s[0]=='.') break;
s+=']';
int be=0;
string ans=ci(be);
rep(i,ans.size()) if(ans[i]=='?') ans[i]='A';
cout<<ans<<endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
int n;
string s;
map<int, char> mp;
string::const_iterator iter, end_;
string ans;
void consume(char ex) {
assert(ex == *iter);
iter++;
}
bool consume_if(char ex) {
if(ex == *iter) { consume(ex); return true; }
return false;
}
void rec(deque<char>& res, int qcnt = 0) {
int prog = 0;
while(iter != end_) {
if(isalpha(*iter)) {
res.push_back(char((*iter - 'A' + prog) % 26 + 'A'));
consume(*iter);
prog = 0;
}
else if(consume_if('+')) {
prog ++;
}
else if(consume_if('-')) {
prog --;
if(prog < 0) prog = 25;
}
else if(consume_if('[')) {
int pos = res.size();
rec(res);
assert(pos < (int)res.size());
reverse(res.begin() + pos, res.end());
}
else if(consume_if(']')) {
return;
}
else if(consume_if('?')) {
prog = 0;
res.push_back(mp[qcnt]);
qcnt ++;
}
}
if(iter == end_) {
string x;
rep(i, res.size()) {
x.push_back(res[i]);
}
ans = min(ans, x);
}
}
int main() {
while(1) {
cin >> s;
if(s == ".") break;
ans = string(88, 'Z');
n = s.size();
vector<int> qs;
rep(i, n) {
if(s[i] == '?') {
qs.push_back(i);
}
}
rep(i, pow(26, qs.size())) {
mp.clear();
int k = i;
rep(j, qs.size()) {
mp[j] = char('A' + (k % 26));
k /= 26;
}
iter = s.begin(), end_ = s.end();
deque<char> d;
rec(d);
}
cout << ans << endl;
}
return 0;
} |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-11;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
int k; vector<int> v; vector<string>x;
string in; int n;
void add(string s) {
stack<int> t;
string res;
int csum = 0;
rep(i, n) {
if (s[i] == '[') {
t.push(res.length());
}
else if (s[i] == ']') {
int le = t.top(); t.pop();
reverse(res.begin() + le, res.end());
}
else if (s[i] == '+') {
csum++;
}
else if (s[i] == '-') {
csum--;
}
else {
int j = s[i] - 'A';
j = ((j + csum) % 26 + 26) % 26;
res.push_back('A' + j);
csum = 0;
}
}
x.push_back(res);
return;
}
void trans(int i) {
if (i == k) {
add(in); return;
}
rep(j, 26) {
in[v[i]] = 'A' + j;
trans(i + 1);
}
return;
}
void solve() {
n = in.length();
k = 0; v.clear(); x.clear();
rep(i, n) {
if (in[i] == '?') {
k++; v.push_back(i);
}
}
trans(0);
int len = x.size();
string out = x[0];
rep(j, len) {
out = min(out, x[j]);
}
cout << out << endl;
}
int main(){
while (cin >> in) {
if (in == ".")break;
solve();
}
return 0;
}
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define all(in) in.begin(),in.end()
using namespace std;
typedef long long ll;
typedef int Def;
typedef pair<Def,Def> pii;
typedef vector<string> vs;
typedef vector<Def> vi;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9+10;
int main(){
string s;
while(cin>>s,s!="."){
int co=0;
string t="";
rep(i,s.size()){
if(s[i]=='+')co++;
else if(s[i]=='-')co--;
else if(s[i]=='?'){
co=0;
t+="A";
}else if(isalpha(s[i])){
int c=s[i]-'A';
c+=co;
c+=26*1000;
c%=26;
t+=(char)(c+'A');
co=0;
}else t+=s[i];
}
loop(i,2,t.size()){
rep(j,t.size())if(j+i<t.size()&&t[j]=='['&&t[j+i]==']'){
string T=t.substr(j+1,i-1);
reverse(all(T));
t=t.substr(0,j)+T+t.substr(j+i+1);
i--;
break;
}
}
cout<<t<<endl;
}
}
//[[a]]
|
#include <stdio.h>
#include <cctype>
#include <limits.h>
#include <math.h>
#include <complex>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cstring>
#include <string>
#include <sstream>
#include <algorithm>
#include <iomanip>
#include <iostream>
#define VARIABLE(x) cerr << #x << "=" << x << endl
#define BINARY(x) static_cast<bitset<16> >(x);
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for (int i=m;i<(int)(n);i++)
#define if_range(x, y, w, h) if (0<=(int)(x) && (int)(x)<(int)(w) && 0<=(int)(y) && (int)(y)<(int)(h))
const int INF = 1000000000;
const double EPS = 1e-8;
const double PI = 3.14159;
int dx[4]={0, 1, 0, -1}, dy[4]={-1, 0, 1, 0};
using namespace std;
//typedef pair<int, int> P;
struct P {
int x, y;
P(int x, int y):x(x), y(y){}
P(){}
};
/** Problem2584 : Broken Cipher Generator **/
string s;
int p;
string String();
char Letter();
string Cipher()
{
string res;
while (1) {
if (p>=s.size()) {
break;
}
res += String();
}
return res;
}
string String()
{
if (s[p]=='[') {
p++;
string t;
while (s[p]!=']')
t+=String();
string res;
for (int i=(int)t.size()-1; i>=0; i--) {
res += t[i];
}
p++;
return res;
} else {
string res; res+=Letter();
return res;
}
}
char Letter()
{
if (s[p]=='+') {
p++;
char c = Letter();
if (c=='Z') return 'A';
else return (char)(c+1);
} else if (s[p] == '-') {
p++;
char c = Letter();
if (c=='A') return 'Z';
else return (char)(c-1);
} else {
return s[p++];
}
}
int main()
{
string t;
while (cin>>t, t!=".") {
p = 0;
int tt=0;
s="";
rep(i, t.size()) {
if (t[i]=='-' || t[i]=='+') {
tt++;
} else if (('A' <= t[i] && t[i] <= 'Z') || t[i]=='[' || t[i]==']') {
for (int j=i-tt; j<=i; j++) {
s+=t[j];
}
tt = 0;
} else if (t[i]=='?') {
s+='A';
tt = 0;
}
}
cout << Cipher() << endl;
}
} |
#include<iostream>
using namespace std;
string s,t;
int len,p;
void rec(){
int cnt=0;
while(p<len&&s[p]!=']'){
if(s[p]=='+'){
cnt++;
}else if(s[p]=='-'){
cnt+=25;
}else if(s[p]=='['){
p++;
int l=t.size();
rec();
int r=t.size()-1;
while(l<r){swap(t[l],t[r]);l++;r--;}
}else if(s[p]=='?'){
t.push_back('A');
cnt=0;
}else{
int ch=(s[p]-'A'+cnt)%26;
t.push_back((char)(ch+'A'));
cnt=0;
}
p++;
}
}
int main(){
while(1){
cin>>s;
if(s==".")break;
t="";
p=0;
len=s.size();
rec();
cout<<t<<endl;
}
return 0;
} |
#include<iostream>
#include <string>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;
int main()
{
while(1){
string s;cin>>s;
if(s==".")break;
stack<int> st;
vector<pair<int,int>>moji;
int cnt=0;
for(int i=0;i<s.size();i++){
if(s[i]=='+')cnt++;
else if(s[i]=='-')cnt--;
else if(s[i]=='['){
st.push(moji.size());
}
else if(s[i]==']'){
int l = st.top();st.pop();
reverse(moji.begin()+l,moji.begin()+moji.size());
}
else if(s[i]=='?'){
moji.push_back(make_pair(0,cnt));
cnt=0;
}
else{
moji.push_back(make_pair(s[i],cnt));
cnt=0;
}
}
string ans;
for(int i=0;i<moji.size();i++){
int cnt = moji[i].second;
cnt += 26*4;
cnt%=26;
char c = moji[i].first;
if(c==0)ans.push_back('A');
else{
for(int j=0;j<cnt;j++){
c++;
if(c>'Z')c='A';
}
ans.push_back(c);
}
}
cout<<ans<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=n-1; i>=0; i--)
using namespace std;
string s;
char *p;
string solve(){
string ret;
int cnt=0;
for(;;){
if(*p == '+'){
cnt++;
}else if(*p == '-'){
cnt--;
}else if(*p == '['){
p++;
auto r=solve();
rrep(i, r.size()) ret += r[i];
}else if(*p == ']' || *p == 0){
return ret;
}else{
ret += (char)((*p-'A'+cnt+260)%26+'A');
cnt = 0;
}
p++;
}
}
int main(){
for(;;){
string ss;
cin >> ss;
if(ss == ".") break;
string ret= "z";
rep(i,26) rep(j,26) rep(k,26){
s = "";
int a=0;
for(auto c:ss){
if(c=='?'){
if(a==0) c=i+'A';
if(a==1) c=j+'A';
if(a==2) c=k+'A';
a++;
}
s += c;
}
p = &s[0];
auto r = solve();
ret = min(ret, r);
}
cout << ret << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
string s;
int now=0;
string solve();
string fplus();
string sub();
string rev();
int main(){
int i;
while(1){
cin >> s;
if(s==".")break;
now=0;
cout << solve() << endl;
}
return 0;
}
string solve(){
string ans;
while(now<s.size()){
now++;
if((s[now-1]>='A'&&s[now-1]<='Z')||s[now-1]=='?')ans+=s[now-1];
else if(s[now-1]=='+')ans+=fplus();
else if(s[now-1]=='-')ans+=sub();
else if(s[now-1]=='[')ans+=rev();
}
for(int i=0;i<ans.size();i++)if(ans[i]=='?')ans[i]='A';
return ans;
}
string fplus(){
string ans;
now++;
if(s[now-1]=='+')ans=fplus();
else if(s[now-1]=='-')ans=sub();
else ans = s[now-1];
if(ans=="Z")ans="A";
else if(ans=="?")ans="?";
else ans=ans[0]+1;
return ans;
}
string sub(){
string ans;
now++;
if(s[now-1]=='+')ans=fplus();
else if(s[now-1]=='-')ans=sub();
else ans = s[now-1];
if(ans=="A")ans="Z";
else if(ans=="?")ans="?";
else ans=ans[0]-1;
return ans;
}
string rev(){
string ans;
while(s[now]!=']'){
now++;
if((s[now-1]>='A'&&s[now-1]<='Z')||s[now-1]=='?')ans+=s[now-1];
else if(s[now-1]=='+')ans+=fplus();
else if(s[now-1]=='-')ans+=sub();
else if(s[now-1]=='[')ans+=rev();
}
now++;
reverse(ans.begin(),ans.end());
return ans;
}
|
#include<bits/stdc++.h>
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
using namespace std;
string text;
int pos;
string String();
string Cipher();
string Letter(){
int coef = 0;
while( text[pos] == '+' || text[pos] == '-' ) {
coef += ((text[pos]=='+')?1:-1);
++pos;
}
if( 'A' <= text[pos] && text[pos] <= 'Z' ) {
int value = ( text[pos] - 'A' + coef ) % 26;
while( value < 0 ) value += 26;
++pos;
return string(1,(char)( 'A' + value));
} else {
++pos;
return "?";
}
}
string String(){
string ret = "";
if( text[pos] == '[' ) {
++pos;
ret = Cipher();
++pos;
reverse(ret.begin(),ret.end());
} else {
ret = Letter();
}
return ret;
}
string Cipher(){
string ret = "";
while( pos < text.size() && ( text[pos] == '[' || text[pos] == '+' || text[pos] == '-' || text[pos] == '?' || isalpha(text[pos]) ) ) ret += String();
return ret;
}
int main(){
while( cin >> text, text[0] != '.' ){
pos = 0;
string s = Cipher();
rep(i,s.size()) if( s[i] == '?' ) s[i] = 'A';
cout << s << endl;
}
return 0;
} |
#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;
inline bool isAlpha(char c){ return 'A' <= c && c <= 'Z'; }
string parse(string & str, int & pos){
string ret;
while(pos < str.size() && str.at(pos) != ']'){
if(str.at(pos) == '['){
pos++;
string diff = parse(str, pos);
reverse(all(diff));
ret += diff;
pos++;
}
else {
ret.pb(str.at(pos));
pos++;
}
}
return ret;
}
vs strs;
void dfs(string str){
bool ok = true;
for(char & c : str){
if(c != '?') continue;
ok = false;
rep(i, 26){
c = 'A' + i;
dfs(str);
}
}
if(!ok) return;
string s;
int delta = 0;
for(char c : str){
if(c == '+') delta++;
else if(c == '-') delta--;
else {
if(isAlpha(c)) s.pb((c - 'A' + delta + 26 * 10) % 26 + 'A');
else s.pb(c);
delta = 0;
}
}
strs.pb(s);
}
int main(void){
for(string str; cin >> str, str != ".";){
//アルファベットを埋めて禅探索
strs = vs();
dfs(str);
string res;
rep(i, 1000) res.pb('Z');
for(auto cur : strs){
int pos = 0;
res = min(res, parse(cur, pos));
}
cout << res << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
using i64 = int64_t;
pair<string, int> Cipher(string s, int idx);
pair<string, int> Cipher_(string s, int idx);
pair<string, int> String(string s, int idx);
pair<string, int> Letter(string s, int idx);
pair<string, int> Cipher(string s, int idx){
auto res = String(s, idx);
auto p = Cipher_(s, idx+res.second);
res.first += p.first;
res.second += p.second;
return res;
}
pair<string, int> Cipher_(string s, int idx){
if(idx >= s.size() || s[idx] == ']'){
return make_pair("", 0);
}
auto res = String(s, idx);
auto p = Cipher_(s, idx+res.second);
res.first += p.first;
res.second += p.second;
return res;
}
pair<string, int> String(string s, int idx){
pair<string, int> res;
if(s[idx] == '['){
res = Cipher(s, idx+1);
reverse(res.first.begin(), res.first.end());
res.second += 2;
}else{
res = Letter(s, idx);
string str = res.first;
if(str[0] == '?')str[0] = 'A';
res.first = str;
}
return res;
}
pair<string, int> Letter(string s, int idx){
pair<string, int> res;
if(s[idx] == '+'){
auto p = Letter(s, idx+1);
string str = p.first;
char c = str.back();
if(c != '?'){
if(c == 'Z')str[str.size()-1] = 'A';
else str[str.size()-1]++;
}
res = make_pair(str, p.second+1);
}else if(s[idx] == '-'){
auto p = Letter(s, idx+1);
string str = p.first;
char c = str.back();
if(c != '?'){
if(c == 'A')str[str.size()-1] = 'Z';
else str[str.size()-1]--;
}
res = make_pair(str, p.second+1);
}else{
res = make_pair(s[idx], 1);
}
return res;
}
int main(){
string s;
while(cin >> s, s != "."){
cout << Cipher(s, 0).first << 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 <deque>
#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;
string S;
string ans;
int p=0;
void parse(int cnt){
if(p==S.size()) return;
if(S[p] == '['){
p++;
int l = ans.size();
parse(cnt);
reverse(ans.begin()+l,ans.begin()+ans.size());
p++;
parse(cnt);
}else if(S[p]==']'){
return;
}else if('A' <= S[p] && S[p] <= 'Z'){
ans += 'A' + ((S[p]-'A'+cnt+2600000)%26);
cnt = 0;
p++;
parse(cnt);
}else if(S[p] == '?'){
ans += 'A';
cnt = 0;
p++;
parse(cnt);
}else if(S[p] == '+'){
cnt++;
p++;
parse(cnt);
}else if(S[p] == '-'){
cnt--;
p++;
parse(cnt);
}
return;
}
int main(){
while(1){
cin>>S;
if(S==".") break;
ans = "";
p=0;
parse(0);
cout<<ans<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef int64_t Int;
#define all(x) (x).begin(), (x).end()
const double EPS = 1e-10;
const Int INF = 1e18;
const int inf = 1e9;
const Int mod = 1e9+7;
bool print_space_enable = false;
void print() {
cout << '\n';
print_space_enable = false;
}
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
if (print_space_enable) cout << " ";
cout << fixed << setprecision(15) << head;
print_space_enable = true;
print(std::forward<Tail>(tail)...);
}
template<typename T>
void print(vector<T> v) {
for (size_t i = 0; i < v.size(); i++) {
if (i > 0) std::cout << " ";
std::cout << v[i];
}
std::cout << std::endl;
}
void f(vector<pair<char, Int>> &v, Int l, Int r) {
vector<pair<char, Int>> vv;
for (Int i = l; i <= r; i++) {
vv.push_back(v[i]);
}
reverse(all(vv));
for (Int i = l; i <= r; i++) {
v[i] = vv[i - l];
}
}
int main() {
string s;
while (cin >> s and s != ".") {
vector<pair<char, Int>> v;
Int cnt = 0;
for (Int i = 0; i < (Int)s.size(); i++) {
if (s[i] == '+') {
cnt = (cnt + 1) % 26;
} else if (s[i] == '-') {
cnt = (cnt - 1 + 26) % 26;
} else {
v.emplace_back(s[i], cnt);
cnt = 0;
}
}
stack<Int> st;
for (Int i = 0; i < (Int)v.size(); i++) {
if (v[i].first == '[') {
st.push(i);
}
if (v[i].first == ']') {
f(v, st.top() + 1, i - 1);
st.pop();
}
}
string t = "";
for (Int i = 0; i < (Int)v.size(); i++) {
if (v[i].first == '[' or v[i].first == ']') continue;
if (v[i].first == '?') {
// Int x = (26 - v[i].second) % 26;
// t.push_back('A' + x);
t.push_back('A');
} else {
Int x = v[i].first - 'A';
t.push_back('A' + (v[i].second + x) % 26);
}
}
cout << t << '\n';
}
return 0;
}
|
#include <iostream>
#include<vector>
#include <algorithm>
#include<string>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
int main(){
string g,h;
int i = 0;
vector<int>ireko;
bool LeftKakko = false;
int k = 0;
while ((std::cin >> g), g != "."){
REP(l, g.length()){
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 <bits/stdc++.h>
#define mod ('Z'-'A'+1)
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++;
if(cnt) res+=((str[i]-'A')+cnt%mod+mod)%mod+'A';
else res += str[i];
if(str[i]=='?')res[res.size()-1]='A';
}
for(int i=0;i<res.size();i++){
if(res[i]=='['){
res[i]=']';
int c=1,j=i+1;
while(c){
if(res[j]=='[')res[j]=']',c++;
else if(res[j]==']')res[j]='[',c--;
j++;
}
reverse(res.begin()+i,res.begin()+j);
res.erase(res.begin()+j-1),res.erase(res.begin()+i);
i--;
}
}
return res;
}
int main(){
while(1){
cin>>str;
if(str==".")break;
cout <<solve()<<endl;
}
return 0;
} |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<(n);i++)
#define loop(i,a,n) for(i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
int main(void) {
int i,j;
string s;
while(cin >> s, s != "."){
string ans = "";
stack<int> st;
int tmp = 0;
rep(i,s.size()){
if(s[i] >= 'A' && s[i] <= 'Z'){
ans += 'A' + (s[i] - 'A' + 260 + tmp)%26;
tmp = 0;
}else if(s[i] == '['){
st.push(ans.size());
}else if(s[i] == ']'){
string t = ans.substr(st.top());
reverse(all(t));
ans = ans.substr(0,st.top()) + t;
st.pop();
}else if(s[i] == '+'){
tmp++;
}else if(s[i] == '-'){
tmp--;
}else if(s[i] == '?'){
ans += 'A';
tmp = 0;
}
//cout << i << " " << s[i]<< " " << ans << endl;
}
cout << ans << endl;
}
}
|
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <numeric>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <functional>
#include <complex>
#include <stack>
#include <tuple>
#include <array>
using namespace std;
#define rep(i,n) for (int i=0; i < (n); i++)
typedef long long int ll;
typedef double D; // ???§??¨?????????????double???long double?????????
typedef complex<D> P; // Point
typedef pair<P, P> L; // Line
typedef vector<P> VP;
const int INF = (1<<30) - 1;
const D EPS = 1e-9;
#define X real()
#define Y imag()
#define LE(n,m) ((n) < (m) + EPS)
#define GE(n,m) ((n) + EPS > (m))
#define EQ(n,m) (abs((n)-(m)) < EPS)
string S;
string dfs(int s, int t){
string ret = "";
while(s<t){
char c = S[s];
if(c == '['){
int count = 0;
for(int i=s; i<t; i++){
if(S[i] == '[') count++;
if(S[i] == ']') count--;
if(count == 0){
string tret = dfs(s+1, i);
reverse(tret.begin(), tret.end());
ret += tret;
s = i;
break;
}
}
}else{
int count = 0;
while(S[s] == '+' || S[s] == '-'){
if(S[s] == '+')
count++;
else if(S[s] == '-')
count--;
s++;
}
if(S[s] == '?')
ret += 'A';
else
ret += ((S[s]-'A'+count)%26+26)%26 + 'A';
}
s++;
}
return ret;
}
//g++ -std=c++0x -msse4.2 -O3
//#include <bits/stdc++.h>
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
//cout.precision(16);
while(cin>>S, S!=".")
cout << dfs(0, S.length()) << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
string s;
int n;
string parse(int &i) {
string t;
while (i < n) {
if (s[i] == '[') {
i++;
string tmp = parse(i);
reverse(tmp.begin(), tmp.end());
t += tmp;
} else {
if (s[i] == ']') break;
t += s[i];
}
i++;
}
return t;
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(10);
while (cin >> s, s != ".") {
n = s.size();
int l = 0, r = 0;
string t;
while (l < n) {
while (l < n && (s[l] != '+' && s[l] != '-')) {
t += (s[l] == '?' ? 'A' : s[l]);
l++, r++;
}
int tmp = 0;
while (r < n && (s[r] == '+' || s[r] == '-')) {
if (s[r] == '+') tmp++;
else tmp--;
r++;
}
if (r < n) {
if (s[r] == '?') {
t += 'A';
} else {
tmp += (s[r]-'A');
tmp %= 26;
while (tmp < 0) tmp += 26;
t += char(tmp+'A');
}
}
l = ++r;
}
s = t;
n = s.size();
int i = 0;
cout << parse(i) << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
string s;
while(cin>>s && s!="."){
int n = s.size();
stack<string> st;
int k = 0;
string tmp;
rep(i,n){
if(s[i]=='['){
st.push(tmp);
tmp ="";
}else if(s[i]==']'){
auto x = st.top();
st.pop();
reverse(tmp.begin(),tmp.end());
tmp = x + tmp;
}else if(s[i]=='-'){
k--;
}else if(s[i]=='+'){
k++;
}else if(s[i]=='?'){
k = 0;
tmp.push_back('?');
}else{
char c = s[i];
if(k<0){
while(k!=0){
if(c=='A'){
c = 'Z';
}else{
c--;
}
k++;
}
}
if(k>0){
while(k!=0){
if(c=='Z'){
c = 'A';
}else{
c++;
}
k--;
}
}
tmp.push_back(c);
}
}
rep(i,tmp.size()){
if(tmp[i]=='?'){
tmp[i] = 'A';
}
}
cout << tmp << "\n";
}
return 0;
}
|
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
string sol[100];
int nsol;
string inp;
int n;
int c;
while(1){
cin>>inp;
if(inp==".") break;
n=0;
c=0;
for(int i=0;i<100;i++) sol[i]="";
for(int i=0;i<inp.size();i++){
switch(inp[i]){
case '+':
c++;
break;
case'-':
c--;
break;
case'?':
sol[n]+='A';
c=0;
break;
case'[':
n++;
break;
case']':
reverse(sol[n].begin(),sol[n].end());
sol[n-1]+=sol[n];
sol[n]="";
n--;
break;
default:
nsol=(inp[i]-'A'+c)%26;
if(nsol<0) nsol+=26;
sol[n]+=nsol+'A';
c=0;
break;
}
}
cout<<sol[0]<<endl;
}
return 0;
} |
#include <iostream>
#include <algorithm>
#include <string>
#include <cctype>
using namespace std;
typedef string::const_iterator State;
char Letter(State& begin){
char ret = *begin;
++begin;
return ret;
}
char term(State& begin){
char x;
int d=0;
while(true){
char c = *begin;
if(c=='+'){
++d;
++begin;
}
else if(c=='-'){
--d;
++begin;
}
else break;
}
x = Letter(begin);
if(x=='?') return 'A';
d+=x-'A';
d = (d+80*26)%26;
return (char)('A'+d);
}
string Ciper(State& begin){
string ret="";
while(true){
char c = *begin;
if(c=='\0') break;
else if(c=='['){
++begin;
string t = Ciper(begin);
++begin;
reverse(t.begin(),t.end());
ret+=t;
}
else if(c==']') break;
else ret+=term(begin);
}
return ret;
}
int main(){
string s;
while(cin>>s,s!="."){
State begin = s.begin();
//cout << term(begin) << endl;
cout << Ciper(begin) << endl;
}
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
#include <limits>
#include <string>
using namespace std;
int main(void) {
for (;;) {
string input,buf;
cin >> input;
if (input == ".")return 0;
int cnt = 0;
for (char a : input) {
switch (a) {
case '+':
cnt++;
break;
case '-':
cnt--;
break;
case '[':
case ']':
buf += a;
break;
case '?':
buf += 'A';
cnt = 0;
break;
default:
a += cnt % 26;
buf += (a<'A') ? a + 26 : (a>'Z') ? a - 26 : a;
cnt = 0;
break;
}
}
bool update;
do {
input = buf;
update = false;
int start;
for (int i = 0; i < input.size();i++) {
if (input[i] == '[')start = i;
if (input[i] == ']') {
buf = string(input.begin(), input.begin() + start);
buf.append(input.rend() - i, input.rend() - start - 1);
buf.append(input.begin() + i + 1, input.end());
update = true;
break;
}
}
} while (update);
cout << buf << endl;
}
} |
#include<bits/stdc++.h>
#define N 100
#define M 26
using namespace std;
string s;
int p,l;
string bnf(){
string r;
int 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;
string a=bnf();
for(int i=0;i<a.size();i++)
if(a[i]=='?')a[i]='A';
cout<<a<<endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
string cipher(string& s, int& index);
string str(string& s, int& index);
char letter(string& s, int& index);
string cipher(string& s, int& index){
string ret = str(s, index);
while(true){
if(s[index] == '#' || s[index] == ']'){
break;
}
else{
ret += str(s, index);
}
}
return ret;
}
string str(string& s, int& index){
if(s[index] == '['){
index++;
string temp = cipher(s, index);
index++;
reverse(temp.begin(), temp.end());
return temp;
}
else{
string ret = "";
ret += letter(s, index);
return ret;
}
}
char letter(string& s, int& index){
if(s[index] == '+'){
index++;
char temp = letter(s, index);
int tempInt = temp - 'A';
tempInt = (tempInt + 1) % 26;
return 'A' + tempInt;
}
else if(s[index] == '-'){
index++;
char temp = letter(s, index);
int tempInt = temp - 'A';
tempInt = (tempInt - 1 + 26) % 26;
return 'A' + tempInt;
}
else{
char ret = s[index];
index++;
return ret;
}
}
string replaceQ(string s, int cnt, vector<int>& qIndexList, int depth){
if(cnt == depth){
string temp = s + '#';
int index = 0;
return cipher(temp, index);
}
string ret = "";
for(int i = 0; i < 26; i++){
char c = 'A' + i;
string temp = s;
temp[qIndexList[depth]] = c;
string statement = replaceQ(temp, cnt, qIndexList, depth + 1);
if(ret == ""){
ret = statement;
}
else{
if(statement < ret){
ret = statement;
}
}
}
return ret;
}
int main(){
while(true){
string s;
cin >> s;
if(s == "."){
break;
}
int cnt = 0;
vector<int> qIndexList;
for(int i = 0; i < (int)s.size(); i++){
if(s[i] == '?'){
cnt++;
qIndexList.push_back(i);
}
}
string ans = replaceQ(s, cnt, qIndexList, 0);
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
typedef string::const_iterator state;
string Cipher(state &begin);
string String(state &begin);
string Letter(state &begin);
string Letter(state &begin){
string s;
int count = 0;
while(1){
if(*begin=='+'){
count +=1;
begin++;
}else if(*begin=='-'){
count -=1;
begin++;
}else{
break;
}
}
char k = *begin;
begin++;
if(k=='?'){
k = 'A';
}else if(k+count>'Z'){
k = 'A'+(k+count-'Z'-1)%26;
}else if(k+count<'A'){
k = 'Z'-('A'-k-count-1)%26;
}else{
k += count;
}
s.push_back(k);
return s;
}
string String(state &begin){
if(*begin =='['){
begin++;
string s = Cipher(begin);
reverse(s.begin(),s.end());
begin++;
return s;
}else{
string s = Letter(begin);
return s;
}
}
string Cipher(state &begin){
string s;
while(1){
if(*begin =='['){
s += String(begin);
}else if((*begin>='A'&&*begin<='Z')||*begin=='+'||*begin=='-'||*begin=='?'){
s += Letter(begin);
}else{
break;
}
}
return s;
}
int main(){
string s;
while(cin>>s && s!="."){
state begin = s.begin();
cout << Cipher(begin) << endl;
}
return 0;
} |
#include <bits/stdc++.h>
class Solve {
private:
std::string str;
int length;
std::string decodeCipher(int& s_i)
{
std::string ret;
while (s_i != length && str[s_i] != ']')
ret += decodeString(s_i);
return ret;
}
std::string decodeString(int& s_i)
{
if (str[s_i] == '[')
{
s_i++;
std::string ret{decodeCipher(s_i)};
std::reverse(ret.begin(), ret.end());
s_i++;
return ret;
}
else
{
return decodeLetter(s_i);
}
}
std::string decodeLetter(int& s_i)
{
if (str[s_i] == '+')
{
s_i++;
std::string ret{decodeLetter(s_i)};
if (ret.front() != '?')
ret.front() = (ret.front() - 'A' + 1) % 26 + 'A';
return ret;
}
else if (str[s_i] == '-')
{
s_i++;
std::string ret{decodeLetter(s_i)};
if (ret.front() != '?')
ret.front() = (ret.front() - 'A' + 25) % 26 + 'A';
return ret;
}
else
{
s_i++;
return std::string(1, str[s_i - 1]);
}
}
public:
bool is_last_query{};
Solve()
{
std::cin >> str;
if (str == ".")
{
is_last_query = true;
return;
}
length = (int)str.size();
int s_i{};
std::string ans{decodeCipher(s_i)};
for (auto& e: ans)
if (e == '?') putchar('A');
else putchar(e);
putchar('\n');
}
};
int main()
{
while (!Solve().is_last_query);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
template<typename T>
bool chmin(T &a,T b){
if(a<=b)return 0;
a=b;
return 1;
}
string d(string s){
int n = s.size();
int now = 0;
string ret = "";
bool fi = true;
for(int i=0;i<n;i++){
if(s[i] == '['){
now++;
if(fi){
fi = false;
continue;
}
if((fi==false) && now == 1)break;
if(now == 2)ret += d(s.substr(i));
}
else if(s[i] == ']'){
now--;
}
else if(now==1)ret += s[i];
if(now == 0)break;
}
//cerr << s << " " << ret << endl;
reverse(ret.begin(),ret.end());
return ret;
}
string f(string s){
int n = s.size();
int now = 0;
string ret = "";
for(int i=0;i<n;i++){
if(s[i] == '['){
now++;
if(now == 1) ret += d(s.substr(i));
}
else if(s[i] == ']') now--;
else if(now == 0){
ret += s[i];
}
}
return ret;
}
signed main(){
//ofstream cout("out.txt");
string s;
while(cin>>s){
if(s == ".")break;
string t;
int n = s.size();
int now = 0;
for(int i=0;i<n;i++){
if(s[i] == '+'){
now++;
now %= 26;
}
else if(s[i] == '-'){
now += 25;
now %= 26;
}
else if(s[i] == '?'){
t += 'A';
now = 0;
}
else if(s[i] == '[' || s[i] == ']') t += s[i];
else{
int c = s[i]-'A';
c += now;
c %= 26;
t += (char)('A'+c);
now=0;
}
}
// cerr << t << endl;
cout << f(t) << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
string cip(const string& s,int& i);
string let(const string& s,int& i)
{
if(s[i]=='+' || s[i]=='-'){
char op=s[i++];
char c=let(s,i)[0];
if(op=='+') c=c=='?'?c:c=='Z'?'A':c+1;
if(op=='-') c=c=='?'?c:c=='A'?'Z':c-1;
return string(1,c);
}
return s.substr(i++,1);
}
string str(const string& s,int& i)
{
if(s[i]=='['){
i++; string t=cip(s,i); i++;
return string(t.rbegin(),t.rend());
}
return let(s,i);
}
string cip(const string& s,int& i)
{
string t=str(s,i);
if(i<s.size() && s[i]!=']')
t+=cip(s,i);
return t;
}
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>
#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;
string s,ans;
stack<int> st;
void bng(unsigned int pos,int diff){
if(pos==s.size()) return;
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;
}
bng(pos+1,(diff+26)%26);
}
int main(){
while(cin>>s){
if(s==".") break;
ans="";
bng(0,0);
p(ans);
}
return 0;
} |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
string parse(string& str, int& pos) {
string res;
int cnt = 0;
for(; pos < str.size(); ++pos) {
if(str[pos] == '+') {
cnt++;
if(cnt == 26) {
cnt = 0;
}
} else if(str[pos] == '-') {
cnt--;
if(cnt == -26) {
cnt = 0;
}
} else if(str[pos] == '?') {
res += 'A';
cnt = 0;
} else if(str[pos] == '[') {
pos++;
string s = parse(str, pos);
reverse(s.begin(), s.end());
res += s;
} else if(str[pos] == ']') {
return res;
} else {
res += 'A' + (str[pos] - 'A' + cnt + 26) % 26;
cnt = 0;
}
}
return res;
}
int main()
{
string s;
while(cin >> s, s!= ".") {
int pos = 0;
cout << parse(s, pos) << endl;
}
} |
#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>
using namespace std;
#define LOG(...) printf(__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((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))
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;
const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };
int main() {
string s;
while (cin >> s, s != "."){
vector<int> vi;
vector<int> vi2;
int a = 0;
for (int i = 0; i < s.length(); i++){
if (s[i] == '+')a++;
if (s[i] == '-')a--;
if (s[i] == '[')vi2.push_back(vi.size());
if (s[i] == ']'){
reverse(vi.begin() + vi2.back(), vi.begin() + vi.size());
vi2.pop_back();
}
if (s[i] == '?'){
vi.push_back('A');
a = 0;
}
if (s[i] >= 'A'&&s[i] <= 'Z'){
while (s[i] + a < 'A')a += 26;
while (s[i] + a > 'Z')a -= 26;
vi.push_back(s[i]+a);
a = 0;
}
}
string s2="";
for (int i = 0; i < vi.size(); i++){
s2 += vi[i];
}
cout << s2 << endl;
}
} |
#define _USE_MATH_DEFINES
#include <cmath>
#include <string>
#include <vector>
#include <utility>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <numeric>
#include <array>
#include <float.h>
#include <memory>
#include <functional>
#include <iomanip>
#include <queue>
#include <random>
#include <map>
#include <set>
#pragma warning(disable:4996)
using namespace std;
using Iterator = std::string::iterator;
std::string String(Iterator& it);
char Letter(Iterator& it);
std::string Cipher(Iterator& it) {
if (*it == ']') {
++it;
return "";
}
if (*it == '.') {
return "";
}
else {
auto str = String(it);
return str + Cipher(it);
}
}
std::string String(Iterator& it) {
if (*it == '[') {
auto str = Cipher(++it);
reverse(str.begin(), str.end());
return str;
}
else {
return std::string({ Letter(it) });
}
}
char Letter(Iterator& it) {
if (*it == '+') {
char tmp = Letter(++it);
return tmp == 127 ? tmp : tmp + 1;
}
else if (*it == '-') {
char tmp = Letter(++it);
return tmp == 127 ? tmp : tmp - 1;
}
else {
char tmp = *it;
++it;
return tmp == '?' ? 127 : tmp - 'A';
}
}
int main() {
while (true) {
string input;
cin >> input;
if (input == ".") {
break;
}
input += ".";
auto it = input.begin();
auto str = Cipher(it);
for (auto& v : str) {
if (v == 127) {
v = 'A';
continue;
}
v %= 26;
v += 26;
v %= 26;
v += 'A';
}
cout <<str << endl;
}
return 0;
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define INF 100000000
#define EPS 1e-10
#define MOD 1000000007
using namespace std;
string str;
string func(string s){
string ret;
int cnt = 0;
rep(i,s.size()){
if(s[i] == '['){
int checker = 0;
string tmp;
while(true){
i++;
if(s[i] == '[') checker++;
if(s[i] == ']' && checker == 0) break;
if(s[i] == ']') checker--;
tmp.push_back(s[i]);
}
ret += func(tmp);
} else if(s[i] == '?'){
ret.push_back('A');
cnt = 0;
} else if(s[i] == '+'){
cnt++;
} else if(s[i] == '-'){
cnt--;
} else{
int x = s[i]-'A';
x += cnt;
x += 26*10;
x %= 26;
ret.push_back('A'+x);
cnt = 0;
}
}
reverse(ret.begin(),ret.end());
return ret;
}
void solve(){
string ans = func(str);
reverse(ans.begin(),ans.end());
cout << ans << endl;
}
int main(){
while(cin >> str){
if(str == ".") break;
solve();
}
} |
#include "bits/stdc++.h"
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
using pii=pair<int, int>;
string Cipher(string& s, int& idx);
string String(string& s, int& idx);
char Letter(string& s, int& idx);
string Cipher(string& s, int& idx) {
string ret;
while (1) {
if (idx == s.size() || s[idx] == ']') {
break;
}
ret += String(s, idx);
}
return ret;
}
string String(string& s, int& idx) {
if (s[idx] == '[') {
idx++;
string tmp = Cipher(s, idx);
idx++;
reverse(tmp.begin(), tmp.end());
return tmp;
}
else {
return string(1, Letter(s, idx));
}
}
char Letter(string& s, int& idx) {
int d = 0;
while (1) {
if (s[idx] == '+') {
d++;
idx++;
}
else if (s[idx] == '-') {
d--;
idx++;
}
else {
int x = s[idx] - 'A';
if (s[idx] == '?') {
x = 'A';
}
else {
x = (x + d % 26 + 26) % 26 + 'A';
}
idx++;
return x;
}
}
}
string solve(string s) {
int i = 0;
return Cipher(s, i);
}
signed main() {
while (1) {
string s;
cin >> s;
if (s == ".") break;
cout << solve(s) << endl;
}
}
|
#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!="."))
{
int ct=0;
rep(i,s.size()) ct+=(s[i]=='?');
int lim=1;
rep(i,ct) lim*=26;
string ans(100,'z');
rep(mask,lim)
{
int t=mask;
string im(ct,' ');
rep(i,ct)
{
im[i]='A'+t%26;
t/=26;
}
int c=0;
string ss=s;
rep(i,ss.size())
{
if(ss[i]=='?') ss[i]=im[c++];
}
ans=min(ans,C(ss));
}
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('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]=='Z') r[0]='A';
else ++r[0];
return r;
}
else if(x[0]=='-')
{
string r=L(x.substr(1));
if(r[0]=='A') r[0]='Z';
else --r[0];
return r;
}
else return x;
} |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
using state = string::const_iterator;
string expr(state &cur, string t = ""){
int v = 0;
while(true){
if(isalpha(*cur)){
t += (char)((*cur-'A'+v+260)%26+'A');
cur++;
v = 0;
} else if(*cur == '?') {
t += 'A';
cur++;
v = 0;
} else if(*cur == '+') {
v++;
cur++;
} else if(*cur == '-') {
v--;
cur++;
} else if(*cur == '[') {
cur++;
string u = expr(cur);
reverse(u.begin(),u.end());
t += u;
cur++;
}else break;
}
return t;
}
int main() {
string s;
while(cin >> s, s != "."){
state cur = s.begin();
string t = expr(cur), ans;
int v = 0;
for (auto &&i : t) {
if(isalpha(i)) ans += (char)((i-'A'+v+26)%26+'A'), v = 0;
else if(i == '?') ans += 'A', v = 0;
else if(i == '+') v++;
else v--;
}
cout << ans << "\n";
}
return 0;
}
|
#include <functional>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <iomanip>
#include <utility>
#include <cstdlib>
#include <sstream>
#include <bitset>
#include <vector>
#include <cstdio>
#include <ctime>
#include <queue>
#include <deque>
#include <cmath>
#include <stack>
#include <list>
#include <map>
#include <set>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define dump(x) cerr << #x << " = " << (x) << endl
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
#define sz size()
const double EPS = 1e-10;
const int INF = 100000000;
char add(char ch,int x){
x=x%26;
ch+=x;
if(ch<'A'){
ch+=26;
}
else if(ch>'Z'){
ch-=26;
}
return ch;
}
string doPlusMinas(string s){
string ret="";
int now=0;
rep(i,s.sz){
if(s[i]=='[' || s[i]==']'){
ret+=s[i];
}
else if(s[i]=='+')now++;
else if(s[i]=='-')now--;
else if(s[i]>='A' && s[i]<='Z'){
ret+=add(s[i],now);
now=0;
}
else if(s[i]=='?'){
ret+='A';
now=0;
}
}
return ret;
}
string rev(string s){
string ret="";
rep(i,s.sz){
int spoint=-1;
int count=0;
if(s[i]=='['){
int sum=1;
spoint=i;
count++;
while(sum){
i++;
count++;
if(s[i]=='[')sum++;
if(s[i]==']')sum--;
}
ret+=rev(s.substr(spoint+1,count-2));
}
else{
ret+=s[i];
}
}
reverse(all(ret));
return ret;
}
int main(){
string s;
while(cin>>s){
if(s==".")break;
s=doPlusMinas(s);
string ans="";
rep(i,s.sz){
int start,count=0;
if(s[i]=='['){
start=i;
int sum=0;
do{
if(s[i]=='[')sum++;
if(s[i]==']')sum--;
i++;
count++;
}while(sum);
i--;
ans+=rev(s.substr(start+1,count-2));
}
else{
ans+=s[i];
}
}
cout<<ans<<endl;
}
return 0;
} |
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <fstream>
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toStr(T x) { ostringstream sout; sout << x; return sout.str(); }
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 FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,(n)-1)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = INT_MAX / 10;
string Cipher();
string String();
string Letter();
string plusLetter(string str);
string minusLetter(string str);
int p;
string s;
string Cipher() {
string ret;
while (p < s.size() && s[p] != ']') {
ret += String();
}
return ret;
}
string String() {
string ret;
if (s[p] == '[') {
p++;
ret = Cipher();
reverse(ALL(ret));
p++;
}
else {
ret = Letter();
}
return ret;
}
string Letter() {
string ret;
if (s[p] == '+') {
p++;
ret = Letter();
ret = plusLetter(ret);
}
else if (s[p] == '-') {
p++;
ret = Letter();
ret = minusLetter(ret);
}
else {
ret = string(1, s[p]);
p++;
}
return ret;
}
string plusLetter(string str) {
string ret;
if (str == "?") {
ret = "?";
}
else if (str == "Z") {
ret = "A";
}
else {
str[0]++;
ret = str;
}
return ret;
}
string minusLetter(string str) {
string ret;
if (str == "?") {
ret = "?";
}
else if (str == "A") {
ret = "Z";
}
else {
str[0]--;
ret = str;
}
return ret;
}
int main() {
while (cin >> s, s != ".") {
p = 0;
string ans = Cipher();
REP(i, ans.size()) {
if (ans[i] == '?') {
ans[i] = 'A';
}
}
cout << ans << endl;
}
return 0;
} |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <iostream>
typedef long long int ll;
#define BIG_NUM 2000000000
#define MOD 1000000007
using namespace std;
struct Info{
Info(int arg_left,int arg_right){
left = arg_left;
right = arg_right;
}
int left,right;
};
int main(){
char buf[100],ans[100];
int ans_index;
while(true){
scanf("%s",buf);
if(buf[0] == '.')break;
ans_index = 0;
int div = 0,tmp;
for(int i = 0; buf[i] != '\0'; i++){
if(buf[i] == '+'){
div++;
}else if(buf[i] == '-'){
div--;
}else if(buf[i] >= 'A' && buf[i] <= 'Z'){
if(div == 0){
ans[ans_index++] = buf[i];
}else{
tmp = buf[i] - 'A';
if(tmp + div > 25){
while(tmp+ div > 25){
div -= 26;
}
ans[ans_index++] = buf[i] + div;
}else if(tmp+div < 0){
while(tmp+div<0){
div += 26;
}
ans[ans_index++] = buf[i] + div;
}else{
ans[ans_index++] = buf[i] + div;
}
div = 0;
}
}else if(buf[i] == '?'){
ans[ans_index++] = 'o';
div = 0;
}else if(buf[i] == '['){
ans[ans_index++] = '[';
}else{ //buf[i] == ']'
ans[ans_index++] = ']';
}
}
ans[ans_index] = '\0';
queue<Info> Q;
int max_depth,depth,calc_left,calc_right;
while(true){
max_depth = -1;
depth = 0;
for(int i = 0; ans[i] != '\0';i++){
if(ans[i] == '['){
depth++;
max_depth = max(max_depth,depth);
}else if(ans[i] == ']')depth--;
}
depth = 0;
for(int i = 0; ans[i] != '\0';i++){
if(ans[i] == '['){
depth++;
if(depth == max_depth){
calc_left = i;
}
}else if(ans[i] == ']'){
if(depth == max_depth){
Q.push(Info(calc_left,i));
}
depth--;
}
}
if(Q.empty())break;
while(!Q.empty()){
calc_left = Q.front().left;
calc_right = Q.front().right;
Q.pop();
ans[calc_left] = 'x';
ans[calc_right] = 'x';
for(int k = 0; calc_left+1+k < calc_right-1-k;k++){
swap(ans[calc_left+1+k],ans[calc_right-1-k]);
}
}
}
for(int i = 0; i < ans_index; i++){
if(ans[i] == 'x')continue;
else if(ans[i] == 'o')printf("A");
else{
printf("%c",ans[i]);
}
}
printf("\n");
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
string S;
string cipher(int&);
char letter(int& i) {
// cerr << "letter " << i << endl;
char c;
if (S[i] == '+') {
++i;
c = letter(i);
if (c != '?') {
++c;
if (c > 'Z') c = 'A';
}
} else if (S[i] == '-') {
++i;
c = letter(i);
if (c != '?') {
--c;
if (c < 'A') c = 'Z';
}
} else {
c = S[i];
++i;
}
return c;
}
string str(int& i) {
// cerr << "str " << i << endl;
string ret;
if (S[i] == '[') {
++i;
ret = cipher(i);
assert(S[i] == ']');
++i;
reverse(ret.begin(), ret.end());
} else {
char c = letter(i);
if (c == '?') c = 'A';
ret = string(1, c);
}
return ret;
}
string cipher(int& i) {
// cerr << "cipher " << i << endl;
string ret = str(i);
if (i < S.length() && S[i] != ']') {
ret += cipher(i);
}
return ret;
}
bool solve() {
cin >> S;
if (S == ".") return false;
int i = 0;
cout << cipher(i) << endl;
return true;
}
int main(){
while(solve()){}
return 0;
}
|
#include <bits/stdc++.h>
#define mod 26
#define S str[i]
using namespace std;
string str;
string solve(){
string res;
stack <int> st;
for(int i=0;i<str.size();i++){
int cnt=0;
while(S=='+'||S=='-')cnt+=(S=='+')-(S=='-'),i++;
if(cnt) res+=((S-'A')+cnt%mod+mod)%mod+'A';
else if(S!='['&&S!=']')res += S;
if(S=='?')res[res.size()-1]='A';
if(S=='[')st.push(res.size());
if(S==']')reverse(res.begin()+st.top(),res.end()),st.pop();
}
return res;
}
int main(){
while(cin>>str&&str!=".")cout <<solve()<<endl;
return 0;
} |
#include<iostream>
#include<stack>
using namespace std;
int main()
{
stack<char> S;
string s;
char c,C[90];
int a,b;
while(1){
cin>>s;
if(s[0]=='.')break;
for(int i=0;i<s.length();i++){
if(s[i]>='A' && s[i]<='Z'){
while(!S.empty() && (S.top()=='+' || S.top()=='-')){
if(S.top()=='+'){
if(s[i]=='Z')s[i]='A';
else s[i]++;
}
else if(S.top()=='-'){
if(s[i]=='A')s[i]='Z';
else s[i]--;
}
S.pop();
}
S.push(s[i]);
}
else if(s[i]=='?'){
while(!S.empty() && (S.top()=='+' || S.top()=='-')){
S.pop();
}
S.push('?');
}
else if(s[i]==']'){
b=0;
while(S.top()!='['){
C[b++]=S.top();S.pop();
}
S.pop();
for(int i=0;i<b;i++)S.push(C[i]);
}
else{
S.push(s[i]);
}
}
a=S.size();b=0;
while(!S.empty()){
C[b++]=S.top(),S.pop();
}
for(int i=b-1;i>=0;i--){
if(C[i]=='?')cout<<'A';
else cout<<C[i];
}
cout<<endl;
}
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
const char *p;
string parse(){
string s, t;
while(*p && *p != ']'){
if(*p == '['){
++p;
t = parse();
++p;
reverse(t.begin(), t.end());
s += t;
}
else{
int c = 0;
for(;; ++p){
if(*p == '+'){
++c;
}
else if(*p == '-'){
--c;
}
else{
break;
}
}
if(*p == '?'){
s += '?';
}
else{
s += char(((*p - 'A') + c % 26 + 26) % 26 + 'A');
}
++p;
}
}
return s;
}
int main(){
string s, t;
while(cin >> s, s[0] != '.'){
p = s.c_str();
t = parse();
replace(t.begin(), t.end(), '?', 'A');
cout << t << '\n';
}
} |
#include<bits/stdc++.h>
using namespace std;
string s;
void up(int j){
if(s[j]+1>'Z')s[j]='A';
else s[j]++;
}
void down(int j){
if(s[j]-1<'A')s[j]='Z';
else s[j]--;
}
int main(){
while(cin>>s,s!="."){
reverse(s.begin(),s.end());
for(int i=0;i<(int)s.size();i++)
if(s[i]=='?'){
for(int j=i+1;j<(int)s.size();j++)
if(s[j]=='+'||s[j]=='-')s.erase(s.begin()+j),j--;
else break;
s[i]='A';
}
else if(isalpha(s[i])){
for(int j=i+1;j<(int)s.size();j++)
if(s[j]=='+')up(i),s.erase(s.begin()+j),j--;
else if(s[j]=='-')down(i),s.erase(s.begin()+j),j--;
else break;
}
reverse(s.begin(),s.end());
stack<int>st;
for(int i=0;i<(int)s.size();i++){
if(s[i]=='[')st.push(i),s.erase(s.begin()+i),i--;
else if(s[i]==']'){
int p=st.top();st.pop();
s.erase(s.begin()+i);
reverse(s.begin()+p,s.begin()+i--);
}
}
cout<<s<<endl;
}
} |
#include <iostream>
#include <algorithm>
#include <string>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <stack>
using namespace std;
#define loop(i,a,b) for(int i=(a); i<int(b); i++)
#define rep(i,b) loop(i,0,b)
int main(){
string s;
while(cin>>s && s!="."){
int n=s.size();
string t;
rep(i,n){
if(s[i]=='+'||s[i]=='-'||s[i]=='?'){
int d=0;
int j=i;
for(; !isalpha(s[j]) && s[j]!='?'; j++){
if(s[j]=='+') d++;
else d--;
}
i=j;
if(s[j]=='?'){
t.push_back('A');
}else{
int x=s[j]-'A'+2600;
x+=d;
x%=26;
t.push_back('A'+x);
}
}else{
t.push_back(s[i]);
}
}
int m=t.size();
stack<int> st;
rep(i,m){
if(t[i]=='[') st.push(i);
else if(t[i]==']'){
int l=st.top(); st.pop();
reverse(t.begin()+l,t.begin()+i+1);
t[l]=' ';
t[i]=' ';
}
}
rep(i,t.size()){
if(isalpha(t[i])) cout<<t[i];
}
cout<<endl;
}
} |
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<((int)(n));i++)
#define reg(i,a,b) for(int i=((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i=((int)(n))-1;i>=0;i--)
#define ireg(i,a,b) for(int i=((int)(b));i>=((int)(a));i--)
typedef long long int lli;
typedef pair<int,int> mp;
#define fir first
#define sec second
#define IINF INT_MAX
#define LINF LLONG_MAX
#define eprintf(...) fprintf(stderr,__VA_ARGS__)
#define pque(type) priority_queue<type,vector<type>,greater<type> >
#define memst(a,b) memset(a,b,sizeof(a))
#define iter(v,ite) for(auto ite=(v).begin();ite!=(v).end();ite++)
#define mimunum(v,x) distance((v).begin(),lower_bound((v).begin(),(v).end(),x))
#include<cassert>
typedef string::iterator state;
string lett(state& s){
int d = 0;
for(;;){
if(*s=='+')d++;
else if(*s=='-')d--;
else{
char res = *s;
d %= 26;
res = ((res -'A') + d + 26) % 26 + 'A';
s++;
char rs[2]={};
rs[0] = res;
return string(rs);
}
s++;
}
}
string str(state& s);
string ciph(state& s){
string rs("");
for(;;){
if(*s == '$' || *s==']')return rs;
rs += str(s);
}
}
string str(state& s){
if(*s=='['){
s++;
string res = ciph(s);
reverse(res.begin(),res.end());
//printf("%c\n",*s);
assert(*s==']');
s++;
return res;
}
else return lett(s);
}
vector<string> anss;
char s[85];
void dfs(int p){
if(s[p]=='\0'){
string ns(s);
//printf("%d %s\n",p,s);
ns += '$';
state ite = ns.begin();
anss.push_back(ciph(ite));
}
else if(s[p]!='?')dfs(p+1);
else{
rep(i,26){
s[p]='A'+i;
dfs(p+1);
}
s[p]='?';
}
}
int main(void){
for(;;){
scanf("%s",s);
if(s[0] == '.')break;
anss.clear();
dfs(0);
sort(anss.begin(),anss.end());
cout << anss[0] << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
int main()
{
while(true)
{
string S; cin >> S;
if(S == ".") return 0;
stack<int> left;
string ans = "";
int point = 0;
for(auto c : S)
{
if (c == '[')
{
left.push(ans.size());
}
else if (c == ']')
{
int l = left.top();
left.pop();
reverse(ans.begin() + l, ans.begin() + ans.size());
}
else if (c == '+')
{
point++;
}
else if(c == '-')
{
point--;
}
else if(c == '?')
{
ans += 'A';
point = 0;
}
else
{
int num = c - 'A';
num = num + point;
num = (num % 26 + 26) % 26;
ans += (char)('A' + num);
point = 0;
}
}
cout << ans << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m,t;
cin>>n>>m>>t;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin>>a[i];
}
sort(a.begin(),a.end());
int ans=a.front()-m;
for (int i = 1; i < n; ++i) {
if(a[i]-a[i-1]>2*m)ans+=(a[i]-a[i-1])-2*m;
}
if(t-a.back()>m)ans+=t-a.back()-m;
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,t;
cin>>n>>m>>t;
vector<int> a(n+2);
a[0]=-m;
a[n+1]=t+m;
for(int i=1;i<=n;i++) cin>>a[i];
long long int res=0;
for(int i=0;i<n+1;i++){
res+=max(0,a[i+1]-a[i]-2*m);
}
cout<<res<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int a[101];
int main(){
int n,m,T;
cin>>n>>m>>T;
for(int i=0;i<n;i++)cin>>a[i];
a[n]=T+m;
int ans=a[0]-m;
for(int i=0;i<n;i++)ans+=max(0,a[i+1]-a[i]-2*m);
cout<<ans<<endl;
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb emplace_back
#define INF (1e9+1)
//#define INF (1LL<<59)
int main(){
int n,m,t;
cin>>n>>m>>t;
vector<int> a(n);
rep(i,n)cin>>a[i];
int ans = 0;
ans+=a[0]-m;
ans+=max(0,t-m-a[a.size()-1]);
rep(i,a.size()-1){
if(a[i+1]-a[i]>2*m)ans+=a[i+1]-a[i]-2*m;
}
cout<<ans<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m, t;
cin >> n >> m >> t;
int res = t;
int p;
cin >> p;
for(int i=1; i<n; i++)
{
int q;
cin >> q;
int d = q - p;
res -= min(d, 2 * m);
p = q;
}
res -= m;
res -= min(m, t-p);
cout << res << endl;
} |
#include<cstdio>
#include<cstring>
bool tbl[50000];
int main(void) {
memset(tbl, 0, sizeof(tbl));
int n,m,t;
int a;
scanf("%d%d%d",&n,&m,&t);
for(int i=0; i<n; i++){
scanf("%d",&a);
a--;
for(int j=0; j<m; j++)
tbl[a-j] = tbl[a+j] = true;
tbl[a+m] = true;
}
int res=0;
for(int i=0; i<t; i++)
res += !tbl[i];
printf("%d\n", res);
return 0;
} |
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define sint(x) cout <<#x<<" = "<<(x)<<endl
#define spair(p) cout <<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(i,v.size())cout<<" "<<v[i];cout<<endl
#define sset(s) cout<<#s<<":";each(i,s)cout <<" "<<i;cout<<endl
using namespace std;
typedef pair<int,int>P;
const int MAX_N = 100005;
int main()
{
int n,m,t;
cin >> n >> m >> t;
vector<int> vec(n);
int ans = 0;
rep(i,n){
cin >> vec[i];
}
ans += vec[0] - m;
rep(i,n-1){
ans += max(vec[i+1] - vec[i] - 2*m,0);
}
ans += max(t-vec[n-1]-m,0);
cout << ans << "\n";
} |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(void)
{
int i,j,n,m,x,t,a,st,en,t1[10001],cnt;
scanf("%d %d %d",&n,&m,&t);
for(i=0;i<=t;i++) t1[i]=0;
for(i=0;i<n;i++) {
scanf("%d",&a);
st=a-m;
if(st<0) st=0;
en=a+m;
if(en>t) en=t;
t1[st]++; t1[en]--;
}
x=0; cnt=0;
for(i=0;i<t;i++) {
x+=t1[i];
if(x==0) cnt++;
// printf("x=%d\n",x);
}
printf("%d\n",cnt);
return 0;
}
|
#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
int main(){
int n, m, t, a[SIZE];
scanf("%d%d%d", &n, &m, &t);
for(int i=1;i<=n;i++){
scanf("%d", a+i);
}
a[0] = -m;
a[n+1] = t + m;
int ans = 0;
for(int i=1;i<=n+1;i++){
ans += max(0, (a[i]-a[i-1]) - 2*m);
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <bitset>
#include <cstring>
#include <queue>
#include <stack>
#include <algorithm>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n,m,t; cin >> n >> m >> t;
vector<int> a(n);
for(int i=0;i<n;i++){
cin >> a[i];
}
a.push_back(0);
a.push_back(t);
int ans=0;
sort(a.begin(),a.end());
for(int i=0;i<n+1;i++){
if(i!=0&&i!=n)ans+=max(0,a[i+1]-a[i]-m-m);
else ans+=max(0,a[i+1]-a[i]-m);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
int main() {
int n,m,t,count = 0;
cin >> n >> m >>t;
int T[10001] = {};
int a[n];
for(int i = 0;i < n;i++){
cin >> a[i];
for(int j = max(0,a[i]-m);j <= min(10000,a[i] + m);j++){
T[j] = 1;
}
}
for(int i = 0;i < t;i++){
if(T[i] == 0 || T[i+1] == 0){
count++;
}
}
cout << count <<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Ti = tuple<int, int, int>;
using Tl = tuple<ll, ll, ll>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define Get(t, i) get<(i)>((t))
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define reps(i, f, n) for(int i = (int)(f); i < (int)(n); i++)
#define each(a, b) for(auto& a : b)
const int inf = 1 << 25;
const ll INF = 1LL << 55;
int main()
{
int N, M, T;
cin >> N >> M >> T;
int ans = 0;
int a[111];
a[0] = 0;
rep(i, N) {
cin >> a[i+1];
if(i == 0) ans += a[i+1] - M;
else if(a[i+1] - a[i] > 2*M) ans += (a[i+1]-a[i]) - 2*M;
}
cout << ans + max(0, T-a[N]-M) << endl;
return 0;
} |
#include <iostream>
using namespace std;
int main(){
int n,m,t,x;
int a[10001] = {};
cin >> n >> m >> t;
a[t] = -1;
for(int i = 0;i < n;i++){
cin >> x;
a[x] = 1;
for(int j = x-m;j<x;j++){
a[j] = 1;
}
if(x+m < t){
for(int j = x;j<x+m;j++){
a[j] = 1;
}
}
else{
for(int j = x;j < t;j++){
a[j] = 1;
}
}
}
int res = 0;
for(int i = 0;i <= t;i++){
if(a[i] == 0)res++;
}
cout << res <<endl;
return 0;
} |
// 2016-12-12
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int n, m, t, a;
cin >> n >> m >> t;
int s = 0, u = 0;
for (int i = 0; i < n; i++) {
cin >> a;
s += max(0, (a - m) - u);
u = a + m;
}
s += max(0, t - u);
cout << s << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, m , t, a;
bool used[11000];
cin >> n >> m >> t;
for(int i = 0; i < t; i++) used[i] = false;
for(int i = 0; i < n; i++){
cin >> a;
int l = a - m;
int r = a + m-1;
r = min(r, t);
for(int j = l; j <= r; j++){
used[j] = true;
}
}
int ans = 0;
for(int i = 0; i < t; i++){
if(used[i] == false) ans++;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,t,a[101]={0},an=0;
cin>>n>>m>>t>>a[1];
an+=a[1]-m;
for(int i=2;i<=n;i++){
cin>>a[i];
if(a[i]-a[i-1]>2*m)an+=a[i]-a[i-1]-2*m;
}
if(t-a[n]>m)an+=t-a[n]-m;
cout<<an<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
signed main(){
bool a[30000]{};
int b,c,d;
cin>>b>>c>>d;
for(int e=0;e<b;e++){
int f;
cin>>f;
for(int g=f-c;g<f+c;g++){
a[g]=true;
}
}
int s=0;
for(int h=0;h<d;h++){
if(!a[h])s++;
}
cout<<s<<endl;
} |
#include<iostream>
using namespace std;
const int MAX_N = 101;
int A[MAX_N];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M, T;
cin >> N >> M >> T;
for (int i = 0; i < N; i++) cin >> A[i];
int ans = A[0] - M;
for (int i = 1; i < N; i++) {
ans += max(0, A[i] - A[i - 1] - 2 * M);
}
ans += max(0, T - A[N - 1] - M);
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#include<iomanip>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-8;
const int inf=1e8;
int main(){
int n,m,t;
cin>>n>>m>>t;
vi in(n);
rep(i,n)cin>>in[i];
int out=in[0]-m;
rep(i,n-1)out+=max(0,in[i+1]-in[i]-2*m);
cout<<out+max(t-(in[n-1]+m),0)<<endl;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.