TCSRM5961000

一直没想到怎么去重 看了眼别人的代码...so easy啊

同余啊 唉..脑子被僵尸吃掉了

 难得1000出个简单的 

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stdlib.h>
#include<cmath>
#include<vector>
using namespace std;
#define LL long long
int vis[1010];
class SparseFactorialDiv2
{
    public:
    long long getCount(long long lo, long long hi, long long divisor)
    {
        LL i,ans1=0,ans2=0,k = divisor;
        for(i = 0 ;i*i <hi ; i++)
        {
            if(!vis[(i*i)%k])
            {
                vis[(i*i)%k] = 1;
                ans1+=(hi-i*i)/k;
                if(lo>i*i)
                ans2+=(lo-i*i-1)/k;
            }
        }
        return ans1-ans2;
    }
};