Pagini recente » Cod sursa (job #1289578) | Cod sursa (job #2913188) | Cod sursa (job #611836) | Cod sursa (job #2182683) | Cod sursa (job #1228260)
#include<fstream>
using namespace std;
ifstream f("elmaj.in",ios::in);
ofstream g("elmaj.out",ios::out);
int a[30];
void quick( int inf, int sup )
{
int i,j,t,p;
i=inf;
j=sup;
p=a[(i+j)/2];
do
{
while(i<=sup && a[i]<p) i++;
while(j>=inf && a[j]>p) j--;
if(i<=j)
{
t=a[i];
a[i]=a[j];
a[j]=t;
i++;
j--;}}
while(i<=j);
if(inf<j) quick(inf,j);
if(sup>i) quick(i,sup);}
int main()
{
int n,k,i1,nr,j1,x,i2;
f>>n;
for(k=1;k<=n;k++)
f>>a[k];
quick(1,n);
i1=1;
nr=0;
while(i1<=n/2)
{j1=i1+n/2;
if(a[i1]==a[j1])
{x=a[i1];
for(i2=i1;i2<=n;i2++)
if(a[i2]==x)
nr++;
g<<a[i1]<<' '<<nr;
g<<'\n';}
i1++;}
return 0;}