#include<stdio.h>
#include<conio.h>
void main()
      {
        int flag,x;
        clrscr();
        printf("1\t");
        for(int i=1;i<=100;i++)
          {
            flag=0;
            for(x=2;x<=i;x++)
              {
                if(i%x==0)
                  {
                    flag=1;
                    break;
                  }
                else
                  continue;
              }
            if(i==x)
            printf("%d\t",i);
          }
        getch();
      }

#include<iostream.h>
void main()
{
int n,a;
cout<<"enter the limit";
cin>>n;
for(i=1;i<=n;i++}
{
if(i=1)
{
cout<<"1 is neither a prime nor a composite no";
}
else if(i%1==0|i%i==0)
{
cout<<i<<"is a prime number";
}
}
}

def shaf(n):
    l=range(3,n+1,2)
    mi=n
    i=0
    r=0
    print l   
    while l[i]<n-1:
        
        for j in range(2,l[i]):
            if l[i]%j==0:
                r=5
        if r==0:
            print l[i]
            
       
        r=0
        i=i+1
       
        
if __name__ == "__main__":
    print "prime numbers from 2 to <101 "      
    shaf(100)

void main()
{
int i,j,m;
for(i=1;i<=100;i++
{
m=0
for(j=1;j<i;j++)
{
if(i%j==0)
m++;
}
if(m==0)
printf("%d",i);
getch();
}

#include<Stdio.h>
#include<conio.h>

int main()
{
	int i,j, flag = 0;

	for(i=2;i<=100;i++)
	{
		for(j=2;j<i;j++)
		{
			if(i != j)
			{
			  if(i%j != 0)
				   continue;
			  else
				  break;
			}
		}
       if(i == j)
		printf("%d ",i);

	}
}

#include<stdio.h>
#include<conio.h>
void main()
{
int m,flag;
printf("enter the numbers upto which you wannt to find the prime numbers :");
scanf("%d",&m);
for(int i=1;i<=m;i++)
{ 
flag=1;
  for(int j=2;j<=i/2;j++)
    {
      if(i%j==0)
       flag=0;
}
if(flag==1)
printf("\n%d",i);
}
getch();
}       


thank u

#include<iostream>
using namespace std;
int main()
{
int num,i,j,flag;
cout<<"enter the no. up2 which u want prime no's:";
cin>>num;
for(i=2;i<=num;i++)
{
flag=1;
for(j-2;j<i/2;i++)
{
if(i%j==0)
flag=0;
}
if(flag==1)
cout<<i<<" ";
}
}