Submission #1307413


Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <utility>
#define INF 1000000000
#define mod 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define all(x) (x).begin(),x.end()
using namespace std;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
bool debug=false;

int main(){
  int h,w;
  char c[105][105];
  cin>>h>>w;
  
  rep(i,h){
    rep(j,w){
      cin>>c[i][j];
    }
  }
  //cout<<h<<" "<<w<<endl;
  rep(i,h*2){
    rep(j,w){
      cout<<c[i/2][j];
    }
    cout<<endl;
  }
  return 0;
 
}

Submission Info

Submission Time
Task B - Thin
User mkan_0141
Language C++14 (GCC 5.4.1)
Score 200
Code Size 740 Byte
Status AC
Exec Time 3 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 13
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 3 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 3 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