CODEHUNT Problem 2
CodeChefOpen on judge ↗
Correct the programme #include int main() { int m, n, p, q, c, d, k, sum = 0; int f[10][10], s[10][10], mv[10][10]; scanf("%d%d", &m, &n); for (c = 0; c Input There two positive integer A&B on the input (equal to about 100000). It stands for the number of numbers to follow. Then there are AxB inputs from uer, each containing exactly one positive integer number N, 1 Output or every number N,
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start