#include <algorithm> #include <iostream> using namespace std; void Slove(int n) { int P[12], S[12], min_count=0, k; for (int k=0; k<n; ++k) cin >> S[k]; while (true) { fill(P,P+12,0); for (int i=0; i</n;></iostream></algorithm>

#include <cmath> #include <iostream> using namespace std; void Slove(double a, double b, double c) { int n; double r; cin >> n; for (int i=0; i<n; ++i) { cin >> r; if ( pow(a/2.0,2)+pow(b/2.0,2)</n;></iostream></cmath>