fork download
  1. #include <algorithm>
  2. #include <iostream>
  3. #include <vector>
  4.  
  5. void fibo1(int n) {
  6. int a = 1;
  7. int b = 1;
  8.  
  9. for (int i = 1; i <= n; i++){
  10. if (i == b)
  11. {
  12. int c = a + b;
  13. a = b;
  14. b = c;
  15. std::cout <<"F";
  16. }
  17. else
  18. {
  19. std::cout <<"f";
  20. }
  21. }
  22. }
  23.  
  24. void fibo2(int n) {
  25. std::vector<int> arr(n);
  26. arr[0] = arr[1] = 1;
  27. for (int i = 2; i < n; i++){
  28. arr[i] = arr[i-1] + arr[i-2];
  29. }
  30.  
  31. for (int i = 1; i <= n; i++){
  32. if (std::find(arr.begin(), arr.end(), i) == arr.end()) {
  33. std::cout << "f";
  34. } else {
  35. std::cout << "F";
  36. }
  37. }
  38. }
  39.  
  40. int main()
  41. {
  42. fibo1(21); std::cout << std::endl;
  43. fibo2(21); std::cout << std::endl;
  44. }
  45.  
Success #stdin #stdout 0s 15240KB
stdin
Standard input is empty
stdout
FFFfFffFffffFfffffffF
FFFfFffFffffFfffffffF