fork download
copy 
  1. #include<stdio.h>
  2. int presentinb(int w,int *v,int x)
  3. {
  4. 	int i;
  5. 	for(i=0;i<x;i++)
  6. 	{
  7. 		if(w==*v)
  8. 			return 1;
  9. 		v++;
  10. 	}
  11. 	return 0;
  12. }
  13. int presentinc(int u,int *y,int z)
  14. {
  15. 	int i;
  16. 	for(i=0;i<z;i++)
  17. 	{
  18. 		if(u==*y)
  19. 			return 1;
  20. 		y++;
  21. 	}
  22. 	return 0;
  23. }
  24. int main()
  25. {
  26. 	int n1,n2,n3;
  27. 	scanf("%d %d %d",&n1,&n2,&n3);
  28. 	int a[n1],b[n2],c[n3];
  29. 	int i,j,k;
  30. 	int d[n1+n2+n3];
  31. 	for(i=0;i<n1;i++)
  32. 	{
  33. 		scanf("%d",&a[n1]);
  34. 	}
  35. 	for(i=0;i<n2;i++)
  36. 	{
  37. 		scanf("%d",&b[n2]);
  38. 	}
  39. 	for(i=0;i<n3;i++)
  40. 	{
  41. 		scanf("%d",&c[n3]);
  42. 	}
  43. 	j=0;
  44. 	for(i=0;i<n1;i++)
  45. 	{
  46. 		if((presentinb(a[i],b,n2)==1)||(presentinc(a[i],c,n3)==1))
  47. 		{
  48. 			d[j]=a[i];
  49. 			j++;
  50. 		}
  51. 	}
  52. 	int e=0;
  53. 	for(i=0;i<n2;i++)
  54. 	{
  55. 		if(presentinc(b[i],c,n3)==1)
  56. 		{
  57. 			for(k=0;k<j;k++)
  58. 			{
  59. 				if(b[i]!=d[k])
  60. 				{
  61. 					e++;
  62. 				}
  63. 			}
  64. 			if(e==j)
  65. 			{
  66. 				d[j]=b[i];
  67. 				j++;
  68. 			}
  69. 			e=0;
  70. 		}
  71. 	}
  72.  
  73. 	int t=0;
  74. 	for(i=0;i<j-1;i++)
  75. 	{
  76. 		for(k=0;k<j-i-1;k++)
  77. 		{
  78. 			if(d[k+1]<d[k])
  79. 			{
  80. 				t=d[k+1];
  81. 				d[k+1]=d[k];
  82. 				d[k]=t;
  83. 			}
  84. 		}
  85. 	}
  86. 	printf("%d\n",j);
  87. 	for(i=0;i<j;i++)
  88. 	{
  89. 		printf("%d\n",d[i]);
  90. 	}
  91.  
  92. }
Time limit exceeded #stdin #stdout 5s 0KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/vy4uX4
language:
C (gcc 8.3)
created:
4 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!