Submission #667190

---

Source Code Expand

#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL<<25;
#define rep(i,n) for(ll (i)=0;(i)<(ll)(n);++(i))
#define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d))
#define all(v) (v).begin(), (v).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset((m),(v),sizeof(m))

#define N 30
#define M 100
ll A[N+2][N+2];

int main(){
	rep(i, N) rep(j, N) cin>>A[i][j];
	rep(_, M) rep(i, N) rep(j, N){
		if(A[i][j]){
			cout<<i+1<<" "<<j+1<<endl;
			A[i][j]--;
		}
	}
	return 0;
}

Submission Info

Judge Result