/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Wrong Answer 1ms 532.0 KiB
#3 Wrong Answer 45ms 836.0 KiB

Code

#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define mod 1000000007

using namespace std;

void solve()
{
    ll n, x, i, l, r, q, xx;
    cin>> n >> x;
    ll a[n+5], mul;
    for(i=1; i<=n; i++)
        cin>> a[i];
    cin>> q;
    while(q--)
    {
        cin>> l >> r;
        mul = 1;
        for(i=l; i<=r; i++)
        {
            mul = mul*a[i];
            if(mul%x==0)    break;
        }
        if(mul%x==0) cout<< "Yes\n";
        else    cout<< "No\n";
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
 
    ll T = 1, cs = 1, i, k=0;
    cin >> T;
    //sieve();
    //cin.get();

    while(T--)
    {
        //cout<< "Case " << cs++ << ": ";
        solve();
    }
    return 0;
}  

Information

Submit By
Type
Submission
Problem
P1128 Roy and Product
Contest
Brain Booster #7
Language
C++17 (G++ 13.2.0)
Submit At
2024-11-05 16:34:01
Judged At
2024-11-05 16:34:01
Judged By
Score
1
Total Time
45ms
Peak Memory
836.0 KiB