0分求条，必关（样例正确）

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    int x[1001], y[1001], z[1001], c[1001];
    double s = 0;
    for (int i = 1; i <= n; i++) {
        cin >> x[i] >> y[i] >> c[i];
        z[i] = sqrt(pow(x[i], 2) + pow(y[i], 2));
        s += 1.5 * c[i];
        s += 1.0 * z[i] / 50;
    }
    cout << ceil(s) + 1;
}