ACM 11614 - Etruscan Warriors Never Play Chess

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

int main()
{
    int caseNum;
    long long int S = 0, n, i;
    scanf("%d", &caseNum);
    while (caseNum --)
    {
        scanf("%lld", &S);
        printf("%lld\n", (long long int)floor(sqrt( 2.0 * (double)S + 0.25 ) + 0.5) - 1) ; 
    }
    return 0;
}

回目錄
回首頁