#include <iostream>
#include <fstream>
#include <cmath>
#define PI 3.14159265358979323846
using namespace std;

#ifndef ONLINE_JUDGE
    #define cin fin
    ifstream fin("input");
#endif

double N, R;

int main() {
    cin >> N >> R;
    N /= 2.0;

    if (R <= N) {
        cout << PI * R * R << '\n';
        return 0;
    }
    if (R >= N * sqrt(2.0)) {
        cout << 4.0 * N * N << '\n';
        return 0;
    }

    double A, B, C;
    A = N;
    C = R;
    B = sqrt(C * C - A * A);
    double angle = 90.0 - (acos(A / C) * 180.0 / PI) * 2.0;

    printf("%.3lf\n", 4.0 * (A * B + PI * R * R * angle / 360.0));
}

This program works fine on all the tests I saw on the forum. But I get WA #1 probably because of the wrong precision. I printed the value with 4 and 6 decimals but I get the same WA #1.
Could anyone tell me please how can I solve the "error" ? It's annoying to have a good solution and take WA.
Thanks a lot!


LATER EDIT:
It seems I succeeded with such a function:

inline void precise(double X, const int &decimals) {
    cout << (int)(X);
    cout << '.';
    X = X - (int)(X);
    for (int i = 1; i <= decimals; ++i) {
        X = X * 10.0;
        cout << (int)(X);
        X = X - (int)(X);
    }
    cout << '\n';
}

...

precise((double)(4.0 * (A * B + PI * R * R * angle / 360.0)), 3);

Have fun!

Edited by author 25.01.2014 04:19

#include<iostream>
using namespace std;
int main ()
{
    int n,a[500000],d,max=0,maxi;
    cin>>n;
    for (int i=0;i<n;i++)
    {
        cin>>d;
        a[d]++;
        if (a[d]>max)
        {
            max=a[d];
            maxi=d;
        }
    }
    cout<<maxi;
    return 0;
}

#include <iostream>
#include <stdio.h>
#include <vector>

using namespace std;

class Place {
public:
    char x;
    int y;

    bool isOnboard() {
        if (x < 'a' || x > 'h' || y < 1 || y > 8) return false;
        return true;
    }



    Place(char x, int y) {
        this->x = x;
        this->y = y;
    }

};



int main(int argc, const char * argv[])
{
    int N;
    cin >> N;


    vector<Place> places;

    for (int i = 0; i < N; i++) {
        char x;
        int y;
        cin.get(x);

        if (x == '\n') {
            i--;
            continue;
        }

        cin >> y;

        Place place (x, y);
        places.push_back(place);

    }


    for (int i = 0; i < N; i++) {
        Place place = places[i];
        int moves = 0;


        //left 2 up 1
        place.x -= 2;
        place.y -= 1;
        moves += place.isOnboard();

        //left 2 down 1
        place.y += 2;
        moves += place.isOnboard();

        //right 2 down 1
        place.x += 4;
        moves += place.isOnboard();
        //right 2 up 1
        place.y -= 2;
        moves += place.isOnboard();

        //right 1 up 2
        place.x -= 1;
        place.y -= 1;
        moves += place.isOnboard();

        //left 1 up 2
        place.x -= 2;
        moves += place.isOnboard();

        //left 1 down 2
        place.y += 4;
        moves += place.isOnboard();

        //right 1 down 2
        place.x += 2;
        moves += place.isOnboard();

        cout << moves << endl;

    }



}

Edited by author 24.01.2014 20:07

Hi,
I'm interested if there is solution for larger N like 1000 and even more?

Thanks.

Edited by author 25.03.2013 01:28

I'm using Floyd-Warshall algorithm, and my program correctcly passes different tests, but i have WA1. Why?

My program works true on test from conditions and on two my tests. Tell me please, what's a problem?

1)
3
2
1
2

2)
614
13
627
861
527
911
751
658
568
846
998
188
923
426
685

3)
1560
19
580
594
644
62
963
718
291
532
293
77
356
984
384
182
986
915
18
671
920

4)
555
27
816
170
523
595
471
313
970
877
465
50
819
517
721
143
394
872
905
462
346
639
193
902
945
927
133
401
410

5)
800
  15
  10
  20
  30
  40
  50
  60
  70
  80
  90
  100
  110
  120
  130
  200
  350

