Блог пользователя BledDest

Автор BledDest, 3 месяца назад, По-русски

Neapolis University Pafos

Привет, Codeforces!

Благодаря поддержке Neapolis University Pafos, продолжается серия образовательных раундов. Университет предлагает получение степени бакалавра в области компьютерных наук и искусственного интеллекта со стипендиями JetBrains. Получите передовые навыки в области искусственного интеллекта и машинного обучения, которые подготовят вас к востребованным техническим карьерам. Доступно ограниченное количество стипендий. Не упустите свой шанс учиться в Европе бесплатно!

В 07.08.2026 17:35 (Московское время) состоится Educational Codeforces Round 193 (Rated for Div. 2).

Этот раунд будет рейтинговым для участников с рейтингом менее 2100. Соревнование будет проводиться по немного расширенным правилам ICPC. Штраф за каждую неверную посылку до посылки, являющейся полным решением, равен 10 минутам. После окончания раунда будет период времени длительностью в 12 часов, в течение которого вы можете попробовать взломать абсолютно любое решение (в том числе свое). Причем исходный код будет предоставлен не только для чтения, но и для копирования.

Вам будет предложено 6 задач на 2 часа. Мы надеемся, что вам они покажутся интересными.

Задачи вместе со мной придумывал и готовил Максим FelixArg Новоточинов.

Выражаем огромную благодарность Михаилу MikeMirzayanov Мирзаянову — создателю платформ Codeforces и Polygon, без которых этого раунда (и в целом серии образовательных раундов) бы не было.

Также большое спасибо тестерам раунда: awoo, Alenochka, pusheen_1024, savolay, yegor.l!

Удачи в раунде! Успешных решений!

upd: Разбор можно найти здесь.

  • Проголосовать: нравится
  • +103
  • Проголосовать: не нравится

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится +12 Проголосовать: не нравится

Finally, another Educational Round! Perfect time to lose my hard-earned rating. :)

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

No testers?

»
3 месяца назад, скрыть # |
← Rev. 2  
Проголосовать: нравится 0 Проголосовать: не нравится

Are my eyes having problems or we are having a bug with this contest that LGMs can register rated?

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

I hope to solve problem C && D *_*

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Educational rounds are not that good since edu189.

No expectations.

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится -6 Проголосовать: не нравится

Educational rounds are not that good since edu189.

No expectations.

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Thanks everyone for participating in Codeforces Round 1114 (Div. 3). Although it was initially difficult to understand from the editorial when I first participating in Codeforces contests. However I found that once I got used to it, the explanations felt very easy to understand, accurate, and highly academic.

We should read the hint and solution before reading code (Sorry for my bad English)

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится +8 Проголосовать: не нравится

Downvote me.

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

lets go! another contest!!

»
3 месяца назад, скрыть # |
← Rev. 3  
Проголосовать: нравится 0 Проголосовать: не нравится

As a participant, I don't think I can perform well after staying up late to 4:30 a.m. to watch Date A Live last night:)

Good luck!

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Hopefully this is the time to get in competition

How to Register

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

oh yeah it's very good that we have a lot of contests in short period of time but it will be good if all of them are standard!

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Why is it asking me whether I want to participate rated or unrated? I'm 2120 and the cutoff is 2100.

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится -10 Проголосовать: не нравится

trashiest B I've ever seen

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

its not so educational...

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

There is a spelling mistake in problem E. In the output column,"beautiful" gets misspelled as "beauitful"...

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

How was this game? I wasn't able to attend it because of something.

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Why is this guy Adham_AlAnany not banned yet? He literally cheats in every contest.. Look at how many skipped contests he has..

He keeps ranking high by cheating in each round he participates in.

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится +1 Проголосовать: не нравится

not so educational for me today...

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

why are GMs showing on the official leaderboard? i toggle between the unofficial and official and it doesn't change at all

  • »
    »
    3 месяца назад, скрыть # ^ |
     
    Проголосовать: нравится +1 Проголосовать: не нравится

    "Rated for div.2" means, everyone will be shown in official standings, but only div.2 participants will be rated. If you only want to see rated participants, change the "Both divisions" to "Division 2" in the top right corner.

»
3 месяца назад, скрыть # |
← Rev. 2  
Проголосовать: нравится 0 Проголосовать: не нравится

POV my friend list today:

Edit: I took this picture before Radson solved D lol

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

How many people will get selected for the university from here?

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

