Problems
 
 
# Name    
C
standard input/output
1 s, 256 MB
Submit  x45
D
standard input/output
1 s, 256 MB
Submit  x28
E
standard input/output
5 s, 256 MB
Submit  x18
F
standard input/output
1 s, 256 MB
Submit  x20
G
standard input/output
1 s, 256 MB
Submit  x14
H
standard input/output
2 s, 256 MB
Submit  x19
I
standard input/output
2 s, 256 MB
Submit  x13
J
standard input/output
2 s, 256 MB
Submit  x8
K
standard input/output
2 s, 256 MB
Submit  x5
L
standard input/output
1 s, 256 MB
Submit  x3
M
standard input/output
2 s, 256 MB
Submit  x2
Complete problemset
 
 
 
 
Questions about problems
 
 
  Question Answer
2022-11-12 04:02:36
Problem G. Foil Folding
*****
If n = m = 1, then how can 1 < k < max(n,m) ?
Sorry, this is a typo -- that should say 1 <= k <= max(n.m).