Submission #1359987

---

Source Code Expand

// In the name of God

#include <iostream>
#include <algorithm>
#include <fstream>
#include <vector>
#include <deque>
#include <assert.h>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <stdio.h>
#include <string.h>
#include <utility>
#include <math.h>
#include <bitset>
#include <iomanip>
#include <complex>

using namespace std;

#define rep(i, a, b) for (int i = (a), i##_end_ = (b); i < i##_end_; ++i)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define mp make_pair
#define x first
#define y second
#define pb push_back
#define SZ(x) (int((x).size()))
#define ALL(x) (x).begin(), (x).end()

template<typename T> inline bool chkmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template<typename T> inline bool chkmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
template<typename T> inline bool smin(T &a, const T &b)   { return a > b ? a = b : a;    }
template<typename T> inline bool smax(T &a, const T &b)   { return a < b ? a = b : a;    }

typedef long long LL;

const int N = (int) 505, oo = 1000 * 1000 * 1000 - 2, mod = (int) 0;
int a[N][N];
int main() {
	int n, m, h, w;
	cin >> n >> m >> h >> w;
	if (n % h == 0 && m % w == 0) {
		cout << "No\n";
		return 0;
	}
	int val = oo / (h * w - 1), neg = -(val * (h * w - 1) + 1);
	cout << "Yes\n";
	for (int x = 0; x < n; ++x)
		for (int y = 0; y < m; ++y) {
			a[x][y] = val;
			if (x % h == h - 1 && y % w == w - 1) {
				a[x][y] = neg;	
			}
		}
	for (int x = 0; x < n; ++x) {
		for (int y = 0; y < m; ++y) {
			cout << a[x][y] << ' ';	
		}
		cout << endl;
	}
}

Submission Info

Judge Result