C > D (

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится
»
3 месяца назад, скрыть # |
 
Проголосовать: нравится +1 Проголосовать: не нравится

Where am I going wrong on C? Submission. Please help.

»
3 месяца назад, скрыть # |
← Rev. 2  
Проголосовать: нравится 0 Проголосовать: не нравится

only solved A and B, not bad :)

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится +7 Проголосовать: не нравится
Spoiler
»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

First time using FFT in my life, it got 500 ACs on it tho

  • »
    »
    3 месяца назад, скрыть # ^ |
    ← Rev. 2  
    Проголосовать: нравится 0 Проголосовать: не нравится

    Seems it passes without FFT... why can't it be n^2?

    UPD: Well, number of candidates will be sqrt(n)...

    • »
      »
      »
      3 месяца назад, скрыть # ^ |
       
      Проголосовать: нравится +9 Проголосовать: не нравится

      size of each group is $$$O(\sqrt n)$$$ because all integers are distinct and their sum is not greater than $$$n$$$, I guess

      • »
        »
        »
        »
        3 месяца назад, скрыть # ^ |
         
        Проголосовать: нравится 0 Проголосовать: не нравится

        how does one prove this? couldnt get gpt to convince with some branching structure thingy..

        • »
          »
          »
          »
          »
          3 месяца назад, скрыть # ^ |
          ← Rev. 2  
          Проголосовать: нравится 0 Проголосовать: не нравится

          Let d be the diameter and k be the number of candidates on one side of the center. If x_i is a candidate, there exists 2 diameters which share the first x_i edges from that side of the centre. For each candidate x_i, there are atleast 2 distinct paths which intersect at a node which is a distance of x_i away from one of the central nodes. The total number of edges of contributed from these paths is 2*(d-x_i)+x_i = 2d-x_i. Therefore the total number of edges in the tree is atleast 2kd-(sum of x_i). We want to maximize the sum of x_i to minimize our lower bound for the number of edges. x_i can be atmost d/2 and to maximize our sum be count down form d/2 to d/2-k-1 giving k(k-1)/2 + (k-1)*(d/2-k-1) which we can upper bound by k^2 + dk-(k-1)^2 = kd+2k. This means that the number of edges is atleast 2kd-kd-2k = kd-2k = k(d-2). We note that the number of candidates is less that the diameter i.e. d > k which means k(d-2) > k(k-2). Since the number of edges (n-1) is atleast k(d-2), we get n-1 >= k(d-2) > k(k-2) which can be approximated to n > k^2 i.e. k < sqrt(n). Doing this for both central nodes and computing all possible sum combinations gives sqrt(n)*sqrt(n) = n thus going through all the combinations results in a time complexity of O(n).

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

I cannot think any ideas to solve problem D. My friend told that i need to do some maths but i still couldnt figure out how to calculate the minimal position (p, q) of the result

  • »
    »
    3 месяца назад, скрыть # ^ |
     
    Проголосовать: нравится 0 Проголосовать: не нравится

    to guess i think

  • »
    »
    3 месяца назад, скрыть # ^ |
     
    Проголосовать: нравится +9 Проголосовать: не нравится

    lets say you will make x jumps in total. your first move will contribute to the corresponding axis x times, the second move x-1 times etc.. so now the problem actually becomes, divide the first x numbers into the two axis such that the distance is minimized. now you can also see that the sum of the numbers is x*(x+1)/2, lets call this sum. now we can notice that if the end position of the x axis is some value v, then the end position of the y axis is sum-v. so then we are looking for the minimum of the function (x-v)^2 + (y+v-sum)^2. we can find it's derivative in order to find the minimum, and with a bit of math you get that the minimum of the function is when v=(x-y+sum)/2. now whats left to do is just iterate up to 20000(because the problem states that the maximum amount of jumps is 20000, although you can also pretty easily calculate this), and then calculate the corresponding values. when you get to the answer you can construct the actual string pretty easily with a greedy approach

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

B=C=D tbh. if anything C is probably harder than D

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится +9 Проголосовать: не нравится

Well, at least this round teaches me implementation skills.

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

how many people will be selected for next round

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится +3 Проголосовать: не нравится

Sadness.

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

This problem appears to be essentially a copy of AtCoder ARC184 B: https://atcoder.jp/contests/arc184/tasks/arc184_b. The core formulation and solution are strikingly similar. It is not easy but huge number of user passed. I suspect this resulted in quite a few people passing the problem by searching for the original problem or using AI.

