Reversing of a given linked list elements

reverse_elements.c

//By luk0y...
#include<stdio.h>
#include<stdlib.h>
struct node
	{
	int data;
	struct node *adr;
	};
void main()
{
	struct node *start=NULL,*nn,*ptr;
	int x,y,c=0;
	printf("Enter how many nodes you want : ");
    scanf("%d",&y);
    int k=y;
    int j=y;
    int i;
	printf("Enter the values : \n");
	while(y!=0)
	{
	    scanf("%d",&x);
		nn=(struct node*) malloc(sizeof(struct node));
		if(nn==NULL)
		{
			printf("no space");
		}
		else
		{
			if(start==NULL)
			{
				start=nn;
				nn->data=x;
				nn->adr=NULL;
			}
			else
			{
				ptr=start;
				while(ptr->adr!=NULL)
				{
					ptr=ptr->adr;
				}
				ptr->adr=nn;
				nn->data=x;
				nn->adr=NULL;
			}
		}
		y--;

	}
            ptr=start;
            printf("New linked list\n");
            for(i=1;i<=k;i++)
            {
                if(i==j){
                printf("%d\n",ptr->data);
                i=1;
                j--;
                 ptr=start;
                    }
                 if(i==k && k!=1){printf("%d",start->data);}
                ptr=ptr->adr;

                }
	        }