6)
1458
17
802
204
451
575
158
168
247
15
50
100
1000
257
354
125
358
125
268

Thanks.

Edited by author 22.06.2006 19:08

Edited by author 23.06.2006 12:20

Please, write there translated (RUSSIAN) version of this problem!!!! or you can send there for my adress   daminus_corp@mail.ru    > Thanks!!!!

Oh no WA#25! Please help me!

var
  a1,a2,a3,h,s,aa,bb:real;
  a:array[1..3,1..2] of integer;
  i,l:integer;


procedure readdata;
begin
  readln(a[1,1],a[1,2],a[2,1],a[2,2]);
  readln(a[3,1],a[3,2],l);
end;

procedure writedata;
begin
  if aa>=0 then
  writeln(aa:0:2) else writeln('0.00');
  if bb>=0 then
  writeln(bb:0:2) else writeln('0.00');
end;

function d(x1,y1,x2,y2:integer):real;
begin
  d:=sqrt(sqr(x1-x2)+sqr(y1-y2));
end;

procedure square;
var
  p:real;
begin
  a1:=d(a[1,1],a[1,2],a[2,1],a[2,2]);
  a2:=d(a[3,1],a[3,2],a[2,1],a[2,2]);
  a3:=d(a[1,1],a[1,2],a[3,1],a[3,2]);
  p:=(a1+a2+a3)/2;
  s:=sqrt(p*(p-a1)*(p-a2)*(p-a2));
end;

begin
  readdata;
  square;
  if (a[1,1]=a[2,1]) and (a[1,2]=a[2,2]) then
  begin
    aa:=d(a[1,1],a[1,2],a[3,1],a[3,2]);
    bb:=aa;
  end  else
  begin
  if (a1*a1+a2*a2<a3*a3) or (a2*a2+a3*a3<a1*a1) or (a1*a1+a3*a3<a2*a2) then
  begin
    aa:=d(a[1,1],a[1,2],a[3,1],a[3,2]);
    if d(a[2,1],a[2,2],a[3,1],a[3,2])<aa
    then aa:=d(a[2,1],a[2,2],a[3,1],a[3,2]);
  end  else
  begin
    h:=d(a[1,1],a[1,2],a[2,1],a[2,2]);
    aa:=s/(0.5*h);
  end;

  bb:=d(a[3,1],a[3,2],a[2,1],a[2,2]);
  if d(a[3,1],a[3,2],a[1,1],a[1,2])>bb then
  bb:=d(a[3,1],a[3,2],a[1,1],a[1,2]);
  end;
  aa:=aa-l;
  bb:=bb-l;
  writedata;
end.

Can anybody suggest me the 6th test case?

I've wrote recursion and got AC with 0.109 s ..... Can anybody tell me how to solve it using DP ?

Any idea?

O(k)    0.015 s

It takes 15 minutes to me to understand, that output line have to be in decrease order!

No need for scanf/printf, just do cin.sync_with_stdio(false) and get 0.5 seconds with 13 lines of code (hint: use deque).

//
//  main.cpp
//  p1787
//
//  Created by Huan Lin on 21/1/14.
//  Copyright (c) 2014 Huan Lin. All rights reserved.
//

#include <iostream>
#include <stdio.h>

using namespace std;

int main(int argc, const char * argv[])
{

    int k,n;
    cin >> k >> n;



    int jam = 0;

    for (int i = 0; i < n; i++) {
        int num;
        cin >> num;

        jam = jam + num - k;
        if (jam < 0) jam = 0;

    }

    cout << jam;
}

package timus;

class timus {

        public static void main (String args[])
        {
            int a = 1,b = 5;
            System.out.println(a+b);
        }
    }

Edited by author 20.01.2014 23:38

Edited by author 20.01.2014 23:38

var n,k: integer;
    x,t:real;
begin
    read(n,k);
    x:=n/k;
    if (Frac(x)>0)
      then
        if (Frac(x)>0.5)
          then
            t:=(trunc(x)+1)*2
          else
            if (trunc(x)=0)
              then
                t:=2
              else
                t:=trunc(x)*2+1
      else
          t:=x*2;
    writeln('t=',t);
end.

Please give any tests. I tried some but my program succesfully done them..