I noticed that finneganpierson's blogs have disappeared. Does anyone know where they are?

I think I'm already forgetting the top 10 ways to get started on your next software development project...

# | User | Rating |
---|---|---|

1 | tourist | 3821 |

2 | Benq | 3744 |

3 | ksun48 | 3559 |

4 | Radewoosh | 3538 |

5 | peehs_moorhsum | 3531 |

6 | Um_nik | 3488 |

7 | maroonrk | 3423 |

8 | Petr | 3379 |

9 | sunset | 3337 |

10 | ecnerwala | 3335 |

# | User | Contrib. |
---|---|---|

1 | 1-gon | 206 |

2 | awoo | 181 |

2 | Errichto | 181 |

4 | Um_nik | 180 |

5 | -is-this-fft- | 174 |

5 | maroonrk | 174 |

7 | Radewoosh | 173 |

8 | tourist | 172 |

9 | SecondThread | 171 |

10 | rng_58 | 166 |

I noticed that finneganpierson's blogs have disappeared. Does anyone know where they are?

I think I'm already forgetting the top 10 ways to get started on your next software development project...

Dear All,

Please recommend some annoying, implementation-heavy, and case-loaded Codeforces problems.

It will be even better if there exists an obvious solution that is very hard to implement and also a clever solution (with the same time complexity) that is easier to implement.

Basically, recommend any problem that you were very confident you could solve but somehow landed 5 WA verdicts and/or left in rage.

About halfway through the contest, this message kept appearing:

Even m2.codeforces.com isn't safe:

Note: My internet connection is not broken Did this affect everyone? Anyways, this is extremely annoying and should be fixed as soon as possible. I had to reload my pages many times before Codeforces began functioning again.

Here is a normal implementation of Pollard's Rho algorithm.

```
ll c = 1;
ll g(ll x, ll n){
return (x*x+c)%n;
}
ll po(ll n){
ll x = 2, y = 2, d = 1;
while (d==1){
x = g(x,n); y = g(g(y,n),n);
d = __gcd(llabs(x-y),n);
}
if (d==n) return -1;
return d;
}
```

However, the product x*x will overflow if n is too big (outside of int range). Is there a way to do the multiplication quickly (without using bigint or adding another log factor), or replacing the polynomial with some other function?

Hello, Codeforces.

I tried to use hashing to solve 1129C - Азбука Морзе. However, I kept getting the TLE verdict. My time complexity should be O(k * m^2) (where k is the longest string to be tested, or 4) while the editorial's solution has time complexity O(k * m^2 + m^2 * log m).

I've tried many optimizations, such as using 2^64 as a base, switching between unordered_map and map, tweaking the multiplied prime, and even adding huge strings of pragmas. Pre-doing all the hashes gave me an MLE.

Here is a link to one of my many failed submissions : 58709459. Please help!

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jul/26/2021 07:41:25 (g2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|