백준 4597번: 패리티

https://www.acmicpc.net/problem/4597

1. 문제

2. 알고리즘

키워드 - 구현

3. 코드

#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <math.h>
#include <memory.h>
using namespace std;
 
#define MAX_SIZE 100
#define INF 0x7fffffff
#define CENDL "\n"
#define ll long long
 
int main() {
 
    cin.tie(0);
    std::ios::sync_with_stdio(false);
 
 
    while(true) {
        string s; cin >> s;
        if (s == "#") {
            break;
        }
 
        int i;
        int cnt = 0;
        for(i=0; s[i] !='e' && s[i]!='o'; ++i){
            cnt += s[i] =='1';
        }
 
        if(s[i]=='e') {
            s[i] = (cnt & 1) ? '1':'0';
        } else {
            s[i] = (cnt & 1) ? '0':'1';
        }
        cout << s << CENDL;
    }
    return 0;
}