C program to accept n number and store all prime numbers in an array and display this array.

Write a ‘C’ program to accept ‘n’ number and store all prime numbers in an array and display this array.

#include<stdio.h>
#include<conio.h>
void main()
{
int a[10],i,n,m,j,l=0,k;
clrscr();
printf("enter the range");
scanf("%d",&n);
for(i=0;i<n;i++)
{
j=2;
printf("enter the no");
scanf("%d",&m);
while(j<m)
{
k=m%j;
if(k==0)
{
break;
}
j++;
}
if(j==m)
{
a[l]=m;
l++;
}
}
printf("\n Prime No's R\n");
for(i=0;i<l;i++)
{
printf("\n%d",a[i]);
}
getch();
}

C program to calculate sum of the elements of lower triangle of a m*n matrix by using dynamic memory allocation.

Write a ‘C’ program to calculate sum of the elements of lower triangle of a m*n matrix by using dynamic memory allocation.

#include<stdio.h>
#include<conio.h>
#include<malloc.h>
void main()
{
int n,m,i,j,sum=0;
int **p;
clrscr();
printf("\nENTER THE ORDER OF MATRIX");
scanf("%d%d",&m,&n);
p=(int**)malloc(sizeof(int*)*m);
for(i=0;i<m;i++)
{
p[i]=(int*)malloc(sizeof(int)*n);
}
printf("\nENTER THE MATRIX ELEMENT\n");
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf("%d",&p[i][j]);
}
}
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
if(i>j)
{
sum=sum+p[i][j];
}
}
}
printf("\nSUM OF LOWER TRIANGLE OF MATRIX IS :%d",sum);
getch();
}