Input:
The first line of input contains an integer T denoting
the number of test cases.
The first line of each test case is N, the size of array.
Second line of the test case is the Array.
Output:
Print the minimum difference between any two pairs.
Constraints:
1 <= T <= 30
1 < N <= 100
1 <= arr[i] <= 100000
Example:
Input:
2
5
2 4 5 7 9
10
87 32 99 75 56 43 21 10 68 49
Output:
1
6
#include <stdio.h>
int main()
{
int t,size,i,j,a[100],temp,k;
scanf("%d",&t);
while(t--)
{
int min=9999;
scanf("%d",&size);
for(i=0;i<size;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<size;i++)
{
for(j=i+1;j<size;j++)
{
k=abs(a[i]-a[j]);
if(min>=k)
min=k;
}
}
printf("%d\n",min);
// printf("\n");
}
return 0;
}
The first line of input contains an integer T denoting
the number of test cases.
The first line of each test case is N, the size of array.
Second line of the test case is the Array.
Output:
Print the minimum difference between any two pairs.
Constraints:
1 <= T <= 30
1 < N <= 100
1 <= arr[i] <= 100000
Example:
Input:
2
5
2 4 5 7 9
10
87 32 99 75 56 43 21 10 68 49
Output:
1
6
#include <stdio.h>
int main()
{
int t,size,i,j,a[100],temp,k;
scanf("%d",&t);
while(t--)
{
int min=9999;
scanf("%d",&size);
for(i=0;i<size;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<size;i++)
{
for(j=i+1;j<size;j++)
{
k=abs(a[i]-a[j]);
if(min>=k)
min=k;
}
}
printf("%d\n",min);
// printf("\n");
}
return 0;
}
No comments:
Post a Comment