class Fibonac { public static int Fib(int n) { if(n>2) return (Fib(n-1)+Fib(n-2)); else return 1; } { public static void main(String[] args) int n=Integer.parseInt(args[0]); int val=Fib(n); System.out.println("The "+n+"th"+" value in the series is "+val); } }
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