• 寒假刷题之5——竹简文


    Rotating Sentences

    In ``Rotating Sentences,'' you are asked to rotate a series of input sentences 90 degrees clockwise. So instead of displaying the input sentences from left to right and top to bottom, your program will display them from top to bottom and right to left.

    Input and Output

    As input to your program, you will be given a maximum of 100 sentences, each not exceeding 100 characters long. Legal characters include: newline, space, any punctuation characters, digits, and lower case or upper case English letters. (NOTE: Tabs are not legal characters.)

    The output of the program should have the last sentence printed out vertically in the leftmost column; the first sentence of the input would subsequently end up at the rightmost column.

    Input

    Rene Decartes once said,
    "I think, therefore I am."

    Output

    "R
    Ie
     n
    te
    h 
    iD
    ne
    kc
    ,a
     r
    tt
    he
    es
    r
    eo
    fn
    oc
    re
    e
     s
    Ia
     i
    ad
    m,
    .
    "

       感觉好水啊这题,题目很容易就看懂了,为了搞清楚输入输出细节我借助了google翻译,结果"I think, therefore I am."这句名言变成了刘若英说的,让人捧腹。。。
       wa了几次,老会把空格打成a,定义ch数组时老是无法正常定义,遇到a条件输出空格也不行,不知道是错误出在哪里。。

    #include<stdio.h>
    
    int main()
    {
    	int i = 0, j = 0, maxj = 0, maxi;
    	char ch[100][100], temp;
    	int row[100] = {0};
    	
    	for (;(temp = getchar()) != EOF;){
    		if (temp == '\n'){
    			i ++;
    			j = 0;
    		}
    		else if (temp != '\t'){
    			ch[i][j++] = temp;
    			if (maxj < j)
    				maxj = j;
    			row[i] = j;
    		}
    	}
    	
    	maxi = i - 1;
    	for (j = 0; j < maxj; j ++){
    		for (i = maxi; i >= 0; i --)
    			printf("%c", j < row[i] ? ch[i][j]: ' ');
    		printf("\n");
    	}
    	
    	return 0;
    }


       挺水的一题我做了也好久,看了我还是太弱了。。。

  • 相关阅读:
    子树的结点个数
    CF988 D. Points and Powers of Two【hash/数学推理】
    回溯法练习【BFS/DFS】
    Zoj 1610 Count the Colors (线段树+区间更新+暴力计数)
    Poj 2947 widget factory (高斯消元解同模方程)
    Poj 2065 SETI (高斯消元)
    Lightoj 1054
    Poj 2528 Mayor's posters (线段树+离散化)
    Lightoj 1090
    Poj 1753 Flip Game 高斯消元
  • 原文地址:https://www.cnblogs.com/java20130723/p/3212279.html
Copyright © 2020-2023  润新知