CENG (ODTÜ BİLGİSAYAR) ödevler, sınavlar, quizler (geniş arşiv)

 #include <stdio.h> 
 #include <stdlib.h> 
 #include <string.h> 
  
  
 struct node { 
 int anasayi; 
 char string[5]; 
 struct node *next1; 
 struct node *prev1; 
 struct node *next2; 
 struct node *prev2;}; 
  
 typedef struct node node; 
  
 node * delete(node **,char *,int,int *,int *); 
 void print(node *,FILE *infile); 
 node *find(int k,node *np) 
 { 
 	while(np) 
 		{ 
 			if(np->anasayi==k) 
 				return np; 
 			else 
 				np=np->next1; 
 		} 
  
  
  
 } 
  
 int findk(char st[5],node *np) 
 { 
 struct node *newnode=np; 
  
 while(np) 
 	{  
 		while(newnode) 
 		{  
 			if(strncmp(newnode->string,st,5)==0)  
 				return newnode->anasayi;  
 			else newnode=newnode->next2; 
 		} 
 		np=np->next1; newnode=np; 
 	} 
  
 } 
  
 node *findkm(char st[5],node *np) 
 { 
 struct node *newnode=np; 
  
 while(np) 
 	{  
 		while(newnode) 
 		{ 
 			if(strncmp(newnode->string,st,5)==0)  
 				return newnode;  
 			else  
 				newnode=newnode->next2; 
 		} 
 		np=np->next1; newnode=np; 
 	} 
  
 } 
  
 void mknode1(node **np,char st[5],int sayi,int sayiler[11]) 
 { 
 	int a=0,k=0; 
 	node *newlist,*search,*last,*current=NULL,*tutucu,*tutucu2,*aa,*bb; 
 	newlist=(node *) malloc(sizeof(node)); 
 	if(*np==NULL) 
 		{	 
 			newlist->anasayi=sayi; 
 			strcpy(newlist->string,st); 
 			newlist->next1=NULL; 
 			*np=newlist; 
 		} 
  
 	else { 
 		last=*np; 
 		for(a=0;a<11;a++) 
 			if(sayi==sayiler[a]) 
 				k++; 
  
 		if(k==0) 
 			{  
 				newlist->anasayi=sayi; 
 				strcpy(newlist->string,st); 
 				while(last && sayi>last->anasayi){ current=last; last=last->next1; } 
 				if(current) 
 					{ 
 						newlist->prev1=current; 
 						current->next1=newlist; 
 						if(last) 
 							{ 
 							newlist->next1=last; 
 							last->prev1=newlist; 
 							} 
 					} 
 					 
 				else 
 					{ 
 						tutucu=*np; 
 						newlist->next1=*np; 
 						tutucu->prev1=newlist;	 
 						 
 						*np=newlist;		 
 					} 
 			} 
 		else 
 			{ 
 				last=find(sayi,*np); 
 				newlist->anasayi=sayi; 
 				strcpy(newlist->string,st); 
 				while(last && strncmp(st, last->string, 5)>0){ current=last; last=last->next2; } 
 				if(current) 
 					{ 
 						newlist->prev2=current; 
 						current->next2=newlist; 
 						if(last) 
 							{ 
 							newlist->next2=last; 
 							last->prev2=newlist; 
 							} 
 					} 
 					 
 				else 
 					{	tutucu2=*np; 
 						tutucu=find(sayi,tutucu2); 
 						newlist->next2=tutucu; 
 						tutucu->prev2=newlist; 
 						newlist->next1=tutucu->next1; 
 						newlist->prev1=tutucu->prev1; 
 						if(tutucu->next1) 
 							{ aa=tutucu->next1; aa->prev1=newlist;} 
 						if(tutucu->prev1) 
 							{bb=tutucu->prev1; bb->next1=newlist;} 
 						tutucu->next1=NULL; 
 						tutucu->prev1=NULL; 
 						if(tutucu==*np) 
 						*np=newlist;		 
 					} 
 			 
 			}		 
 		} 
 } 
  
  
 void mknode2(node **np,char st[5],int sayiler[11],char listst[10][6],int *eyr) 
 { 
 int a,b,say=0,sayac=0,k,z,t=0; 
 char don[5]; 
 node *aaa=NULL,*bbb=NULL; 
 bbb=*np; 
 for(a=0;a<10;a++) 
 if(strncmp(st,listst[a], 5)==0) say++; 
  
 for(a=0;a<10;a++) 
 if(strncmp("...,,",listst[a], 5)==0) sayac++; 
  
 if(say!=0) 
 	{ 
 	k=findk(st,*np); 
 	mknode1(&bbb,st,k+1,sayiler); 
 	for(z=0;z<*eyr;z++) 
 			if(k+1==sayiler[z]) t++;  
 		if(t==0) { sayiler[*eyr]=k+1; *eyr=*eyr+1;} 
 		 aaa=delete(np,st,k,sayiler,eyr);  
 	} 
 else if(say==0 && sayac!=0) 
 	{ 
 	strcpy(listst[10-sayac],st); 
 	mknode1(np,st,1,sayiler); 
 		for(z=0;z<*eyr;z++) 
 			if(1==sayiler[z]) t++;  
 	if(t==0) { sayiler[*eyr]=1; *eyr=*eyr+1;} 
 	} 
 else if(say==0 && sayac==0) 
 	{ 
 	mknode1(np,st,1,sayiler); 
  
 		for(z=0;z<*eyr;z++) 
 			if(1==sayiler[z]) t++;  
 		if(t==0) { sayiler[*eyr]=1; *eyr=*eyr+1;}	 
  
  aaa=delete(np,bbb->string,bbb->anasayi,sayiler,eyr);  
  
 		for(a=0;a<10;a++) 
 		if(strncmp(aaa->string,listst[a], 5)==0) 	strcpy(listst[a],st); 
  
 	} 
 } 
  
 node * delete(node **np,char st[6],int sayi,int sayiler[11],int * eyr) 
 { 
 node *a1=NULL,*a2=NULL,*a3=NULL,*a4=NULL,*a5=NULL; 
 int a=0,b=0,t=0; 
 a1=findkm(st,*np); 
 a5=(node *) malloc(sizeof(node)); 
 strcpy(a5->string,a1->string); 
 if(a1->next2!=NULL) 
 { 
 	if(a1->prev2!=NULL) 
 		{ 
 			a3=a1->next2; 
 			a2=a1->prev2; 
 			a2->next2=a3; 
 			a3->prev2=a2; 
 			return a5; 
 		} 
 	else 
 		{ 
 		if(a1->next1!=NULL) 
 			{ 
 				if(a1->prev1!=NULL) 
 					{ 
 						a3=a1->next1; 
 						a2=a1->prev1; 
 						a4=a1->next2; 
 						a2->next1=a4; 
 						a3->prev1=a4; 
 						a4->prev2=NULL; 
 						a4->next1=a3; 
 						a4->prev1=a2;	 
 						return a5; 
 					} 
 				else 
 					{ 
 						a3=a1->next1; 
 						a4=a1->next2; 
 						a3->prev1=a4; 
 						a4->prev2=NULL; 
 						a4->next1=a3; 
 						*np=a4;	 
 						return a5; 
  
 					} 
 			} 
 		else 
 			{ 
 						if(a1->prev1){ 
 						a2=a1->prev1; 
 						a4=a1->next2; 
 						a2->next1=a4; 
 						a4->prev2=NULL; 
 						a4->prev1=a2; 
 						return a5;	 
 							} 
 						else 
 							{ 
 						a4=a1->next2; 
 						a4->prev2=NULL; 
 						*np=a4;	 
 						return a5; 
 							}	 
 			} 
 			 
  
 }		} 
 else 
 { 
 		if(a1->prev2!=NULL) 
 			{ 
 			a2=a1->prev2; 
 			a2->next2=NULL; 
 			return a5; 
  
 			} 
 		else 
 			{ 
 				if(a1->next1!=NULL) 
 					{ 
 						if(a1->prev1!=NULL) 
 							{ 
 							a3=a1->next1; 
 							a2=a1->prev1; 
 							a2->next1=a3; 
 							a3->prev1=a2; 
 							for(b=0;b<11;b++) 
 								if(sayi==sayiler[b]) sayiler[b]=0;  
 							for(a=0;a<10;a++) 
 							{if(sayiler[a]==0 && sayiler[a+1]!=0){sayiler[a]=sayiler[a+1]; sayiler[a+1]=0; a=0;}} 
 							*eyr=*eyr-1;	 
 							return a5; 
  
 							} 
 						else 
 							{ 
 							a3=a1->next1; 
 							a3->prev1=NULL; 
 							for(b=0;b<11;b++) 
 								if(sayi==sayiler[b]) sayiler[b]=0;  
 							for(a=0;a<10;a++) 
 							{if(sayiler[a]==0 && sayiler[a+1]!=0){sayiler[a]=sayiler[a+1]; sayiler[a+1]=0; a=0;}} 
 							*eyr=*eyr-1;	 
 							*np=a3;	 
 							return a5; 
 							 
 							} 
  
 					} 
 				else 
 					{ 
 						a2=a1->prev1; 
 						a2->next1=NULL; 
 						for(b=0;b<11;b++) 
 							if(sayi==sayiler[b]) sayiler[b]=0;  
 							for(a=0;a<10;a++) 
 							{if(sayiler[a]==0 && sayiler[a+1]!=0){sayiler[a]=sayiler[a+1]; sayiler[a+1]=0; a=0;}} 
 							*eyr=*eyr-1; 
 						return a5; 
 					 
 					} 
  
 			} 
 		 
 } 
  
 } 
  
 void print(node *node,FILE *infile) 
 { 
 struct node *newnode=node; 
  
 while(node) 
 	{  
 		fprintf(infile,"%i ",node->anasayi); 
 		while(newnode) 
 		{fprintf(infile,"%s ",newnode->string);  newnode=newnode->next2;} 
 		fprintf(infile,"\n");  
 		node=node->next1; newnode=node; 
 	} 
  
 } 
  
  
 int main() 
 { 
 int sayi1,a,b,t=0,sayiler[11]={0},sayi,eyr=0,l=0,say=0,tkr=0,pr=0,s=0,tt=0; 
 char string1[5]; 
 char string2[5]={"...,,"}; 
 char listst[10][6]; 
  
 for(a=0;a<10;a++) 
 strcpy(listst[a],"...,,"); 
 node *a1=NULL; 
 FILE * sk1; 
 FILE * sk2; 
  
 sk1=fopen("input.txt","r"); 
 fscanf(sk1,"%i",&sayi1); 
  
 for(a=0;a<sayi1;a++) 
 	{  
 		fscanf(sk1,"%s %i",string1,&sayi); /*scanf("%i",&sayi); */ 
 		mknode1(&a1,string1,sayi,sayiler); 
 		for(l=0;l<10;l++) 
 			if(strncmp(string1,listst[a], 5)==0) say++; 
 			  
 		if(say==0) 
 		{ strcpy(listst[tkr],string1); tkr=tkr+1;} 
 		say=0; 
 		for(b=0;b<a;b++) 
 			if(sayi==sayiler[b]) t++;  
 		if(t==0) { sayiler[eyr]=sayi; eyr++;} 
 		t=0; 
 	 } 
  
 while(tt!=EOF) 
 	{ 
 	tt=fscanf(sk1,"%s",string2); 
 	if(tt!=EOF) 
 	mknode2(&a1,string2,sayiler,listst,&eyr); 
 	} 
 fclose(sk1); 
 sk2=fopen("output.txt","w+"); 
 print(a1,sk2); 
 close(sk2); 
 return 0; 
 }