Introfor

피보나치(반복, 재귀)

123456789101112131415#include int main() { int num = 0; int fibo = 0, fibo1 = 0, fibo2 = 1; scanf("%d",&num); for(; num>0; num--){ printf("%d ",fibo); fibo = fibo2; fibo2 += fibo1; fibo1 = fibo; }}Colored by Color Scriptercs 12345678910111213141516171819202122232425#include int f(int n); int main(){ int num = 0; scanf("%d ",&num); for(int i = 0 ; i
Doing/C&C++ 2017. 9. 18. 06:22
하노이의 탑

1234567891011121314151617181920#include void hanoi(int n, int from, int by, int to){ if (n == 1) printf("\nMove from %d to %d", from, to); else{ hanoi(n - 1, from, to, by); printf("\nMove from %d to %d", from, to); hanoi(n - 1, by, from, to); }} int main(void){ int i = 3; hanoi(i, 1, 2, 3); return 0;}Colored by Color Scriptercs
Doing/C&C++ 2017. 9. 7. 08:09
팩토리얼(반복, 재귀)

123456789101112131415#include int main() { int num = 0, f = 1; scanf("%d",&num); if(num == 0) printf("%d",1); else{ for(int i = num; i>0; i--) f *= i; printf("%d",f); }}Colored by Color Scriptercs123456789101112131415161718#include int f(int n); int main(){ printf("%d", f(5)); return 0;} int f(int n){ if (n == 1) return n; return n * f(n - 1); }cs
Doing/C&C++ 2017. 9. 5. 11:22
Prev 1 ··· 24 25 26 27 28 29 30 ··· 61 Next