Solution to the problem number 512 of AceptaelReto - 512.

Any questions do not hesitate to contact.

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

int main()
{
    int cases; scanf("%d",&cases);
    while(cases--)
    {
        double n,n1; scanf("%lf%lf",&n,&n1);
        printf("%d\n",int(floor((n/(n+n1))*100)));
    }
    return 0;
}

Don't miss anything.

Keep in touch with Isaac Lozano Osorio!