hdu-1200-To and Fro
来源:互联网 发布:淘宝开店认证怎 编辑:程序博客网 时间:2024/05/16 12:56
#include<stdio.h>
#include<string.h>
char a[250],b[250][250];
int main()
{
int n;
while(scanf("%d",&n)&&n!=0)
{
int m,i,j,k,t;
scanf("%s",a);
m=strlen(a);
for(i=0;i<250;i++)
for(j=0;j<250;j++)
b[i][j]='0';
for(k=0,i=0;k<m;)
{
for(j=0;j<n&&k<m;j++)
b[i][j]=a[k++];
i=i+1;
for(j=j-1;j>=0&&k<m;j--)
b[i][j]=a[k++];
i+=1;
}
t=i;
for(j=0;j<n;j++)
for(i=0;i<t;i++)
if(b[i][j]!='0')
//if(b[i][j]>='a'&&b[i][j]<='z'||b[i][j]>='A'&&b[i][j]<='Z')
printf("%c",b[i][j]);
printf("\n");
}
return 0;
}
#include<string.h>
char a[250],b[250][250];
int main()
{
int n;
while(scanf("%d",&n)&&n!=0)
{
int m,i,j,k,t;
scanf("%s",a);
m=strlen(a);
for(i=0;i<250;i++)
for(j=0;j<250;j++)
b[i][j]='0';
for(k=0,i=0;k<m;)
{
for(j=0;j<n&&k<m;j++)
b[i][j]=a[k++];
i=i+1;
for(j=j-1;j>=0&&k<m;j--)
b[i][j]=a[k++];
i+=1;
}
t=i;
for(j=0;j<n;j++)
for(i=0;i<t;i++)
if(b[i][j]!='0')
//if(b[i][j]>='a'&&b[i][j]<='z'||b[i][j]>='A'&&b[i][j]<='Z')
printf("%c",b[i][j]);
printf("\n");
}
return 0;
}
- hdu 1200 To and Fro
- hdu 1200 To and Fro
- hdu 1200 To and Fro
- HDU 1200 To and Fro
- hdu 1200 To and Fro
- hdu-1200-To and Fro
- HDU-1200To and Fro
- hdu 1200 To and Fro
- hdu 1200 To and Fro
- HDU 1200 To and Fro
- hdu 1200 To and Fro
- HDU 1200 To and Fro
- HDU 1200 To and Fro
- HDU 1200 To and Fro
- hdu 1200 To and Fro
- HDU 1200 To and Fro
- hdu-1200 To and Fro
- HDU 1200 To and Fro
- 由include、extend的关系联想到组合、聚合的关系
- 第一个 Swing 程序
- listener.ora/sqlnet.ora/tnsnames.ora配置文件详解
- 选择排序
- 百度地图:根据范围和检索词发起范围搜索
- hdu-1200-To and Fro
- [算法][LeetCode]Search a 2D Matrix——二维数组的二分查找
- 存储快照
- hdu1181(变形课)
- 常见的数据结构java实现
- windbg+winXP 双机调试配置
- HashMap的使用
- CV牛人牛事简介
- 杭电OJ_A+B