Submission #29661027


Source Code Expand

// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint998244353;
// using mint = modint1000000007;
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,k,n) for (int i = (k); i < (n); ++i)
using namespace std;
using ll = long long;
// using P = pair<ll,ll>;
using P = pair<int,int>;
using vint = vector<int>;
using vll = vector<ll>;
using vvint = vector<vector<int>>;
using vvll = vector<vector<ll>>;

// const ll INF = (ll)2e18+9;
const int INF = (int)2e9+7;
// const ll MOD = (ll)1e9+9;
template<typename T>
void chmin(T &a, T b) { a = min(a, b); }
template<typename T>
void chmax(T &a, T b) { a = max(a, b); }

template<typename T>
void print(vector<T> v) {
    int n = v.size();
    rep(i,n) {
        if (i == 0) cout << v[i];
        else cout << ' ' << v[i];
    }
    cout << endl;
}

void solve() {
    vint a(10);
    rep(i,10) cin >> a[i];

    cout << a[a[a[0]]] << endl;
}

int main() {
    solve();
    return 0;
}

Submission Info

Submission Time
Task A - Digit Machine
User goropikari
Language C++ (GCC 9.2.1)
Score 100
Code Size 1111 Byte
Status AC
Exec Time 8 ms
Memory 3624 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 10
Set Name Test Cases
Sample example0.txt, example1.txt, example2.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, example0.txt, example1.txt, example2.txt
Case Name Status Exec Time Memory
000.txt AC 8 ms 3624 KiB
001.txt AC 2 ms 3592 KiB
002.txt AC 2 ms 3624 KiB
003.txt AC 3 ms 3568 KiB
004.txt AC 2 ms 3476 KiB
005.txt AC 2 ms 3588 KiB
006.txt AC 2 ms 3520 KiB
example0.txt AC 3 ms 3568 KiB
example1.txt AC 3 ms 3420 KiB
example2.txt AC 3 ms 3620 KiB