Search found 429 matches

by Per
Wed Oct 04, 2006 9:10 am
Forum: Other words
Topic: 2007 world finals IN JAPAN?
Replies: 20
Views: 10490

Mohammad Mahmudur Rahman wrote:Won't there be any java challenge / parallel challenge this year? Nothing is mentioned in the schedule. :o
It might be hidden in the "nine to five" Tech Trek on Tuesday -- there's no way they would do eight hours of talks.
by Per
Sun Aug 06, 2006 9:58 pm
Forum: Algorithms
Topic: Matrix Multiplication O(nlgn) problems
Replies: 5
Views: 1916

Matrix multiplication can not be done in O(n log n). Perhaps you are thinking of polynomial multiplication?
by Per
Wed Jul 26, 2006 11:05 pm
Forum: Algorithms
Topic: longest path
Replies: 7
Views: 2485

Nothing brightens the day up like a little nitpicking. :) The IMO more standard choice of decision problem for longest path would be "Given G and K, does G have a path of length at least K", which is NP-complete. That is why I dragged in FNP, so that the "not known to be NP-complete" part would stay...
by Per
Wed Jul 26, 2006 5:37 pm
Forum: Algorithms
Topic: longest path
Replies: 7
Views: 2485

Cosmin.ro: NP-what? :) The correct phrase here would be "is known to be NP-hard", meaning: - if we were able to solve this problem in polynomial time, we would be able to solve any problem from NP in polynomial time - it is not even known whether there is a non-deterministic polynomial algorithm fo...
by Per
Mon Jul 24, 2006 9:05 pm
Forum: Other words
Topic: 2007 world finals IN JAPAN?
Replies: 20
Views: 10490

Re: hmm

Often the contest organizers fail to emphasize the importance of all teams being present. And I have not seen public announcement (May be I have missed) when any team fails to come due to visa problem in ICPC. If I remember correctly, this year, in San Antonio, there was only one team that couldn't...
by Per
Fri Apr 28, 2006 4:49 pm
Forum: Other words
Topic: World Finals 2006 Ready to submit
Replies: 9
Views: 4014

That is great. Many thanks.
by Per
Wed Apr 26, 2006 6:00 pm
Forum: Algorithms
Topic: bisection or something else..
Replies: 15
Views: 2867

I learned about bipartite matching the second year in university, both through a discrete math class and an algorithms class. Pick's Theorem I would consider more "special" knowledge. Though I guess if you study pure math and mainly combinatorics you might hear about it already as an undergrad. (Eve...
by Per
Fri Apr 21, 2006 3:59 am
Forum: Other words
Topic: IPSC 2006 -- invitation to a programming contest
Replies: 3
Views: 2251

Yay, the rules I've always wanted! :)
Sincere thanks for the rule change!
by Per
Fri Apr 14, 2006 10:07 am
Forum: Other words
Topic: Who will be ACM ICPC 2006 World Final's Champion?
Replies: 23
Views: 8461

I couldn't find any complete result at the awards ceremony this year, so my guess is that there won't be one. I don't think that is very important however; it makes sense to let the teams outside of top 12 be tied just by problems solved and not by time (though I guess the teams close to top 12 are ...
by Per
Tue Apr 04, 2006 7:20 pm
Forum: Other words
Topic: Who will be ACM ICPC 2006 World Final's Champion?
Replies: 23
Views: 8461

Unless they're having a really bad year, I think he underestimates the chances of the Russian teams. No Russian team in top 4 would be very surprising, in my opinion. This year Russia doesn't have exceptionally strong teams (imho, we had two previous year (I'm being honest, aren't I?), and we got t...
by Per
Sat Apr 01, 2006 7:30 pm
Forum: Bugs and suggestions
Topic: Solution times in contest ranklist
Replies: 3
Views: 2412

Solution times in contest ranklist

Hi, looking at the contest ranklist today I got a bit confused until I realised that the times displayed in the ranklist include penalty time. I find the more commonly used way of displaying just the time the problem was solved and the number of attempts a lot more useful. So I would like to suggest...
by Per
Tue Mar 14, 2006 11:07 pm
Forum: Other words
Topic: Who will be ACM ICPC 2006 World Final's Champion?
Replies: 23
Views: 8461

2 Per: I think results of Northern Grand Prix made Petr think so... Ah, I see. I would still be surprised if not a single Russian team managed to get in top 4 though. :) BTW, does anyone know who decides where to organize next World Finals? Is there some kind of voting? I think St. Petersburg would...
by Per
Mon Mar 13, 2006 8:32 pm
Forum: Other words
Topic: Who will be ACM ICPC 2006 World Final's Champion?
Replies: 23
Views: 8461

Recently I read an interview with a femous russian programmer Petr Mitrichev a.k.a. Petr Here it is in russian Among other questions he was asked about chances of russian teams in ACM ICPC World Finals 2006. And his answer was smth. like "I think we will get medals, but most probably not gold" Forg...
by Per
Wed Mar 01, 2006 10:18 am
Forum: Volume 109 (10900-10999)
Topic: 10999 - Crabbles
Replies: 26
Views: 13819

I have an another question. I also know how hashing works, and how trie works, (and surely how BST or set-dictionary works, too), but in this situation how should I implement tries? |∑| = 26, i.e. the number of available letter is 26 ('a' through 'z'), and almost string's LENGTH is about 10, so bru...
by Per
Wed Mar 01, 2006 10:10 am
Forum: Algorithms
Topic: putchar
Replies: 3
Views: 1299

Re: putchar

how do you print an integer by using only putchar and not using any extra storage memory(no arrays) You can also do like this, only using one additional integer, rather than #digits number of stack frames. m = 0; while (n) m = 10*m + n%10, n /= 10; while (m) putchar(m % 10), m /= 10; You'll have to...

Go to advanced search