69eloChess's blog

By 69eloChess, history, 2 months ago, In English

I request MikeMirzayanov to strictly take actions against the telegram cheaters.

Please please do the rating rollback as soon as possible.

I saw there were a lot of people from telegram groups who cheated problem D, a lot of cheaters for C as well.

This would improve my ranking by at least 100, if you do the rollback.

Thanks

Full text and comments »

  • Vote: I like it
  • -9
  • Vote: I do not like it

By 69eloChess, history, 3 months ago, In English
  • Vote: I like it
  • -1
  • Vote: I do not like it

By 69eloChess, history, 3 months ago, In English

This user is spamming his blogs in the feed.

Look there are tons of senseless blogs by him.

I request admins and MikeMirzayanov to disable/ban this user for all our mental peace.

Thanks

Full text and comments »

  • Vote: I like it
  • -9
  • Vote: I do not like it

By 69eloChess, history, 3 months ago, In English

xerox_07

yamani_kobayashi

musa10th

kaptaan_Aditya_deshmukh

Ab151823

Thanh_Do

wlu28

They submit the leaked code first to check if it is correct, then resubmit it after changing var names, etc to avoid plagiarism.

I went through each skipped D submission and manually caught these.

Their submissions speak for themselves, I don't need to explain anything. (Just check their skipped submission of D, it is 100% same as the leaked D code I shared in my previous blog)

I request Mike to ban them all.

Thanks

Full text and comments »

Tags ban
  • Vote: I like it
  • +36
  • Vote: I do not like it

By 69eloChess, history, 3 months ago, In English
Cheated D from the infamous YT Channel
Cheated C from the same place

selmon__bhoi check his submissions (has cheated 5 times already)

AbhiKundu2002 Pro cheater, check his submissions, you will find nonsensical similarities.

(has cheated 3 times)

MikeMirzayanov Please ban these cheaters asap.

Full text and comments »

  • Vote: I like it
  • -8
  • Vote: I do not like it

By 69eloChess, history, 3 months ago, In English

I saw many people in the telegram group that I have joined sharing solution for D1 (~30% AC), D2 (~60% AC), E(~15% AC).

Not to mention the cheating for ABCs is also prominent.

Its sad to see so many cheaters doing their thing to cheat. Its insane.

I want to know the experience of other people like how difficult do you think D1,D2,E was ?

(personally i was only able to do till D2, and i think d1 was pretty ez as a D, D2 was kinda good as a D, I don’t know about E)

Full text and comments »

  • Vote: I like it
  • +14
  • Vote: I do not like it

By 69eloChess, history, 3 months ago, In English

You are given an integer N and a prime P. Count the number, modulo P, of undirected connected graphs G of N vertices numbered 1 to N that satisfy the following conditions:

There are no self-loops in G. Note that multiple edges are allowed.

For all edges (u,v) in G, if we delete (u,v) from G, G remains connected. In other words, G is edge-biconnected.

For all edges (u,v) in G, if we delete (u,v) from G, G is no longer edge-biconnected. Two graphs are considered different if and only if there exists a pair of distinct vertices (u,v) such that the numbers of edges connecting u and v in the two graphs are different.

N<=50, P<=1e9

Input : Two integers N and P

Output: Print the answer.

Full text and comments »

  • Vote: I like it
  • -21
  • Vote: I do not like it

By 69eloChess, history, 5 months ago, In English

Problem A :

1,2,3,4,.......n is an intutive and easy answer.

Difficulty: 5/10 for a A

Problem B

Search the whole matrix a on 2x2 small grids and keep changing the values accordingly till i=0,n-1. j=0,m-1. In the end you will check if the two matrices are now equal or not.

Difficulty: 9/10 for a B

Problem C

There are nine cases totally ABC, ACB, BAC, BCA, CAB, CBA now check for each case seprately and apply binary search to find the lower bound for total_sum/3. Implementation is kinda tough.

Difficulty: 8/10 for a C

Problem D

Just count number of inversions using merge sort/segment tree. If (count1-count2)%2==0 YES else NO. Corner case: check if a & b are a permutation of each other or not.

Difficulty: 5/10 for a D

Full text and comments »

  • Vote: I like it
  • -5
  • Vote: I do not like it