You are given a cube of size k × k × k , which consists of unit cubes. Two unit cubes are considered neighbouring, if they have common face.
Your task is to paint each of k 3 unit cubes one of two colours (black or white), so that the following conditions must be satisfied:
- each white cube has exactly 2 neighbouring cubes of white color;
- each black cube has exactly 2 neighbouring cubes of black color.
The first line contains integer k (1 ≤ k ≤ 100) , which is size of the cube.
Print -1 if there is no solution. Otherwise, print the required painting of the cube consequently by layers. Print a k × k matrix in the first k lines, showing how the first layer of the cube should be painted. In the following k lines print a k × k matrix — the way the second layer should be painted. And so on to the last k -th layer. Note that orientation of the cube in the space does not matter.
Mark a white unit cube with symbol " w " and a black one with " b ". Use the format of output data, given in the test samples. You may print extra empty lines, they will be ignored.
1
-1
2
bb
ww
bb
ww
題目意思，輸出一個k*k*k的立體模型，使每個b的旁邊有2個b，每個k的旁邊有2個k
題解：
題目說的輸出描述有點問題，它說的是先輸出你的第1層，再輸出k層從1到k的你的模型。實際上只用輸出你構造的模型的1-k層。
這里提供兩種構造方法
第1種
bbwwbb
bbwwbb
wwbbww
wwbbww
bbwwbb
bbwwbb
這種就是4個4個的。。以后每層就把上一層取反就OK了
還有一種是
bbbbbb
bwwwwb
bwbbwb
bwbbwb
bwwwwb
bbbbbb
類似這種不斷將最外層圍起來的構造方式，同理，以后的每層就把上一層取反就OK了。。
構造方法不唯一的。
至于 k 為奇數時無解我無法證明這個。。。
?
/*
* @author ipqhjjybj
* @date 20130709
*
*/
#include <cstdio>
#include <cstdlib>
int main(){
int k;
scanf("%d",&k);
if(k&1) {
puts("-1");
return 0;
}
for(int i=0;i<k;i++){
for(int j=0;j<k;j++){
for(int z=0;z<k;z++){
putchar(((j>>1)&1)^((z>>1)&1)^(i&1)?'w':'b');
}
putchar('\n');
}
putchar('\n');
}
return 0;
}
?
?
更多文章、技術交流、商務合作、聯系博主
微信掃碼或搜索：z360901061
微信掃一掃加我為好友
QQ號聯系： 360901061
您的支持是博主寫作最大的動力，如果您喜歡我的文章，感覺我的文章對您有幫助，請用微信掃描下面二維碼支持博主2元、5元、10元、20元等您想捐的金額吧，狠狠點擊下面給點支持吧，站長非常感激您！手機微信長按不能支付解決辦法：請將微信支付二維碼保存到相冊，切換到微信，然后點擊微信右上角掃一掃功能，選擇支付二維碼完成支付。
【本文對您有幫助就好】元
