Submission #1247244
Source Code Expand
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
#include <deque>
#include <stdio.h>
using namespace std;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int)(n)-1;i>=0;i--)
#define FILL(Itr,n) fill((Itr).begin(),(Itr).end(),n)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())
#define LBOUND(Itr,val) lower_bound((Itr).begin(),(Itr).end(),(val))
#define UBOUND(Itr,val) upper_bound((Itr).begin(),(Itr).end(),(val))
#define MOD 1000000007
typedef long long ll;
typedef pair<int,int> P;
int M[31][31];
int main(){
REP(i,30)REP(j,30) cin >> M[i][j];
REP(i,30)REP(j,30) {
REP(k,M[i][j]) cout << i+1 << " " << j+1 << endl;
}
return 0;
}
Submission Info
Submission Time |
|
Task |
A - 高橋君の山崩しゲーム |
User |
kosakkun |
Language |
C++14 (GCC 5.4.1) |
Score |
541032 |
Code Size |
1041 Byte |
Status |
AC |
Exec Time |
82 ms |
Memory |
512 KB |
Judge Result
Set Name |
test_01 |
test_02 |
test_03 |
test_04 |
test_05 |
test_06 |
test_07 |
test_08 |
test_09 |
test_10 |
Score / Max Score |
55534 / 100000 |
53221 / 100000 |
54807 / 100000 |
51866 / 100000 |
54778 / 100000 |
54564 / 100000 |
53691 / 100000 |
55284 / 100000 |
53781 / 100000 |
53506 / 100000 |
Status |
|
|
|
|
|
|
|
|
|
|
Set Name |
Test Cases |
test_01 |
subtask_01_01.txt |
test_02 |
subtask_01_02.txt |
test_03 |
subtask_01_03.txt |
test_04 |
subtask_01_04.txt |
test_05 |
subtask_01_05.txt |
test_06 |
subtask_01_06.txt |
test_07 |
subtask_01_07.txt |
test_08 |
subtask_01_08.txt |
test_09 |
subtask_01_09.txt |
test_10 |
subtask_01_10.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask_01_01.txt |
AC |
72 ms |
512 KB |
subtask_01_02.txt |
AC |
74 ms |
512 KB |
subtask_01_03.txt |
AC |
72 ms |
512 KB |
subtask_01_04.txt |
AC |
82 ms |
512 KB |
subtask_01_05.txt |
AC |
73 ms |
512 KB |
subtask_01_06.txt |
AC |
72 ms |
512 KB |
subtask_01_07.txt |
AC |
75 ms |
512 KB |
subtask_01_08.txt |
AC |
71 ms |
512 KB |
subtask_01_09.txt |
AC |
75 ms |
512 KB |
subtask_01_10.txt |
AC |
75 ms |
512 KB |