Hey there , i think this cf round overlaps with topcoder srm ;)
i just wanted to point it out , no hard feelings, just in case it can be re-scheduled.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Hey there , i think this cf round overlaps with topcoder srm ;)
i just wanted to point it out , no hard feelings, just in case it can be re-scheduled.
Hey there,
I am looking for help regarding the "Minimum vertex cover" of a bipartite graph.
A vertex cove of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set.
I know that its equal to the maximum matching , acording to Konig theorem .
I want to know how to find it (find the nodes) ;
I've seen some explanations on the internet but they all seem very hard to understand (a lot of mathematical notations, wich are bugging me ) .
All ive understood is that you somehow have to start from a maximum match , then apply some greedy algorithm wich i don't understand.
Can some1 explain it to me in an intuitive manner please :D
Thanks .
Hello everyone , I am seeking help regarding interactive tasks (IOI-style alike).
I want to get used to this type of problems , but can't seem to find any website that supports interactive submisions.
Also sharing with me some nice interactive tasks that you know of would be of great help .
Thanks a lot!!!, All the best !!!
Tomorow , 11 april TCO 2015 Round1A will take place ,
http://tco15.topcoder.com/algorithm/schedule/
time-date :
good luck to all the participants !!!
ps : how do i register to it ? its the same like any regular srm?
Hey there , does any1 know where i can get the test data for Chinese national Olympiad (NOI).
I've googled it but i don't seem to find any website with past NOI's or atleast some NOI's.
Thanks in advance; all the best :)
Tomorow , 2 Feb. Topcoder srm 648 will take place
does anyone know what time it starts ?
ive looked on the event calendar but it usualy dosent show the right time (it dosent match with my country hour , or atleast i think that);
Thanks in advance
Hey , my name is Dutzu ,I'm 17 and I am searching for a friendly group of people who want to simulate ACM-like contests . I'm not preparing for ACM , I'm just doing it for fun. I think working in team is more productive than training alone. I'm usualy free after 17:00 (Romania time) http://www.timeanddate.com/worldclock/fixedtime.html?iso=20140526T17&p1=2210 ,but I got no fixed schendule and also summer holiday is coming soon. My algorithmic level is alike my codeforces rating.
$$$ Have a nice day !
Название |
---|