Submission #5903467


Source Code Expand

#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>
#include <assert.h>
#include <unordered_set>
#include <random>



using namespace std;
using ll = long long;
using ull = unsigned long long;

const ll INF = 1e16;
const ll MOD = 1e9 + 7;

#define REP(i, n) for(ll i = 0; i < n; i++)




















 
int main(){
    int n;
    scanf("%d", &n);
    int hand = 0, mx = 0;
    for(int i = 0; i < n; i++){
        char s[11];
        scanf("%s", s);
        int cnt = 0;
        for(int j = 0; j < n; j++){
            if(s[j] == 'o') cnt++;
        }
        if(mx < cnt){
            hand = i;
            mx = cnt;
        }
    }
    for(int i = 0; i < 1000; i++){
        printf("%d\n", hand + 1);
        fflush(stdout);
        int judge_ai_hand;
        scanf("%d", &judge_ai_hand);
    }
}

Submission Info

Submission Time
Task E - じゃんけん
User chocobo
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1140 Byte
Status IE