r/codeforces

Hey everyone,

I came across this LeetCode profile (vinaypinagadi) and noticed some absolutely absurd statistics that defy basic human limitations. While the user clearly has some competitive programming background (they hold a Guardian badge), their overall profile metrics are a textbook example of scripted bulk-uploading or botting.

https://leetcode.com/u/vinaypinagadi/

Here are the undeniable facts based on their public dashboard:

1. The Impossible Daily Average

• Total Active Days: 123 days
• Max Streak: 123 days
• Total Problems Solved: 3,239
• The Math: To hit this number in this exact timeframe, this user had to solve 26.3 unique problems every single day for 4 months straight without a single day off.

1. The Complexity Breakdown

The profile claims they solved:

• Hard: 773 problems
• Medium: 1,635 problems
• Easy: 831 problems

Even for a seasoned competitive programmer, reading, conceptualizing, coding, and debugging 6.2 Hard problems and 13.2 Medium problems every single day alongside Easy ones is completely unrealistic.

3. The 380-Submission Spike

If you look closely at their heat map for April 28, 2026, they recorded 380 submissions in a single day.

• Assuming they didn't sleep for a full 24 hours, that forces an average of 15.8 submissions every single hour.
• This is a definitive indicator of an automated script or a GitHub-to-LeetCode sync tool bulk-uploading pre-written repositories, not a human typing out code.

The JavaScript Smoking Gun (The Contest Giveaways)

• The Profile Stats: He solved 2,199 of these problems using JavaScript.
• The Rare Choice: High-level competitive programmers almost never use JavaScript.
• The Tooling Deficit: JS lacks native advanced data structures like Priority Queues.
• The Contest Reality: Top-tier contestants rely on C++, Java, or Python.
• The Suspicion: Writing complex JS boilerplate under strict contest time limits is impractical.
• The Conclusion: This proves he is copy-pasting pre-written JS solutions from an external repository.

Conclusion

While they might be decent at contests, this dashboard is heavily inflated. It's a fresh account created specifically to dump thousands of solutions via automated scripts to look impressive for recruiters.

Don't let profiles like this discourage your own grind. Real learning doesn't look like an API dump.

i have recently started cp on codeforces, I'm following the cp 31 sheet 800 rating. can you all please drop some advice to get better in this

Mods of this sub, or my fellow friends as I don't get time during daytime cause of college, development, leetcode and all so I generally so the cf in night and didn't saw that post that it will be down today 😔😔😔 can I restore my streak please please if there is some way ,

The streak keeps me going hard and consistent bro.

Please anybody help find me some way out of this

anybody else facing this issue?

Same at heading

Is Div-2 enough or do we also need to be good at Div-1?

[supprimé]

Guys I know some DSA can you pls suggest how can I start codeforces

The problem is from last Div 2 contest.

Problem: https://codeforces.com/contest/2257/problem/D#

Solution: https://codeforces.com/contest/2257/submission/387559313

I am getting TLE on test case 8.

Basically finding factors = sqrt(n)

The query loop should be = q * log(factors(n))

Can someone check and tell me which line is causing TLE?

EDIT:
I found the issue. I was using 'int i' while checking for factors instead of 'long long i'.

As a result i*i was never able to reach n for the given constraint

https://preview.redd.it/zlao85mo9dkh1.png?width=799&format=png&auto=webp&s=de3199e50eca1aaea15f2a8d5850692b70191847

This excerpt is from the cp handbook. The percentages of programming languages used seem to add up to more than 100.

I'm trying to solve Codeforces 2248B, and I came up with a multiset-based greedy approach.

My idea is the following:

For every b[i], I want to choose two elements from the current multiset:

• lo = the smallest available a, preferably st.begin(), such that lo < b[i]
• hi = the smallest available a greater than b[i]i.e.st.upper_bound(b[i])

Then I replace those two elements with b[i].

So conceptually:

auto lo = st.begin();
auto hi = st.upper_bound(b[i]);

if (lo == st.end() || *lo >= b[i] || hi == st.end()) {
    // impossible
}

st.erase(lo);
st.erase(hi);
st.insert(b[i]);

I initially implemented something very similar:

sort(a.begin(), a.end());
sort(b.begin(), b.end());

multiset<ll> st(a.begin(), a.end());

if (n < 2 * m) {
    cout << "NO\n";
    return;
}

for (int i = 0; i < m; i++) {
    auto hi_it = st.lower_bound(b[i]);
    if (hi_it == st.begin() || hi_it == st.end()) {
        cout << "NO\n";
        return;
    }

    auto lo_it = st.begin();

    st.erase(lo_it);
    st.erase(hi_it);
    st.insert(b[i]);
}

cout << "YES\n";

My intuition is that choosing the smallest possible lower element should be safe because it leaves all the larger elements available for future b[i] values.

Similarly, choosing the smallest possible upper element should also be safe because I'm consuming the closest possible value above b[i] rather than wasting a larger value.

My intuition is that choosing the smallest possible lower element should be safe because it leaves all the larger elements available for future b[i] values.Similarly, choosing the smallest possible upper element should also be safe because I'm consuming the closest possible value above b[i] rather than wasting a larger value.

However, I understand that my greedy choice is apparently not correct.
What I'm struggling with is understanding exactly where the logic breaks.

last month i was specialist and now my rating came down to 1190
even after consistently solving A B C in div 2 why this much dip in my rating