FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
cpp/F14TwoDimensionalArrays/PrintLikeAWave.cpp at main · roydevashish/cpp · GitHub
roydevashish
/
cpp
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Issues
0
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
cpp
/
F14TwoDimensionalArrays
/
PrintLikeAWave.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
93 lines (76 loc) · 2.09 KB
Breadcrumbs
cpp
/
F14TwoDimensionalArrays
/
PrintLikeAWave.cpp
Copy path
File metadata and controls
93 lines (76 loc) · 2.09 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
/*
Title: Print Like a Wave
Problem statement
For a given two-dimensional integer array/list of size (N x M), print the array/list in a sine wave
order, i.e, print the first column top to bottom, next column bottom to top and so on.
Detailed explanation ( Input/output format, Notes, Images )
Input format :
The first line contains an Integer 't' which denotes the number of test cases or queries to be run.
Then the test cases follow.
First line of each test case or query contains two integer values, 'N' and 'M', separated by a single
space. They represent the 'rows' and 'columns' respectively, for the two-dimensional array/list.
Second line onwards, the next 'N' lines or rows represent the ith row values.
Each of the ith row constitutes 'M' column values separated by a single space.
Output format :
For each test case, print the elements of the two-dimensional array/list in the sine wave order in a
single line, separated by a single space.
Output for every test case will be printed in a seperate line.
Constraints :
1 <= t <= 10^2
0 <= N <= 10^3
0 <= M <= 10^3
Time Limit: 1sec
Sample Input 1:
1
3 4
1 2 3 4
5 6 7 8
9 10 11 12
Sample Output 1:
1 5 9 10 6 2 3 7 11 12 8 4
Sample Input 2:
2
5 3
1 2 3
4 5 6
7 8 9
10 11 12
13 14 15
3 3
10 20 30
40 50 60
70 80 90
Sample Output 2:
1 4 7 10 13 14 11 8 5 2 3 6 9 12 15
10 40 70 80 50 20 30 60 90
*/
#
include
<
iostream
>
using
namespace
std
;
int
main
() {
int
t;
cin >> t;
for
(
int
test_case =
0
; test_case < t; test_case++) {
int
n, m;
cin >> n >> m;
int
input_array[n][m];
for
(
int
i =
0
; i < n; i++) {
for
(
int
j =
0
; j < m; j++) {
cin >> input_array[i][j];
}
}
//
for
(
int
j =
0
; j < m; j++) {
if
(j %
2
==
0
) {
for
(
int
i =
0
; i < n; i++) {
cout << input_array[i][j] <<
"
"
;
}
}
else
{
for
(
int
i = n-
1
; i >=
0
; i--) {
cout << input_array[i][j] <<
"
"
;
}
}
}
cout << endl;
}
return
0
;
}
Back
|
FazBrowse Home
|
New Git URL