Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- typedef long long ll;
- int main(){
- ll t,n,a[10005],i,f,c=0;
- cin>>t;
- while(t--){
- f=0;
- cin>>n;
- while(n--)
- for(i=1;i<=n;i++)cin>>a[i];
- for(i=1;i<=n;i++){
- for(i=1;i<n;i++){
- if((i-1)==a[i]||(n-i)==a[i])f=1;
- }
- }
- if(f)printf("Case %lld: yes\n",++c);
- else printf("Case %lld: no\n",++c);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement