Submission #24300117

Source Code Expand

#include<iostream>
#include<vector>
#include<cmath>
#include<string>
#include<algorithm>
#include<map>
#include<utility>
#include<cstdio>
#include<cmath>
#include<bits/stdc++.h>

using namespace std;
using ll = long long;
const long long INF = 1LL<<60;

typedef pair<ll,ll> Pair;

int main(){

  ll N;
  string S;

  cin >> N >> S;

  vector<string> n = {"Takahashi","Aoki"};

  ll cnt = 0;

  for(ll i = 0;i < N;++i){
    cnt = i%2;
    if(S[i] == '1'){
      cout << n[cnt] << endl;
      break;
    }
  }



  return 0;

}

Submission Info

Submission Time
Task B - Bouzu Mekuri
User MurATa25
Language C++ (GCC 9.2.1)
Score 200
Code Size 567 Byte
Status AC
Exec Time 9 ms
Memory 3708 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 13
Set Name Test Cases
Sample example0.txt, example1.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, example0.txt, example1.txt
Case Name Status Exec Time Memory
000.txt AC 6 ms 3520 KiB
001.txt AC 2 ms 3516 KiB
002.txt AC 6 ms 3608 KiB
003.txt AC 8 ms 3664 KiB
004.txt AC 9 ms 3708 KiB
005.txt AC 5 ms 3604 KiB
006.txt AC 3 ms 3528 KiB
007.txt AC 6 ms 3548 KiB
008.txt AC 2 ms 3536 KiB
009.txt AC 5 ms 3692 KiB
010.txt AC 5 ms 3708 KiB
example0.txt AC 2 ms 3468 KiB
example1.txt AC 2 ms 3412 KiB