Reminder: in case of any technical issues, you can use the lightweight website m1.codeforces.com, m2.codeforces.com, m3.codeforces.com. ×

Omar_Morsi's blog

By Omar_Morsi, history, 10 months ago, In English,

This can be helpful for people who want to retrieve all of their accepted Codeforces solution links.

I implemented this simple script in GoLang as I needed to collect all of my Codeforces solution links and put them on Github in this format.

Running

  • Download main.exe file.
  • Open the terminal and go to the directory containing the downloaded file.
  • Type ./main.exe to execute the code.
  • You will be asked for the Codeforces handle for which the accepted solution links will be retrieved.

I hope this helps.

Read more »

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

By Omar_Morsi, history, 16 months ago, In English,

I think it will be a nice and fun feature to be able to see all the contests that a specific team participated in.

Read more »

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

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

I used to open this link to be able to find topcoder problems categorized. But now it is not working, does someone has any other alternative?

Read more »

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

By Omar_Morsi, history, 23 months ago, In English,

Can you provide a Greedy solution for the following problem ?

Given N <= 1e18 , M <= 10,000

Provide an array D = [d1, d2, d3, ... , dk] , such that d1 * d2 * d3 * ... * dk = N, di <= M, k should be minimized, or print impossible.

Read more »

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