Submission #1304460
Source Code Expand
#include <iostream> #include <math.h> #include <algorithm> using namespace std; int main(){ int s,a; cin >> a; int n[a]; s = 0; for (int i = 0; i < a; i++){ cin >> n[i]; } sort(n,n+a); for (int i = 0; i < a; ++i){ n[i] *= n[i]; } if (a % 2 == 0){ for (int i = 0; i < a; i += 2){ n[i] *= -1; } }else{ for (int i = 1; i < a; i += 2){ n[i] *= -1; } } for (int i = 0; i < a; i++){ s += n[i]; } cout << s * M_PI << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - N重丸 |
User | inazuma110 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 501 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 1 ms | 256 KB |
example_1.txt | AC | 1 ms | 256 KB |
maxrand_0.txt | WA | 1 ms | 256 KB |
maxrand_1.txt | WA | 1 ms | 256 KB |
maxrand_2.txt | WA | 1 ms | 256 KB |
random_0.txt | AC | 1 ms | 256 KB |
random_1.txt | WA | 1 ms | 256 KB |
random_2.txt | WA | 1 ms | 256 KB |
random_3.txt | AC | 1 ms | 256 KB |
random_4.txt | WA | 1 ms | 256 KB |
random_5.txt | WA | 1 ms | 256 KB |
random_6.txt | WA | 1 ms | 256 KB |
random_7.txt | WA | 1 ms | 256 KB |
random_8.txt | WA | 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 |