Submission #1307412
Source Code Expand
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <cctype>
#include <cmath>
#include <map>
#include <set>
#define rep(i, m, n) for(int i = m;i < n;i++)
#define repr(i, n) for(int i = n;i >= 0;i--)
#define ll long long
#define ull unsigned long long
#define push(a) push_back(a)
#define pop(a) pop_back(a)
#define debug(x) cout<<#x<<": "<<x<<endl
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#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(){
int h,w;
char c[105][105]={};
cin>>h>>w;
rep(i,0,h){
rep(j,0,w){
cin>>c[i][j];
}
}
rep(i,0,h){
rep(j,0,w){
cout<<c[i][j];
}
cout<<endl;
rep(j,0,w){
cout<<c[i][j];
}
cout<<endl;
}
}
Submission Info
Submission Time |
|
Task |
B - Thin |
User |
thedekopin0108 |
Language |
C++14 (GCC 5.4.1) |
Score |
200 |
Code Size |
1027 Byte |
Status |
AC |
Exec Time |
3 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 |
3 ms |
256 KB |
subtask1_1.txt |
AC |
2 ms |
256 KB |
subtask1_2.txt |
AC |
3 ms |
256 KB |
subtask1_3.txt |
AC |
3 ms |
256 KB |
subtask1_4.txt |
AC |
2 ms |
256 KB |
subtask1_5.txt |
AC |
2 ms |
256 KB |
subtask1_6.txt |
AC |
3 ms |
256 KB |
subtask1_7.txt |
AC |
3 ms |
256 KB |
subtask1_8.txt |
AC |
3 ms |
256 KB |
subtask1_9.txt |
AC |
2 ms |
256 KB |