Difference between revisions of "Solução: Problema da seqüência de Fibonacci (Márcio Trindade)"
From AdonaiMedrado.Pro.Br
(New page: <code lang="c"> #include <stdio.h> int main(void) { int i,z,x=0,y=0,w=1,n; do { printf("digite um numero\n"); scanf("%d",&n); } while ((n<0)||(n>40)); if ...) |
|||
Line 2: | Line 2: | ||
#include <stdio.h> | #include <stdio.h> | ||
− | |||
− | |||
int main(void) | int main(void) | ||
Line 9: | Line 7: | ||
{ | { | ||
− | + | int i,z,x=0,y=0,w=1,n; | |
− | + | do | |
− | + | { | |
− | + | printf("digite um numero\n"); | |
− | + | scanf("%d",&n); } while ((n<0)||(n>40)); | |
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
if (n==0) | if (n==0) | ||
− | + | { | |
− | + | printf("0\n"); | |
− | } | + | } |
if (n==1) | if (n==1) | ||
− | {printf("0\n"); | + | { |
+ | printf("0\n"); | ||
+ | } | ||
− | + | if (n>1) | |
− | + | { | |
− | if (n>1) { | + | printf("0\n"); |
− | + | ||
− | printf("0\n"); | + | |
for (i=0;i<n;i++) | for (i=0;i<n;i++) | ||
− | + | { | |
− | + | z=x+y+w; | |
− | + | y=x; | |
− | + | w=0; | |
− | + | x=z; | |
− | + | printf("%d\n",z); | |
− | + | } | |
− | + | ||
− | + | ||
} | } | ||
− | + | return 0; | |
} | } | ||
− | |||
− | |||
</code> | </code> |