Search found 34 matches

by paulmcvn
Sun Jan 21, 2007 7:29 am
Forum: Volume 111 (11100-11199)
Topic: 11159 - Factors and Multiples
Replies: 19
Views: 12009

Yes, I've got WA. I coded it in Pascal. First, I coded problem B in C++, but it got compile error in UVA, although successful in my computer. So I have to change to use Pascal. Through coding in UVA, I note that there are many "not allowed" words, if you write it, you will surely get compile error. ...
by paulmcvn
Sun Jan 21, 2007 5:45 am
Forum: Volume 111 (11100-11199)
Topic: 11159 - Factors and Multiples
Replies: 19
Views: 12009

The tricky here is that there may be zeros in A
Thus if you define the edge (u, v) by (b[v]%a==0) you will get WA

In the contest time I really don't know why I got WA again and again, just because of that trick.
by paulmcvn
Sun Dec 24, 2006 12:06 pm
Forum: Other words
Topic: New site: Resources for Informatics Olympiad
Replies: 4
Views: 4510

I've changed the address to http://oiresources.googlepages.com !
Merry christmast to all! :)
by paulmcvn
Sat Dec 23, 2006 6:19 pm
Forum: Other words
Topic: New site: Resources for Informatics Olympiad
Replies: 4
Views: 4510

I've added input, output, solution for some UVA problems (vol 1 - vol 7), taken from OIBH site!

But you know that it's just for references. The source code is nothing if you can't understand and resolve that problem by yourself! ^^
by paulmcvn
Fri Dec 22, 2006 7:02 am
Forum: Other words
Topic: New site: Resources for Informatics Olympiad
Replies: 4
Views: 4510

OK, to avoid breaching copyright , I removed the links to some ebooks. Anyway, thanks for warning. My main aim is to collect useful lectures, articles or problems about algorithms from the internet for our problem-solving comunnity. If you have some, please take a minute to tell me! Thanks very much.
by paulmcvn
Thu Dec 21, 2006 6:28 pm
Forum: Other words
Topic: New site: Resources for Informatics Olympiad
Replies: 4
Views: 4510

New site: Resources for Informatics Olympiad

I plan to create a site containing ebooks, articles, problems, and so on in algorithms.
Here is the address:
http://www.oiresources.net.tf/
or http://ducnm0.googlepages.com/

This site is brand new! Give me some comments or useful resources if you like it!

Thanks so much!
by paulmcvn
Wed Apr 27, 2005 1:15 pm
Forum: Other words
Topic: May I use problem on ACM.UVA.ES to other online-judge site?
Replies: 4
Views: 1454

May I use problem on ACM.UVA.ES to other online-judge site?

May I use problem 10073 "Constrained Exchanged Sort" (and other problems in the future) which was made by Rezaul Alam Chowdhury to add to Sphere Online Judge (spoj.sphere.pl) problem-set.
by paulmcvn
Tue Feb 22, 2005 11:15 am
Forum: Algorithms
Topic: Gabow's algorithm and Shorir's algorithm?
Replies: 1
Views: 1955

Gabow's algorithm and Shorir's algorithm?

Could anyone give me some information on these algorithms? I've just see their names in topic 10510.
Thanks
by paulmcvn
Tue Feb 22, 2005 11:01 am
Forum: Volume 105 (10500-10599)
Topic: 10510 - Cactus
Replies: 31
Views: 22986

I think that: First, check if the graph is strongly connected (I use Tarjan's algorithm) Then use this observation: A strongly connected graph is not a cactus if and only exist a pair u,v such that there are two of more paths from u to v (could anyone prove this clearly?) we can prove: there is a pa...
by paulmcvn
Sat Feb 05, 2005 3:43 am
Forum: Algorithms
Topic: Help with this graph problem
Replies: 0
Views: 754

Help with this graph problem

Input:
A connected graph G=(V,E), a number k (3*K<=|V|)

Problem:
Delete as small edges of G as possible such that after deleting, G has k connected-component, each component has at least 3 verticles

Please help me. Thanks
by paulmcvn
Fri Feb 04, 2005 4:38 pm
Forum: Algorithms
Topic: Help
Replies: 3
Views: 1079

Sorry I'm not good in English :( so i think i should write as short as possible There is an O(n^3) solution: Sort x coordinates of (all end points of triangles and intersection points ) Then go through interval x[1]-x[2]; x[2]-x[3]; x[3]-x[4]; .... For each interval, find intersection of triangles a...
by paulmcvn
Fri Feb 04, 2005 10:59 am
Forum: Algorithms
Topic: Help
Replies: 3
Views: 1079

Help

Input: a set of n triangles
(x1i, y1i), (x2i, y2i), (x3i, y3i)

Output: Area of union of the triangles

Sample Input:
2
0 0 2 0 1 2
0 0 2 0 1 1
Sample Output
2.0000
by paulmcvn
Thu Feb 03, 2005 11:43 am
Forum: Algorithms
Topic: Help with this problem
Replies: 2
Views: 1120

Help with this problem

by paulmcvn
Thu Jan 27, 2005 3:14 pm
Forum: Algorithms
Topic: Help with this SPOJ problem
Replies: 9
Views: 2764

Thanks very much.

So, will you code the problem and get the high rank :wink:
by paulmcvn
Thu Jan 27, 2005 4:45 am
Forum: Algorithms
Topic: Help with this SPOJ problem
Replies: 9
Views: 2764

If you suppose all numbers in the input have roughly the same order of magnitude (i.e. number of digits), the resulting difference will in fact be proportional to the smallest element in the input. I couldn't clearly understand this. :( Could you give an example? Is there an example such that the g...

Go to advanced search