結果

提出番号	1798
提出者	olphe
言語	C++
提出日時	2018-08-04 13:56:46
問題名	(65)Small Grid and Score
結果	WA
点数	0%

---

テストケース

ソースコード

#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"

using namespace std;

const long long int MOD = 1000000007;
const long double EPS = 1e-8;

long long int N, M, K, H, W, L, R;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	N = 18;
	cin >> M;
	vector<vector<long long int>>v(N, vector<long long int>(N));
	for (int i = 0; i < N; i++) {
		v[i][0] = 1;
		v[0][i] = 1;
	}
	for (int i = 1; i < N; i++) {
		for (int j = 1; j < N; j++) {
			v[i][j] = v[i][j - 1] + v[i - 1][j];
		}
	}
	K = M / v[17][17];
	vector<string>ans(20);
	for (int i = 0; i < 20; i++) {
		ans[i].resize(20, '.');
	}
	if (K) {
		for (int i = 34; i >= 0; i--) {
			if (K % 2 && K > 2) {
				for (int j = 0; j < 18; j++) {
					for (int k = 0; k < 18; k++) {
						if (i == j + k) {
							ans[j + 2][k] = '1';
						}
					}
				}
				K--;
			}
			else if (K >= 2) {
				for (int j = 0; j < 18; j++) {
					for (int k = 0; k < 18; k++) {
						if (i == j + k) {
							ans[j + 2][k] = '2';
						}
					}
				}
				K /= 2;
			}
		}
	}
	else {
		ans[1][0] = '#';
	}
	for (int i = 1; i < 19; i++) {
		ans[1][i] = '#';
		ans[i][18] = '#';
	}
	K = M % v[17][17];
	for (int i = 18; i >= 0; i--) {
		if (K % 2&&K>2) {
			ans[i][19] = '1';
			K--;
		}
		else if(K>1){
			ans[i][19] = '2';
			K /= 2;
		}
	}
	for (int i = 18; i > 0; i--) {
		if (K % 2&&K>2) {
			ans[0][i] = '1';
			K--;
		}
		else if (K > 1) {
			ans[0][i] = '2';
			K /= 2;
		}
	}
	cout << 20 << " " << 20 << endl;
	for (auto i : ans) {
		cout << i << endl;
	}
	return 0;
}