`
java-mans
  • 浏览: 11340196 次
文章分类
社区版块
存档分类
最新评论

SGU 117 Counting 数论

 
阅读更多

今天难得出太阳啊,真舒服~而且还是星期六~

好吧~今天的最后一题,洗洗睡咯~

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;

#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\n"
#define in64 "%lld"
#endif

#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)
#define FF(i,a)         for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a)        for( int i = (a)-1 ; i >= 0 ; i --)
#define S64(a)          scanf(in64,&a)
#define SS(a)           scanf("%d",&a)
#define LL(a)           ((a)<<1)
#define RR(a)           (((a)<<1)+1)
#define SZ(a)           ((int)a.size())
#define PP(n,m,a)       puts("---");FF(i,n){FF(j,m)cout << a[i][j] << ' ';puts("");}
#define pb              push_back
#define CL(Q)           while(!Q.empty())Q.pop()
#define MM(name,what)   memset(name,what,sizeof(name))
#define read            freopen("in.txt","r",stdin)
#define write           freopen("out.txt","w",stdout)

const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-10;
const double pi = acos(-1.0);
const int maxn = 10011;
const int maxc = 1234;

int n,m,k;
int a[maxn];
int z[maxn];
int xx[maxn];
vector<int>p;
vector<int>h;
vector<int>ned;

bool div(int x)
{
    int temp = sqrt(x);
    for(int i=0;i<p.size();i++)
    {
        if(!(x%p[i]))
        {
            return true;
        }
        if(p[i]>temp)
        {
            return false;
        }
    }
    return false;
}

void init()
{
    p.clear();
    p.push_back(2);
    for(int i=3;i<maxn;i++)
    {
        if(!div(i))
        {
            p.push_back(i);
        }
    }
    return ;
}

bool ok()
{
    for(int i=0;i<ned.size();i++)
    {
        if(xx[ned[i]] < z[ned[i]])
        {
            return false;
        }
    }
    return true;
}

bool div2(int x)
{
    int temp = x;
    h.clear();
    MM(xx,0);
    for(int i=0;p[i]<=temp;i++)
    {
        while(temp%p[i]==0)
        {
            if(!xx[p[i]])
            {
                h.push_back(p[i]);
            }
            xx[p[i]]++;
            temp/=p[i];
        }
    }
    for(int i=0;i<h.size();i++)
    {
        xx[h[i]] *= m;
    }
    return ok();
}

int main()
{
    init();
    while(cin>>n>>m>>k)
    {
        FOR(i,1,n) cin>>a[i];
        ned.clear();
        MM(z,0);
        int temp = k;
        for(int i=0; p[i]<=temp ;i++)
        {
            while(temp%p[i]==0)
            {
                if(!z[p[i]])
                {
                    ned.pb(p[i]);
                }
                z[p[i]]++;
                temp /= p[i];
            }
        }
        int ans = 0;
        for(int i=1;i<=n;i++)
        {
            if(div2(a[i]))
            {
                ans++;
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}



分享到:
评论

相关推荐

Global site tag (gtag.js) - Google Analytics