class Prime
{
public static void main(String[] args)
{
int i=0,c=0,j=0;
int n=Integer.parseInt(args[0]);
System.out.println("the prime numbers are:");
for(j=1;j<=n;j++)
{
c=0;
for(i=1;i<=n;i++)
{
if(j%i==0)
{
c++;
}
}
if(c==2)
{
System.out.println(j);
}
}
}
}
PROCEDURE:- 1.enter values for u,a,t to find distance 2.find distance with the formulae ut+1/2at 2 3.print the above result CODE:- #include<stdio.h> #include<conio.h> void main() { float u,t,a,S; clrscr(); printf(“enter values u,t,a”); scanf(“%f %f %f”, &u,&t,&a); S=(u*t)+(0.5*a*t*t); printf(“\n S = %f”, S); } Input:- enter values u,t,a U=10,t=4,a=4.9 Output:- S =79.200
Comments
Post a Comment