UVA 11461

Solve in C:

#include<stdio.h>
#include <math.h>
int main()
{

    int i,count=0,f,g,a,b;
    while(scanf("%d%d",&a,&b)!=EOF)
    {
        if(a==0&&b==0)
        break;
        count=0;
        for(i=a;i<=b;i++)
        {
            f=sqrt(i);

            if(f*f==i)
            count++;
        }
        printf("%d\n",count);
    }
    return 0;

}

No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.