Day1

[Day1]

1. 니모를 찾아서

문제 링크: https://www.acmicpc.net/problem/10173

2. OX 퀴즈

문제 링크: https://www.acmicpc.net/problem/8958

#include <iostream>
using namespace std;

int main(int argc, const char * argv[]) {
    int input_num;
    cin >> input_num;
    string input[100];
    for(int i=0; i<input_num; i++){
        cin >> input[i];
    }
    int count =0;
    int result = 0;
    for(int i=0; i<input_num; i++){
        for(int j=0; j<input[i].length(); j++){
            if(input[i][j] == 'O'){
                count++;
                result += count;
            }
            else if(input[i][j] == 'X'){
                count = 0;
            }
        }
        cout << result << "\n";
        count = 0;
        result = 0;
    }
    return 0;
}

3. 키로거

문제 링크: https://www.acmicpc.net/problem/5397

#include <iostream>
#include <list>
using namespace std;

int main(int argc, const char * argv[]) {
    int number;
    cin >> number;
    string input;
    list<char> l;
    list<char>::iterator t;

    for(int i=0; i<number; i++){
        cin >> input;
        l.clear();
        t = l.begin();
        for(int j=0; j<input.length(); j++){
            if(input[j] == '<' && t!=l.begin()){
                t--;
            }
            else if(input[j]=='>' && t!=l.end()){
                t++;
            }
            else if(input[j]=='-' && t!= l.begin()){
                t=l.erase(--t);
            }
            else if(input[j]!='<' && input[j]!='>' && input[j]!='-'){
                l.insert(t, input[j]);
            }
        }
        for(t = l.begin(); t != l.end(); t++){
            cout << *t;
        }
        cout << "\n";
    }
    return 0;
}