sgu 117. Counting 快速幂取模

最新推荐文章于 2018-07-07 09:34:47 发布

原创最新推荐文章于 2018-07-07 09:34:47 发布 · 182 阅读

0 ·

CC 4.0 BY-SA版权

sgu !!!!!!!!!! 同时被 2 个专栏收录

50 篇文章

订阅专栏

快速幂

1 篇文章

订阅专栏

本文介绍了一个算法问题：给定一系列整数，找出其中多少个数在被提升到M次幂后能被K整除。通过使用快速幂运算技巧来高效解决此问题，并提供了一段C++代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

117. Counting

time limit per test: 0.25 sec.
memory limit per test: 4096 KB

Find amount of numbers for given sequence of integer numbers such that after raising them to the M-th power they will be divided by K.

Input

Input consists of two lines. There are three integer numbers N, M, K (0<N, M, K<10001) on the first line. There are N positive integer numbers − given sequence (each number is not more than 10001) − on the second line.

Output

Write answer for given task.

Sample Input

4 2 50
9 10 11 12

Sample Output

#include <bits/stdc++.h>

using namespace std;

int n,m,k;

int qpow(int x, int y){
    int now=1;
    while(y>0){
        if(y&1){
            now=(x*now)%k;
        }
        y>>=1;
        x=(x*x)%k;
        if(now==0)return 0;
    }
    return now;
}


void solve(){

    scanf("%d%d%d",&n,&m,&k);
    int ans=0;
    while(n--){
        int a;
        scanf("%d",&a);
        if(qpow(a,m)==0){
            ans++;
        }

    }
    printf("%d",ans);
}

int main(){
    solve();
    return 0;
}