TheForces Round #40 (Maths-Forces)

7 problems from TheForces Round #40 (Maths-Forces) (contest 105767), difficulty -. 2/7 solutions verified against sample I/O.

7 items

TheForces Round #40 (Maths-Forces)

Special | 7 problems | 2/7 verified | Difficulty - | 3m 39s

#	Problem	Time	✓
A	Submission Bait II	39s	✓
B	Subtractonacci	27s
C	Kaosar loves Polynomials	30s
D	Array Forge	26s
E	GCD and LCM in Perfect Sync	27s
F	Mega Polynomial	47s	✓
G	Max-Min Madness	23s

Practice › Codeforces Solutions › TheForces Round #40 (Maths-Forces) ›

CF 105767F - Mega Polynomial

We are given two polynomials. The first one is a linear polynomial $$f(x)=Ax+B$$ and the second one has only two non-zero terms: $$g(x)=Cx^n+Dx^{n-1}.

Practice › Codeforces Solutions › TheForces Round #40 (Maths-Forces) ›

CF 105767G - Max-Min Madness

Sure - I can do that. Please paste the Codeforces problem statement (or at least the problem link / full text). If there are constraints or samples, include those too.

Practice › Codeforces Solutions › TheForces Round #40 (Maths-Forces) ›

CF 105767E - GCD and LCM in Perfect Sync

I can’t write a correct Codeforces editorial without the actual problem statement. Right now the “Problem Statement / Input / Output” sections are empty, so there’s no way to reconstruct: - what objects are being manipulated - what “GCD and LCM in perfect sync”…

Practice › Codeforces Solutions › TheForces Round #40 (Maths-Forces) ›

CF 105767D - Array Forge

Sure-please paste the full Codeforces problem statement (or at least the problem link / contest + problem letter).

Practice › Codeforces Solutions › TheForces Round #40 (Maths-Forces) ›

CF 105767A - Submission Bait II

The task is to build an array of length n where every value is between 1 and 2n, and no value in the array can divide another value at a different position. The actual values do not matter beyond satisfying these two rules, so any valid construction is accepted.

Practice › Codeforces Solutions › TheForces Round #40 (Maths-Forces) ›

CF 105767C - Kaosar loves Polynomials

I’m missing the actual statement for Codeforces 105767C - Kaosar loves Polynomials, so I can’t reliably reconstruct the intended model, constraints, or even what is being computed. Right now you’ve provided only the formatting instructions, not the problem itself.

Practice › Codeforces Solutions › TheForces Round #40 (Maths-Forces) ›

CF 105767B - Subtractonacci

Sure - I can do that, but I need the problem first. Please paste the full Codeforces problem statement (or at least the key parts: input/output format, constraints, and statement). If you also have a link or contest/problem ID, that works too.