Does Anybody have a working COOL (Classroom Object-Oriented Language) Compiler project ??
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Does Anybody have a working COOL (Classroom Object-Oriented Language) Compiler project ??
How to solve the problem from latest Codechef Long Contest :
How to solve this problem from recent Codechef Long Challenge??
http://usaco.org/index.php?page=viewproblem2&cpid=532 can someone elaborate the solution to this problem given at the website ?
http://www.codechef.com/COOK56/problems/STRAB/
Can someone explain the dp approach except the one given in the editorial ? Also if someone know similar problems , please provide the link :) .
To find shortest path in a directed graph with edges having weight either 0 or 1 , we often use a modification of bfs with deque. But i don't know why we push at head of the queue whenever we encounter a 0-weight edge ?
Name |
---|