Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official. ×

You can use several words in query to find by all of them at the same time. In addition, if you are lucky search understands word forms and some synonyms. It supports search by title and author. Examples:

  • 305 — search for 305, most probably it will find blogs about the Round 305
  • andrew stankevich contests — search for words "andrew", "stankevich" and "contests" at the same time
  • user:mikemirzayanov title:testlib — search containing "testlib" in title by MikeMirzayanov
  • "vk cup" — use quotes to find phrase as is
  • title:educational — search in title

Results

1.

denied

Last visit:  3 months ago
Registered:  4 years ago
2.
By maroonrk, history, 10 days ago, In English
I will step down as AtCoder Admin [Original Post on AtCoder](https://atcoder.jp/posts/goodbye_maroonrk_en). I'm maroonrk. I have been serving as an admin for AtCoder's Algorithm division since 2021, but I would like to announce that I will be stepping down at the end of January 2027. There are several reasons behind this decision, but the biggest turning point was this year's AWTF. It wasn't because I was devastated by seeing humans lose to AI. Having watched AI's progress, I had expected that this day would eventually come. I won't deny that seeing AI solve every problem was a shock, but even so, I am glad that I had the opportunity to witness that historic moment, and that the problems presented on that stage were ones I had created. That contest left me with a certain sense of accomplishment. I felt that all the effort I had poured into organizing contests over the years had been rewarded by becoming a part of history. At the same time, I began to feel that I needed to take on a new challenge. For a w...
eventually come. I won't deny that seeing AI solve every problem was a shock, but even so, I am glad that I, expected that this day would eventually come. I won't deny that seeing AI solve every problem was a

Full text and comments »

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

3.
By maroonrk, history, 5 months ago, In English
Regarding AtCoder’s Ban Policy and the Recent ARC222 Ban In ARC222, held last week, we banned a user who had been in first place at one point during the contest. This has led to discussion about AtCoder’s ban system, so I would like to explain several points. ## General Policy The people responsible for making ban decisions are well aware that there may be strong competitors who have not participated in many contests before. We do not ban users merely because they achieve good results. That said, we cannot say that the possibility of a mistaken ban is completely zero. Recently, every time we hold a contest, tens to hundreds of bad actors have attempted to achieve high rankings using AI. Their methods have also become increasingly sophisticated, and we spend a great deal of time and effort making these judgments. As a result, we cannot completely deny the possibility that legitimate participants may be banned by mistake. However, for users who have already participated in dozens of contests, we conduct thorough investigations a...
and effort making these judgments. As a result, we cannot completely deny the possibility that, cannot completely deny the possibility that legitimate participants may be banned by mistake. However

Full text and comments »

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

4.
By Um_nik, history, 5 years ago, In English
Changes in CodeChef Problemsetting Hello Codeforces! For the last half a year I have been working on CodeChef and was proposing ideas on how to change the problemsetting practices (hopefully, for the best). For some time the changes were in brainstorming phase, but as of now many of them are implemented. Today we are ready to share the information with you. But first I would like to approach people who are going to close this blog without reading: If you are not interested in CodeChef contests at all, I think you should change your mind. Monthly short contests (Cook-Off and Lunchtime) have interesting quality problems, on par with Codeforces in my opinion (not AtCoder level yet, but who are?). Long and Starters are more targeted to newbie participants, with more classical educational problems. If you are interested in setting problems for regular contests, you might want to do it on CodeChef. Some reasons: - You don't have to set the whole round, as we work on per problem basis. - This may be especially...
different views on my persona, but it is hard to deny that I'm pretty good at this stuff. - In, have different views on my persona, but it is hard to deny that I'm pretty good at this stuff. - In

Full text and comments »

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

5.
By purplesyringa, 5 years ago, In English
This is not an exit. ![This is not an exit.](https://i.ibb.co/N9zrDNp/cf.png) I am looking at the post called [*Is Mike Mirzayanov dictator?*](https://codeforces.me/blog/entry/94033) at the moment. I'm reading through the comments, I'm looking at people's reactions, I'm reading Mike's replies, and... I am utterly disappointed. I demand progress. For context, I do believe Codeforces is the best website for competitive programming contests at the moment. I sincerely give credit to Mike for creating Codeforces and providing participants and contest authors a platform for interaction completely for free. I am confident that Codeforces is the most appropriate website for being *the* platform for sharing knowledge, exchanging tricks and methods, and collaboration between both contest participants, their authors, and coordinators. **Please consider this an open letter**, for this is a will not of a single person, but of many individuals. Please consider signing it by stating so in a comment under the...
implement. That gives the developers a chance to deny the lack of progress, even though many participants, to deny the lack of progress, even though many participants and users don't sincerely believe in that.

Full text and comments »

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

6.
By Dominater069, 2 years ago, In English
How to Solve Questions [Dominater Version] Recently, I got a request asking me to write down my thought process while solving questions. So, here is the promised blog. I would like to thank [user:Iceknight1093,2024-08-30], [user:qwexd,2024-08-30], [user:Sana,2024-08-30], [user:Everule,2024-08-30] and [user:NovusStellachan,2024-08-30] for proof reading and suggesting edits in the blog. Special thanks to [user:satyam343,2024-08-30] for discussing most of the blog with me. <h3> 1. Overview </h3> The blog contains my solutions to $7$ problems in a wide range of ratings, starting from $1200$ all the way upto $2700$. Each problem has a step-by-step solution and you can notice how there are no large jumps in logic, but everything comes naturally. I do not claim that this is always possible in each problem, however I solve majority of CF problems in such a manner. There are certainly other high rated people who will have completely different methods of solving. However, this is about what works for me. There are some meta ...
into $1...k$. Now, consider the case when Bob wants to deny the sequence $x_1, x_2, ..., x_m$ from, occurrences of some element $x$ himself before Alice reaches there so as to deny Alice that element $x, some element $x$ himself before Alice reaches there so as to deny Alice that element $x$., somewhat guessable problem. I don't deny that. However, I think analyzing structures like I did is, Now, we know Bob's strategy too. Let's look at when he can successfully deny Alice all those

Full text and comments »

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

7.
By ToxicPie9, 4 years ago, In English
[Tutorial/Parody Post] Common Mistakes in Competitive Programming and How to Avoid Them Yesterday [user:YouKn0wWho,2023-01-11] posted a [blog](https://codeforces.me/blog/entry/111217) explaining common mistakes in competitive programming and how to avoid them. I was greatly inspired by that post so I decided to make my own. I have compiled some of the mistakes that I didn't make in my early Competitive Programming phase. I also mentioned how to avoid them. Also, in most cases, I will give you a chance to find out what the bug is before I reveal the culprit as I tried to make this blog interactive. The codes that I have used in this blog have been written in Rust as it is the most beloved language for CP. #### Mistake 1 Check out the following code: <spoiler summary="Code"> ``` fn main() { let x: i32 = 1_000_000_000; let y: i32 = 1_000_000_000; println!("{}", x * y); } ``` </spoiler> The output should be $10^{18}$. But if you run the code, you will get a different output. Why? <spoiler summary="Reason"> Because it won't even compile....
would overflow | = note: `#[deny(arithmetic_overflow)]` on by default

Full text and comments »

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

8.
By AkiLotus, history, 8 years ago, In English
Codeforces Round #554 (Div. 2) Editorial [problem:1152A] ------------------ Author: [user:xuanquang1999,2019-04-24] Development: [user:xuanquang1999,2019-04-24], [user:Akikaze,2019-04-24], [user:GreenGrape,2019-04-24] Theme development: [user:Akikaze,2019-04-24], [user:GreenGrape,2019-04-24] Editorialist: [user:xuanquang1999,2019-04-24] <spoiler summary="Tutorial"> [tutorial:1152A] </spoiler> <spoiler summary="Solution (xuanquang1999)"> Submission link: [submission:53259456] <spoiler summary="Source code in plain text"> ~~~~~ #include <bits/stdc++.h> using namespace std; int main(int argc, char* argv[]) { int n, m; scanf("%d%d", &n, &m); vector<int> a(n), b(m); for(int i = 0; i < n; ++i) scanf("%d", &a[i]); for(int i = 0; i < m; ++i) scanf("%d", &b[i]); int c0 = 0, c1 = 0; for(int i = 0; i < n; ++i) if (a[i]%2 == 0) ++c0; else ++c1; int k0 = 0, k1 = 0; for(int i = 0; i < m; ++i...

Full text and comments »

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

9.
By awoo, history, 8 years ago, In English
Educational Codeforces Round 49 Editorial [problem:1027A] <spoiler summary="Tutorial"> [tutorial:1027A] </spoiler> <spoiler summary="Solution (PikMike)"> ~~~~~ #include <bits/stdc++.h> #define forn(i, n) for (int i = 0; i < int(n); i++) using namespace std; int main() { int T; cin >> T; int n; string s; forn(_, T){ cin >> n >> s; bool ok = true; forn(i, n){ int k = abs(s[i] - s[n - i - 1]); if (k > 2 || k % 2 == 1){ ok = false; break; } } cout << (ok ? "YES" : "NO") << endl; } return 0; } ~~~~~ </spoiler> [problem:1027B] <spoiler summary="Tutorial"> [tutorial:1027B] </spoiler> <spoiler summary="Solution (Vovuh)"> ~~~~~ import sys lst = sys.stdin.readlines() n, q = map(int, lst[0].split()) for i in range(q): x, y = map(int, lst[i + 1].split()) cnt = (x - 1) * n + y ans = (cnt + 1) // 2 if ((x + y) % 2...
)); forn(i, s.size()) if (i > day) { if (!deny(i)) { return false; } }, ]; vector s; bool used[N]; bool exam[N]; vector> g[N]; bool deny(int v) { if, deny(int v) { if (used[v]) return false; used[v] = true; for (auto it : g[v

Full text and comments »

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

10.
By Bakry, history, 4 years ago, In English
Egyptian team is likely not going to IOI. Again. Hello Codeforces, I'm a member of the Egyptian IOI 2022 team, and I'm not sure yet if we are going to IOI. Historically, the Ministry of Communication and Information Technology (MCIT) sponsored the Egyptian team to travel to IOI. However, this year, there is no confirmation from the MCIT's side at all. Our tickets are not booked until now, and MCIT doesn't either confirm or deny that they will sponsor us this year. Now, there are fewer tickets left, and the cost of traveling increases as we approach IOI. We all have been practicing really hard for IOI for the past few months. Now, there is very little time for us to make alternative plans to participate onsite. Note that MCIT provides training and sponsors the team every year so we expected more from the MCIT side. AASTMT has supported us with a part of ticket expenses In an attempt to collect the remaining part, we created a crowdfunding campaign. Please donate [here](https://gogetfunding.com/iiot-fundraising/). UPD: W...
are not booked until now, and MCIT doesn't either confirm or deny that they will sponsor us this, at all. Our tickets are not booked until now, and MCIT doesn't either confirm ordeny that they

Full text and comments »

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

11.
By Anadi, history, 8 years ago, In English
Codeforces Round #519 Editorial #### [1043A &mdash; Elections](http://codeforces.me/contest/1043/problem/A) <spoiler summary="Tutorial"> We can observe that result cannot exceed $201$ &mdash; Awruk gets at least $101$ votes from one person and Elodreip cannot get more than $100$ votes from one person. So we can iterate over every possible integer from $1$ to $201$ and check if Awruk wins with $k$ set to this integer. We have to remember that $k$ &mdash; $a_i$ is always at least $0$, so we have to check this condition too. Complexity $O(n * M)$, where $M$ denotes maximum possible value of $a_i$. Try to solve it in $O(n)$. </spoiler> <spoiler summary="Solution"> ~~~~~ #include <bits/stdc++.h> using namespace std; int n; int mx = 0, sum = 0; int main(){ scanf("%d", &n); for(int i = 1; i <= n; ++i){ int a; scanf("%d", &a); mx = max(mx, a); sum += a; } sum *= 2; sum += n; sum /= n; printf("%d", max(sum, mx)); return 0; } ~~~~~ </spoiler> Author: [user:FCB1234,201...
we will reverse it second time. But instead of reversing it second time, we can deny it's first

Full text and comments »

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

12.
By Sprdalo, history, 16 months ago, In English
[IOI 2025] Travel Log: 68 Hours, 0 Luck, 1 Chicken Dear CP and IOI community, This is my first time leading the team at the IOI! However, after this experience, I will be having a long, hard look in the mirror before ever considering it again. TL;DR: Every single step went wrong — even the ones you thought _couldn't_. Part of the Serbian team (two contestants and a guest) was traveling with me, while the rest traveled separately with the deputy, due to a training camp. Failing before even departing ----------------------------- Our intended route was: Belgrade → Zurich → São Paulo → Santa Cruz, followed by a separate domestic flight to Sucre. We planned to depart on the 26th and arrive on the 27th. However, a major storm hit Europe that day, and many flights to/from Zurich were delayed — including ours. Because of that delay, we missed our connection to São Paulo, and consequently all following flights. _The other part of the delegation did not have this problem._ Logistic problems ----------------- We were re...

Full text and comments »

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

13.
By Igor_Parfenov, history, 4 years ago, In English
Codeforces Round #868 (Div.2) Hello! On [contest_time:1823] we will host [contest:1823]. The problems were written and prepared by [user:Igor_Parfenov,2023-04-21]. I would like to thank everyone who made this round possible: - [user:awoo,2023-04-21], [user:madlogic,2023-04-21], [user:_Israel_,2023-04-21], [user:Vectors_Master,2023-04-21], [user:BabaVoss,2023-04-21], [user:AlperenT,2023-04-21], [user:FzArK,2023-04-21], [user:Dominater069,2023-04-21], [user:m0t9_,2023-04-21], [user:rui_er,2023-04-21], [user:aryan12,2023-04-21], [user:purp4ever,2023-04-21], [user:mahersefo,2023-04-21], [user:Shawerma,2023-04-21], [user:maomao90,2023-04-21], [user:satyam343,2023-04-21], [user:errorgorn,2023-04-21], [user:Glemhel,2023-04-21] for testing the round and providing feedback to the problems - [user:adedalic,2023-04-21], for coordination of the round - [user:MikeMirzayanov,2023-04-21], for Codeforces and Polygon platforms - All participants This round will be **rated for participants with rating lower than 21...
) **UPD**: Congratulations to the Winners! Div.2: 1. [user:Low-Deny -Cup,2023-04-27] 2, . [user:Low-Deny-Cup,2023-04-27] 2. [user:psz6,2023-04-27] 3. [user:BULBULBUL,2023-04-27] 4, 1. [user:Low-Deny-Cup,2023-04-27]

Full text and comments »

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

14.
By mcqueencin, history, 3 years ago, In English
Difficulties Faced in ICPC Colombia: Balancing National and International Competitions Hi Codeforces community! I am currently a member of a team that aspires to compete in the upcoming ICPC World Final 2024. As we gear up for this exciting journey, we encounter a significant hurdle that we'd like to share with you all. As part of the qualification process, we must first participate in the national marathon in Colombia, which is a crucial step towards earning a spot in the Latin American regional and, ultimately, the world finals. However, here's where the difficultie lies – the scheduled date for the national marathon (2nd September) coincides with the prestigious International Olympiad in Informatics (IOI), taking place from 28th August to 4th September. Several team members, including myself as a coach and one of my teammates as participant, have qualified to represent Colombia in Hungary at the IOI, making it seemingly impossible to be at both events simultaneously (as far as we know). Upon realizing this conflict, we immediately attempted to contact ICPC Co...

Full text and comments »

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

15.
By Xellos, 13 years ago, In English
Samara SAU ACM ICPC 2013-2014 Quarterfinal Qualification Contest: Editorial ### A. The Power of the Dark Side (difficulty: easy) Let's sort the parameters of every Jedi: $a \ge b \ge c$. The "coverted" Jedi obviously wants to use his strongest 2 parameters ($a_k,b_k$) against the opponent's weakest 2 ($b_i,c_i$) to get 2 victories as assuredly as possible; besides, the optimal order is $a_k$ against $b_i$ and $b_k$ against $c_i$, because if he can win when using them in the opposite order, then he'll win after swapping them, too. So we want to find all Jedis that have $a_k > b_i$ and $b_k > c_i$ for all $i$. That's simple, because those are the same conditions as $a_k > B=\max(b_i)$ and $b_k > C=\max(c_i)$. When processing the input, we can count $B$, $C$ and then we just check for every Jedi if he satisfies these 2 conditions, in linear time. I decided during the contest to code a solution which is a bit slower, but more powerful &mdash; it allows us to answer stronger versions of this problem like "which Jedis can we choose, if we're satisfied with...

Full text and comments »

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

16.
By AkiLotus, history, 3 years ago, In English
Reflection on my past authored problems Hello Codeforces! This is not a round announcement, however. I realize it's around 4 years since my last rated participation, and 3 years since my last problemsetting contribution. I think I have never said a proper goodbye to competitive programming since then. I know, I know, this is not an airport, thus my departure is not mandatory. But after all, this is a free space of my blog entries after all. Besides, today is my 25th cake day, and I just feel nostalgic reflecting everything I have gone through. Thus, rather than just saying farewell, I'd like to, in an absolutely styled late attempt, jump on the [trend](https://codeforces.me/blog/entry/113715) and reflect on the past programming problems that I have authored. My format would be a bit different though. I prefer to write in my own style and convey my thoughts the way I feel comfortable. ;) Okay, first and foremost, I'll only consider those available in official Codeforces rounds. I've done quite a myriad of work...

Full text and comments »

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

17.
By Not-Afraid, history, 6 years ago, In English
Bash Script for Stress Testing[Code with explanation] Hello Codeforces community. ~~~~~ Tl;dr: The script is specifically for *Unix and can be used to stress test `C++` solutions. It can be easily modified to work with python or java. To use it in windows you can download Ubuntu terminal which is officially available on Microsoft Store and then use it or you can modify the script to work in cmd by changing the .out files to .exe and a bit of syntax for cmd. ~~~~~ **Note**: If you don't want to read this lengthy blog, just go to [this](https://github.com/bhupixb/Stress-Testing-bash-script) repo and follow the instructions of readme. <br> First let me tell you what stress testing is if you don't know, Stress testing is technique using which we can run our solution (which we think might fail/is failing) on a number of random test cases and match it's output with the output of a solution which is a brute force solution or accepted solution of someone else.<br> If you don't know why and when to use stress testing you can use [...

Full text and comments »

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

18.
By ink65536, history, 11 months ago, In English
Goodbye 2025: more than 4% of Top Ranks Are AI-Cheaters The last rollback from Goodbye 2025 Codeforces round starkly reveals a crisis of fairness. My rank jumped from 3141 to 3017, not because my code suddenly optimized itself, but because a large number of cheaters were skipped. It means 124 fraudulent participants were skipped from the top 3000. This indicates that approximately 4.13% of top contestants relied on AI to generate solutions. Moreover, there must be more cheaters who have not been detected and still steal top rankings and high ratings. Such behavior does not merely exploit a loophole—it fundamentally ruins the spirit of competitive programming. Platforms like Codeforces are designed to test problem-solving under pressure, creativity, and the rigorous application of algorithms. When code is mass-produced by AI rather than cultivated through careful thought, contestants cheat not only the system but also themselves, missing the growth that comes from struggle and debugging. Worse, this trend erodes trust across the com...

Full text and comments »

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

19.
By tatianyi, history, 3 years ago, In English
Strange TLE by cin using GNU C++20 (64)...Again? _This time_, [user:Auroraa_,2024-05-17] is solving [problem:524E]. After some trial, he got <spoiler summary="this code"> ```c++ // Code written by Auroraa_ #include "bits/stdc++.h" using namespace std; #define endl '\n' const int N = 2e5 + 5; #define ls (p<<1) #define rs ((p<<1)|1) #define mid ((l+r)>>1) struct Seg { int l, r; int mn; }seg[4 * N]; void build(int p, int l, int r) { seg[p].l = l, seg[p].r = r; seg[p].mn = 0; if (l == r)return; build(ls, l, mid); build(rs, mid + 1, r); } void upd(int p, int x, int y) { int l = seg[p].l, r = seg[p].r; if (l == r) { seg[p].mn = y; return; } if (x <= mid)upd(ls, x, y); else upd(rs, x, y); seg[p].mn = min(seg[ls].mn, seg[rs].mn); } int ask(int p, int x, int y) { int l = seg[p].l, r = seg[p].r; if (x <= l && y >= r)return seg[p].mn; int ans = 1000000; if (x <= mid)ans = min(ans, ask(ls, x, y)); if (y > mid)ans = min(ans, ask(rs, x, y)); return ans; } int ans[N]; struct...

Full text and comments »

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

20.
By jamjury, history, 14 months ago, In English
Memory-mapped stdout In [my last blog post](https://codeforces.me/blog/entry/130391) I wrote about mapping stdin into memory. This time we're going to be mapping stdout. Firstly, we need to get a handle to stdout. That's easy enough with Win32 API [GetStdHandle](https://learn.microsoft.com/en-us/windows/console/getstdhandle): ~~~~ HANDLE Stdout = GetStdHandle(STD_OUTPUT_HANDLE); ~~~~ Alternatively we could directly use NT API [NtCurrentTeb](https://learn.microsoft.com/en-us/windows/win32/api/winnt/nf-winnt-ntcurrentteb), which `GetStdHandle` uses under the hood, but it's a little more lengthy: ~~~~ HANDLE Stdout = NtCurrentTeb()->ProcessEnvironmentBlock->ProcessParameters->StdOutputHandle; ~~~~ Next we need to map our file into memory. Windows (or any other platform) doesn't support write-only pages, so we have to map into read-write pages. Let's try to follow what we did for stdin ([CreateFileMapping](learn.microsoft.com/en-us/windows/win32/api/winbase/nf-winbase-createfilemappinga)): ...

Full text and comments »

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

21.
By Fork512Hz, history, 2 years ago, In English
CCPC Jinan Contest Report: Team World Resonates in Key Tones (English Ver.) The 2024 CCPC Jinan Contest ended on Oct 27. While this report was initially a requirement by our team coach, I think it may be valuable to repost it to Codeforces in English. ## Preparation The week before contest contained 2 team training sessions: [contest:104008] and [contest:103409], and we got 1 problem above the gold medal line in both, which enhanced our confidence. Our three teams, along with our coach (part of the contest committee), reached Jinan via high-speed railway a day prior to team registration. During the dress rehearsal, a flaw on the contest floor(literal) immediately drew our attention: there was a narrow drain hole beneath one of my teammates' chair and a chair leg might get caught up causing him to fall over, and later we found we were not alone. We called staff over and they fixed it with cardboard taped to the ground. But the bigger problem was the keyboard: the `\` and `Enter` almost switched place(compared to usual keyboard layouts), so when typing `\...

Full text and comments »

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

22.
By JaroPaska, history, 7 years ago, In English
Educational Round 73 rating change policy Hello everyone, I participated in the Educational Round 73 contest and solved problems A to E, but I had a bug in my solution to B and the round was unrated for me in the end. However, despite this I would still be looking at an increase in rating of about +25 (which is admittedly still quite disappointing compared to the +214 the CF-Predictor was claiming during the contest). I don't think that it's particularly fair that the people that would have had positive deltas even with a 0 for problem B got denied their rating change. By my standards I had an outstanding contest yesterday, and while it sucks to get screwed over by the checker for B, it sucks even more to solve 4 other problems and be denied that only because I had a wrong submission on B (if I just skipped over B and didn't submit B at all I wouldn't have this problem). I'm sure this happened to some other people as well, and that sucks, because they were also probably having a really good contest and in the end got not...

Full text and comments »

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

23.
By natalia, 15 years ago, translation, In English
Codeforces Round #100: problem analysis <p style="text-align: justify;"><a href="http://codeforces.me/contest/140/problem/A">Problem A. New Year Table</a></p><p style="text-align: justify;">The plates must touch the edge of the table, so their centers must lie on the circle with radius R - r (see the figure).</p><div><div style="text-align: center;"><img src="http://saveimg.ru/thumbnails/04-01-12/1853f5c6ef024fe851a0e0e55a538fba.bmp" /><br /></div><div style="text-align: justify;">In case the plates have the largest radius possible for the given table, their centers are situated in the vertices of the regular polygon (n-gon) inscribed in this circle. The problem is to find the length of the side of the inscribed regular n-gon and to compare it with 2r. The formula for the length of the side is $a = 2 (R - r) \sin (\pi / n)$, it can be easily deduced. For that you should consider the right triangle (the green one in the figure).</div></div><div style="text-align: justify;"><br /></div><div style="text-align: justify;">In impl...
#comment-71300">preference lists (russian). I can't deny that the order chosen during preparation, /blog/entry/3531?locale=ru#comment-71300">preference lists (russian). I can't deny that the order

Full text and comments »

Tutorial of Codeforces Round 100
  • Vote: I like it
  • +110
  • Vote: I do not like it

24.
By ScotchOnTheRocks, history, 6 years ago, In English
Frustration and Stagnation If you do not like these types of blogs, here's your warning to move on. Problem: ------------------ Firstly I'd like to address all the people who are going to say rating doesn't matter, what matters is just developing problem solving skills, because that's the only thing under your control. To that I say, perfectly agreed, because rating is only an approximation of one's skill, and a large number of variable factors control it. But you cannot deny that there is a postiive correlation between the two in the long run. The idea behind saying "just develop problem solving skills" is to essentially say that over the long run, rating will eventually pick up, don't worry about it. I honestly feel like I'm a much better solver than two-three months ago. But as you would see on my profile page, I've been largely hovering around 1750, and now I've dropped multiple times continuously in rating, to add fuel to fire. And its not a one or two contest whine. It's been the story over 20+ co...
number of variable factors control it. But you cannot deny that there is a postiive correlation, one's skill, and a large number of variable factors control it. But you cannot deny that there is a

Full text and comments »

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

25.
By dhiweifhf, history, 6 months ago, In English
Denied Judgement for Haunted House 904 Div 2 Can anybody tell what is the issue in this, did pass a lot of cases but crashed for a case The problem https://codeforces.me/contest/1884/problem/B // This is going to be the template for competitive programming #include <iostream> // cin, cout, basic I/O #include <algorithm> // sort, max, min, lower_bound, upper_bound #include <cmath> // sqrt, pow, abs, log, sin, cos, etc. #include <cstring> // memset, memcpy, strcmp (C-style strings) #include <vector> // vector #include <set> // set, multiset, ordered sets #include <map> // map, multimap #include <unordered_map> // hash map (average O(1)) #include <unordered_set> // hash set (average O(1)) #include <queue> // queue, priority_queue #include <stack> // stack #include <deque> // deque (double-ended queue) #include <bitset> // bitset (fixed-size bit manipulation) #include <numeric> // accumulate, gcd, lcm, iota` #...

Full text and comments »

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

26.
By Marinush, history, 5 years ago, In English
How to become Master. I see a lot of newbies trying to get better at cp. But working hard isn't enough. You need to have a goal in mind and follow it till the end (like becoming X till Y). Here I am gonna give some tips on how to become master. #### Participate in contests For master you need rating. To get rating you have to participate in contests. Nothing more needed to be said. #### Solve problems To get a good place in a contest, you have to solve problems. So, obviously, try to solve as many problems as you can. You might say that me saying this is useless and idiotic, but I disagree! I see a lot of people that give up after solving a certain amount of problems, but don't be like those people. They will never achieve anything meaningful in life. #### Have the correct mindset. Competitive programming is just as much about programming as it is about having a good mindset. It's all about competing, so you have to be in the right state of mind. You might ask me what it is, but I can'...
mind but will be out there in the world where you can't ever deny it. Reading it will make you feel, the world where you can't ever deny it. Reading it will make you feel way better as you will see

Full text and comments »

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

27.
By Los_Angelos_Laycurse, 12 years ago, In English
Lets discuss this problem 100025B Almost Average(I think insanely hard) I think it is a insanely hard and interesting problem(at least to me),if I'm not miss something: I have came up with a idea of complexity O(m*sqrt(n)*log(n)*log(answer)) : this is my anlanysis: we want to find the maximum almost everage number between [a,b] in the interval (L,R), if the answer >=0 ,then we can conclude the length of the length of [a,b] is either 2 or 3,so we just need to build a segment tree record maximum (ai+a(i+1)+a(i+2))/2 and (ai+ai+1). if the result of query of [L,R] is non-negative ,then this is the answer, but if it is negative,then it is more and more complex: we need to binary search the answer x. we need to check if there is almost average number >=x. we just need to check if there is [a,b] v[a]-x+v[a+1]-x+...+v[b]-x>=-x , right part is positive. if we split the interval into two part and have already checked left part and right part both are <-x,then we need to check the maximum sum of v[i]-x of the suffix ...

Full text and comments »

28.
By evergreen1124, history, 10 months ago, In English
“Low Ratings, High Ignorance: How the Platform Secretly Hates Its Newbies” Let’s talk about something that almost nobody admits out loud: the way low-rated participants are treated on competitive programming platforms. You know what I mean—how submissions from people with ratings below a certain threshold are casually dismissed, jokes are made at their expense, and sometimes even their presence in discussions is questioned. It’s subtle, often disguised as humor or “encouragement,” but the pattern is unmistakable. It bears an uncomfortable resemblance to systemic discrimination. Just like in real-world prejudice, low-rated participants are judged not by their actual effort or improvement, but by an arbitrary number attached to their name. A 900-rated user solving a problem with creativity and persistence can be overlooked or ridiculed because the rating system has predetermined their “worth.” Meanwhile, high-rated users often get the benefit of doubt, assumptions of competence, and access to social capital within the community that others are denied. Thi...

Full text and comments »

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

29.
By Seferoglu, history, 19 months ago, In English
IOI Preperation Hello Codeforces, Yesterday marked the end of the Turkish TST. While the official results haven't been announced yet, I believe I've qualified for the national team. Over the years, I've solved thousands of problems across various platforms. However, I’m aware that unlike many other Olympiads in Informatics, the IOI includes heuristic, output-only, and many interactive problems. I’ve also heard that since 2016, the IOI has shifted from being primarily algorithm/technique-heavy to featuring more ad-hoc and logic-based problems. As someone still relatively inexperienced with actual IOI tasks, I can neither confirm nor deny these claims. Right now, I’m trying to figure out the best way to make use of the few months ahead. I’d truly appreciate any recommendations on high-quality IOI preparation resources. My goal is for this blog to serve as a cornerstone for IOI preparation—a place that brings together everything related to the IOI, and the IOI only. Thank you for your interes...
inexperienced with actual IOI tasks, I can neither confirm nor deny these claims., tasks, I can neither confirm nor deny these claims. Right now, I’m trying to figure out the best

Full text and comments »

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

30.
By Sacchidananda, history, 4 years ago, In English
Dream and waking world The waking world is as real as the dream world ============================================== Objections: ----------- 1 General objection: Waking world is real and the dream world is just a dream. 2 Dream objects are subjective, they are the creation of the sleeper’s/dreamer’s mind. Whereas the waking objects are real, they exist outside independent of the perceiver and are perceived by the means of sense organs. 3 Dream experiences are private. Its objects and actions are known to the dreamer and none else. The waking experiences are public. We all live in a shared world. 4 Waking percepts in contrast to dream percepts are said to endure for a long period of time. 5 Practicality: The money a dreamer possesses can not purchase his bread and butter when he feels hungry in the waking state. 6 Dream experiences are found to be fantastic, illogical, random, arbitrary. But the waking world seems to be very logical. Things work according to the laws of science, reason, ...
you can confirm or deny as being real or unreal are all objects of experience. What you can notdeny, ? What you can confirm or deny as being real or unreal are all objects of experience. What you can not

Full text and comments »

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

31.
By ferlon_v2.0, 6 years ago, In English
How to kill ten years of your life Hey community. Today I want to share some rather unique experience: how to kill ten years of your life. This whining should appear on some anonymous whiners' site, but I suppose only the CF members can, you know, truly feel all the spectrum. Soon you'll find out that I am very awful English-speaker, but I write it in other language intentionally, because it guarantees no person mentioned in the story would read it. It all began with yet another codejam round, which I totally fucked up. I felt raged and exhausted. To be honest, I feel so after too many contests, and I even had a custom to go for a sole walk after onsites during my ICPC years, just to calm down. I treat contests as a negative-sum game: if you achieved your goal (to proceed to the next round, to win a t-shirt, you name it), you can sleep well today, otherwise you deserve your pain. Nobody of my friends beat that round too, so I opened chat messenger to talk about it. But all I got was some phrases like "don't push yo...

Full text and comments »

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

32.
By worstesttest, history, 7 years ago, In English
masterpiece.txt Bee Movie Script According to all known laws of aviation, there is no way a bee should be able to fly. Its wings are too small to get its fat little body off the ground. The bee, of course, flies anyway because bees don't care what humans think is impossible. Yellow, black. Yellow, black. Yellow, black. Yellow, black. Ooh, black and yellow! Let's shake it up a little. Barry! Breakfast is ready! Ooming! Hang on a second. Hello? - Barry? - Adam? - Oan you believe this is happening? - I can't. I'll pick you up. Looking sharp. Use the stairs. Your father paid good money for those. Sorry. I'm excited. Here's the graduate. We're very proud of you, son. A perfect report card, all B's. Very proud. Ma! I got a thing going here. - You got lint on your fuzz. - Ow! That's me! - Wave to us! We'll be in row 118,000. - Bye! Ba...
to me! We are not them! We're us. There's us and there's them! Yes, but who can deny, Yes, but who can deny the heart that is yearning?

Full text and comments »

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

33.
By Ashishgup, history, 8 years ago, In English
CodeForces: Access Denied Trying to open the Announcement Blogs or Tutorials of some of the past contests (such as: http://codeforces.me/contest/877) gives "Access Denied". What is the reason behind this? Is it a bug? <spoiler summary="Screenshot"> ![ ](https://i.gyazo.com/eb92111074e146eea6aaea037ebb896a.png) </spoiler>

Full text and comments »

Tags bug
  • Vote: I like it
  • +56
  • Vote: I do not like it

34.
By neitoroxin, history, 4 months ago, translation, In English
Math in out life I don't think anyone doubts that when we solve problems on platforms like Codeforces, we are primarily sharpening our mathematical thinking, and only secondarily our algorithmic skills (such as implementation, data structures, etc.). However, lately, I’ve noticed a rather controversial trend: sometimes problemsetters don’t seem to put much effort in and just cram pure mathematics into a basic <input/output> format. You've probably encountered this in recent rounds: you open a problem, and its entire "solution" boils down to guessing a formula or a pattern just by looking at the samples. By no means am I denying the benefits of math, and I love it myself. But the context in which it is currently being served leaves much to be desired. I’m absolutely not against problems where proving a specific fact serves as the foundation for the solution (for instance, optimizing a brute-force search). Instead, I suggest adding more variety to the problems—incorporating things like "olympiad tr...

Full text and comments »

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

35.
By winawer_player, history, 16 months ago, In English
Yet another way to combat cheating(possibly effective?) Hi everyone, I know that there are probably too many cheating related blogs on this website by now. But I think that my proposal could actually be useful. I'm assuming that this approach hasn't been discussed before. First I ask the question as to what motivates people to cheat? I think it is largely because of rating. People want to get a high rating and post it on their CV/Resume. What we can do is deny them this incentive. Right now, when a user has a skipped submission, their contest is skipped and they are moved to the bottom of the standings and get an appropriate recalculated delta. I think that I have a better solution, which I will describe in the next paragraph. Let us say user X has a initial rating of 1500. He cheats in a contest and get his rating to say, 1650. We make his rating -1650 after recalculation. In other words, just negate his final rating before rollback. He can then get a rank of a Newbie or any other appropriate title. We can move such users to a s...
can do is deny them this incentive. Right now, when a user has a skipped submission, their, rating. People want to get a high rating and post it on their CV/Resume. What we can do isdeny them

Full text and comments »

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

36.
By RE_Prince, history, 2 years ago, In English
Tips on becoming specialist I became specialist in round 986, a dream I had for 2 years. Here are some tips for a pupil or even a newbie to reach specialist: - practice a lot, I noticed one thing, which is that some people usually take more time to solve a problem during contests then during daily practice. As you can see, I solved some 1500~1900 problems, but I only have 1400 rating, so perhaps upsolving will help. - DONT CHEAT. I used to cheat 2 years ago, and it seemed that it only brought me negative delta and nothing else. I didn't improve nor increased rating. SO FOR THOSE OF YOU WHO USE GPT FOR POSITIVE DELTA, QUIT USING IT. OTHER CONTESTANTS WILL FIND OUT IF RATING ROLLBACK DOESN'T. - Always have pen&paper beside you. It might seem like a small thing to do, but writing out what you are thinking can greatly inprove your thinking process, allowing you to think more clearly. - This is the last tip, and what I think is the most important. Don't quit when your idea is denied. Sometimes, you t...

Full text and comments »

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

37.
By rahulgandhi1970, history, 17 months ago, In English
Codeforces and Politics The title of my blog also happens to be the title of my thesis which I have submitted for my PhD dissertation, where I was asked to work on a common ground between Politics and Programming and I happened to find this platform the best source for observing people and gathering data (by the way I am pursuing my PhD in Political Science but was pretty active here during my BTech days). I just thought of sharing some of my findings on this platform &mdash; for those who might be interested in Political Science and for those who might want to know how politics effects the people around them. The Global Rise of Right Wing Politics ------------------ To give people who don't have a background in political science a context and some background information, since the past two decades, the world started to shift more towards the right. This refers the increase in the likelihood of people falling more for the right wing propaganda than the left wing one, which happened to be the case 2 d...
constant with minor fluctuations. I don't deny the rise of cheating in past year or two but the, on this platform has always remained constant with minor fluctuations. I don't deny the rise of

Full text and comments »

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

38.
By Torta, history, 8 years ago, In English
SIHE.AI? Hi there, Recently a Chinese company reached out to me, called SIHE.AI, that claims to have recruited several ACM ICPC world finalists. They also claim to have held a programming competition at their office, where most participants were IOI gold medalists and ACM ICPC world finalists. Could anyone help me confirm or deny this? Thank you! ![ ](/predownloaded/68/bf/68bf73f957d31ccd44bd93db602d55ba90dae485.png)
anyone help me confirm or deny this? Thank you! ![ ](/predownloaded/68/bf, Could anyone help me confirm or deny this? Thank you!

Full text and comments »

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

39.
By C_Witch, history, 4 years ago, In English
May you help Egyptian team to make it to the IOI'22 Hey Codeforces!, For the past years , the Ministry of Communication and Information Technology MCIT sponsored the Egyptian team to travel to IOI. However, this year, there is no transparency from the MCIT's side at all. Our tickets are not booked until now, and MCIT doesn't either confirm or deny that they will sponsor us this year. Now, there are fewer tickets left, and the cost of traveling increases as we approach IOI. We all have been practicing really hard for IOI for the past few months. Now, there is very little time for us to make alternative plans to participate onsite. We'd be so grateful if you helped our team to make to Indonesia this year!. You can take a look on [this blog](https://codeforces.me/blog/entry/105302) for more info. Please [donate here.](https://gogetfunding.com/iiot-fundraising/) Update: Thanks for your help, our team made to Indonesia's IOI'22 elhamdullah , and gained 2 bronze medals. ...
all. Our tickets are not booked until now, and MCIT doesn't either confirm or deny that they will, deny that they will sponsor us this year. Now, there are fewer tickets left, and the cost of

Full text and comments »

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

40.
By Winn1topking, 7 years ago, In English
On a mission to reach LGM Time's up. As many of you had predicted, the "mission to reach Red in 6 months and LGM in 12 months" was as ambitious as it was unsuccessful. I won't be having the "last laugh" and that wasn't even the right way to go about this whole thing. I started the year strong but things fell off track after January. There were some productive weeks throughout the course of the year but I failed to remind myself to keep on going in the face of a seemingly insurmountable challenge. And yet, I owe it to myself to keep the dream alive and make a proper update that better represents my intentions after a year of reflection. The road to LGM is full of self-doubts and failures no matter how embarrassing or self-sabotaging they may be, but all that crap needs to be thrown right out the window in order to become one. This is just one of those moments. There is nothing wrong in wanting to become LGM but there is a price to pay for such an esteemed and elusive title held by so few members of this co...
— to deny that one can never approach the level of "gods" who crossed the magical 3000 barrier, " (referring to myself), but also the other way around — to deny that one can never approach

Full text and comments »

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

41.
By duyminhtruong711, history, 3 years ago, In English
Recap process after half a month of practicing Hello there, this is my first blog in Codeforces, if anything is not going right, please let me know it. This is a note after 12 hours of practicing a unofficial contest on a day and half a month of practicing in Codeforces. My journey of coding start when I was in high school, I was taken part in a small coding contest with Pascal, the result was really bad. And now when I am in university, I practiced some algorithms problems in C first, and then in Java. After one or two year, now I'm back in algorithm, I choose C++ because it easier to search for tutorial. With C knowledge, it still took me a little time to get comfort in C++, since I was coding website with HTML, CSS, Javascript, Java and C# lately. With the strategy for going fast, I go mad on solving problems, whenever I fail, I go for tutorial. After that, I was able to solve problem up to 1300 rating according to Codeforces. Beside, I taken part in 5 Codeforces contest, solve only one or two problems, a...
can deny the sadness.

Full text and comments »

42.
By avinashdoddi, 4 years ago, In English
Unable to Use Gmail to Login into Codeforces [user:MikeMirzayanov,2023-04-07] When I try to login Using Gmail, "Access Denied" is being displayed. [(This is Begin Displayed after trying to login using Gmail)] (https://drive.google.com/file/d/1KMuAHmyhk4_gA5xB9eqWiQCU7hVCsVzo/view?usp=sharing) I have noticed that I can't login into Codeforces using Gmail after logging Out after participating in Educational Round 146 yesterday. Can this issue be resolved?

Full text and comments »

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

43.
By mathemage, history, 5 years ago, In English
TopCoder Open 21 Round 3B? Will there be TCO21 Round 3B? I can see there was one in previous years (2020, 2019, 2017,...) but I can't find one in the TC public calendar. According to this [link](https://www.timeanddate.com/worldclock/fixedtime.html?msg=TCO21%20Algorithm%20Round%203B&iso=20210717T1600&ah=2&am=0), there is supposed to be one. I also saw it somewhere on clist.by calendar, but I can't find it anymore. Can someone please confirm or deny, whether there'll be Round 3B? Thanks.
Can someone please confirm or deny, whether there'll be Round 3B? Thanks.

Full text and comments »

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

44.
By Kallaseldor, history, 8 years ago, In English
[BUG] Access Denied when trying to enter "Favourites" tab When trying to enter the tab "Favourites" I receive a "Access denied" message instead of being able to see my favourited blogs. Does anyone know how to solve this?

Full text and comments »

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

45.
By raghuslayer, history, 12 months ago, In English
Cannot view other users’ submissions — need help Hi everyone, I’m facing an issue on Codeforces where I’m not able to view submissions of other users for any problem. Normally, the “Submissions” tab shows all public submissions, but for me: It loads a blank page, or It shows only my own submissions, or It keeps showing “Access Denied”/NA I tested this on multiple devices and networks, but the issue remains. Is this a new feature, a bug, or is something wrong with my account settings? If anyone knows the reason or any fix, please help. Thanks in advance!

Full text and comments »

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

46.
By 2ooWeak2ooSlow2ooDumb, history, 8 years ago, In English
WHY ACCESS DENIED ? When i try to open this blog [click](https://codeforces.me/blog/entry/22616), it shows access denied. Please look into the matter [user:MikeMirzayanov,2019-01-07]

Full text and comments »

47.
By ahm.kam_92, 15 years ago, In English
Access Denied Some of my friends cannot log in to submit their codes in the contest, because they are receiving an "Access Denied" message. Any help?

Full text and comments »

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

48.
By Bilal04, history, 4 years ago, In English
System Alleging me for plagiarism **Your solution 191878626 for the problem 1791B significantly coincides with solutions Bilal04/191878626, sam1617/191903840.** I firmly deny the allegation that I copied someone else's code or provided any form of assistance to other contestants during the coding contest. In my code, I have used variables like 's' representing string, 'x' and 'y' representing x and y coordinates, and 'f' for flag which is very common, I am confident that the code I have submitted is entirely my own and that I have followed all the rules and guidelines of the contest. This is a pure coincidence and I hope that this issue will be resolved quickly and fairly.
/191878626, sam1617/191903840.** I firmly deny the allegation that I copied someone else's code or, I firmly deny the allegation that I copied someone else's code or provided any form of assistance

Full text and comments »

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

49.
By Der_Vlapos, history, 4 years ago, translation, In English
Dp optimization Problems **Hello codeforces!** I recently came across the topic of **dp optimization** (Knuta-Yao, Lambda, Convex Hull Trick, divide and conquer), and it seemed to me that it often appeared at the olympiads in my region. However, I practically did not find a task on this topic (I do not deny the fact that I searched badly). So, if someone has **links to problems** on this topic or **search method** for such problems and you don't mind sharing them, I will be very grateful to you!
olympiads in my region. However, I practically did not find a task on this topic (I do notdeny the fact, , I practically did not find a task on this topic (I do not deny the fact that I searched badly). So

Full text and comments »

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

50.
By aryan2621, history, 5 years ago, In English
About Practise in Codechef Through this blog I want to know about how to practise in the codechef.I know how to practise in codeforces,like by setting the difficulties and tags,targeting a particular rating like 1400-1500 and various extensions are there for keeping the track of the practice. `I know that codechef is unpopular due to cheating but we cant deny the fact that they also have very good questions`. In short I want to know how to get started with Codechef? Request : If you dont know/dont want,just ignore but dont downvote. <spoiler summary=" : ("> Update : Downvoters will be Downvoters ! :( </spoiler>
unpopular due to cheating but we cant deny the fact that they also have very good questions`. In, `I know that codechef is unpopular due to cheating but we cant deny the fact that they also have

Full text and comments »

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

51.
By stingray, 17 years ago, In English
Accurate memory accounting for programming contests (part 1) <span class="Apple-style-span" style="font-family: arial , sans-serif;font-size: small;"> <p>The memory accounting is the part of programming contest environment which is almost never done right. And even if it's done right, it doesn't seems so to the extent that people will complain about it. A lot.</p> <p>So let's start with choosing our platform first (Windows), and briefly describe the most common mistakes people do (aside from saying "contest platform is simple, I'll write one in no time").</p> <h2>Chapter 1, in which we learn how to do&nbsp;<a style="font-family: arial , sans-serif;color: rgb(0,62,168);">GetProcessMemoryInfo</a></h2> <p> <a style="font-family: arial , sans-serif;color: rgb(0,62,168);">CreateProcess</a>&nbsp;(and similar functions) give us this handle, which we can later use in&nbsp;<a style="font-family: arial , sans-serif;color: rgb(0,62,168);">GetProcessMemoryInfo</a>&nbsp;call, which will in turn give ...
good in our case. What they do when you limit the memory size is they deny memory allocations, . What they do when you limit the memory size is they deny memory allocations by forcing

Full text and comments »

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

52.
By SunaookamiShiroko, history, 11 months ago, In English
Why do Indians cheat so much? Is it just my impression, or do Indians always appear on lists of cheaters—and in large numbers at that? What’s more, they even firmly deny it when caught.
that? What’s more, they even firmly deny it when caught.

Full text and comments »

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

53.
By ytml20010, history, 6 years ago, In English
Is it true that top companies offer jobs/internships for top contestants in their organized contests? Hello Codeforces Every year big companies like Google and Facebook organize many programming contests, like Google hash code, Google code jam, Facebook hacker cup... I was wondering, is it really true that top contestants are offered jobs/internships at these companies? someone told me that this year everyone who reached Facebook hacker cup round 3 were offered internships and every one who reached the onsite contest got a job offer at Facebook. Can anyone please confirm or deny that? Please share your knowledge with the community.
contest got a job offer at Facebook. Can anyone please confirm or deny that? Please share your, reached the onsite contest got a job offer at Facebook. Can anyone please confirm ordeny that? Please

Full text and comments »

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

54.
By 4e494b, history, 8 years ago, In English
Access denied to favorite section of profile. [user:MikeMirzayanov,2019-01-07] please look into it, as i can not access my, "favorite blogs". I had searched for the blogs and saved them as favorites (by clicking on the star), but now when i click on favorite section, it shows ACCESS DENIED. Please help. **UPD**: This issue is **fixed** now.

Full text and comments »

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

55.
By Deathly_Hallows, history, 10 years ago, In English
Codeforces Round #407 (Div. 2) problem B i want to say one thing to the setters denying that there was a mistake in the English statement is worse than the mistake itself

Full text and comments »

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

56.
By Ghost0fSparta, history, 8 years ago, In English
Handle not alloted even if it is not taken I want "GhostOfSparta" handle but I am denied telling me that this handle is already taken. [user:MikeMirzayanov,2018-12-29] please allot me this handle if it does not exist. <br><br> **PS**: As pointed out by [user:dreamoon_love_AA,2018-12-29], [user:subhamdubeyinfo,2018-12-29] previously used this handle and has changed it now. So now I should be given access to this handle as it not not held by anybody.<br> **PS**: Settled this with "Gost0fSparta" instead of "GhostOfSparta". Hopefully the difference is not visible :p

Full text and comments »

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

57.
By unrated_round, history, 6 years ago, In English
Make Round #677 unrated Hello codeforces! This round was very cool, I won't deny that. But, many people "precomputed" answers for E. How is it possible? Let me introduce you to [OEIS](https://oeis.org/). This is an online encylopedia of series and sequences, and it's very well-known. Consider the output of sample 4 (12164510040883200). It's a pretty random number, right? No. Let's see what happens. Paste this URL: https://oeis.org/search?q=12164510040883200&language=english&go=Search We can see that the result is a sequence of integers 1, 3, 40, 1260, 72576, 6652800, 889574400, 163459296000, 39520825344000, 12164510040883200, 4644631106519040000, 2154334728240414720000, 1193170003333152768000000, 777776389315596582912000000 which turn out to be the solutions for problem E. Problem E was solved by many in a similar fashion, and it's extremely unfair to the others if people who cheated get away with it. I request you to scrap problem E, or make the round unrated. Thank you! [user:vovuh,2020-10-...
Hello codeforces! This round was very cool, I won't deny that. But, many people "precomputed, This round was very cool, I won't deny that. But, many people "precomputed" answers for E. How is

Full text and comments »

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

58.
By tanus_era, history, 6 years ago, In English
Protest Very unexpected and unprofessional act from codeforces authority. This is not a religious-based community, right? Then why are you asking users to accept santa claus? This is clearly against Islam and Muslims. We don't expect anything like this. Please don't argue in the comment-box. You have no right to criticize someone if he denies to accept your beliefs. I hope cf will accept their mistake && resolve the issue ASAP

Full text and comments »

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

59.
By scaler_truth_ib, history, 7 years ago, In English
Review of Scaler Academy and suggesting every other India coder friend of mine not to get in the trap I will not disclose who I am. Simple reason is we are normal middle class people who fear these people, they might screw us since they are powerful. I belong to the May batch, am from a mediocre college. We had webinars, "dare to dream" sessions and much before enrolling in the course, not even a single day they did mention that you are here to learn, it was all about **REFERRALS** and **REFERRALS**. I was not a very good coder(5* at CC and 1550+ at CF), but I was good enough to crack the questions that Indian companies asked in the interviews. The only problem was our college did not have tech giants visiting. I enrolled, and we were assured that the referrals will start from September. After a month of the course, they attached a condition that you need to have problem solving percentage > 70% to appear for referrals. I did not want to miss this golden opportunity and used to solve the problems on a weekly basis and always had my % > 80. I approached them in September, they sai...

Full text and comments »

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

60.
By AnonymousForSafety, 7 years ago, In English
About Universities (Help) So this year I went to study at Innopolis University and right away I noticed that the courses weren't that good and started asking professors whether I should go there or go back to a university of a higher rank by in a worse country (worse living conditions but not that shit). Now the problem is I asked some of the professors and from what I got it was like some of them are leaving and that Innopolis is a risk and it doesn't have a rank and having an academic career from there could be close to impossible because the diploma wouldn't be worth much from this place. However, living conditions here are better and we get a good scholarship. Now my question to you guys is, what would you do if you were in my place. I have the option to stay here or go back to study computer engineering in a more established uni but in a shittier place but with an engineering program that has like top 250-300 rank. There were also some talk about how this project started and that it could have been some di...
confirm or deny this shit but what would you do if you were me?

Full text and comments »

61.
By ramprakash_k, 12 years ago, In English
Problem There are n>0 people standing in a queue. Their heights are a permutation of {1,2,...,n}. <br> There are m>0 ships ready for departure. <br> You can do 2 operations : (in the order of the queue) <br> -> Allot a boat i (1<=i<=m) for the person in the front of the queue. <br> -> Deny him service (send him away). <br> There is one constraint though. A person will board the ship allotted to him only if all the people already in that ship have lesser height than him (else he feels inferior). <br> As the manager, you need to find a way to maximize the number of people that can board these m ships. <br> (Sorry I dont remember the exact constraints on m,n but they are pretty big) <br> Input : <br> n m <br> a1 a2 a3 ... an <br> Output : <br> k <br> (a single integer 0<k<=n which is the maximum people that can be allotted to these m ships) <br> Example : <br> 5 2 <br> 4 2 5 1 3 <br> Output : <br> 4
) -> Allot a boat i (1<=i<=m) for the person in the front of the queue. -> Deny him

Full text and comments »

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

62.
By rahulm_1997, history, 10 years ago, In English
confusion regarding online judge for the contest on june 8 .. codeforces round 356 my c problem had initially been accepted and later had been failed towards the very end of the contest due to which it did not come to my notice .. just informing. my first solution [submission:18322989] was denied afer the contest was over but was initially accepted. after the contest i submitted the write solution [submission:18330104].. this was very depressing.

Full text and comments »

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

63.
By Kh.Madi, 15 years ago, translation, In English
Need help with Ubuntu <p>I'm new on Ubuntu. When I want to run my program, the "Permission denied" message appears. Who knows why? Help please. I wrote a+b program in c++. And compiled like "g++ a.cpp -o a". Then, I wrote in terminal ./a.</p><p></p>

Full text and comments »

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

64.
By Rikam, history, 4 years ago, In English
ChartGPT denying its intelligence <a href="https://ibb.co/HX21KXd"><img src="https://i.ibb.co/wYL3dYs/ChartGPT.png" alt="ChartGPT" border="0"></a>

Full text and comments »

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

65.
By revenge5, 13 years ago, In English
security transfer Guangzhou security transfer Guangzhou Songri, Gao Hongbo appeared in almost every national security arena will be greeted by the enthusiasm of the fans &mdash; Beijing curse. "Maybe the transfer has not been so common, coupled with poor communication and concerned me, so I left Beijing fans may have misunderstood it." Especially in the 2007 season, leading the<a href="http://www.maxsalesupras.com/nike-air-max-tn-c-39.html">nike air max tn online</a> National Security Yatai away win in the race, the mood Guoan fans excited cursed Gao Hongbo, the Yatai bus trapped in the stadium, but Gao Hongbo won the title King of the mountain still look calm.For national security hot balls City, Gao Hongbo also have their own views. "Guoan heritage is very good, any team can have so many spectators cheering, allowing the team to enhance the combat effectiveness of 30 percent. Guoan club organization is very good, the team is very enthusiastic to admire . "However, many players left the national security, whi...

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

66.
By dustr80, 13 years ago, In English
coach Doak River Lawyers Adams coach Doak River Lawyers Adams, the Clippers players Chris Paul and Union conducted any relevant communication, "all of which will be implemented based on the findings of this survey." For just appointed Adam Silverstone, how The deal also allows him to alleged incidents of racial discrimination faced enormous challenges.It is reported that in the<a href="http://www.freeasicscheap.co.uk/nike-free-run-3-c-29.html">nike free run 3 for sale</a> NBA before the official launch of the investigation and evidence collection, Adam Silverstone has also been on the matter and the players union representatives Kevin Johnson communicated. Johnson said, NBA officials have listened to the views of the players union, and make a preliminary punishment: Stirling can not attend the remainder of the playoffs this season, any game.As to how the ultimate punishment Stirling, is now generally views the U.S. media is fine, suspended or disqualified Stirling boss, including Johnson, James, including a numbe...

Full text and comments »

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

67.
By godlife7, 13 years ago, In English
d coach Ancelotti participating d coach Ancelotti participating ho to take 45 wins 56 games 6 draws and 5 losses, scoring 151 goals, lost only 42 balls, winning up to 80.36%. In the history of Real Madrid, Ancelotti was the highest winning coach, are higher than Jose Mourinho, <a href="http://www.airfreeshoes.es/nike-free-40-v3-c-13.html">nike free 4.0 v3 hombre</a> Fabio Capello, Bosque, Guus Hiddink, Di Stefano, who Valdano.Whether it is the big winner as a player or coach, Carlo Ancelotti is the Champions League. Age of the players, Ancelotti at AC Milan validity period, two in 1989 and 1990 to win the military Cup. As a coach, Carlo Ancelotti had three degrees (2003, 2005 and 2007) led Milan reached the Champions League final, and has twice defeated Juventus and Liverpool Champions League aspirations. Milan Champions League once had said DNA, Ancelotti is also true, as a player and coach him four degrees aspirations Champions (Champions League) champion, Lisbon May 25, he will impact the individual football car...

Full text and comments »

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

68.
By reign88, 13 years ago, In English
because they can not participate to others. Shortly after the case was investigated, Li City sacked.Henan migrant workers from workers in Beijing for 20 years, children in Beijing from kindergarten to junior high school, but was told that the move can only apply for enrollment in secondary vocational schools, and high school can not be reported. April 28, because they can not participate equally in the entrance examination in Beijing household registration in Henan, Shandong and Beijing's eight non-nationals middle school students, the Beijing Xicheng District administrative complaint filed by the Beijing Municipal Commission of Education court. Reporter<a href="http://www.airmaxssalomon.es/nike-air-max-90-c-10.html">nike air max 90 venta online</a> learned yesterday, they filed a suit in the court notice of its complement other materials on May 4.Experience | in Beijing from kindergarten to junior high school, when the move was "stuck"Chen Hui (a pseudonym) in Beijing workers 20 years, residence in Xinyang, Henan,...

Full text and comments »

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

69.
By Douchbag, history, 8 years ago, In English
Sublime Text Problem Hi everyone, so i'm having a trouble with sublime text, I installed tdm64 gcc as a compiler, I ran a test code once and it worked but when I wrote a whole new one I got an error message that says : "can't open file name.exe permission denied". What should I do ??!

Full text and comments »

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

70.
By bask89, 13 years ago, In English
when asked if the Knicks would errors still cause she has been a disadvantage. Flor sent Love Game finished a strong third game after the break, to establish a 3-1 lead. Fully restricted Peng Shuai then lost serve again, squandered three break points after the failure to win the marathon sixth inning, Peng Shuai has a big deficit to 1-5. Flor obvious advantages did not let up, the end of the fourth disc easily break on a 6-1 head start.Peng Shuai fought back in the second set start to complete the first break, after winning serve to establish a 2-1 lead. Submit Love Game of Flor recover inning, but still rely Peng Shuai serve to defuse the crisis after a break and continue to a 3-1 lead. They followed their own security, Flor 2-4 behind in<a href="http://www.shoejordan.fr/air-jordan-9-c-10.html">air jordan 9 retro</a> the face of adversity began to elevate status: Spaniard saved three break points to hold the seventh inning, the game gradually snatch the initiative. Then take advantage of China's Golden unforced ...

Full text and comments »

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

71.
By CrappyPoo, history, 6 years ago, In English
Protest Very unexpected and unprofessional act from codeforces authority. This is not a religious-based community, right? Then why are you asking users to accept santa claus? This is clearly against atheism. As an atheist, I refuse to pledge my loyalty to children's story characters. We don't expect anything like this. Please don't argue in the comment-box. You have no right to criticize someone if he denies to accept your beliefs. I hope cf will accept their mistake && resolve the issue ASAP

Full text and comments »

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

72.
By zl1101, 13 years ago, In English
Whitey Bulger 'Deserves No Mercy,' Prosecutors Say Whitey Bulger 'Deserves No Mercy,' Prosecutors Say <a href="http://dyddpt.com">cheap uggs </a> WASHINGTON -- Senate Majority Leader Harry Reid (D-Nev.) is plowing ahead trying to confirm President Barack Obama's nominees to the second-most powerful court in the country, even after Republicans blocked one nominee and signaled they'll do it again for others.<br /> Reid filed a motion on Thursday that sets up a confirmation vote on Tuesday for Nina Pillard, one of Obama's three nominees for the D.C. Circuit Court of Appeals. Republicans last week filibustered the first nominee, Patricia Millett, who Reid has vowed to bring up again. Obama's third nominee, Robert Wilkins, is expected to soon get a vote. Republicans are expected to block him, too.<br /> <a href="http://dyddpt.com">uggs on sale </a> None of the D.C. Circuit nominations is contentious -- even the Republicans blocking them say it's nothing personal. Instead, GOP senators argue the 11-member court isn't bus...

Full text and comments »

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