Убийца
#include "Stdafx.h"
#include 
#include 
#include 

using namespace std;

struct MEN
{  int info;
	MEN *next;
 };
void input(MEN **i,MEN **one, int n)
{
 MEN *new_node;
 new_node=(MEN*)malloc(sizeof(MEN));
 new_node->info=n;
 if (!*one)
  {
	*one=new_node;
	new_node->next=*one;
  }
 else
  {
	new_node->next=(*i)->next;
	(*i)->next=new_node;
  }
  *i=new_node;
}

void del(MEN **i,MEN **one,int *otv)
{
 MEN *previous=*one;
 if (*one==NULL)
 {
  *otv=0;
 }
 else
  if ((*one)->next==*one)
    {
		*otv=(*one)->info;
   
    }
    else
   {
    while (previous->next!=*i) previous=previous->next;
    previous->next=(*i)->next;
    free(*i);
    if (*one==*i) *one=previous;
    *i=previous;
   }
}

int main()
{
int n,m,i,otv=0;
MEN *q=0,*one=0;
scanf("%d",&n);
scanf("%d",&m);
for(i=0;inext;
	del(&q,&one,&otv);
}
printf("%d",otv);
getch();
return 0;
}
Рекурсивная дробь
#include "Stdafx.h"
#include 
#include 
#include 

using namespace std;
double task(double x,int n)
{
	double k=pow(x,n)/n;
	if(abs(pow(x,n)/n)>0.001) return pow(x,n)/n + task(x,n+1);
	else return 1;
	
}
int _tmain(int argc, _TCHAR* argv[])
{

double x=0;
scanf("%lg",&x);
printf("\n %lg",task(x,1));
getch();
return 0;
}
рекурсивный многочлен
#include "Stdafx.h"
#include 
#include 
#include 

using namespace std;
 double task(double x,int k)
 {
	 if(k==0)return 1;
	 else 
		 if (k==1) return x;
		 else  return 2*x*task(x,k-1)-task(x,k-2);
		 
 }
int _tmain(int argc, _TCHAR* argv[])
{
int k;
double x;
printf("\n x=");
scanf("%lg",&x);
printf("\n k=");
scanf("%d",&k);
printf("\notvet= %lg",task(x,k));
getch();
return 0;
}