九度 OJ 1464 Hello World for U
2014-03-25 22:32
573 查看
题目描述
将输入长度为n的字符串按 |__| 形输出。两个竖形变分别记为n1、n3,横边记为n2,要求:n1 = n3 = k,k<=n2,3 <= n2 <= n,n1 + n2 +n3 -2 = n。输入
输入的字符串占一行,长度介于5-80之间,没有空格。输出
按描述中的要求进行输出。源代码
#include<stdio.h> #include<string.h> int main() { char str[81]; while(scanf("%s",str) != EOF){ int len = strlen(str); int n1,n3; int i,j; if(len % 3 == 0) n1 = len / 3 - 1; else n1 = len / 3; n3 = len - n1*2; for(i=0;i<n1;i++) { printf("%c",str[i]); for(j = 0;j<n3-2;j++){ printf(" "); } printf("%c\n",str[len - i - 1]); } for(i=0;i<n3;i++) printf("%c",str[n1+i]); printf("\n"); } return 0; } /************************************************************** Problem: 1464 User: Language: C Result: Accepted Time:10 ms Memory:912 kb ****************************************************************/
相关文章推荐
- 九度OJ 题目1464:Hello World for U
- 【学习笔记】〖九度OJ〗题目1464:Hello World for U
- 九度oj 题目1464:Hello World for U 【ZJU2012考研机试题1】
- 九度1464:Hello World for U
- 九度 1464:Hello World for U
- 九度OnlineJudge之1464:Hello World for U
- 九度考研真题 浙大 2012-1浙大1464:Hello World for U
- 1464 Hello World for U 九度Online Judge
- 九度 题目1464:Hello World for U
- 题目1464:Hello World for U
- 九度:1464<Hello World For U><排版>
- 九度OJ-1464:Hello World for U
- 九度OJ 1464 Hello World for U
- 九度oj-1464-Hello World for U
- 题目1464:Hello World for U
- 题目1464:Hello World for U
- 题目1464:Hello World for U
- 1031. Hello World for U (20)
- Hello World for U (20)
- 1031. Hello World for U