FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
JavaProgramming/HackerRank/FiftyNine.java at patch-2 · subham500071430/JavaProgramming · GitHub
subham500071430
/
JavaProgramming
Public
forked from
karterhhgg/JavaProgramming
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
JavaProgramming
/
HackerRank
/
FiftyNine.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
51 lines (41 loc) · 1.68 KB
Breadcrumbs
JavaProgramming
/
HackerRank
/
FiftyNine.java
Copy path
File metadata and controls
51 lines (41 loc) · 1.68 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
package
HackerRank
;
import
java
.
io
.*;
import
java
.
util
.*;
import
java
.
text
.*;
import
java
.
math
.*;
import
java
.
util
.
regex
.*;
public
class
FiftyNine
{
public
static
void
main
(
String
[]
args
) {
/* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
Scanner
sc
=
new
Scanner
(
System
.
in
);
// Read number of lines
int
n
=
sc
.
nextInt
();
sc
.
nextLine
();
// Consume the newline after reading the integer
// Initialize an ArrayList to hold the lines of numbers
ArrayList
<
ArrayList
<
Integer
>>
lines
=
new
ArrayList
<>();
// Read each line
for
(
int
i
=
0
;
i
<
n
;
i
++) {
// Read the number of integers in the line and the integers themselves
String
[]
input
=
sc
.
nextLine
().
split
(
" "
);
ArrayList
<
Integer
>
line
=
new
ArrayList
<>();
for
(
int
j
=
1
;
j
<
input
.
length
;
j
++) {
// Skip the first number (count)
line
.
add
(
Integer
.
parseInt
(
input
[
j
]));
}
lines
.
add
(
line
);
}
// Read the number of queries
int
q
=
sc
.
nextInt
();
// Process each query
for
(
int
i
=
0
;
i
<
q
;
i
++) {
int
x
=
sc
.
nextInt
() -
1
;
// Convert 1-based index to 0-based
int
y
=
sc
.
nextInt
() -
1
;
// Convert 1-based index to 0-based
// Check if the indices are valid
if
(
x
>=
0
&&
x
<
n
&&
y
>=
0
&&
y
<
lines
.
get
(
x
).
size
()) {
System
.
out
.
println
(
lines
.
get
(
x
).
get
(
y
));
}
else
{
System
.
out
.
println
(
"ERROR!"
);
}
}
sc
.
close
();
}
}
Back
|
FazBrowse Home
|
New Git URL