#include <stdio.h>
void quick_sort(int data[],int left,int right)
{
int pivot = left;
int i,num,mun,k = 0,key;
if(left<right)
{
num=left+1;
mun = right;
key = data[left];
while(num-1<mun)
{
while(data[num]<=key)
{
num++;
}
while(data[mun]> key)
{
mun--;
}
if(num<mun)
{
k = data[num];
data[num] = data[mun];
data[mun] = k;
}
}
k = data[pivot];
data[pivot] = data[mun];
data[mun] = k;
quick_sort(data,left,mun-1);
quick_sort(data,mun+1,right);
}
}
int main()
{
int data[8]= {20,18,50,40,9,17,5,25};
int i;
for(i=0; i<8; i++)
{
printf("%d ",data[i]);
}
printf("\n");
quick_sort(data,0,7);
for(i=0; i<8; i++)
{
printf("%d ",data[i]);
}
}
#include<stdio.h>
int main()
{
int i,j,a,sum = 0;
for(i=0;i<5;i++)
{
scanf("%d",&a);
sum+=a*a;
}
printf("%d",sum%10);
return 0;
}