it's simple:
{
int a,b,c,d;
printf("enter the numbers");
scanf("%d %d %d" &a &b &c);
d=a+b+c;
printf("the sum is=%d" d);
}
simple program
algorithm is a way to solve your problem
Three ways.. Multiply n by itself. Calculate Sum[2i+1,{i,0,n-1}] Calculate Sum[n,{i,1,n}]
public static final int getSum(final int n) { int sum = 0; for(int i = 1; i <= n; ++i) { sum += i; } return sum; }
The quotient of the sum of a number and three, and four is seven
The sum of four and the product of three and a number xxxx.
n+3 the sum of a number and three means a number plus three.
int sum = 0; int n = 0; while( sum <= 999 ) { sum += (++n); }
Their sum is three times the middle number.
There are not three odd primes with the sum of 14. The sum of three odd primes will be an odd number.
The sum of 8 and 5 is 13. There is then no number with which to calculate its product.
(sum of data)/number of data