diff options
author | Tobias Klauser <tklauser@distanz.ch> | 2008-01-27 11:37:44 +0100 |
---|---|---|
committer | Tobias Klauser <tklauser@xenon.tklauser.home> | 2008-01-27 11:37:44 +0100 |
commit | 7e0f021a9aec35fd8e6725e87e3313b101d26f5e (patch) | |
tree | b1cacc4b24393f517aeb4610e9e1021f954307a8 /reference/C/PROBLEMS/array_prob.c |
Initial import (2.0.2-6)2.0.2-6
Diffstat (limited to 'reference/C/PROBLEMS/array_prob.c')
-rw-r--r-- | reference/C/PROBLEMS/array_prob.c | 36 |
1 files changed, 36 insertions, 0 deletions
diff --git a/reference/C/PROBLEMS/array_prob.c b/reference/C/PROBLEMS/array_prob.c new file mode 100644 index 0000000..1054eed --- /dev/null +++ b/reference/C/PROBLEMS/array_prob.c @@ -0,0 +1,36 @@ +/************************************************************************* + * + * Purpose: Numerical exercise with integer arrays. Starting with 0, 1 add + * them up then take the result and add it to the last number and + * repeat. + * + * For example: + * + * 0 + 1 = 1 + * 1 + 1 = 2 + * 1 + 2 = 3 + * + * Author: M. J. Leslie + * Date: 04-Apr-94 + * + ************************************************************************/ + +#include <stdio.h> + +#define ITTERATIONS 20 + /* NO COMMENTS! can you figure it out? */ +main() +{ +int num[3]={0,1}; +int count1, count2; + +printf("%d %d ", num[0], num[1]); + +for (count1=0; count1 < ITTERATIONS-2; count1++) + { + num[2] = num[0] + num[1]; + printf("%d ",num[2]); + for (count2 =0; count2 < 2; count2++) num[count2] = num[count2+1]; + } +puts(""); +} |