# 20191214TOI新手同好會6.資工系的浪漫

---

題目連結：https://zerojudge.tw/ShowProblem?problemid=e799

---

#include<iostream>
using namespace std;

int main(){
	int n, m, i = 0, k = 0;
	long long int s;
	char c;
	int g[62][62];
	cin >> n >> m >> c;
	while(i < n){
		cin >> s;
		k = 0;
		while(s >= 1){
			if(s % 2 == 0)
				g[i][k] = 0;
			else
				g[i][k] = 1;
			s = s / 2;
			k++;
		}
		i++;
	}
	for(int j = 0; j < n; j++){
		for(int p = m - 1; p >= 0; p--){
			if(g[j][p] == 0)
				cout << ". ";
			else
				cout << c << " ";
		}
		cout << endl;
	}
	return 0;
} 

---

* 紀錄二進位的時候，要記得倒過來看
(測資都是對稱的有夠討厭)