Hello! I`ve got a code, equations must be right, but the result is different from sample. I don`t know what the problem is. Please, help!! My result is 45,28, whereas the sample`s one is 52,04.

static void Main(string[] args)
        {
            const double D = 6875;
            const double pi = 3.1415926535897932384626433;
            string trash;
            char[] separators = new[] { ' ', '^', '"', '\''};
            /* double shipx, shipy, shipz, icex, icey, icez; */
            for (int i = 0; i < 3; i++)
                trash = Console.ReadLine();
            var shipLat = Console.ReadLine().Split(separators);
            var shipLong = Console.ReadLine().Split(separators);
            trash = Console.ReadLine();
            var iceLat = Console.ReadLine().Split(separators);
            var iceLong = Console.ReadLine().Split(separators);
            trash = Console.ReadLine();

            double phi1 = (int.Parse(shipLat[0]) + (int.Parse(shipLat[1]) + int.Parse(shipLat[2]) / 60) / 60) * (pi / 180);
            double phi2 = (int.Parse(shipLong[1]) + (int.Parse(shipLong[2]) + int.Parse(shipLong[3]) / 60) / 60) * (pi / 180);
            if (shipLat[3] == "SL") phi1 = -phi1;
            if (shipLong[4] == "WL") phi2 = -phi2;

            double L1 = (int.Parse(iceLat[0]) + (int.Parse(iceLat[1]) + int.Parse(iceLat[2]) / 60)/60) * (pi / 180);
            double L2 = (int.Parse(iceLong[1]) + (int.Parse(iceLong[2]) + int.Parse(iceLong[3]) / 60)/60) * (pi / 180);
            if (iceLat[3] == "SL") L1 = -L1;
            if (iceLong[4] == "WL") L2 = -L2;

            double ans = Math.Acos(Math.Sin(phi1) * Math.Sin(L1) + Math.Cos(phi1) * Math.Cos(L1) * Math.Cos(L2-phi2));
            double dist = ans * D/2;

            Console.Write("The distance to the iceberg: ");
            Console.WriteLine("{0:0.00}", dist);
            if (100.00 - dist > 0.005) Console.WriteLine("DANGER!");
        }

I just cin every string and then solve using it. 0.156 accepted

1 1
1 1
1

the answer must be "NO", not "YES"

Edited by author 27.04.2007 09:34

If its not a multy eadge and it is a bridge, then it increase the number of pieces by one otherwise the pieces amount left same. Am I right?

#include<iostream>
#include<string.h>
#include<deque>
#include<stdio.h>
using namespace std;
int main()
{
    string node;
    cin >> node;
    int one,two;
    one = 0;
    two = 1;
    int pre = 0;
    for(int i = 0;i < node.size();i++)
    {
        if(node[i] == '!')
        continue;
        if(node[i] == node[i+1])
        {
            node[i] = node[i+1] = '!';
            one = pre;
            if(i+2 < node.size())
            two = i+2;
            while(one> 0 && two < node.size())
            {
                while(one > 0 && node[one] == '!')
                one--;
                if(node[one] == node[two] )
                {
                    node[one] = node[two] = '!';
                    one--;two++;
                }
                else
                break;
            }
        }
        else
        pre = i;

    }

   for(int i = 0;i < node.size();i++)
   {
       if(node[i] != '!')
       cout << node[i];
   }

}

Wrong answer    1 test

#include <iostream>
using namespace std;

int main()
{
    int n, i, x, max;
    int mas[1000];

    cin >> n;
    max = 0;
    for (i = 0; i < n; i++)
    {
        cin >> mas[i];
    }
    max = mas[0] + mas[1] + mas[2];
    x = 1;
    for (i = 1; i < n; i++)
    {
        if (mas[i] + mas[i + 1] + mas[i + 2] > max)
        {
            max = mas[i] + mas[i + 1] + mas[i + 2];
            x = i + 1;
        }
    }
    cout << max << ' ' << x + 1 << endl;
    system("pause");
    return (0);
}

#include <iostream>

using namespace std;

int main()
{
    int a[1000];
    int n=0,s,sx=0,m=0;
    cin >> n;
    for(int i=0;i<n;i++){
        cin >> a[i];
    }
    for(int u=1;u<n-1;u++){
            s=a[u]+a[u+1]+a[u+2];
            if(s>sx){
                sx=s;
                m=u+1;
            }}
    if (n==3){
        sx=a[0]+a[1]+a[2];
        m=2;
    }
    cout << sx << " " << m << endl;
}

For those who as I has wa3 or wa5 and don't understand why:
1) similar must be personal number, not passwords
2) personal number is decimal number
3) to get other password (i.e. calculate diffeence of passwords) we can ONLY change digit, we can't insert or erase digits like in personal number
May be you don't have theese mistakes, but I spent a day to undestand it

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

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?