Uva/Uva11956.cpp at master · Dobromi/Uva · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <algorithm>
#include <map>
#include <sstream>
using namespace std;


int main()
{


    int T;
    scanf("%d",&T);
    int cas=0;
    while(T--){
        string line;
        cin>>line;
        cas++;
        int circularArray[100];
        for(int i=0;i<100;i++)circularArray[i]=0;
        int pointer=0;

        for(int i=0;i<line.size();i++){
            if(line[i]=='>'){
                if(pointer==99)pointer=0;
                else pointer++;
            }
            else if(line[i]=='<'){
                if(pointer==0)pointer=99;
                else pointer--;
            }
            else if(line[i]=='+'){
                if(circularArray[pointer]==255){
                    circularArray[pointer]=0;
                }
                else{circularArray[pointer]++;}
            }
            else if(line[i]=='-'){
                if(circularArray[pointer]==0){
                    circularArray[pointer]=255;
                }
                else{circularArray[pointer]--;}
            }
        }
        printf("Case %d:", cas);
        for (int i = 0; i < 100; ++i)
            printf(" %02X", circularArray[i]);
        printf("\n");


    }

    return 0;
}