Search found 146 matches

by Dmytro Chernysh
Fri Dec 26, 2003 7:11 pm
Forum: Other words
Topic: WOW!!! :-)
Replies: 15
Views: 5510

WOW!!! :-)

Now the forum is indeed cooooool :-)
Thanks!
by Dmytro Chernysh
Sat Dec 20, 2003 7:15 pm
Forum: Volume 105 (10500-10599)
Topic: 10541 - Stripe
Replies: 10
Views: 5154

Sure! :-)
Just mail me. You see, I don't want everyone just coping the results...
by Dmytro Chernysh
Wed Dec 17, 2003 11:10 pm
Forum: Volume 105 (10500-10599)
Topic: 10541 - Stripe
Replies: 10
Views: 5154

Finally! :-) Somebody does have troubles with it :-)
by Dmytro Chernysh
Wed Dec 10, 2003 9:57 pm
Forum: ACM ICPC Archive Board
Topic: 2684
Replies: 2
Views: 1028

Caesum, but you got the best time on 10290! :-)
by Dmytro Chernysh
Mon Dec 01, 2003 2:28 pm
Forum: Algorithms
Topic: Help with TSP problem
Replies: 7
Views: 2125

Frankly -- yes :-) But the most important is 2^n
by Dmytro Chernysh
Sun Nov 30, 2003 2:35 am
Forum: Volume 101 (10100-10199)
Topic: 10198 - Counting
Replies: 30
Views: 14212

When you have a really big number, let's say 1000 digit, the only way to keep it is an array. Now, if you want add, subrtact, multiplay or divide such numbers you have to write alogithms of addition, subtraction... Such procedures/methods are called "long arifmetic". The answer for n=1000 in this pr...
by Dmytro Chernysh
Fri Nov 28, 2003 7:56 pm
Forum: Off topic (General chit-chat)
Topic: What do you like to eat?
Replies: 20
Views: 66305

Sausages made on Pasal code :-) :-D
by Dmytro Chernysh
Fri Nov 28, 2003 5:50 pm
Forum: Volume 101 (10100-10199)
Topic: 10198 - Counting
Replies: 30
Views: 14212

Hi Charlla,

You do have a mistake -- you should have used "long arigfmetic" instead of just long long. For example, n=30
1186714748389

Obviously, for n=1000 the number is really huge

Hope you understood :-)
by Dmytro Chernysh
Mon Nov 24, 2003 9:46 pm
Forum: Algorithms
Topic: Help with TSP problem
Replies: 7
Views: 2125

About heruistics -- yes, they are really the best when the size of a NP problem is large enouth. But when the size of it is n<=20, an exact solution can be found in 2^n steps :-)
by Dmytro Chernysh
Sun Nov 23, 2003 7:28 pm
Forum: Pascal
Topic: Input Matrix in Pascal
Replies: 3
Views: 6080

Hi Tatiana,

It's not that difficult -- I can show you how to do that. Mail me.
by Dmytro Chernysh
Wed Nov 19, 2003 5:24 am
Forum: Algorithms
Topic: Help with TSP problem
Replies: 7
Views: 2125

And what do you need about TSP? The exact algothim, the implementation on a patricular language ... or what? Mail me, and I think I will be able to help you :-)
Bwt, 10068 and 10496 are exellent examples of TSP problem.
by Dmytro Chernysh
Fri Nov 14, 2003 3:30 am
Forum: Volume 4 (400-499)
Topic: 465 - Overflow
Replies: 104
Views: 24021

Hi Shaka,

Yours output looks ok... But I had a mistake like this
000000000035 + 000000000035
first number too big
second number too big

But it was wrong! Just get rid of leading zeroes.
by Dmytro Chernysh
Wed Nov 05, 2003 11:09 pm
Forum: ACM ICPC Archive Board
Topic: What is wrong with 2701?
Replies: 1
Views: 1599

What is wrong with 2701?

Here is my output for 2701. I think it's correct but WA Why??? Maybe the special corrector works improperly? const a:array [1..200] of string[20]=( '10', '10', '111', '100', '10', '1110', '1001', '1000', '111111111', '100', '1100', '11100', '1001', '10010', '1110', '10000', '11101', '1111111110', '1...
by Dmytro Chernysh
Wed Nov 05, 2003 8:12 pm
Forum: Volume 101 (10100-10199)
Topic: 10199 - Tourist Guide
Replies: 57
Views: 30970

You probably did not consider the case when the graph is not connected.
In 315,on the other hand, you are told that the graph is connected, that's why AC :-)
by Dmytro Chernysh
Sun Nov 02, 2003 6:08 am
Forum: Volume 6 (600-699)
Topic: 612 - DNA Sorting
Replies: 122
Views: 15976

I can give you input/output.
Mail me.

Go to advanced search