1012
1 #include<iostream> 2 #include<array> 3 #include<vector> 4 #include<algorithm> 5 6 using namespace std; 7 8 int main() 9 { 10 array<double, 5> a = {0.0}; 11 array<bool, 5> b = { false }; 12 vector<int> v = {0}; 13 int n, value; 14 int k = -1; 15 int cnt = 0; 16 double sum = 0.0; 17 cin >> n; 18 for (int i = 0; i != n; ++i) 19 { 20 cin >> value; 21 if (value % 5 == 0 && value % 2 == 0) 22 { 23 a[0] += value; 24 b[0] = true; 25 } 26 if (value % 5 == 1) 27 { 28 a[1] += k * (-1)*value; 29 k *= -1; 30 b[1] = true; 31 } 32 if (value % 5 == 2) 33 { 34 a[2] = a[2] + 1; 35 b[2] = true; 36 } 37 if (value % 5 == 3) 38 { 39 sum += value; 40 ++cnt; 41 b[3] = true; 42 } 43 if (value % 5 == 4) 44 { 45 v.push_back(value); 46 b[4] = true; 47 } 48 } 49 if(cnt != 0) 50 a[3] = sum / cnt; 51 sort(v.begin(), v.end(), [](int a, int b) 52 { 53 return a > b; 54 }); 55 a[4] = v.front(); 56 int i = 0; 57 for (; i != a.size() - 1; ++i) 58 { 59 if (b[i] == false) 60 printf("N "); 61 else 62 if (i != 3) 63 printf("%.0f ", a[i]); 64 else 65 printf("%.1f ", a[i]); 66 } 67 if (b[i] == false) 68 printf("N"); 69 else 70 printf("%.0f", a[i]); 71 72 return 0; 73 }
有点麻烦...
