关闭

UVA oj 488 Triangle Wave

标签: UVAoj488
133人阅读 评论(0) 收藏 举报
分类:
Time Limit: 3000MS   Memory Limit: Unknown   64bit IO Format: %lld & %llu

 Status

Description

Download as PDF

 Triangle Wave 

In this problem you are to generate a triangular wave form according to a specified pair of Amplitude and Frequency.

Input and Output

The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive inputs.

Each input set will contain two integers, each on a separate line. The first integer is the Amplitude; the second integer is the Frequency.

For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.

For the output of your program, you will be printing wave forms each separated by a blank line. The total number of wave forms equals the Frequency, and the horizontal ``height'' of each wave equals the Amplitude. The Amplitude will never be greater than nine.

The waveform itself should be filled with integers on each line which indicate the ``height'' of that line.

NOTE: There is a blank line after each separate waveform, excluding the last one.

Sample Input

1

3
2

Sample Output

1
22
333
22
1

1
22
333
22
1
一道水题,PE了两发,UVA的样例输入好奇葩
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
using namespace std;

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
       int x,y;
       scanf("%d%d",&x,&y);
        for(int i=1;i<=y;i++)
        {
            for(int j=1;j<=x;j++)
            {
                for(int k=1;k<=j;k++)
                {
                    printf("%d",j);
                }
                printf("\n");
            }
            for(int j=x-1;j>=1;j--)
            {
                for(int k=1;k<=j;k++)
                {
                    printf("%d",j);
                }
                printf("\n");
            }
            if(i != y)
                printf("\n");
        }
        if(t)
            printf("\n");
    }
    return 0;
}

0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:46401次
    • 积分:2779
    • 等级:
    • 排名:第12933名
    • 原创:242篇
    • 转载:16篇
    • 译文:0篇
    • 评论:0条