UVA 488 - 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
#define RUN #ifdef RUN #include <stdio.h> #include <stdlib.h> #include <string.h> #include <assert.h> #include <string> #include <iostream> #include <sstream> #include <map> #include <set> #include <vector> #include <list> #include <cctype> #include <algorithm> #include <utility> #include <math.h> using namespace std; #define MAXN 105 int n; int amp, fre; void printout(bool islast){ for(int k=0; k<fre; k++){ for(int i=1; i<=amp; i++){ for(int j=1; j<=i; j++){ printf("%d", i); } printf("\n"); } for(int i=amp-1; i>=1; i--){ for(int j=1; j<=i; j++){ printf("%d", i); } printf("\n"); } if(!islast){ printf("\n"); } else{ if(k!=fre-1){ printf("\n"); } } } } int main(){ #ifndef ONLINE_JUDGE freopen("488.in", "r", stdin); freopen("488.out", "w", stdout); #endif scanf("%d", &n); for(int i=0; i<n; i++){ getchar(); getchar(); scanf("%d%d", &, &fre); if(i != n-1){ printout(false); } else{ printout(true); } } } #endif