Submission #1306735


Source Code Expand

#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;

int main(void){
	int n, i, sp = 0, tmp, rad[1000];
	bool swi = true;

	cin >> n;
	for(i=0; i<n; i++){
		cin >> rad[i];
	}

	for(i=0; i<n-1; i++){
		for(int j=i+1; j<n; j++){
			if(rad[i] > rad[j]){
				tmp = rad[i];
				rad[i] = rad[j];
				rad[j] = tmp;
			}
		}
	}

	//for(i=0; i<n; i++)
	//	cout << rad[i] << endl;

	for(i=n-1; i >= 0; i--){
		if(swi){
			sp += rad[i]*rad[i];
			swi=false;
		}else{
			sp -= rad[i]*rad[i];
			swi=true;
		}
	}

	printf("%.12f\n",(double)sp * M_PI);
}

Submission Info

Submission Time
Task B - N重丸
User Lapua
Language C++14 (GCC 5.4.1)
Score 100
Code Size 606 Byte
Status AC
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 21
Set Name Test Cases
Sample example_0.txt, example_1.txt
All example_0.txt, example_1.txt, maxrand_0.txt, maxrand_1.txt, maxrand_2.txt, random_0.txt, random_1.txt, random_2.txt, random_3.txt, random_4.txt, random_5.txt, random_6.txt, random_7.txt, random_8.txt, random_9.txt, special_0.txt, special_1.txt, special_2.txt, special_3.txt, example_0.txt, example_1.txt
Case Name Status Exec Time Memory
example_0.txt AC 1 ms 256 KB
example_1.txt AC 1 ms 256 KB
maxrand_0.txt AC 2 ms 256 KB
maxrand_1.txt AC 2 ms 256 KB
maxrand_2.txt AC 2 ms 256 KB
random_0.txt AC 1 ms 256 KB
random_1.txt AC 1 ms 256 KB
random_2.txt AC 2 ms 256 KB
random_3.txt AC 2 ms 256 KB
random_4.txt AC 1 ms 256 KB
random_5.txt AC 1 ms 256 KB
random_6.txt AC 2 ms 256 KB
random_7.txt AC 2 ms 256 KB
random_8.txt AC 1 ms 256 KB
random_9.txt AC 2 ms 256 KB
special_0.txt AC 1 ms 256 KB
special_1.txt AC 1 ms 256 KB
special_2.txt AC 1 ms 256 KB
special_3.txt AC 1 ms 256 KB