| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 2731 | 陶俊宸 | 有趣的跳跃 | C++ | Wrong Answer | 0 | 0 MS | 264 KB | 396 | 2019-12-07 11:59:58 |
#include<iostream> using namespace std; int main(){ int a,b[3000],c,i,j,t; cin>>a; for(i=0;i<a;i++) cin>>b[i]; for(i=0;i<a;i++) b[i]=b[i]>0?b[i]:0-b[i]; for(i=0;i<a;i++){ for(j=i-1;j<a;j++){ if(b[i]>b[j]){ t=b[i]; b[i]=b[j]; b[j]=t; } } } for(i=0;i<a;i++) if(b[i]=i+1) c++; if(c==a) printf("Jolly"); else printf("Not jolly"); return 0; }