KY147 Hello World for U浙江大学复试上机题

KY147 Hello World for U浙江大学复试上机题

一、题目描述

Given any string of N (>=5) characters, you are asked to form the characters into the shape of U. For example, “helloworld” can be printed as: h d e l l r lowo That is, the characters must be printed in the original order, starting top-down from the left vertical line with n1 characters, then left to right along the bottom line with n2 characters, and finally bottom-up along the vertical line with n3 characters. And more, we would like U to be as squared as possible – that is, it must be satisfied that n1 = n3 = max { k| k <= n2 for all 3 <= n2 <= N } with n1 + n2 + n3 - 2 = N.
输入描述:
There are multiple test cases.Each case contains one string with no less than 5 and no more than 80 characters in a line. The string contains no white space.
输出描述:
For each test case, print the input string in the shape of U as specified in the description.
示例1
输入:
helloworld!
www.nowcoder.com
复制
输出:
h !
e d
l l
lowor
w m
w o
w c
. .
n r
owcode

二、题目描述

就是把一个长度为N(5<=N<=80)字符串表达成U型,
高度为u1,宽度为u2,u1和u2尽可能的接近,但u2 > u1且u2>3。

三、代码描述

1、将其看成是矩阵,先赋值,再打印

#include <iostream>
#include <math.h>
#include<cstring>
using namespace std;

//2.2图形模拟
//图形排版

//Hello World for U
const int MAXN=80+10;
char matrix[MAXN][MAXN];
int main(){
    char str[80];
    while(scanf("%s",&str)!=EOF){
        int n1;
        int N=strlen(str);
        for(int i=1;i<N;++i){
           if(N+2-2*i>=i&&i>n1&&N+2-2*i>=3){
                n1=i;
            }
        }
        int n2=N+2-2*n1;
        printf("%d %d %d\n",N,n1,n2);
        //按行输出
        for(int i=0;i<n1;i++){
            for(int j=0;j<n2;j++){
                matrix[i][j]=' ';
            }
        }
        for(int i=0;i<=n1;i++){
                matrix[i][0]=str[i];
                matrix[n1-1][i]=str[n1+i-1];
                matrix[i][n2-1]=str[N-i-1];
            }
        for(int i=0;i<n1;i++){
            for(int j=0;j<n2;j++){
                printf("%c",matrix[i][j]);
            }
            printf("\n");
        }

    }
}

2、直接打印

#include<cstdio>
#include<string.h>
using namespace std;
 
int main(){
    char str[80];
    while(~scanf("%s",str)){
        int i, n1=0;
        int N=strlen(str);
        for(i=1;i<N;i++){                   /*先计算n1和n2*/
            if(N+2-2*i>=i && i>n1)
                n1=i;
        }
        int n2=N+2-2*n1;
         
        int j=N, k;                         /*按行输出*/ 
        for(i=0,j=N-1;j-i+1>n2;i++,j--){
            printf("%c",str[i]);           /*输出每行第一个字符*/ 
            for(k=0;k<n2-2;k++)            /*输出中间的空格*/ 
                printf(" ");
            printf("%c\n",str[j]);         /*输出每行最后一个字符*/ 
        } 
        for(;i<=j;i++)                     /*输出最后一行*/ 
            printf("%c",str[i]);
        printf("\n");          
    }
    return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值