QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#430037#973. Composite Sequencegrass8cow#WA 1ms3748kbC++14437b2024-06-03 11:57:472024-06-03 11:57:49

Judging History

This is the latest submission verdict.

  • [2024-06-03 11:57:49]
  • Judged
  • Verdict: WA
  • Time: 1ms
  • Memory: 3748kb
  • [2024-06-03 11:57:47]
  • Submitted

answer

#include<bits/stdc++.h>
using namespace std;
int n,a[300100];
bool chk(int x){
	if(x==1)return 0;
	for(int i=2;i*i<=x;i++)if(!(x%i))return 0;
	return 1;
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);if(n>10){
		puts("Yes");return 0;
	}
	for(int i=1;i<=n;i++){
		int s=0;
		for(int j=i;j<=n;j++){
			s+=a[j];
			if(!chk(s)){
				puts("Yes");return 0;
			}
		}
	}
	puts("No");
	return 0;
} 

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3656kb

input:

2
5 7

output:

Yes

result:

ok "Yes"

Test #2:

score: 0
Accepted
time: 0ms
memory: 3604kb

input:

1
97

output:

No

result:

ok "No"

Test #3:

score: 0
Accepted
time: 0ms
memory: 3648kb

input:

1
97

output:

No

result:

ok "No"

Test #4:

score: -100
Wrong Answer
time: 0ms
memory: 3748kb

input:

3
1 1 1

output:

Yes

result:

wrong answer 1st words differ - expected: 'No', found: 'Yes'