Because cf has a round.

That's because the round was clashing with Technocup based Codeforces Rounds that could not be rescheduled.

Just get rid of the prefix.

Fixed, thanks.

Reminder 2 — Contests starts in less than 15 minutes.

GL; HF!

Sorry, there was an issue with CodeChef. It is being handled.

Very true, I literally spent half an hour wondering how is "a" a bad substring and then saw the announcement :(.

Let's see:

• Literally first sentence in the statement: "managed to obtain a string S"
• Literally last sentence in the statement: "Help Sed find the number of good substrings in the string S."
• Input: "The first and only line of each test case contains a single string S."
• Constraints: talks about S.
• Also somewhere in the statement: "the original string S"

What else would S be?

ahh i agree statements were huge :. also the definition of substring mid problem statement was a bad idea. I think putting it at the bottom would have been better.

Increasing difficulty of the first problem may not be a good idea. Many people will just leave the contest if you raise its difficulty. Solving first problem quickly commits people to participate in the contest, otherwise if it starts taking more time, the propensity of people leaving the contest rises.

Am I on the right track? Yes, all capacities except one are powers of 2 (in my solution).

Yep, I think you're on the right track as I also did powers of $$$2$$$. The idea is you fill in a bucket of size $$$2^k$$$ until there are $$$2^{k-1}$$$ fruits, and then keep filling the bucket of size $$$2^k$$$ one fruit at a time while using the rest of your three fruits to fill up $$$2^{k+1}$$$ until the bucket of size $$$2^{k+1}$$$ reaches a fruit count of $$$2^k$$$, which must happen before the bucket of size $$$2^k$$$ gets full. Then do the same thing for the bucket of size $$$2^{k+1}$$$ and so on.

Maybe you forgot that sizes of baskets must be less or equal than $$$n$$$?

Yup, powers of two is on the right track.

#include <bits/stdc++.h>
#define int long long
using pii=std::pair<int,int>;
using namespace std;
 
int t, n;
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> t;
    for(int cases = 0; cases < t; cases++)
    {
        cin >> n;
        cout << 30 << "\n";
        for(int i = 1; i <= 30; i++)
            cout << min(1ll << i, n) << "\n";
        cout << 1 << "\n";
        cout << 1 << " " << 1 << "\n";
        int cursz = 2, curbasket = 1, nestep = 1;
        for(int curstep = 2; curstep <= n; curstep++)
        {
            if(curstep > cursz)
            {
                cursz *= 2;
                curbasket++;
                nestep = 1;
            }
            cout << 3 << "\n";
            cout << curstep << " " << curbasket << "\n";
            cout << nestep++ << " " << curbasket + 1 << "\n";
            cout << nestep++ << " " << curbasket + 1 << "\n";
        }
    }
    return 0;
} 

simpler solution using 4 fruits
Thats the reason they allowed 4 fruits and 1000 baskets. Many times they fake constraints instead of making them tight so as to avoid giving out information.

Utkarsh and Ashishgup did same in D. Circle Game as well. They could have very easily made T<=1e5 and d<=1e18 in D. Circle Game.