Hi all! Many times I have seen people saying that their solution fails at a particular test case. How they observe it? Is there a way to find out the test case at which your program fail?
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
Few days ago there were online version of Lithuanian and Croatian olympiad in Informatics 2018. Are there any such an IOI style contests?
Hi All. Is there any LINEAR algorithm to find the diameter of a graph, which have only one cycle(N vertexes, N paths)?
Hi frineds,
Does anyone have the problems of IZHO (INTERNATIONAL ZHAUTYKOV OLYMPIAD) 2017? Please share it with me!
Hi guys! I openned this block to discuss apio 2017 problems. Especially I want to know any solution of problem A. I've got only 23 points from that problem. Is there anyone , hwo can help me solve this problem fully?
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/22/2024 22:46:07 (h1).
Desktop version, switch to mobile version.
Supported by
