ъеъеукъкупъкцъъъпъъпъ

Speed is not constant. It can be 0 or infinity. But it covers each k kilometers in h hours.

So, for a segment of length less than k, minimum time is 0 and maximum time is h.

Edited by author 06.06.2019 14:01

Can somebody give me some hard test - my program works fine on all tests, which I can think out. BTW, here is some of them:

########
#.OOOOO#
#$O$O$O#
#OO$O$O#
#@O$O$O#
###***O#
#......#
########

########
#.O$OO.#
#O$..$O#
#$$..$O#
#O$..$$#
#@$O.$O#
#..$OO.#
########

########
#.O$OO.#
#O$..$O#
#$$..$O#
#O$..$$#
#@$..$O#
#.O$OO.#
########

########
#......#
###***O#
#@O$O$O#
#OO$O$O#
#$O$O$O#
#.OOOOO#
########

########
#.....O#
#$$$$$O#
#OO...O#
#$$$$$O#
#O.OO$.#
#.O$.$+#
########

########
#......#
###***O#
#@O$O$O#
#OO$O$O#
#OO$O$O#
#OOOOOO#
########

########
#.$.$OO#
#@OOOOO#
#O$$$$$#
#O.....#
#$$$$$$#
#......#
########

########
#.OOO.O#
#@$O##O#
#OOO*OO#
#.$O$O$#
#$$$$..#
#...OOO#
########

########
#OOOO.O#
#@OO##O#
#OOO*OO#
#.$O$OO#
#$$$$.O#
#...OOO#
########

#######
#@$OO.#
#$O$OO#
#.O.OO#
#######

P.S. space I've changed to O.

Edited by author 03.11.2009 20:42

#include "stdafx.h"
#include <iostream>



int main()
{
    int a;
    int b;
    int c;
    scanf_s("%d%d\n", &a, &b);
    c = a + b;
    printf("%d\n", c);
    return 0;
}

#include <iostream>
using namespace std;
int main()
{
 long long a, b;
 cin >> a >> b;
 cout << a+b;
}

Hi guys, i've tried to solve this problem with A*. I came with pull distance as heuristic and calculate the distance table with Floyd's algorithm. I also have put deadlock detector (for Simple and Frozen) on my code. Is there something i miss? Or do you have any other suggestion?

I am very happy if i can discuss with you guys. Thanks before for your help :)

I tried to pick up to my occasion all data types ,but there was some problem ;Then i  tried using data type "auto" and it's worked!

Whoever made this problem, thanks a lot! Seeing group theory applied in cp felt pretty cool. Alos learnt a lot thanks to this problem

I believe I am having precision errors when calculating the solution.
I changed from doubles to long doubles and got one more test case, so I believe my solution is correct but not precise enough.
Any tips to resolve this?

have no ideas. i've runned my random test generator and my program passed over 1000 tests, but wa.
help, please.

can anybody help me with this problem?

1) Maybe, you are reading long long variable with this command :
  scanf("%d",&arr[i]);
  It is not right. You should do, for example, it with next command
  scanf("%I64d",&arr[i]);
2) Maybe, you were confused by statement. You have to choose such two points so line that passing through this points has maximal absolute value of inclination, not just inclination.
3) Maybe, you are doing something like this :
    for ( int i = 1 ; i <= n ; ++i ) {
      long long d = abs2(arr[i+1] - arr[i]);

       if ( d > x ) {
                 x = d; m1 = i;
       }
   }
There is a mistake in first line. Right way is
   for ( int i = 1 ; i < n ; ++i ) {

It was my biggest mistake, because the problem itself is so simple.

Problem statement says "His friends write numbers from 1 to N on cards", but it doesn't mention that these numbers should be distinct. Yet, it seems like the problem only accepts solutions in which the numbers are distinct (i.e. the numbers on the N cards are a permutation of [1..N]).

If none of your browsers let you run java applets anymore, you can just download the jar:
http://acm.timus.ru/Supplement/CalcEngine/CalcEngineGUI.jar

Then run it as:
java -cp CalcEngineGUI.jar CalcEngineApplet

The cases when all times are less than 6 seconds are neglected. So the cost of each plan should be zero as all calling will be free but adding the basic plan to the cost leads to AC.

puts gets.split(' ').sum { |s| s.to_i }

а вот так ок:
puts gets.split(' ').map { |s| s.to_i }.inject(0) {|sum,x| sum + x }

что не так с с sum?
Edited by author 22.05.2019 11:43

Edited by author 29.05.2019 02:44

?

Any hints for solution? I am completely stuck at TLE.

So, we can decompose like this any connected graph G = (V, E), |E| = 2k, k in Z+? This is lovely, this is nice (I proved it using induction, I'm proud of myself, yay!).