Submission #1126046


Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <array>
#include <cmath>
#include <iterator>
#include <utility>
#include <set>
#include <random>
#include <map>
#include <stack>
#include <queue>
#include <list>
#include <limits>
#include <numeric>

using namespace std;

int main() {
    string s;
    int n;
    cin >> s >> n;

    if (n <= 5)
    {
        cout << s[0];
        if (n % 5 == 1)
        {
            cout << s[0] << endl;
        }
        else if (n % 5 == 2)
        {
            cout << s[1] << endl;
        }
        else if (n % 5 == 3)
        {
            cout << s[2] << endl;
        }
        else if (n % 5 == 4)
        {
            cout << s[3] << endl;
        }
        else if (n % 5 == 0)
        {
            cout << s[4] << endl;
        }
    }
    else if (6 <= n && n <= 10)
    {
        cout << s[1];
        n -= 5;
        if (n % 5 == 1)
        {
            cout << s[0] << endl;
        }
        else if (n % 5 == 2)
        {
            cout << s[1] << endl;
        }
        else if (n % 5 == 3)
        {
            cout << s[2] << endl;
        }
        else if (n % 5 == 4)
        {
            cout << s[3] << endl;
        }
        else if (n % 5 == 0)
        {
            cout << s[4] << endl;
        }
    }
    else if (11 <= n && n <= 15)
    {
        cout << s[2];
        n -= 10;
        if (n % 5 == 1)
        {
            cout << s[0] << endl;
        }
        else if (n % 5 == 2)
        {
            cout << s[1] << endl;
        }
        else if (n % 5 == 3)
        {
            cout << s[2] << endl;
        }
        else if (n % 5 == 4)
        {
            cout << s[3] << endl;
        }
        else if (n % 5 == 0)
        {
            cout << s[4] << endl;
        }
    }
    else if (16 <= n && n <= 20)
    {
        cout << s[3];
        n -= 15;
        if (n % 5 == 1)
        {
            cout << s[0] << endl;
        }
        else if (n % 5 == 2)
        {
            cout << s[1] << endl;
        }
        else if (n % 5 == 3)
        {
            cout << s[2] << endl;
        }
        else if (n % 5 == 4)
        {
            cout << s[3] << endl;
        }
        else if (n % 5 == 0)
        {
            cout << s[4] << endl;
        }
    }
    else if (21 <= n && n <= 25)
    {
        cout << s[4];
        n -= 20;
        if (n % 5 == 1)
        {
            cout << s[0] << endl;
        }
        else if (n % 5 == 2)
        {
            cout << s[1] << endl;
        }
        else if (n % 5 == 3)
        {
            cout << s[2] << endl;
        }
        else if (n % 5 == 4)
        {
            cout << s[3] << endl;
        }
        else if (n % 5 == 0)
        {
            cout << s[4] << endl;
        }
    }
    return 0;
}

Submission Info

Submission Time
Task A - 25個の文字列
User poketorena
Language C++14 (GCC 5.4.1)
Score 100
Code Size 2966 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 36
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt
All sample-01.txt, sample-02.txt, sample-03.txt, test-01.txt, test-02.txt, test-03.txt, test-04.txt, test-05.txt, test-06.txt, test-07.txt, test-08.txt, test-09.txt, test-10.txt, test-11.txt, test-12.txt, test-13.txt, test-14.txt, test-15.txt, test-16.txt, test-17.txt, test-18.txt, test-19.txt, test-20.txt, test-21.txt, test-22.txt, test-23.txt, test-24.txt, test-25.txt, test-26.txt, test-27.txt, test-28.txt, test-29.txt, test-30.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB
sample-03.txt AC 1 ms 256 KB
test-01.txt AC 1 ms 256 KB
test-02.txt AC 1 ms 256 KB
test-03.txt AC 1 ms 256 KB
test-04.txt AC 1 ms 256 KB
test-05.txt AC 1 ms 256 KB
test-06.txt AC 1 ms 256 KB
test-07.txt AC 1 ms 256 KB
test-08.txt AC 1 ms 256 KB
test-09.txt AC 1 ms 256 KB
test-10.txt AC 1 ms 256 KB
test-11.txt AC 1 ms 256 KB
test-12.txt AC 1 ms 256 KB
test-13.txt AC 1 ms 256 KB
test-14.txt AC 1 ms 256 KB
test-15.txt AC 1 ms 256 KB
test-16.txt AC 1 ms 256 KB
test-17.txt AC 1 ms 256 KB
test-18.txt AC 1 ms 256 KB
test-19.txt AC 1 ms 256 KB
test-20.txt AC 1 ms 256 KB
test-21.txt AC 1 ms 256 KB
test-22.txt AC 1 ms 256 KB
test-23.txt AC 1 ms 256 KB
test-24.txt AC 1 ms 256 KB
test-25.txt AC 1 ms 256 KB
test-26.txt AC 1 ms 256 KB
test-27.txt AC 1 ms 256 KB
test-28.txt AC 1 ms 256 KB
test-29.txt AC 1 ms 256 KB
test-30.txt AC 1 ms 256 KB