UVa488 - Triangle Wave-难度1

题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=429

 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

代码:

[cpp]  view plain copy 在CODE上查看代码片 派生到我的代码片
  1. /* 
  2.  *注意点:There is a blank line after each separate waveform, 
  3.  *      excluding the last one. 除了最后一个波,其余波后面输出换行, 
  4.  *      可以把换行接到后一个波上。用first表示第一个,第一个波前面不用换 
  5.  *      行,其余波在输出前先翻墙。 
  6.  */  
  7.   
  8. #include <iostream>  
  9. #include <string>  
  10. #include <cstdio>  
  11. #include <cctype>  
  12. using namespace std;  
  13.   
  14. int main()  
  15. {  
  16. #ifdef LOCAL  
  17.     freopen("f:\\input.txt""r", stdin);  
  18. #endif LOCAL  
  19.       
  20.     int n, first = 0;//first 用来控制换行  
  21.     cin >> n;  
  22.     while(n--)  
  23.     {  
  24.         int A, F;// A 表示振幅,F表示频率。  
  25.         cin >> A >> F;  
  26.         for(int i = 0; i < F ; ++i)  
  27.         {  
  28.             if(first == 0)  
  29.             {  
  30.                 first = 1;  
  31.             }  
  32.             else  
  33.             {  
  34.                 cout << endl;  
  35.             }  
  36.             int temp = 2 * A - 1, j;  
  37.             for(j = 1 ; j <= A; ++j)  
  38.             {  
  39.                 for(int k = 0; k < j; ++k)  
  40.                 {  
  41.                     cout << j;  
  42.                 }  
  43.                 cout << endl;  
  44.             }  
  45.             for(; j <= temp; ++j)  
  46.             {  
  47.                 for(int k = 0; k < temp + 1 - j; ++k)  
  48.                 {  
  49.                     cout << temp + 1 - j;  
  50.                 }  
  51.                 cout << endl;  
  52.             }  
  53.         }  
  54.     }  
  55.     return 0;  
  56. }  
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值