Submission #496831
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define mem(a) memset(a,0,sizeof(a))
#define pd(a) printf("%.10f\n",a)
#define pb(a) push_back(a)
#define in(a) insert(a)
#define pi M_PI
#define R cin>>
#define F first
#define S second
#define C class
#define ll long long
#define ln cout<<'\n'
#define _(_1,_2,_3,N,...)N
#define pr(...) _(__VA_ARGS__,pr3,pr2,pr1)(__VA_ARGS__)
template<C T>void pr1(T a){cout<<a;ln;}
template<C T,C T2>void pr2(T a,T2 b){cout<<a<<' '<<b;ln;}
template<C T,C T2,C T3>void pr3(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}
template<C T>void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
bool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;
void Main() {
string s;
R s;
pr(s+'s');
}
int main() {
ios::sync_with_stdio(0);cin.tie(0);
Main();return 0;
}
Submission Info
Submission Time |
|
Task |
A - 複数形 |
User |
kzyKT |
Language |
C++ (GCC 4.9.2) |
Score |
100 |
Code Size |
1216 Byte |
Status |
AC |
Exec Time |
28 ms |
Memory |
932 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
subtask0_sample_01.txt, subtask0_sample_02.txt |
All |
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0_sample_01.txt |
AC |
26 ms |
804 KB |
subtask0_sample_02.txt |
AC |
26 ms |
732 KB |
subtask1_01.txt |
AC |
26 ms |
800 KB |
subtask1_02.txt |
AC |
26 ms |
924 KB |
subtask1_03.txt |
AC |
26 ms |
928 KB |
subtask1_04.txt |
AC |
25 ms |
800 KB |
subtask1_05.txt |
AC |
26 ms |
928 KB |
subtask1_06.txt |
AC |
25 ms |
804 KB |
subtask1_07.txt |
AC |
25 ms |
928 KB |
subtask1_08.txt |
AC |
26 ms |
724 KB |
subtask1_09.txt |
AC |
23 ms |
800 KB |
subtask1_10.txt |
AC |
25 ms |
932 KB |
subtask1_11.txt |
AC |
25 ms |
804 KB |
subtask1_12.txt |
AC |
26 ms |
804 KB |
subtask1_13.txt |
AC |
25 ms |
924 KB |
subtask1_14.txt |
AC |
25 ms |
816 KB |
subtask1_15.txt |
AC |
25 ms |
804 KB |
subtask1_16.txt |
AC |
25 ms |
808 KB |
subtask1_17.txt |
AC |
25 ms |
924 KB |
subtask1_18.txt |
AC |
25 ms |
928 KB |
subtask1_19.txt |
AC |
28 ms |
800 KB |
subtask1_20.txt |
AC |
25 ms |
928 KB |