Submission #996998


Source Code Expand

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>

using namespace std;
using ll = long long;

#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second

const ll INF = 1e18;
const ll MOD = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int K;
string S;

int main() {
    cin >> K >> S;
    if (K == 0) cout << S << endl;
    else if (K <= 2) {
        if (S.size() == 1)
            cout << S << endl;
        else
            cout << max(S[0], S[1]) << endl;
    }
    return 0;
}

Submission Info

Submission Time
Task A - Takahashi is Missing!
User odan
Language C++14 (GCC 5.4.1)
Score 0
Code Size 836 Byte
Status WA
Exec Time 3 ms
Memory 256 KB

Judge Result

Set Name Sample Dataset1 Dataset2 Dataset3
Score / Max Score 0 / 0 0 / 200 0 / 300 0 / 200
Status
WA × 3
AC × 1
WA × 6
AC × 1
WA × 9
AC × 1
WA × 22
Set Name Test Cases
Sample subtask_01_ex1.txt, subtask_03_ex2.txt, subtask_04_ex3.txt
Dataset1 subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_ex1.txt, subtask_02_01.txt, subtask_02_02.txt, subtask_02_03.txt
Dataset2 subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_ex1.txt, subtask_03_01.txt, subtask_03_02.txt, subtask_03_03.txt, subtask_03_04.txt, subtask_03_05.txt, subtask_03_ex2.txt
Dataset3 subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_ex1.txt, subtask_02_01.txt, subtask_02_02.txt, subtask_02_03.txt, subtask_03_01.txt, subtask_03_02.txt, subtask_03_03.txt, subtask_03_04.txt, subtask_03_05.txt, subtask_03_ex2.txt, subtask_04_01.txt, subtask_04_02.txt, subtask_04_03.txt, subtask_04_04.txt, subtask_04_05.txt, subtask_04_06.txt, subtask_04_07.txt, subtask_04_08.txt, subtask_04_09.txt, subtask_04_ex3.txt
Case Name Status Exec Time Memory
subtask_01_02.txt AC 3 ms 256 KB
subtask_01_03.txt WA 3 ms 256 KB
subtask_01_04.txt WA 2 ms 256 KB
subtask_01_ex1.txt WA 3 ms 256 KB
subtask_02_01.txt WA 3 ms 256 KB
subtask_02_02.txt WA 2 ms 256 KB
subtask_02_03.txt WA 2 ms 256 KB
subtask_03_01.txt WA 2 ms 256 KB
subtask_03_02.txt WA 3 ms 256 KB
subtask_03_03.txt WA 2 ms 256 KB
subtask_03_04.txt WA 3 ms 256 KB
subtask_03_05.txt WA 2 ms 256 KB
subtask_03_ex2.txt WA 2 ms 256 KB
subtask_04_01.txt WA 2 ms 256 KB
subtask_04_02.txt WA 2 ms 256 KB
subtask_04_03.txt WA 2 ms 256 KB
subtask_04_04.txt WA 2 ms 256 KB
subtask_04_05.txt WA 2 ms 256 KB
subtask_04_06.txt WA 2 ms 256 KB
subtask_04_07.txt WA 2 ms 256 KB
subtask_04_08.txt WA 2 ms 256 KB
subtask_04_09.txt WA 3 ms 256 KB
subtask_04_ex3.txt WA 2 ms 256 KB