WWWW
WWWW
WWWW
WWWW

#include<stdio.h>
#include<math.h>
#include<algorithm>

using namespace std;

#define PI 3.1415926535897932384626433

int lat1, lat2, lat3, lon1, lon2, lon3, trash;
char latc, lonc;

long double latf, lats, lonf, lons;
long double sq(double x){
  return x*x;
}

int main(void){
  scanf("Message #%d.\nReceived at %d:%d:%d.\nCurrent ship’s coordinates are\n%d^%d'%d\" %cL\nand %d^%d'%d\" %cL.\n",
         &trash, &trash, &trash, &trash, &lat1, &lat2, &lat3, &latc, &lon1, &lon2, &lon3, &lonc);
  lats = (latc=='N'?1:-1)*(lat1 + (lat2 + lat3/60.0)/60.0)*PI/180.0;
  lons = (lonc=='W'?-1:1)*(lon1 + (lon2 + lon3/60.0)/60.0)*PI/180.0;


  scanf("An iceberg was noticed at\n%d^%d'%d\" %cL\nand %d^%d'%d\" %cL.",
         &lat1, &lat2, &lat3, &latc, &lon1, &lon2, &lon3, &lonc);
  latf = (latc=='N'?1:-1)*(lat1 + (lat2 + lat3/60.0)/60.0)*PI/180.0;
  lonf = (lonc=='W'?-1:1)*(lon1 + (lon2 + lon3/60.0)/60.0)*PI/180.0;

  double dlon = lonf - lons, dlat = latf - lats;

  double a = acos(sin(lats)*sin(latf) + cos(lats)*cos(latf)*cos(dlon));
  double len =  3437.5*a;
  printf("The distance to the iceberg: %.2lf miles.\n", len);
  if(100.00-len>0.005)
    printf("DANGER!\n");
  return 0;
}

Am I wright about input?

#include<iostream>
#include<vector>
using namespace std;
int main()
{
    int k;
    cin>>k;
    vector<int> p;

    for(int i=0,a=0;i<k;i++)
    {cin>>a;
        p.push_back (a);
    }
    for(int temp=0,j=0;j<k-1;j++)
    {
        if(p[j]>p[j+1])
        {
            temp=p[j];
            p[j]=p[j+1];
            p[j+1]=temp;
        }
    }

    int out=0;
    for(int b=0;b<=k/2;b++)
        out=out+p[b]/2+1;
    cout<<out<<"\n";
    return 0;
}

Hint confuse you .You must use long long . I use int that #14 WA all time.  It's all.

any hint please ?

Why Value and ValueA is 3 ?
Remainder of -2499999 divided by 6 or -6 is -3 in both cases!
-2499999 / 6 = -416666
-2499999 - (-416666 * 6) = -3
and same for -6.

Please correct tests or describe in task the way to find quotient and remainder of division


Edited by author 11.09.2010 03:13

i am sure that my program is ok, but wa#4

if (a == b*q+p) and (0 <= p < |b|) then
{
  q == a / b
  p == a % b
}

is it TRUE?

Edited by author 13.02.2007 14:34

[code deleted]

Edited by moderator 20.11.2019 00:22

Pascal's type TDateTime (module SysUtils) allow decide this problem in 10 strings.

Let's solve problems which have the same number with your rank in authors ranklist. Milanin is lucky=)

why WA?

give me test 5 please

var n,i:longint;
begin
read(n);
if n<=0 then begin
n:=n*-1;
write(((n*(n+1))div 2)*-1+1);
end
else writeln(n*(n+1)div 2);
end.

Edited by author 13.04.2010 16:42

Edited by author 13.04.2010 16:43

Что здесь поменять чтоб количество циклов было меньше...

var n,x,i,j,t:integer;
a,b:array[1..250000]of char;
tempchar,ch:char;
label fin,step;
begin
readln(n);
x:=-1;
for i:=1 to n do read(a[i]);
readln;
for i:=1 to n do read(b[i]);
readln;
i:=1;
while i<=n  do begin
j:=1;
                 while  j<=n do begin
                                if j=1 then begin
                                tempchar:=a[1];
                                a[1]:=a[n];
                                            end else begin
                                            ch:=a[j];
                                            a[j]:=tempchar;
                                            tempchar:=ch;
                                            end;
                                            j:=j+1;
                                end;
                 for t:=1 to n do if a[t]=b[t] then x:=i else begin
                                                              x:=-1;goto step;
                                                              end;
                 if i=n then x:=0;
                 goto fin;
                 step:i:=i+1;
                 end;
fin:write(x);
end.

Please, help.

Thanks.

increase size of array.
15000 (not 14999)
Edited by author 25.07.2010 03:39

Edited by author 25.07.2010 03:40

Here some testcases and my AC program's answers.
May be these would be helpful for you. Good Luck.

10 NO
100 YES
1000 YES
8 YES
16 NO
32 YES
64 NO
125 YES
126 YES
1 NO
12345678 YES
17 YES
107 YES
267 YES
2992 YES
987456 YES
769 YES
896 NO
1536 NO
796 YES

#include<iostream>
using namespace std;
void K(int);
void main()
{
    int b[10],j=0,k=0;
    for(;j<10;j++)
    {
        cin>>b[j];
        if(b[j]==0) break;
    }
    for(;k<j;k++)
        K(b[k]);
}






void K(int n)
{
    if(n!=1)
    {
        n++;
        int *a = new int [n];
        a[0]=0;
        a[1]=1;
        int i=2;
        for(;i<n;i++)
        {
            if(i%2==0){a[i]=a[i/2];}
            else {a[i]=a[(i-1)/2]+a[(i-1)/2+1];}
        }

        if(n%2==0){cout<<a[n-1];}
        else {cout<<a[n-2];}

        cout<<endl;
    }
    else
    {
        cout<<0<<endl;
    }
}