| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 5865 | cki86201 | Company Planning (TOKI14_company) | C++98 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//test
#include<stdio.h>
int n,m.i,x,p[100010],ans;
int main(){scanf("%d%d",&n,&m);for(i=1;i<n;i++)scanf("%d",&x),p[x]++;for(i=1;i<=n;i++)if(ans<p[i])ans=p[i];printf("%d",ans);return 0;}