Submission #1872297
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <map> #include <queue> #include <string> #include <set> #define INF 1000000000 using namespace std; #define FOR(i,a,b) for(int i=a;i<b;i++) #define LOOP(i,N) for(int i=0;i<N;i++) #define LOOP1(i,N) for(int i=1;i<=N;i++) typedef pair<int,int> P; typedef pair<int,pair<int,int> > PP; const int MAX_V=100000; #define int long long struct edge{int to,cost;}; int V,E; vector<edge> G[MAX_V]; int d[MAX_V]; signed main(){ string S; cin >> S; cout << S << "pp" << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - ハンドルネーム |
User | Takeno_hito |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 566 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 2560 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
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 | 2 ms | 2560 KB |
sample_02.txt | AC | 2 ms | 2560 KB |
test_aaaaaaaaaa.txt | AC | 2 ms | 2560 KB |
test_myonmyon.txt | AC | 2 ms | 2560 KB |
test_nemui.txt | AC | 2 ms | 2560 KB |
test_onakasuita.txt | AC | 2 ms | 2560 KB |
test_p.txt | AC | 2 ms | 2560 KB |