Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define F first
- #define S second
- #define mp make_pair
- #define pb push_back
- #define INF 0x3f3f3f3f
- #define LINF 0x3f3f3f3f3f3f3f3fLL
- using namespace std;
- typedef long long ll;
- typedef vector<int> vi;
- typedef set<int> si;
- typedef pair<int,int> ii;
- typedef vector<ii> vii;
- typedef map<string,int> msi;
- typedef map<int,int> mi;
- int main(){
- int n;
- cin >>n;
- for(int caso =1;caso<=n;caso++){
- string in;
- cin >> in;
- string code;
- cin >> code;
- char mem[100010];
- int p=0;
- int inDex=0;
- stack<int> loop;
- memset(mem,0,sizeof mem);
- cout << "Instancia "<<caso<<"\n";
- for(int i=0;i<code.size();i++){
- //printf("%c %c",code[i],mem[p]);
- switch(code[i]){
- case '>':p++;
- break;
- case '<':p--;
- break;
- case '+':mem[p]++;
- break;
- case '-':mem[p]--;
- break;
- case ',':
- mem[p] = in[inDex];
- inDex++;
- break;
- case '.':cout<<mem[p];
- break;
- case '[':loop.push(i);
- break;
- case ']':
- if(mem[p]==0)loop.pop();
- else i=loop.top();
- break;
- case '#':
- for(int j=0;j<10;j++) cout << mem[j];
- break;
- }
- }
- cout << "\n\n";
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement