fork download
copy 
  1. #include<stdio.h>
  2.  
  3. void nhapMang(int a[],int &n)
  4. {
  5. 	scanf("%d",&n);
  6. 	for(int i=0;i<n;i++)
  7. 	{
  8. 		scanf("%d",&a[i]);
  9. 	}
  10. }
  11.  
  12. int a[100000],b[1000000000]={0};
  13. main()
  14. {
  15. 	int a[100000],n,m,p;
  16. 	scanf("%d",&p);
  17. 	while(p--)
  18. 	{
  19. 		nhapMang(a,n);
  20. 		b[1000000000]={0};		
  21. 		for(int i=0;i<n;i++)
  22. 		{
  23. 			b[a[i]]++;
  24. 		}
  25. 		int max=b[a[0]];
  26. 		for(int i=1;i<n;i++)
  27. 		{
  28. 			if(b[a[i]]>max) max = b[a[i]];
  29. 		}
  30. 		if(max==1)printf("NO\n");
  31. 		else
  32. 		{
  33. 			for(int i=1;i<n;i++)
  34. 			{
  35. 				if(b[a[i]]==max)
  36. 				{
  37. 					printf("%d\n",a[i]);
  38. 					break;
  39. 				}
  40. 			}
  41. 		}
  42. 	}
  43. }
Success #stdin #stdout 0s 3921920KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/iDXuM3
language:
C++ (gcc 8.3)
created:
6 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!