rotate a linked list around a node.cpp

#include<stdio.h>
#include<stdlib.h>

typedef struct node
{
	int data;
	struct node *next;
}node;

int main()
{	
	int a , i , n , cnt , r;
	node *p,*q,*start , *temp , *new_start;
	printf("Enter the number of nodes");
	scanf("%d",&n);
	
	printf("Enter all the nodes separated by space \n");
	p = (node*)malloc(sizeof(node));
	scanf("%d",&a);
	p->data = a;
	p->next = NULL;
	start = p; 
		
	for(i=1;i<n;i++)
	 	{
		 	q = (node*)malloc(sizeof(node));
			scanf("%d",&a);
			q->data = a;
			q->next = NULL;			 	
		 	p->next = q;
		 	p = p->next;		 	
	 	
		}
	printf("Enter the rotation node");
	scanf("%d",&r);
	
	p = start;
	while(p->data!= r)   //search the node
	{
		p = p->next;	
	}
	
	temp = p->next;
	new_start = temp;
	p->next = NULL;  // make p as last node of new rotated linked list
	
	while(temp->next!=NULL) // go to the last node of original linked list
	{
		temp = temp->next;		
	}
	
	temp->next = start; // connect last node of original linked list to first node
		
	printf("\n Rotated List = ");
	p = new_start;
	while(p!=NULL)
	{
		printf("%d  ",p->data);
		p =p->next;
	}
		
	
	return 0;
}