-
While discussing versioning strategy, @mashedcode recently [pointed out](https://github.com/jmitchell/multiset/pull/27#discussion_r363116158) many
things remain undecided about this crate and asked f…
-
**Describe the bug**
I installed the package into a virtual environment and proceeded to attempt the following code:
```
import codeforces_api
import json
SECRETS = json.load(open("secret.json"…
-
In [`f64c021`](https://github.com/bitsstdcheee/luogu-status/commit/f64c021c7ce676eab91315ddfe168eec7f1689cc
), Codeforces (https://codeforces.com) was **down**:
- HTTP code: 403
- Response time: 149 m…
-
In [`673dda9`](https://github.com/xcpcio/codeforces.uptime/commit/673dda98c005600dfcece53592f20036838eec2a
), Codeforces (https://codeforces.com) was **down**:
- HTTP code: 403
- Response time: 96 ms
Dup4 updated
2 months ago
-
UnionFind
データのグループ化を素早く行う
not sameな頂点をN-1回つなげるとN頂点の木になる
UnionFind + スタック芸
https://atcoder.jp/contests/acl1/submissions/18374339 A - Reachable Towns
グラフの問題になる
G の各辺に対して、端点のうちどちらかを光らせることができる。光る頂点の…
-
-
In [`44227a8`](https://github.com/xcpcio/codeforces.uptime/commit/44227a8413eedfe322f7574ff32bf1fa2e81dea6
), Polygon (https://polygon.codeforces.com) was **down**:
- HTTP code: 0
- Response time: 0 m…
-
I would like to add O(nlogn) implementation of Longest Increasing Subsequence in an array.
#### This issue is about [Algo/LongestIncreasingSubsequence] [C++] in nlogn
(http://codeforces.com/blog/en…
-
Hi!
I do coding on many platforms and I got TLE(time limit exceed) errors many times so I just want to know how can I reduce the time complexity of my python program.
-
It would be more helpful if it display a notification icon, to draw attention, i think so.
ghost updated
8 years ago