Does Anybody have a working COOL (Classroom Object-Oriented Language) Compiler project ??
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 168 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | nor | 151 |
5 | -is-this-fft- | 151 |
7 | atcoder_official | 147 |
7 | TheScrasse | 147 |
9 | Petr | 145 |
10 | pajenegod | 144 |
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 |
---|