»
3 месяца назад, скрыть # |
← Rev. 2  
Проголосовать: нравится 0 Проголосовать: не нравится

My code for problem B only passes the example tests :( code

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Pls drop some hint on how to solve problem B.

  • »
    »
    3 месяца назад, скрыть # ^ |
     
    Проголосовать: нравится 0 Проголосовать: не нравится

    Define a segment in the array to be a continuous block of values, so an array like [1,1,2,2,2,1,1] has 3 segments. Handle cases where n <= 3 as edge cases.

    For n >= 4, determine if there is a single swap that can be made that can increase the segment count by 2. If this doesn't exist, try finding a swap that increases the segment count by 1. Otherwise swapping is unnecessary; then answer will be n - number of segments.

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится -9 Проголосовать: не нравится

It's crazy that over 500 users solve an NTT problem.

It's more crazy that the half of the top 20 users are rated users, and rank 41 — 60 include a bunch of gray and green users. A lot of people cheating here.

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится -7 Проголосовать: не нравится

HATE EDU ROUNDS WITH GUESSING AND GUESSING B, C

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится +18 Проголосовать: не нравится

I would rather see Arsenal win the UCL than participate in this contest

»
3 месяца назад, скрыть # |
← Rev. 2  
Проголосовать: нравится +3 Проголосовать: не нравится

For every step forward , I move 2 steps back . Really disappointing :(

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится +6 Проголосовать: не нравится

Felt harder than yesterday's div-2

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится +3 Проголосовать: не нравится

Have educational contests been getting harder? I'm still struggling with C, yet I'm able to solve past D problems.

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

yay! : )

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

I think B could be very better but A and C were good I prefer a balanced contest and I think the algorithm and theory part wasnt enough

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Good contest

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

c sucks man someone explain it

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

can someone explain c ?

  • »
    »
    3 месяца назад, скрыть # ^ |
     
    Проголосовать: нравится 0 Проголосовать: не нравится

    in your matrix, you can either have: n elements from X and m-1 from Y OR n-1 from X and m from Y. After you get that observation, you find a way of getting the highest sum of those elements where you can only sum each different number one time only.

  • »
    »
    3 месяца назад, скрыть # ^ |
     
    Проголосовать: нравится +3 Проголосовать: не нравится

    My solution for C.

    Hint1
    Hint2
    Hint3
    Hint4
    Solution
    • »
      »
      »
      3 месяца назад, скрыть # ^ |
       
      Проголосовать: нравится 0 Проголосовать: не нравится

      Ah I see, I was totally doing it wrong by mixing everything into one set. I thought taking the top n+m-1 from the union would just work, but obviously that ignored the per‑array capacity limits and also double‑counted common numbers. Using two separate sets and treating common numbers as "extra" before allocating them to either side is way cleaner — it actually respects the constraints and avoids the overlap issue. Got AC right after switching to that. Thanks!

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится +13 Проголосовать: не нравится

Hard C, Easy DE...

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Will there be an editorial for this?

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

D is insane hard level

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

edu trash

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

FFT is a good tool use in problem E

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

My approach to D:

Notice that manhattan distance is invariant across all paths of equal length. For example among paths of with $$$3$$$ steps, we may end on any of $$$\{(0, 6), (1, 5), (2, 4), (3, 3), (4, 2), (5, 1), (6, 0)\}$$$.

You may also notice in the above example that we can reach ANY point with manhattan distance equal to $$$\frac{k(k+1)}{2}$$$ where $$$k$$$ is the number of steps taken.

Proof

Visually, a given manhattan distance forms a "manhattan line" of reachable points with a slope of $$$-1$$$. We want furthest manhattan line with some part of it inside the rectangle $$$[0, x] \times [0, y]$$$.

One (albeit kinda dumb) way to do this is to check if $$$x + y$$$ (the manhattan distance of $$$(x, y)$$$) is a triangular number (i.e. can be expressed as $$$\frac{n(n + 1)}{2}$$$). If it is not, then try $$$x + y - 1$$$, if that fails, try $$$x + y - 2$$$ and so on. This will take at most $$$15,000$$$ or so iterations.

Once you find the nearest "manhattan line", simply check every point on that line that lies inside the rectangle, of which there are only about $$$15,000$$$ candidates. Alternatively, find the orthogonal projection of $$$(x,y)$$$ onto the manhattan line (not actually bad to implement).

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

rating update when

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

editorial where

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Plz release tutorials.

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Plz release tutorials soon.

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

BledDest can you release editorial pls

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

For B can somebody tell me whats wrong in my appraoch 386226955

»
3 месяца назад, скрыть # |
← Rev. 2  
Проголосовать: нравится 0 Проголосовать: не нравится

C killed me. If I solved it quicker there was a chance I could have done E if I got that sqrt(n) derivation quick enough ;-;. This was still my best contest so far (by rank).

»
3 месяца назад, скрыть # |
← Rev. 2  
Проголосовать: нравится 0 Проголосовать: не нравится

Nice

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится -12 Проголосовать: не нравится

Hello Codeforces team,

I sincerely apologize for the violation. Both muhammadmiad and Ami-Miad are my own accounts, and I understand now that participating in contests using multiple accounts violates the Codeforces rules.

I did not intend to gain an unfair advantage over other participants, but I understand that using two accounts and submitting similar solutions is still a violation, regardless of my intention.

I take full responsibility for my mistake. I have now decided to use only one account for all future contests and will not participate in rated contests using any other account.

I respectfully request you to review my case once more and, if possible, consider restoring my rating/results or reducing the penalty. I understand that the final decision is entirely up to the Codeforces team.

I apologize for the mistake and assure you that it will not happen again.

Thank you for your time and consideration.

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится -12 Проголосовать: не нравится

Hello Codeforces team,

I sincerely apologize for the violation. Both muhammadmiad and Ami-Miad are my own accounts, and I understand now that participating in contests using multiple accounts violates the Codeforces rules.

I did not intend to gain an unfair advantage over other participants, but I understand that using two accounts and submitting similar solutions is still a violation, regardless of my intention.

I take full responsibility for my mistake. I have now decided to use only one account for all future contests and will not participate in rated contests using any other account.

I respectfully request you to review my case once more and, if possible, consider restoring my rating/results or reducing the penalty. I understand that the final decision is entirely up to the Codeforces team.

I apologize for the mistake and assure you that it will not happen again.

Thank you for your time and consideration.

»
3 месяца назад, скрыть # |
← Rev. 2  
Проголосовать: нравится 0 Проголосовать: не нравится

Deleted Comment

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Hello Codeforces admins,

I am writing to appeal the rules violation that resulted in my submissions being skipped in Contest 2253 — Educational Codeforces Round 193 (Rated for Div. 2).

I received the following message:

"Your submissions in contest 2253 were skipped because of a rules violation in one or more submissions for problem C. Sum of Distinct Values in a Matrix

As a result, all of my solved submissions in this contest (Problems A, B, and C) have been skipped.

I would like to respectfully ask for a manual review of my submissions.

I want to clearly state that I did not cheat in this contest. I wrote my solutions myself during the contest. I did not copy code from another participant, did not share my solutions with anyone, and did not use another participant's solution.

In particular, my submission for Problem C is available here:

This is my own code. I normally use a personal C++ template with standard settings I always use in contests, such as #define int long long, ios::sync_with_stdio(false), cin.tie(nullptr), mx,vector usage, and straightforward loop structures. These are all part of my usual coding style and template, not copied from another contestant's submission.

I understand that Codeforces uses automated systems to detect suspicious similarities between submissions, and I fully respect the contest rules and the work of the admins. However, I believe that in this case the result may be a false positive.

I would therefore kindly ask the admins to manually review my submissions for Problems A, B, and C and reconsider the decision if there was no actual rules violation. https://codeforces.me/contest/2253/submission/386128008 If my submission was flagged because of similarity with another solution, I would also appreciate knowing which part or which submission caused the violation, so that I can understand what happened and clarify it if necessary.

I am not asking for any special treatment. I only want my submissions to be reviewed fairly, because I genuinely did not copy or use another participant's code during the contest.

Thank you very much for your time and for reviewing my case.

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

It was a really interesting round specially Div 2 Gracefully thanks to prepare those problems to BledDest always making amazing problems..

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Hello Codeforces admins, I am writing to appeal the rules violation that resulted in my submissions being skipped in Contest 2253 — Educational Codeforces Round 193 (Rated for Div. 2). account- Harsh_Negi_ I received the following message: "Your solution 386119386 for the problem 2253D significantly coincides with solutions" As a result, all of my solved submissions in this contest (Problems A, B, C and D) have been skipped. I would like to respectfully ask for a manual review of my submissions. I want to clearly state that I did not cheat in this contest. I wrote my solutions myself during the contest. I did not copy code from another participant, did not share my solutions with anyone, and did not use another participant's solution. In particular, my submission for Problem D is available here: https://github.com/Harsh-Negi-dev/Competitive-Programming-Practice/blame/main/Contest%2006%20August%202026/q4.cpp This is my own code. Also, one thing that I feel could be a reason was that I accidentally submitted my code on my github which I generally do after the contest gets over but that day I unknowingly and unintentionally did before the contest got over which you can even see with the timestamp over that repo. I normally use a personal C++ template with standard settings I always use in contests, such as #define int long long, ios::sync_with_stdio(false), cin.tie(nullptr), mx,vector usage, and rep and rev loop structures. These are all part of my usual coding style and template, not copied from another contestant's submission. I understand that Codeforces uses automated systems to detect suspicious similarities between submissions, and I fully respect the contest rules and the work of the admins. However, I believe that in this case the result may be a false positive. I would therefore kindly ask the admins to manually review my submissions for Problems A, B, C and D and reconsider the decision. If my submission was flagged because of the same reason, then please consider an apology and I will make sure not to submit my code publicly this way before the contest ends ever in future. I am not asking for any special treatment. I only want my submissions to be reviewed fairly, because I genuinely did not copy or use another participant's code during the contest. Thank you very much for your time and for reviewing my case. account- Harsh_Negi_

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Hello. I lokeshkrcodes would like to request a manual review regarding the coincidence warnings on my submissions for 2253C and 2253D.

I wrote both solutions independently during the contest. I did not view or copy other participants' submissions, nor I shared my code with anyone.

I was surprised to receive the coincidence warnings and subsequently be placed out of competition. I am also currently unable to view the submissions of the other participants listed in the warning, so I cannot determine what specific similarities were detected or compare my code with theirs. I have attached screenshots showing this: drive link

I would appreciate a manual review of the detected similarities and my participation in the contest.

Thank you.

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Dear Codeforces Coordinators and Admins,

My submission 386123227 for problem 2253D was skipped due to a coincidence with user Dominator_of_IITJ (submission 386125415). I am writing this to firmly appeal the verdict.

I wrote the code completely by myself locally on my IDE (Visual Studio Code). I did not use any online compilers like ideone and checked by CPH extension on VSC too, nor did I share my code with anyone.

The similarities between our submissions might come from the basic template setup (the library includes, using namespace, and the standard main function structure), which is a boilerplate I have been using by habit for a long time. You can easily verify this coding style by checking the past submissions on my account, ddminh2607.

As for the core logic of 2253D, the implementation was quite straightforward, which likely led to independent competitors coming up with nearly identical code structures.

Please kindly manually review my submission and the AST structure. I strictly follow the Codeforces rules and would never cheat. Thank you for your time!

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Dear Codeforces Coordinators and Admins,

My submission 386123227 for problem 2253D was skipped due to a coincidence with user Dominator_of_IITJ (submission 386125415). I am writing this to firmly appeal the verdict.

I wrote the code completely by myself locally on my IDE (Visual Studio Code). I did not use any online compilers like ideone and checked my code by CPH extension on VSC too, nor did I share my code with anyone.

The similarities between our submissions might come from the basic template setup (the library includes, using namespace, and the standard main function structure), which is a boilerplate I have been using by habit for a long time. You can easily verify this coding style by checking the past submissions on my account, ddminh2607.

As for the core logic of 2253D, the implementation was quite straightforward, which likely led to independent competitors coming up with nearly identical code structures.

Please kindly manually review my submission and the AST structure. I strictly follow the Codeforces rules and would never cheat. Thank you for your time!

»
3 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Hello CF team

I participated in Educational Codeforces Round 193 and was recently flagged for a "rules violation" regarding Problem B. I want to affirm that the flagged submission was genuinely my own work.

My earlier incorrect submission was: https://codeforces.me/contest/2253/submission/386117290

The later submission was: https://codeforces.me/contest/2253/submission/386120900

During the contest, my local editor became unresponsive during compilation, so I quickly switched to my saved template file in the USACO online editor to rewrite and submit my code. The later submission resulted from debugging my earlier incorrect approach. I have also been a member of this platform for more than 2 years and I have consistently been practicing problems in the 1200–1500 range recently, so the performance was within the level I have been training at and the difficulty of this particular problem is only 1100 as well.

Please kindly look into this.