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

### arasmus's blog

By arasmus, history, 3 years ago,

Since know I have your attention.Can someone please explain how in the world do you go about solving a distributed codejam question? (Specifically ... how to write code ? ... what are messages and nodes ?...) There seems to be no meaningful tutorial available for it online .

• -40

By arasmus, history, 4 years ago,

35685511 <- This has a macro min() at line 12 35686050 <- This does not In the first case...the code at line 44 && 45 (query() function) runs twice....this gave a TLE ... but why? In the second case when the macro is removed...no TLE happens!

• 0

By arasmus, history, 4 years ago,

• +15

By arasmus, history, 4 years ago,

• -18

By arasmus, history, 4 years ago,

Is there any website that allows for virtual participation in a SRM ?

• +7

By arasmus, history, 5 years ago,

Can anyone please suggest the best books (for competitive programming) in these subjects/sub-fields :
1) Probability
2) Combinatornics
3) Number Theory
4) Any other of your choice
(books must be of mid to high level)

• +9

By arasmus, history, 5 years ago,

Please mention ( according to you ) which 5 regions in the ACM live archive are the *best to practice from.

*by best I mean that the difficulty of questions should be high and the scope(breadth of topics covered) should be good too.

• +23

By arasmus, history, 5 years ago,

19194587
The code gives runtime error .
the line  mod1[X%10].push_back({X/10,f,s})  is causing the problem , if u comment it out everything runs fine
How can this simple push_back() cause a RE (array index of mod1 vector are in bound)

  for(int s=0;s<=6;s++)  for(int f = 0; (f+s)<=6;f++){  int X = s*7 + f*4;  mod1[X%10].push_back({X/10,f,s});  }

• -15

By arasmus, history, 5 years ago,

Can someone explain (in detail) how can a Linear Programming Problem be converted to a Network Flow problem.
Essentially I wish know how to create the network flow graph given the LP constraints,what edges/vertices to add to the graph and why those edges/vertices are added

• +34

By arasmus, history, 5 years ago,

Can someone give the idea behind implementing Link Cut trees and euler tour trees using splay trees.I am finding it a little difficult.Any help will be appreciated.

• +13

By arasmus, history, 5 years ago,

To the CodeForces team,
Please keep the problem tags hidden by the default. The tags should only become visible when the user clicks on the "Problem Tags" text.

• -24

By arasmus, history, 6 years ago,

Does anyone know on what CPU
do codeforces servers run on ? Any other info will be welcomed