Submission #1611634
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=(n)-1;i>=0;i--)
#define VSORT(v) sort(v.begin(), v.end())
#define DVSORT(v) sort(v.begin(), v.end(),greater<int>())
#define SORT(v, n) sort(v, v+n)
#define DSORT(v,n) sort(v, v+n,greater<int>())
#define vi vector<int>
#define pb push_back
#define P pair<int,int>
template <class T> void chmin(T&a,T&b) { a = min(a,b); }
template <class T> void chmax(T&a,T&b) { a = max(a,b); }
void print(){cout<<endl;}
template <class Head, class... Tail>
void print(Head&& h,Tail&&... t){
if(sizeof...(t)==0)
cout<<h;
else
cout<<h<<' ';
print(move(t)...);
}
const double EPS =1e-9;
const long INF =2147483647;//32bit 2*1e+9
const long MOD =1e+9+7;
#define PI 3.14159265258979
int dy[]={0, 0, 1, -1, 1, 1, -1, -1};
int dx[]={1, -1, 0, 0, 1, -1, -1, 1};
int main(void){
int H,W;
string S;
cin>>H>>W;
REP(i,H){
cin>>S;
print(S);
print(S);
}
}
Submission Info
Submission Time |
|
Task |
B - Thin |
User |
stnae678 |
Language |
C++14 (GCC 5.4.1) |
Score |
200 |
Code Size |
1164 Byte |
Status |
AC |
Exec Time |
2 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
200 / 200 |
Status |
|
|
Set Name |
Test Cases |
Sample |
subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
All |
subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0_0.txt |
AC |
1 ms |
256 KB |
subtask0_1.txt |
AC |
1 ms |
256 KB |
subtask0_2.txt |
AC |
1 ms |
256 KB |
subtask1_0.txt |
AC |
2 ms |
256 KB |
subtask1_1.txt |
AC |
2 ms |
256 KB |
subtask1_2.txt |
AC |
2 ms |
256 KB |
subtask1_3.txt |
AC |
2 ms |
256 KB |
subtask1_4.txt |
AC |
2 ms |
256 KB |
subtask1_5.txt |
AC |
2 ms |
256 KB |
subtask1_6.txt |
AC |
2 ms |
256 KB |
subtask1_7.txt |
AC |
2 ms |
256 KB |
subtask1_8.txt |
AC |
2 ms |
256 KB |
subtask1_9.txt |
AC |
2 ms |
256 KB |