Թաքցված խնդիր
|Այս խնդիրը թաքցված է խմբագրական խրհրդի անդամի կողմից քանի որ կամ այն ոչ ճիշտ լեզվով է գրված,|կամ թեստային տվյալներն են սխալ, կամ խնդրի ձևակերպումը պարզ չէ։|

COCI0002 - HERMAN

   The 19th century German mathematician Hermann Minkowski investigated a non-Euclidian geometry, called the taxicab geometry. In taxicab geometry the distance between two points T1(x1, y1) and T2(x2, y2) is defined as:

D(T1,T2) = |x1 - x2| + |y1 - y2|

   All other definitions are the same as in Euclidian geometry, including that of a circle:

   A circle is the set of all points in a plane at a fixed distance (the radius) from a fixed point (the centre of the circle).

   We are interested in the difference of the areas of two circles with radius R, one of which is in normal (Euclidian) geometry, and the other in taxicab geometry. The burden of solving this difficult problem has fallen onto you.

Input.

   The first and only line of input will contain the radius R, an integer smaller than or equal to 10000.   

Output.

   On the first line you should output the area of a circle with radius R in normal (Euclidian) geometry.

   On the second line you should output the area of a circle with radius R in taxicab geometry.

Sample tests.

N

stdin

stdout

1

1

3.141593
2.000000 

2

21

1385.442360
882.000000 

3

42

5541.769441
3528.000000

Note: Outputs within ±0.000001 of the official solution will be accepted. 


Ավելացրեց.Հրանտ Հովհաննիսյան
Ամսաթիվ.2016-05-05
Ժամանակի սահմանափակումը.1s
Ծրագրի տեքստի սահմանափակումը.50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Լեզուներ.Բոլորը բացի ASM32 ASM64 GAWK CLPS CLOJURE D ERL FSHARP FORTRAN GOSU HASK ICON ICK JS-MONKEY NEM NIM OBJC-CLANG PICO PIKE PYPY PYPY3 PY_NBC RUST SCM guile CHICKEN SED TCL WHITESPACE
Աղբյուրը.COCI, Contest #1, 2006-2007

© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.