FMI No Stress 11

14 problems from FMI No Stress 11 (contest 103999), difficulty -. 2/14 solutions verified against sample I/O.

14 items

FMI No Stress 11

Special | 14 problems | 2/14 verified | Difficulty - | 7m 36s

#	Problem	Rating	Tags	Accepted	Time	✓
A	String String				43s	✓
B	Nitoiu				31s
C	Prime				26s
D	Gioconda				26s
E	CntSeq				22s
F	Basketball				28s
G	Battle of Scundu				24s
H	for-for-for-for				32s
I	Dacians vs Samurai				42s
J	P-ON				33s
K	Iuli				37s
L	SAlt				52s	✓
M	Interesting Minimums				29s
N	Bitscore				31s

Practice › Codeforces Solutions › FMI No Stress 11 ›

CF 103999L - SAlt

Each query gives a contiguous segment of the array. Inside that segment, we consider all possible subsets. For each subset, we sort it in descending order and assign alternating signs starting with plus.

Practice › Codeforces Solutions › FMI No Stress 11 ›

CF 103999N - Bitscore

The problem statement is missing from your message, so I don’t have enough information to write a correct editorial.

Practice › Codeforces Solutions › FMI No Stress 11 ›

CF 103999M - Interesting Minimums

I can write the full editorial in the exact style you want, but I’m missing the only thing that makes it possible: the actual problem statement.

Practice › Codeforces Solutions › FMI No Stress 11 ›

CF 103999K - Iuli

I don’t have the statement for Codeforces 103999K - Iuli available in your prompt, and I can’t reconstruct it reliably from the title alone.

Practice › Codeforces Solutions › FMI No Stress 11 ›

CF 103999J - P-ON

I can’t write a correct editorial yet because the actual problem statement for Codeforces 103999J - P-ON is missing from your prompt.

Practice › Codeforces Solutions › FMI No Stress 11 ›

CF 103999H - for-for-for-for

I don’t have the actual problem statement for Codeforces 103999H - for-for-for-for, so I can’t reliably derive the solution, constraints, or even the intended algorithm.

Practice › Codeforces Solutions › FMI No Stress 11 ›

CF 103999I - Dacians vs Samurai

The problem statement is missing from your prompt, so I don’t have enough information to write a correct editorial. Right now I only know the title “Dacians vs Samurai”, but there are no details about the input format, the operations, or what needs to be computed.

Practice › Codeforces Solutions › FMI No Stress 11 ›

CF 103999G - Battle of Scundu

I can’t write a correct editorial yet because the actual problem statement for “Codeforces 103999G - Battle of Scundu” is missing.

Practice › Codeforces Solutions › FMI No Stress 11 ›

CF 103999F - Basketball

I don’t have the actual statement of Codeforces 103999F - Basketball, and without it I can’t reconstruct the problem or derive a correct solution.

Practice › Codeforces Solutions › FMI No Stress 11 ›

CF 103999E - CntSeq

The problem statement is missing from your prompt, so I can’t reliably reconstruct the task or write a correct Codeforces-style editorial.

Practice › Codeforces Solutions › FMI No Stress 11 ›

CF 103999A - String String

We are given two strings, a longer text string and a shorter pattern string. The task is to determine how many times the pattern appears inside the text as a contiguous substring.

Practice › Codeforces Solutions › FMI No Stress 11 ›

CF 103999C - Prime

The problem statement section is empty, so there is no information about what “103999C - Prime” is actually asking.

Practice › Codeforces Solutions › FMI No Stress 11 ›

CF 103999D - Gioconda

The problem statement for Codeforces 103999D - Gioconda is missing from your message, so I don’t have the actual task description to base an editorial on. Right now I only see empty sections for Input/Output, which isn’t enough to reconstruct the problem reliably.

Practice › Codeforces Solutions › FMI No Stress 11 ›

CF 103999B - Nitoiu

I can’t produce a correct editorial yet because the actual problem statement for Codeforces 103999B - Nitoiu is missing, and it does not appear to be accessible from the standard problemset content in the way typical Codeforces tasks are.