Cod sursa(job #115366)

Utilizator mihai_simionSimion Zanescu Mihai mihai_simion Data 16 decembrie 2007 12:24:19
Problema Dusman Scor 0
Compilator cpp Status done
Runda preONI 2008, Runda 2, Clasele 5-8 Marime 0.73 kb
#include<stdio.h>
int n,k,m,i,x[1001],dus1[3001],dus2[3001];
int partitie (int st,int dr)
{
int aux,m,i,j,pivot;
m=(st+dr)/2;
pivot=x[m];
i=st-1;
j=dr+1;
while(1)
	{
	do{i++;}while(x[i]<pivot);
	do{j--;}while(x[j]>pivot);
	if(i<j)
		{
		aux=dus1[i];
		dus1[i]=dus1[j];
		dus1[j]=aux;
		aux=dus2[i];
		dus2[i]=dus2[j];
		dus2[j]=aux;
		}
	else return j;
	}
}
void qs (int st,int dr)
{
int p;
if(st<dr)
	{
	p=partitie(st,dr);
	qs(st,p);
	qs(p+1,dr);
	}
}
int main ()
{
freopen("dusman.in","r",stdin);
freopen("dusman.out","w",stdout);
scanf("%d %d %d ",&n,&k,&m);
for(i=1;i<=m;i++)
scanf(" %d %d ",&dus1[i],&dus2[i]);
if(k>(n*(n+1))/2)
{printf("exemplu gresit");}
else
if(m==0)
{

+}



return 0;
}