← All problemsSign in

Polynomials

CodeChefRating 2722Open on judge ↗

Given n functions yi(x) = a0 + a1x + a2x2 + a3x3 and q queries. For each query, you are given an integer t and you are required to find out yi (i ≤ i ≤ n) that minimizes the value of yi(t). Input The first line is an integer T denotes the number of testcases. Each testcase starts with an integer n on a single line, the number of polynomials. The next n lines, each line describes a polynomial con

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.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start