Search found 35 matches

by Alexander Denisjuk
Sun Apr 24, 2005 12:16 am
Forum: Volume 8 (800-899)
Topic: 861 - Little Bishops
Replies: 33
Views: 20937

I missed the solution
(1 1) => 1
Check, may be also you missed it.
By the way, the solution not only less than 10^15, but fits into int
by Alexander Denisjuk
Tue Dec 14, 2004 3:44 pm
Forum: Volume 102 (10200-10299)
Topic: 10267 - Graphical Editor
Replies: 190
Views: 53004

Re: Dirty Tricks

mullusko wrote:
These is one very dirty trick in there. White is represented as the uppercase letter O, as in Octopus. Not the numeral zero.
Note, please, that the following is written explicitly in the problem:
As the parameters there may be: ... the colour - the Latin capital;...
by Alexander Denisjuk
Tue May 04, 2004 10:04 am
Forum: Algorithms
Topic: I'm collecting cool graph algorithms problems
Replies: 13
Views: 4800

Consider please:
10239 The Book-shelver's Problem (the shortest path)
10266 Surveying (connected components)
10265 Toroidal Chess Queens' Problem (tree rounds ???)
709 Formatting Text (the shortest path)
by Alexander Denisjuk
Wed Jan 21, 2004 1:02 pm
Forum: Volume 102 (10200-10299)
Topic: 10267 - Graphical Editor
Replies: 190
Views: 53004

Algoritmo wrote: --in K command, X2>X1 and Y2>Y1, but this is not always true for V and H commands.
I think "X2 is not always greater than X1" is the standard trick. See, for instance, problem 100 :)
by Alexander Denisjuk
Thu Sep 11, 2003 10:15 am
Forum: Volume 102 (10200-10299)
Topic: 10268 - 498-bis
Replies: 51
Views: 17788

Consider, for instance, the following relation:

f(x)=(x-7)^10=x^10 - 70 x^9 + 2205 x^8 - 41160 x^7 + 504210 x^6 - 4235364 x^5 + 24706290 x^4+ 24706290 x^3 + 259416045 x^2 - 403536070 x+ 282475249

Test your problem for f'(7)=0. Then try f(x)*(x^100+1) for x=7. And so on.
by Alexander Denisjuk
Tue Jul 01, 2003 10:10 am
Forum: Volume 6 (600-699)
Topic: 605 - The Rotating Disk
Replies: 8
Views: 4684

Re: 605

Miguel Angel wrote:How to solve it?. ?
Well, just analyse the problem to see when it is soluable, when it is not. If yes, my algorithm is to place all the numbers to their places, one by one.

A propos, does anybody know if there is any problem, which can be solved by using some heuristics?
by Alexander Denisjuk
Thu Jun 12, 2003 10:48 am
Forum: Volume 102 (10200-10299)
Topic: 10236 - The Fibonacci Primes
Replies: 28
Views: 11570

I like this problem very much, specially the pair 6879 --- 842347072 In fact the correspondent Fibonacci number begins with 84234707299956.... So, you really should have good accuracy. But how did the problemsetter know about this Fib number? My experience in getting AC is the following: use long do...
by Alexander Denisjuk
Thu Jun 12, 2003 10:03 am
Forum: Volume 102 (10200-10299)
Topic: 10213 - How Many Pieces of Land ?
Replies: 54
Views: 22978

By the way, it is not very hard to obtain the formula. The easiest way is the following:

1. To beleive that the formula is polynomial.
2. To calculate the interpolation polynomail.

:)
by Alexander Denisjuk
Thu Jun 12, 2003 9:30 am
Forum: Volume 102 (10200-10299)
Topic: 10267 - Graphical Editor
Replies: 190
Views: 53004

Dear colleagues, thank you very much for you interest in my problem. Special thanks to "Ivan Golubev" for his interest in my person. The problem with graphical editor is very old and widely spread. I believe you can find this problem or some of it parts in every programming manual. Since I signed th...
by Alexander Denisjuk
Tue Jun 03, 2003 11:01 am
Forum: Volume 7 (700-799)
Topic: 731 - Numerical Summation of a Series
Replies: 3
Views: 2531

Yes, it works.

Some more hints: Phi_m(n) can be expressed by Phi_{m}(n-1) and sum_{k=1}^{N}1/k^m should be computed as sum_{k=N}^{1}1/k^m to reduce rounding errors.
by Alexander Denisjuk
Fri May 23, 2003 9:36 am
Forum: C++
Topic: A very very small problem
Replies: 12
Views: 3853

hank wrote:

Code: Select all

( cin>>i>>j>>k )
What it may return when reaching the end of the file ?
Does it return "EOF" ?
As I know, operator >> returns a stream. That is why one writes cin>>i>>j>>k which is nothing but ((cin>>i)>>j)>>k If input fails, the returned stream is converted to false
by Alexander Denisjuk
Wed May 21, 2003 9:40 am
Forum: Volume 2 (200-299)
Topic: 272 - TEX Quotes
Replies: 136
Views: 36372

By the way, if you wish something more complicated, consider my variant of main (I skip details):
[cpp]
int main(){
automat A;
while(cin>>A>>cout);
return 0;
}
[/cpp]
:wink:
by Alexander Denisjuk
Mon May 12, 2003 9:55 am
Forum: Off topic (General chit-chat)
Topic: How old are you? Statistics.
Replies: 121
Views: 177054

I am 38. Joined in 1998. I have solved about 55 problems. Unfortunately, I have not enough time :(
by Alexander Denisjuk
Mon May 05, 2003 9:40 am
Forum: Volume 7 (700-799)
Topic: 731 - Numerical Summation of a Series
Replies: 3
Views: 2531

Re: help with 731

I haven't solved this problem yet, but you can try the following:

Code: Select all

         infinity    1
Phi(x) =   Sigma  -------
           k = 1   k(k+x).

Let Phi1n(n+alpha) =  Phi(n+alpha) - Phi(n) ,

where n is integer. |alpha|<=0.5.

I belive it will work.
by Alexander Denisjuk
Wed Apr 30, 2003 9:36 am
Forum: Volume 8 (800-899)
Topic: 838 - Worm World
Replies: 8
Views: 5317

I have tried to memorize some calculations, i.e. all the warms from point P1 and to use it while calculating a warm from P2 to P3 through P1. It was enough to get AC. With 7628 K memory :wink:

Go to advanced search