Title: Seek 1+2+...+n, the request cannot use multiplication and division method \for\while\if\else\switch\case and so on key word and Condition judgment statement (A? B:C).
You can use the function pointer to solve, by recursive call, each recursive value minus 1, using negation operation (!), that is, not 0 is 0, 0 is 1.
Code:
* * * * * main.cpp * * * Created on:2014.7.12 *
This column more wonderful content: http://www.bianceng.cnhttp:// www.bianceng.cn/Programming/sjjg/
* author:spike
/
#include <stdio.h>
#include < stdlib.h>
#include <string.h>
#include <math.h>
typedef size_t (*fun) (size_t);
size_t sum_t (size_t N) {return
0;
}
size_t sum (size_t n) {
static fun f[2] = {sum_t, sum};
Return f[!! N] (n-1) + N;
}
int main (void)
{
size_t result = Sum;
printf ("result =%d\n", result);
return 0;
}
Output:
result = 55
Author: csdn Blog Caroline-wendy