9 solutions
-
1
#include<bits/stdc++.h> using namespace std; int a[11110],c[11110]; int main() { int n;cin>>n; for(int i=1;i<=n;i++) { cin>>a[i]; } for(int i=1;i<n;i++) { c[i]=abs(a[i+1]-a[i]); } n--; for(int i=1;i<=n;i++) { for(int j=1;j+1<=n;j++) { if(c[j]>c[j+1]) swap(c[j],c[j+1]); } } for(int i=1;i<=n;i++) { if(c[i]!=i) { cout<<"Not jolly"; return 0; } } cout<<"Jolly"; return 0; }
Information
- ID
- 75
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 3
- Tags
- (None)
- # Submissions
- 147
- Accepted
- 48
- Uploaded By