arasmus's blog

By arasmus, history, 18 months ago, In English,

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 .

Read more »

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

By arasmus, history, 20 months ago, In English,

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!

Read more »

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

By arasmus, history, 21 month(s) ago, In English,

Does anyone have more info about this than can be obtained from a google search (which yielded nothing significant)

Read more »

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

By arasmus, history, 2 years ago, In English,
 
 
 
 
  • Vote: I like it
  • -18
  • Vote: I do not like it

By arasmus, history, 2 years ago, In English,

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

Read more »

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

By arasmus, history, 3 years ago, In English,

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)

Read more »

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

By arasmus, history, 3 years ago, In English,

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.

Read more »

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

By arasmus, history, 3 years ago, In English,

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});
}

Read more »

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

By arasmus, history, 3 years ago, In English,

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

Read more »

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

By arasmus, history, 3 years ago, In English,

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.

Read more »

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

By arasmus, history, 3 years ago, In English,

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.
PS.If there is already a way to do it ,please mention that in the comments

Read more »

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

By arasmus, history, 4 years ago, In English,

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

Read more »

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