Submission #1868861
Source Code Expand
#include <iostream> #include <algorithm> using namespace std; int main() { int N,R[1000]; double ans = 0; cin >> N; for (int n = 0; n < N; n++) { cin >> R[n]; } sort(R, R + N); reverse(R, R + N); for (int n = 0; n < N; n++) { if ((n + 1) % 2 == 0)ans -= R[n] * R[n] * 3.14159265358979; else ans += R[n] * R[n] * 3.14159265358979; } printf("%.10f\n", ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - N重丸 |
User | karukan |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 418 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
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 | 1 ms | 256 KB |
maxrand_1.txt | AC | 1 ms | 256 KB |
maxrand_2.txt | AC | 1 ms | 256 KB |
random_0.txt | AC | 1 ms | 256 KB |
random_1.txt | AC | 1 ms | 256 KB |
random_2.txt | AC | 1 ms | 256 KB |
random_3.txt | AC | 1 ms | 256 KB |
random_4.txt | AC | 1 ms | 256 KB |
random_5.txt | AC | 1 ms | 256 KB |
random_6.txt | AC | 1 ms | 256 KB |
random_7.txt | AC | 1 ms | 256 KB |
random_8.txt | AC | 1 ms | 256 KB |
random_9.txt | AC | 1 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 |