Search found 183 matches

by Eduard
Tue May 10, 2005 10:40 am
Forum: Volume 108 (10800-10899)
Topic: 10842 - Traffic Flow
Replies: 17
Views: 9897

10842 - Traffic Flow

Hello.
I want to know what algorith are you using for this problem.I think this problem must have easy solution but I solve it only using binary search.
I want to know have someone else solved this problems using binary search.
Thanks
Eduard.
by Eduard
Fri May 06, 2005 4:23 pm
Forum: Pascal
Topic: Sets...
Replies: 9
Views: 8622

Yes you are right 10227 is very good Set problem.
by Eduard
Thu May 05, 2005 8:37 pm
Forum: Volume 5 (500-599)
Topic: 545 - Heads
Replies: 67
Views: 44220

Hello.
I have solved this problem using DP and Pascal.But 474 I solve using C++.
And I solve this one from first submission.
I think it is better to try this problem using Pascal,but 474 using C++.
Eduard.
by Eduard
Thu May 05, 2005 5:14 pm
Forum: Pascal
Topic: Sets...
Replies: 9
Views: 8622

Problems 10583,10608,10685 can be solved using sets but standart set is too small, you must make your own set.
Try them.
by Eduard
Thu May 05, 2005 3:12 pm
Forum: Pascal
Topic: Sets...
Replies: 9
Views: 8622

Hello Zyaad Jaunnoo.
I think "false coin - problem 665" is a good example that can be solved using sets...
I think so too.
Try 608 too.
Eduard.
by Eduard
Thu May 05, 2005 1:22 pm
Forum: Volume 8 (800-899)
Topic: 879 - Circuit Nets
Replies: 11
Views: 5609

Hello.
I have a quastion.

Can there be spaces after the last number of the line???
Thanks.
by Eduard
Mon May 02, 2005 1:58 pm
Forum: Volume 106 (10600-10699)
Topic: 10698 - Football Sort
Replies: 23
Views: 7828

Hello.
I think the best special test is the sample input.
Please read the old post about this problem.
http://online-judge.uva.es/board/viewto ... tball+sort
Eduard
by Eduard
Fri Apr 29, 2005 10:26 pm
Forum: Volume 4 (400-499)
Topic: 436 - Arbitrage (II)
Replies: 17
Views: 5313

Hello.
I don't know how this code haven't got memory error in your computer.
You just forget this

Code: Select all

for (i=1;i<=n;i++)
{
  for (j=1;j<=n;j++)   // <-------this line
    if(i==j) g[i][j]=1; 
    else    g[i][j]= 0; 
  }   
by Eduard
Sun Apr 24, 2005 10:57 am
Forum: Algorithms
Topic: PIE Problems
Replies: 2
Views: 972

Thank you.
by Eduard
Sun Apr 24, 2005 10:29 am
Forum: Algorithms
Topic: PIE Problems
Replies: 2
Views: 972

PIE Problems

Hello.
Can somebody tell some PIE(Principe of inclusion and exclusion) problems.
I have solved 10238,10497.
Thanks.
by Eduard
Tue Mar 22, 2005 3:53 pm
Forum: Volume 108 (10800-10899)
Topic: 10831 - Gerg's Cake
Replies: 13
Views: 5829

10831 - Gerg's Cake

Can somebody give hint how to solve this poblem?
Thanks
by Eduard
Mon Mar 21, 2005 10:07 pm
Forum: Volume 108 (10800-10899)
Topic: 10830 - A New Function
Replies: 33
Views: 15697

Now i got it.
Thanks.
by Eduard
Mon Mar 21, 2005 9:46 pm
Forum: Volume 108 (10800-10899)
Topic: 10830 - A New Function
Replies: 33
Views: 15697

I don't understand your previous post well.
I find out how many values of x will make f(x,N) = k of a certain value in O(1)
For wich K are you doing it?What is time complexity of your program?
Thanks.
by Eduard
Mon Mar 21, 2005 9:06 pm
Forum: Volume 108 (10800-10899)
Topic: 10830 - A New Function
Replies: 33
Views: 15697

Hello.
I dont think it's hard to find this formula.
CSOD(n)=P-n+1 P=((n div 2)-1)*2+((n div 3)-1)*3 +...+((n div n)-1)*n
But for calculating it I must do N operations,it is too slow.Can this formula calculated faster?
Eduard
by Eduard
Tue Mar 15, 2005 4:44 pm
Forum: Off topic (General chit-chat)
Topic: A request to University of Waterloo
Replies: 19
Views: 5580

Hello.
You are talking about waterloos solutions wich are only 1% of whole problemset.But In internet there are solutions of 80% of problems volume 1-7.And I know people just submitting solutions.
What about this? :-?

Go to advanced search