/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Wrong Answer 6ms 484.0 KiB
#3 Wrong Answer 991ms 836.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;

void royAndProduct(vector<int>& arr, int x, int l, int r) {

	int product = 1;
	bool isProduct = false;
	for(int i = l - 1; i <= r - 1; i++) {

		for(int j = i; j <= r - 1; j++) {
			
			product = 1;
			for(int k = i; k <= j; k++)	product *= arr[k];

			if(product % x == 0)	isProduct = true;
		}
	}

	if(isProduct)
		cout << "Yes" << endl;
	else
		cout << "No" << endl;
}

int main() {
	int t;
	cin >> t;

	while(t--) {

		int n;
		cin >> n;

		int x;
		cin >> x;

		vector<int> arr;
		for(int i = 0; i < n; i++) {

			int elem;
			cin >> elem;

			arr.push_back(elem);
		}

		int q;
		cin >> q;

		for(int i = 0; i < q; i++) {

			int l;
			cin >> l;

			int r;
			cin >> r;

			royAndProduct(arr, x, l, r);
		}
	}

	return 0;
}

Information

Submit By
Type
Submission
Problem
P1128 Roy and Product
Language
C++11 (G++ 13.2.0)
Submit At
2024-11-08 12:43:46
Judged At
2024-11-11 02:22:46
Judged By
Score
1
Total Time
991ms
Peak Memory
836.0 KiB