Submission #2195507


Source Code Expand

#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;

int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};

int main()
{
    string name;
    cin >> name;
    cout << name << "pp" << endl;
}

Submission Info

Submission Time
Task A - ハンドルネーム
User jellyfish
Language C++14 (GCC 5.4.1)
Score 100
Code Size 638 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 7
Set Name Test Cases
All sample_01.txt, sample_02.txt, test_aaaaaaaaaa.txt, test_myonmyon.txt, test_nemui.txt, test_onakasuita.txt, test_p.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
test_aaaaaaaaaa.txt AC 1 ms 256 KB
test_myonmyon.txt AC 1 ms 256 KB
test_nemui.txt AC 1 ms 256 KB
test_onakasuita.txt AC 1 ms 256 KB
test_p.txt AC 1 ms 256 KB