[problem A](https://mirror.codeforces.com/contest/2118/submission/324084308)
submission, variable name, Problem B: Instant change of coding style, using T instead of tt as his
previous [problemA](https
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
→ Find user
→ Recent actions
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 305andrew stankevich contests— search for words "andrew", "stankevich" and "contests" at the same timeuser:mikemirzayanov title:testlib— search containing "testlib" in title by MikeMirzayanov"vk cup"— use quotes to find phrase as istitle:educational— search in title
Results
1.
Specialist after 4 contest. Is he cheating? + prof ai cheater 23rd place and 5 more cheaters Yo
So apparently I found out this [user:marshadow_ninja,2025-06-13] guy and he gain my suspicion through his code.
Problem B: Instant change of coding style, using T instead of tt as his previous [problem A](https://mirror.codeforces.com/contest/2118/submission/324084308) submission, variable name starts to get longer. Also this style is very VERY similar to ChatGPT and also in competitive progamming who will like to use caps lock letters and variable i mean it take lot more time
[Problem C](https://mirror.codeforces.com/contest/2118/submission/324094098) : "onesAbove" array, interesting name tbh. Also the logic and style is the similar to ChatGPT and same thing again can y'all tell me you will prefer writing o_a or oa as variable name if it is used 10+ time in code or you will prefer writing onesAbove as var name. intially_beauty bro i would have used ib as var name wtf use this much bigger names i suppose his hands had potion that make him immune to pain
<spoiler summary="onesAbove vs oa...
2.
Blog formatting tips Hi everyone!
Since a ton of blogs are being posted everyday and let's say not all of them are worth reading ●︿● , I decided to write this blog so that we could agree on some proper formatting or at least get some advice from experienced users.
<spoiler summary="this is aimed to be a discussion">
Well, of course as a person who is writing his second blog, I'm not qualified for writing this.
</spoiler>
Points that I find important while writing a blog ( not that my opinion matters anyway (¬_¬) ):
* use:
- A proper title (using ["I'm stuck on test 69!!!!"](https://mirror.codeforces.com/blog/entry/82183) won't get you anywhere)
- Italics for Titles, Foreign Words, and Proper Names. ( _not just for making your text look better_ )
- Simple English ( maybe some users aren't as good as you are )
- Your brain to figure out if your text can be misinterpreted ( [this blog](https://mirror.codeforces.com/blog/entry/82177) is a good example )
- A fresh topic as m...
Hi everyone! Since a ton of blogs are being posted everyday and let's say not
all of them are
3.
Algorithm Gym :: Graph Algorithms Welcome to the new episode of [user:PrinceOfPersia,2015-01-31] presents: Fun with algorithms ;)
You can find all the definitions here in the book "Introduction to graph theory", Douglas.B West.
[cut]
Important graph algorithms :
DFS
---
The most useful graph algorithms are search algorithms. DFS (Depth First Search) is one of them.
While running DFS, we assign colors to the vertices (initially white). Algorithm itself is really simple :
~~~~~
dfs (v):
color[v] = gray
for u in adj[v]:
if color[u] == white
then dfs(u)
color[v] = black
~~~~~
Black color here is not used, but you can use it sometimes.
Time complexity : $O(n + m)$.
#### DFS tree
DFS tree is a rooted tree that is built like this :
~~~~~
let T be a new tree
dfs (v):
color[v] = gray
for u in adj[v]:
if color[u] == white
then dfs(u) and par[u] = v (in T)
...
n$. So, for each binary block of size $l$ we need to lock up in a table $P$
the value for $RMQ
4.
The judge said wrong answer in cAPS lOCK Hello, everyone. In the question [cAPS lOCK](https://mirror.codeforces.com/gym/338178/problem/D), the judge said the wrong answer for test case number 3, i.e, 'cAPSlOCK'. Now, from reading the question and the following conditions being given:
"Let's consider that a word has been typed with the Caps lock key accidentally switched on, if:
a) either it only contains uppercase letters;
b) or all letters except for the first one are uppercase."
taking the above conditions into consideration, 'cAPSlOCK' should change to 'CapsLock' as apart from 'c' not all the words are lowercase, i.e, 'l'.
My submission number is #123967359 and it can also be found at https://pastebin.com/6EazS8Ph. So, my code converts 'cAPSlOCK' to 'CapsLock', however the desired answer is 'cAPSlOCK'
I highly appreciate anyone's input here.
The judge said wrong answer in cAPS lOCK, "Let's consider that a word has been typed with the Caps lock key accidentally
switched on, if:, a) either it only contains uppercase letters; b) or all letters except for the
first one are, lock key accidentally switched on, if: a) either it only contains uppercase
letters; b) or all
5.
ACM-ICPC 2011 Finals: Beginning <p>The train number nine from Saratov to Moscow was a pleasant surprise. Every compartment in our
wagon had a small TV, outlets, and each passenger could use a personal safe with a code lock. Of course,
we didn't turn the TV on and didn't use the safes. Imagine how ironic it would be if we put there, say, a
passport and forgot the code number.</p>
<center>
<img src="http://assets.codeforces.com/photos/finals-2011/p_IMG_4116.JPG" style="width:500px"><br><small>Note that there's not only a TV, but also also outlets behind Nickolay.</small>
</center>
<p>
In Moscow we had a little snack in some seedy railway eatery (in fact, Kolya and Artem went to
Mcdonalds) and got on an express to the Domodedovo Airport. The fun lasted 40 minutes and cost 12 USD
rubles each. Russian Railways have a good business![cut]</p>
<p>
We met Roman Alekseenkov (<span class="Apple-style-span" style="border-collapse: collapse; font-family: verdana, arial, sans-serif; font-size: 13px; "><a href="http:/...
wagon had a small TV, outlets, and each passenger could use a personal safe
witha code lock. Of
6.
MemSQL start[c]up Round 2 -- Editorial This is the Editorial for [contest:326] and [contest:335]. Congratulations [user:RAD,2013-08-05] for online round winner and [user:Petr,2013-08-05] for onsite and overall score winner!
This editorial is written jointly by the contest's coordinators (i.e., MemSQL engineers).
[problem:335A] -- [user:SkidanovAlex,2013-08-05]
Reference solution: [user:nwin,2013-08-05]'s [submission:4222182]
Instead of calculating the smallest possible number of sheets given a fixed $n$, let us instead try to compute the smallest possible value of $n$ given a fixed number of sheets. Let $k$ denote the number of sheets. If a particular letter appears $p$ times in $s$, then it must appear at least $ceil(p/k)$ times in the sheet. Thus we can compute the smallest possible value of $n$ by summing $ceil(p/k)$ over all letters. Now the original problem can be solved using binary search on $k$ (or brute force, since the constraints were small enough).
[problem:335B] -- [user:SkidanovAlex,2013-08-...
) = \frac{P(A \cap B)}{P(B)}$) to calculate this. Thus the expected number of
zip lines immediately
Tutorial of MemSQL start[c]up Round 2
Tutorial of MemSQL start[c]up Round 2 - online version
7.
Теоретический минимум для программиста [Кросспост] Шарпиц продолжает радовать нас замечательными постами в жж.<br>Предлагаю обсудить сей эпичный пост:<br><a href="http://sharpc.livejournal.com/67583.html">http://sharpc.livejournal.com/67583.html</a><br><br>Многие начинающие программисты, особенно обучающиеся в провинциальных
вузах, часто не знают, в какую сторону им развиваться, и что они должны
знать для того, чтобы эффективно работать по специальности. Удивительно,
но каждый день используя продукты и технологии, созданные другими
программистами на основании развитых областей знания, они даже не
догадываются о том, как они устроены.<br>[cut]<br><br>Построенные на теории
массового обслуживания и протоколе GSM сети мобильной связи;
PHP-скрипты, исполняющиеся на удаленных серверах и передающие свою
выдачу через Ethernet по TCP/IP на компьютеры с NDIS-драйверами;
процессоры, переупорядочивающие и спекулятивно исполняющие наборы
инструкций для того, чтобы скомпенсировать вызванную ограничениями
полупроводниковой элект...
:
<a
href="http://sharpc.livejournal.com/67583.html">http://sharpc.livejournal.com/67583.html
a
8.
Unknown Language Round #4: editorial <p>So here goes an editorial for the round. For me Befunge is one of the languages in which it's much easier to write code than to read it (and debugging code written by someone else is a complete torture; that's why we don't have hacking in ULRs). That's why I'll post just the general idea of the solution and my own codes — the latter just to show that I can code in Befunge too.</p>
<h3>A. Hexagonal numbers</h3>
{{{&:2*1-*.@}}}
<p>A "consolation" problem, which requires only to understand the principles of working with stack. Read $n$, duplicate it, multiply the topmost copy by 2 and decrement the result. Now the stack contains two numbers $n$ and $2n - 1$; multiply them and print the result.</p>
[cut]
<h3>B. Gnikool Ssalg</h3>
{{{> ~ : 25*- #v_ $ >:#,_ @
^ <}}}
<p>Here the easiest solution is to use the main stack property — elements are popped in reverse order compared to the order in which they were pushed. You can break the solution i...
much easier to write code than to read it (and debugging code written by
someone else isa complete
Tutorial of Unknown Language Round 4
9.
caps lock import java.io.*;<br /><br />public class capslock<br />{<br /> public static void main(String[]args) throws IOException<br /> {<br /> <br /> System.out.print("Enter a word: ");<br /> System.out.println(setWord());<br /> }<br /> <br /> public static String setWord() throws IOException<br /> {<br /> BufferedReader userInput = new BufferedReader (new InputStreamReader (System.in));<br /> <br /> String word = userInput.readLine();<br /> word = word.toLowerCase();<br /> word = word.substring(0,1).toUpperCase()+word.substring(1);<br /> <br /> return word;<br /> }<br />}
caps lock, /> {
System.out.print("Enter a word: ");, a word: ");
System.out.println(setWord());
}
public
10.
Runtime error on python code even though it runs fine in VSCODE As the title says, I get a runtime error on my code for a problem (Caps Lock) even though my code seems to work fine in my IDE.
Any ideas why this is?
**Here is the submission link:**
[Caps Lock Submission](https://mirror.codeforces.com/contest/131/submission/142911076)
As the title says, I get a runtime error on my code for a problem (Caps Lock)
even though my code
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Apr/19/2026 10:42:32 (h1).
Desktop version, switch to mobile version.
Supported by
