题解
【入门】找出最大的圆
2 条题解
-
0
#include <bits/stdc++.h> using namespace std; int a[105], n, maxi = 1; int main(){ cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; if (a[i] > a[maxi]) { maxi = i; } } cout << fixed << setprecision(2) << 3.14 * a[maxi] * a[maxi] << ' ' << maxi; return 0; } -
0
#include <iostream> #include <vector> #include <iomanip> using namespace std; int main() { int n; cin >> n; vector<int> radii(n); for (int i = 0; i < n; ++i) { cin >> radii[i]; } double maxArea = 0; int maxIndex = 0; for (int i = 0; i < n; ++i) { double area = 3.14 * radii[i] * radii[i]; if (area > maxArea) { maxArea = area; maxIndex = i + 1; // 编号从1开始 } } // 输出保留两位小数 + 编号 cout << fixed << setprecision(2) << maxArea << " " << maxIndex << endl; return 0; }
- 1