Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main()
- {
- int t,cas,i,j,k,n;
- cin>>t;
- for(cas=1;cas<=t;cas++)
- {
- cin>>n;
- int arr[n+5],a,b,c,d;
- map<int,int>mp;
- for(i=0;i<n;i++)
- {
- cin>>arr[i];
- mp[arr[i]]++;
- }
- bool flag=0;
- for(i=0;i<n;i++)
- {
- if(mp[arr[i]]>2)
- flag=1;
- else if(mp[arr[i]]==2 && mp[n-1-arr[i]]!=0)
- flag=1;
- else if(mp[arr[i]]==1 && mp[n-1-arr[i]]!=1)
- flag=1;
- }
- if(flag==0)
- cout<<"Case "<<cas<<": "<<"yes"<<endl;
- else
- cout<<"Case "<<cas<<": "<<"no"<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement