URI 1002

-

Solution of URI 1002 >>Area of Circle

  1. #include < stdio.h >
  2. int main()
  3. {
  4.     double R, A, pi ;
  5.     pi = 3.14159;
  6.     scanf ("%lf",  & R);
  7.     A = pi * R * R;
  8.     printf ("A=%.4lf\n", A );
  9.  
  10.     return 0;
  11. }

Comments

Post a Comment

Popular posts from this blog

GCD (Greatest Common Divisor)

-
Image
Using Euclid's algorithm A much more efficient method is the Euclidean algorithm , which uses a division algorithm such as long division in combination with the observation that the gcd of two numbers also divides their difference. To compute gcd(48,18), divide 48 by 18 to get a quotient of 2 and a remainder of 12. Then divide 18 by 12 to get a quotient of 1 and a remainder of 6. Then divide 12 by 6 to get a remainder of 0, which means that 6 is the gcd. Note that we ignored the quotient in each step except to notice when the remainder reached 0, signalling that we had arrived at the answer. Formally the algorithm can be described as: gcd ( a , 0 ) = a {\displaystyle \gcd(a,0)=a} gcd ( a , b ) = gcd ( b , a m ...
Read more

Pick's Theorem

-
Image
Pick's theorem says that if a polygon has I vertices/points inside it and B vertices or points on the border of it, then the AREA of this polygon is : AREA = I + ( B / 2 ) -1 There some conditions for applying this theorem. The shape must be a polygon. It can be concave or convex, but not self-intersecting. No circles apply here. Each vertex of the polygon must fall on the board. The polygon must be complete. No holes. Although, if it does have a hole, we can still compute the area by subtracting the smaller area from the larger area if the interior hole is also a lattice polygon. Pick's formula assumes unit measures and unit squares for the area. You can make your unit whatever you desire though if sides of your shape aren't whole numbers. However, you must adjust the value of your unit squares accordingly. So, if you made your lattice units 0.5, your interior squares would each be 0.5*0.5=0.25 square units each. A problem related to Picks Theorem is   LightOJ ...
Read more

Number Of Divisors (NOD)

-
Number of Divisors(NOD) Given N you have to find the number of divisors of N. Solution: Step 1: Generating Prime using Sieve of Eratosthenes Step 2: Count Divisors using prime factorization CODE: long long NOD_using_factorization ( long long n ) /// O(lof2(N)) { long long sqrtn = sqrt ( n ) ; long long tmp = 1 ,divisors = 1 ; for ( int i = 0 ; i < prime. size ( ) && prime [ i ] <= sqrtn ; i ++ ) { ///if ( sieve[n] == 0 ) break; ///*Checks if n is prime or not*/ Please comment This line if n > 1e7 if ( n % prime [ i ] == 0 ) { tmp = 1 ; while ( n % prime [ i ] == 0 ) { n / = prime [ i ] ; tmp ++ ; } divisors * = tmp ; sqrtn = sqrt ( n ) ; ...
Read more