fork download
copy 
  1. #include <stdio.h>
  2. inline long long int scan()
  3. {
  4.     long long int n=0;
  5.     char ch=getchar_unlocked();
  6.     while(ch<'0'||ch>'9')
  7.         ch=getchar_unlocked();
  8.     while(ch>='0'&&ch<='9')
  9.     {
  10.         n=(n<<3)+(n<<1)+ch-'0';
  11.         ch=getchar_unlocked();
  12.     }
  13.     return n;
  14. }
  15. int main(void) {
  16. 	int t,n,i,a[50]={0},min,flag;
  17. 	t=scan();
  18. 	while(t--)
  19. 	{
  20. 		n=scan();
  21. 		//take input
  22. 		for(i=0;i<n;i++)
  23. 		{
  24. 		a[i]=scan();	
  25. 		}
  26.  
  27. 		//find mininum
  28. 		min=a[0];
  29. 		for(i=1;i<n;i++)
  30. 		{
  31. 			if(min>a[i])
  32. 			min=a[i];
  33. 		}
  34. 		//find whether minimum number is divisible by all numbers
  35. 		flag=1;
  36. 		for(i=0;i<n;i++)
  37. 		{
  38. 			if(a[i]%min!=0)
  39. 			{
  40. 				flag=0;
  41. 				break;
  42. 			}
  43. 		}
  44.  
  45. 		//if not divisible print as it is
  46. 		if(flag==0)
  47. 		{
  48. 			for(i=0;i<n;i++)
  49. 			printf("%d ",a[i]);
  50. 		}
  51. 		//if divisible divide by that number
  52. 		else
  53. 		{
  54. 			for(i=0;i<n;i++)
  55. 			printf("%d ",a[i]/min);
  56. 		}
  57. 				printf("\n");	
  58. 		//initialize back array to zero
  59. 		for(i=0;i<n;i++)
  60. 		a[i]=0;
  61.  
  62.  
  63. 	}
  64. 	return 0;
  65. }
  66.  
Success #stdin #stdout 0s 2300KB
comments (?)
stdin
copy 
4
2 4 4
3 2 3 4
4 3 15 9 6
3 8 16 20
stdout
copy 
1 1 
2 3 4 
1 5 3 2 
8 16 20
https://ideone.com/rQ8gdM
language:
C (gcc 8.3)
created:
9 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!