fork download
copy 
  1. #include <iostream>
  2. #include <cmath>
  3. #include <vector>
  4. #include <algorithm>
  5.  
  6. using namespace std;
  7.  
  8. int main()
  9. {
  10.     int* a = new int[31];
  11.     *(a + 1) = 1; *(a + 2) = 1;
  12.     for (int i = 3; i <= 30; ++i) {
  13.         *(a + i) = *(a + i - 1) + *(a + i - 2);
  14.     }
  15.     for (int i = 3; i <= 30; ++i) {
  16.         if (i % 4 == 0) {
  17.             *(a + i) = -*(a + i);
  18.         }
  19.     }
  20.     int maxPos = -1, maxNeg = -2000000000;
  21.     int pr = 1;
  22.     vector<int> pos_numbers;
  23.     for (int i = 1; i <= 30; ++i) {
  24.         cout << *(a + i) << ' ';
  25.         pr *= *(a + i);
  26.         if (a[i] < 0) {
  27.             maxNeg = max(maxNeg, *(a + i));
  28.         } else {
  29.             maxPos = max(maxPos, *(a + i));
  30.             pos_numbers.push_back(*(a + i));
  31.         }
  32.     } cout << endl;
  33.     cout << maxPos << ' ' << maxNeg << endl;
  34.     cout << pr << endl;
  35.     sort(pos_numbers.begin(), pos_numbers.end());
  36.     reverse(pos_numbers.begin(), pos_numbers.end());
  37.     for (int i = 0; i < pos_numbers.size(); ++i) {
  38.         cout << pos_numbers[i] << ' ';
  39.     }
  40.     delete [] a;
  41.  
  42.     return 0;
  43. }
Success #stdin #stdout 0s 4372KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
1 1 2 -3 5 8 13 -21 34 55 89 -144 233 377 610 -987 1597 2584 4181 -6765 10946 17711 28657 -46368 75025 121393 196418 -317811 514229 832040 
832040 -3
394264576
832040 514229 196418 121393 75025 28657 17711 10946 4181 2584 1597 610 377 233 89 55 34 13 8 5 2 1 1
https://ideone.com/FSHL4z
language:
C++14 (gcc 8.3)
created:
4 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!