Codeforces Round #259 (Div. 2) problemsA Little Pony and Crystal Mine
来源:互联网 发布:俄航中转莫斯科 知乎 编辑:程序博客网 时间:2024/06/06 02:40
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<cctype>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<stack>
#define ll long long
#define MAX 1000
#define INF INT_MAX
#define eps 1e-8
using namespace std;
char s[MAX][MAX];
int main(){
int n;
while (scanf("%d",&n) != EOF){
for (int i=0; i<n/2+1; i++){
int k = n/2-i;
//printf("k = %d\n",k);
for (int j=0; j<k; j++) s[i][j] = '*';
for (int j=n-1,v=0; v<k; v++,j--) s[i][j] = '*';
for (int j = k; j<n-k; j++) s[i][j] = 'D';
}
for (int i=0,j = n-1; i<n/2; i++,j--){
memcpy(s[j],s[i],sizeof(s[i]));
}
for (int i=0; i<n; i++){
for (int j=0; j<n; j++) printf("%c",s[i][j]);
printf("\n");
}
}
return 0;
}
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<cctype>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<stack>
#define ll long long
#define MAX 1000
#define INF INT_MAX
#define eps 1e-8
using namespace std;
char s[MAX][MAX];
int main(){
int n;
while (scanf("%d",&n) != EOF){
for (int i=0; i<n/2+1; i++){
int k = n/2-i;
//printf("k = %d\n",k);
for (int j=0; j<k; j++) s[i][j] = '*';
for (int j=n-1,v=0; v<k; v++,j--) s[i][j] = '*';
for (int j = k; j<n-k; j++) s[i][j] = 'D';
}
for (int i=0,j = n-1; i<n/2; i++,j--){
memcpy(s[j],s[i],sizeof(s[i]));
}
for (int i=0; i<n; i++){
for (int j=0; j<n; j++) printf("%c",s[i][j]);
printf("\n");
}
}
return 0;
}
0 0
- Codeforces Round #259 (Div. 2) problemsA Little Pony and Crystal Mine
- Codeforces Div. 2 #259-A. Little Pony and Crystal Mine
- Codeforces Round #259 (Div. 2) A. Little Pony and Crystal Mine
- Codeforces Round #259 (Div. 2) A-Little Pony and Crystal Mine
- Codeforces Round #259 (Div. 2) A.Little Pony and Crystal Mine
- Codeforces Round #259 (Div. 2) A. Little Pony and Crystal Mine(简单模拟实现题)
- Codeforces Round #259 (Div. 2) 454A Little Pony and Crystal Mine(模拟)
- Codeforces Round #259 (Div. 2) A. Little Pony and Crystal Mine
- Codeforces 454A. Little Pony and Crystal Mine
- Codeforces 454A Little Pony and Crystal Mine(水题)
- codeforces 454A Little Pony and Crystal Mine
- A. Little Pony and Crystal Mine
- A. Little Pony and Crystal Mine
- Codeforces 453 B Little Pony and Harmony Chest(Round 259 div.1 B/div.2 D)
- Codeforces Round #259 (Div. 2) C. Little Pony and Expected Maximum
- Codeforces Round #259 (Div. 2) B. Little Pony and Sort by Shif
- Codeforces Round #259 (Div. 2) B. Little Pony and Sort by Shift
- Codeforces Round #259 (Div. 2)C. Little Pony and Expected Maximum
- 【模拟】【环形数组】-UVA-133- The Dole Queue |java实现
- 个人FPGA学习心得
- android 常用布局LinearLayout以及RelativeLayout介绍
- JavaScript模块化开发
- hdu 1394 线段树之四
- Codeforces Round #259 (Div. 2) problemsA Little Pony and Crystal Mine
- OpenGLES demo - 14. 阴影贴图 Shadow Map 之平行光
- 考研日记--8.1 未来呀未来
- 关于字符编码,你所需要知道的
- 搜:搜索内容,返回百度的结果 20140801 ①文本处理
- ubuntu重启,dns修改为默认值的禁止
- 黑马程序员_银行业务调度系统
- AIDL(1)
- c++ primer(第五版)笔记 第三章(1)string类