dipta007's blog

By dipta007, 20 months ago, In English,

3-4 days ago my friend mamun4122 told me, he wanted to download all his codes from the Codeforces site. He searched on google for such tool. Found some links 1, 2. But till today, they can't download from the gyms or we can't find any. If there is any, please give me the link in comment section. TIA.

So I thought why don't I give a try.

Now here is the link to the source code

You can find descriptions of how to use it in the README.md.

It would ask for your handle & account password as the gym solutions can't be downloaded without login. But if you still feel insecure, feel free to check my code. I know everyone here is smart enough to understand my beginner level code.

The format of the folder is [ Problem name — contest ID ]
And the format of the file is [ Problem ID — Problem name ]

If you face any problems or bugs, you can open an issue on github or knock me here or in FB

Thanks mamun4122 & howcum for testing and finding bugs.

Read more »

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

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

In the last CSAcademy Round 53, Problem Number C, My this submission gives me TLE

My TLE Code

But after the contest I have changed my code and submitted and that was accepted.

My Accepted Code

The change was on line 144 and 161. On the first code (TLE) I checked if the propagate value is not equal to 0 by the following code

if( tree[node].prop )

On the accepted code I checked the same thing by this following code:

if( tree[node].prop != 0 )

But I think there is no difference in the two codes. Please explain me if I am wrong.

I have already posted on CSAcademy. But haven't got any reply till now. So I posted here for getting more response. You can check my blog by the following link: My Blog on CSAcademy

Read more »

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

By dipta007, history, 22 months ago, In English,

Can anyone provide me some resources / link / explanation to understand the technique of finding all pair shortest path using Matrix Expo ?

During Google search I came across this link: http://codeforces.com/blog/entry/43225

But I couldn't get the idea. Sorry for my bad English. Thanks in advance :)

Read more »

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