Submission #1780110


Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <fstream>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <stack>
#include <queue>
#include <complex>
#include <set>
#include <list>
#include <iomanip>
#include <map>
#include <memory.h>



using namespace std;
static const double EPS = 1e-9;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i,n) for(int i=0;i<(int)n;++i)
#define FORNUM(p, x) for (int num = p; num < (int)(x); ++num)
#define FORI(p, x) for (int i = p; i < (int)(x); ++i)
#define FORJ(p, x) for (int j = p; j < (int)(x); ++j)
#define FORK(p, x) for (int k = p; k < (int)(x); ++k)
#define FORL(p, x) for (int l = p; l < (int)(x); ++l)

typedef pair<int,int>P;
#define INF 1000000000
 
struct edge { 
	int from, to,cap,rev; 
	edge (int from, int to, int cap, int rev){
		this->from=from; this->to=to; this->cap=cap; this->rev=rev;
	}
};
 
int V,E;
typedef vector<edge> edges;
vector<edges> G;


int h, w;
string s[110];
int main(){
	cin >> h >> w;
	FORI(0, h) {
		cin >> s[i];
	}
	FORI(0, h) {
		cout << s[i] << endl;
		cout << s[i] << endl;
	}
	return 0;
}

Submission Info

Submission Time
Task B - Thin
User cypher512
Language C++14 (GCC 5.4.1)
Score 200
Code Size 1195 Byte
Status AC
Exec Time 2 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 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