Skip to main content

Sum and average of n different numbers.

PROCEDURE:-
  1. input an integer value n and set sum to 0
  2. repeat step 3 until  all the n different values are read
  3. read an integer add this to previous sum
  4. print the sum

CODE:-

#include<stdio.h>
void main()
{
  int n,x,i=1;sum=0;
  printf(“enter value for n”);
  scanf(“%d”,&n);
  printf(“enter %d different values”,n);
  while(i<=n)
  {
    scanf(“%d”,&x);
    sum=sum+x;
    i++;
  }
 printf(“sum of %d numbers is  %d”, n, sum);
}


Input:- enter value for n 4
              enter 4 different values   20 20 20 20
Output:- sum of 4 numbers is 80
Labels:

Comments

Post a Comment

Popular posts from this blog

Find Value of S=ut+1/2*a*t**2.

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
1 comment
Read more

Check whether a given number is Fibonacci prime or not.

PROCEDURE:- 1.input an integer n 2. first check whether it is prime or not 3. if it prime check whether it is in the Fibonacci series 4.the above check can be made by generating series and comparing each number with n 5.if n is found in the series then n is Fibonacci prime 6.else it is not Fibonacci prime   CODE:- #include<stdio.h> void main(){ int n,i=2,k=0,a,b,i,m; printf(“enter the number”); scanf(“%d”,&n); while(i<=n/2) { if(n%i = = 0)   {     k=1; break;   } i++; } if(k!=1) { a=0; b=1; i=1; m=n; while(i<=m) {   c=a+b;    if(m= =c)     {      printf(“ %d is Fibonacci prime”,n);    break;     } a=b; b=c; i++; } if(m!=c) printf(“%d  Not Fibonacci prime”,n); } else printf(“not prime “); } Input:- enter the number  13 Output:- 13 is Fibonacci prime  
Post a Comment
Read more