POJ2993
来源:互联网 发布:淘宝海外直邮要身份证 编辑:程序博客网 时间:2024/05/22 00:24
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
char str[100];
char map[10][10];
char line[40] = {"+---+---+---+---+---+---+---+---+"};//boundary
void init(void);//chushihua
void process(int flag);//fenxi
void deal(void);//huitu
int main()
{
init();
//baifangduru
gets(str);
process(0);
//heifangduru
gets(str);
process(1);
deal();
return 0;
}
void init(void)
{
memset(map,0,sizeof(0));
return ;
}
void process( int flag)
{
int l = strlen(str);
char chess = 'P';
int xx,yy;
int count = 0;
for( int i = 7; i < l; i++)
{
if(str[i] == ',')
continue;
else if(str[i] > 96)//lower
{
yy = 105 - str[i];
//cout<<str[i]<<endl;
}
else if(str[i] > 64) // upper
{
yy = str[i];
count = yy - 'P';
// cout<<str[i]<<endl;
}
else
{
xx = str[i] -'0';
map[xx][yy] = chess + count + ('a' - 'A' )* flag;
chess = 'P';
count = 0;
}
}
return ;
}
void deal(void)
{
for( int xx,i = 1; i<= 17; i++)
{
if((i%2) == 1)
printf("%s",line);
else
{
for( int y , j = 0, x = i/2; j<= 32; j++)
{
y = (j+3)/4;
switch(j%4)
{
case 0:
{
printf("|");
break;
}
case 2:
if(map[9-x][9-y] != 0)
{
printf("%c",map[9-x][9-y]);
}
else
printf("%c",((x+y)%2)? ':':'.');
break;
case 1:
case 3:
printf("%c",((x+y)%2)? ':':'.');
break;
}
}
}
cout<<endl;
}
}
#include <stdio.h>
#include <string.h>
using namespace std;
char str[100];
char map[10][10];
char line[40] = {"+---+---+---+---+---+---+---+---+"};//boundary
void init(void);//chushihua
void process(int flag);//fenxi
void deal(void);//huitu
int main()
{
init();
//baifangduru
gets(str);
process(0);
//heifangduru
gets(str);
process(1);
deal();
return 0;
}
void init(void)
{
memset(map,0,sizeof(0));
return ;
}
void process( int flag)
{
int l = strlen(str);
char chess = 'P';
int xx,yy;
int count = 0;
for( int i = 7; i < l; i++)
{
if(str[i] == ',')
continue;
else if(str[i] > 96)//lower
{
yy = 105 - str[i];
//cout<<str[i]<<endl;
}
else if(str[i] > 64) // upper
{
yy = str[i];
count = yy - 'P';
// cout<<str[i]<<endl;
}
else
{
xx = str[i] -'0';
map[xx][yy] = chess + count + ('a' - 'A' )* flag;
chess = 'P';
count = 0;
}
}
return ;
}
void deal(void)
{
for( int xx,i = 1; i<= 17; i++)
{
if((i%2) == 1)
printf("%s",line);
else
{
for( int y , j = 0, x = i/2; j<= 32; j++)
{
y = (j+3)/4;
switch(j%4)
{
case 0:
{
printf("|");
break;
}
case 2:
if(map[9-x][9-y] != 0)
{
printf("%c",map[9-x][9-y]);
}
else
printf("%c",((x+y)%2)? ':':'.');
break;
case 1:
case 3:
printf("%c",((x+y)%2)? ':':'.');
break;
}
}
}
cout<<endl;
}
}
0 0
- POJ2993
- POJ2993
- poj2993
- poj2993
- poj2993
- poj2993
- poj2993 poj2669
- poj2993模拟
- POJ2993&&POJ2996
- POJ2996 & POJ2993 (模拟)
- poj2993 2996(模拟)
- poj2993 与2996相反的模拟
- POJ2993 Emag eht htiw Em Pleh
- poj2993--Emag eht htiw Em Pleh
- POJ2993 - Emag eht htiw Em Pleh
- POJ2993 Emag eht htiw Em Pleh
- 两道很有意思的题目POJ 2996,POJ2993
- POJ2993,Emag eht htiw Em Pleh,跟2996反过来
- POJ3080
- activemq 消息队列 技术的介绍和原理
- C语言实现 hanio问题
- c++ const总结(转)
- 刘宇凡:苍井空靠粉丝经济卖内衣还能持续多久?
- POJ2993
- Tempter of the Bone
- POJ2485
- Android之shape与selector实现圆角
- classloader加载class的流程及自定义ClassLoader
- Mac下Ruby on Rails环境配置并配置Redmine
- C语言实现 递归法求最大公约数
- 学习Golang语言(6):类型--切片
- 启动hbase时,hregionserver没有启动的原因