ois_annoluce

#include <stdio.h>
#include <math.h>
#include <vector>
#include <algorithm>

std::vector <double> O;

void mappatura(int N, int X[], int Y[], int Z[])
{
    float P;
    for(int i=0; i<N; i++)
    {
        P = sqrt(X[i]*X[i] + Y[i]*Y[i] + Z[i]*Z[i]);
        printf("%f\n",P);
        O.push_back(P);
    }
    std::sort(O.begin(),O.end());
}

int query(int D)
{
    return upper_bound(O.begin(), O.end(), D) - O.begin();
}

#define MAXN 100000
int X[MAXN], Y[MAXN], Z[MAXN];

int main()
{
    FILE *fr, *fw;
    int N, Q, i;

    fr = fopen("input.txt", "r");
    fw = fopen("output.txt", "w");
    fscanf(fr, "%d\n", &N);
    for(i=0; i<N; i++)
        fscanf(fr, "%d %d %d", &X[i], &Y[i], &Z[i]);
    mappatura(N, X, Y, Z);
    fscanf(fr, "%d\n", &Q);
    for(i=0; i<Q; i++)
    {
        int D;
        fscanf(fr, "%d\n", &D);
        fprintf(fw, "%d\n", query(D));
    }
    fclose(fr);
    fclose(fw);
    return 0;
}