Rajeev Sreedharan rajeevs1992

## dangle.c
#include<stdio.h>
#define CUBE(n) n*n*n
int armstrong(int n);
int prime(int n);
int main()
{
	int n,i;
	printf("\nEnter number ");
	scanf("%d",&n);
	if(armstrong(n))

## polyadd.c
#include<stdio.h>
#include<stdlib.h>//For malloc
struct node
{
	int exp;
	int coefft;
	struct node *next;
};

char getch()
	#include<stdio.h>
	#define CUBE(n) nnn
	int armstrong(int n);
	int prime(int n);
	int main()
	{
	int n,i;
	printf("\nEnter number ");
	scanf("%d",&n);
	if(armstrong(n))
	#include<stdio.h>
	#include<stdlib.h>//For malloc
	struct node
	{
	int exp;
	int coefft;
	struct node *next;
	};

	char getch()