完全平方数 (Square Numbers,UVa 11461)

#include <iostream>
#include <string.h>
#include <string>
#include <fstream>
#include <algorithm>
#include <stdio.h>
#include <vector>
#include <queue>
#include <set>
#include <cmath>
using namespace std;
const double eps = 1e-8;
const int INF=0x7fffffff;
unsigned long long uINF = ~0LL;
#define MAXN 10000007
typedef long long LL;
LL vis[MAXN];
LL prime[MAXN];

void sieve(LL n)
{
    LL m=(LL)sqrt(n+0.5);
    memset(vis,0,sizeof(vis));
    for(LL i=2;i<=m;i++)if(!vis[i])
    for(LL j=i*i;j<=n;j+=i)vis[j]=1;
}

LL gen_prime(LL n)
{
    sieve(n);
    LL c=0;
    for(LL i=2;i<=n;i++)if(!vis[i])
        prime[c++]=i;
    return c;
}

LL gcd(LL a,LL b)
{
    return b==0?a:gcd(b,a%b);
}
int num[100001];
int main()
{
    int a,b;
    int temp=1;
    memset(num,0,sizeof(num));
    for(LL i=1;i<100001;i++)
    {
        if(i==(LL)(temp*temp)){num[temp++]=i;}
        //cout<<num[i]<<endl;system("pause");
    }
    while(scanf("%d%d",&a,&b),a+b!=0)
    {
        int sa=sqrt(a);
        int sb=sqrt(b);
        //cout<<sa<<' '<<sb<<endl;
        int ans=sb-sa;
        if(a==num[sa])ans++;
        //if(b==num[sb])ans++;
        printf("%d
",ans);
    }

    return 0;
}

#include <iostream>
#include <string.h>
#include <string>
#include <fstream>
#include <algorithm>
#include <stdio.h>
#include <vector>
#include <queue>
#include <set>
#include <cmath>
using namespace std;
const double eps = 1e-8;
const int INF=0x7fffffff;
unsigned long long uINF = ~0LL;
#define MAXN 10000007
typedef long long LL;
LL vis[MAXN];
LL prime[MAXN];

void sieve(LL n)
{
    LL m=(LL)sqrt(n+0.5);
    memset(vis,0,sizeof(vis));
    for(LL i=2;i<=m;i++)if(!vis[i])
    for(LL j=i*i;j<=n;j+=i)vis[j]=1;
}

LL gen_prime(LL n)
{
    sieve(n);
    LL c=0;
    for(LL i=2;i<=n;i++)if(!vis[i])
        prime[c++]=i;
    return c;
}

LL gcd(LL a,LL b)
{
    return b==0?a:gcd(b,a%b);
}
int num[100001];
int main()
{
    int a,b;
    int temp=1;
    memset(num,0,sizeof(num));
    for(LL i=1;i<100001;i++)
    {
        if(i==(LL)(temp*temp)){num[temp++]=i;}
        //cout<<num[i]<<endl;system("pause");
    }
    while(scanf("%d%d",&a,&b),a+b!=0)
    {
        int sa=sqrt(a);
        int sb=sqrt(b);
        //cout<<sa<<' '<<sb<<endl;
        int ans=sb-sa;
        if(a==num[sa])ans++;
        //if(b==num[sb])ans++;
        printf("%d
",ans);
    }

    return 0;
}