【UVA - 488 Triangle Wave】

本文介绍了一个简单的程序,用于根据指定的振幅和频率生成三角波形。程序接收输入参数并输出对应数量的波形,每个波形的高度等于振幅。通过打印一系列递增和递减的数字来形成波形。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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 descri_ption 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



 1 // Project name : H ( Triangle Wave ) 
 2 // File name    : main.cpp
 3 // Author       : Izumu
 4 // Date & Time  : Tue Jul 10 20:32:18 2012
 5 
 6 
 7 #include <iostream>
 8 #include <stdio.h>
 9 #include <string>
10 #include <cmath>
11 using namespace std;
12 
13 int main()
14 {
15     int t;
16     cin >> t;
17     while (t--)
18     {
19         
20         int n, m;
21         cin >> n >> m;
22         for (int k = 0; k < m; k++)
23         {
24             if (k)
25             {
26                 cout << endl;
27             }
28             for (int i = 1; i <= n; i++)
29             {
30                 for (int j = 0; j < i; j++)
31                 {
32                     cout << i;
33                 }
34                 cout << endl;
35             }
36             for (int i = n - 1; i >= 1; i--)
37             {
38                 for (int j = 0; j < i; j++)
39                 {
40                     cout << i;
41                 }
42                 cout << endl;
43             }
44 
45         }
46         
47         if (t)
48         {
49             cout << endl;
50         }
51     }
52     return 0;
53 }
54 
55 // end 
56 // ism 

转载于:https://www.cnblogs.com/ismdeep/archive/2012/07/10/2585238.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值