fork(1) download
copy 
  1. #include <iostream>
  2. using std::cin;
  3. using std::cout;
  4.  
  5. int goes_around(int id, int a, int b, int c, int d, int e,
  6.                         int f, int g, int h, int i, int j)
  7. {
  8.     switch (id)
  9.     {
  10.         case 0: return a;
  11.         case 1: return b;
  12.         case 2: return c;
  13.         case 3: return d;
  14.         case 4: return e;
  15.         case 5: return f;
  16.         case 6: return g;
  17.         case 7: return h;
  18.         case 8: return i;
  19.         case 9: return j;
  20.         default: return 0;
  21.     }
  22. }
  23.  
  24. int main()
  25. {
  26.     int a, b, c, d, e, f, g, h, i, j;
  27.     int n, k, temp;
  28.  
  29.     cin >> n;
  30.     k = n;
  31.  
  32.     cin >> a; b = a; --k;
  33.     if (k) { cin >> c; a += c; --k; }
  34.     if (k) { cin >> d; a += d; --k; }
  35.     if (k) { cin >> e; a += e; --k; }
  36.     if (k) { cin >> f; a += f; --k; }
  37.     if (k) { cin >> g; a += g; --k; }
  38.     if (k) { cin >> h; a += h; --k; }
  39.     if (k) { cin >> i; a += i; --k; }
  40.     if (k) { cin >> j; a += j; --k; }
  41.  
  42.     for (int kk = 0; kk < n-9; ++kk)
  43.     {
  44.     	cin >> temp;
  45.     	a += temp;
  46.     }
  47.  
  48.     b = 2*a - b;
  49.  
  50.     if (++k < n) { c = 2*b - c; }
  51.     else         { c = 2*b - goes_around(k-n, a, b, c, d, e, f, g, h, i, j); }
  52.     if (++k < n) { d = 2*c - d; }
  53.     else         { d = 2*c - goes_around(k-n, a, b, c, d, e, f, g, h, i, j); }
  54.     if (++k < n) { e = 2*d - e; }
  55.     else         { e = 2*d - goes_around(k-n, a, b, c, d, e, f, g, h, i, j); }
  56.     if (++k < n) { f = 2*e - f; }
  57.     else         { f = 2*e - goes_around(k-n, a, b, c, d, e, f, g, h, i, j); }
  58.     if (++k < n) { g = 2*f - g; }
  59.     else         { g = 2*f - goes_around(k-n, a, b, c, d, e, f, g, h, i, j); }
  60.     if (++k < n) { h = 2*g - h; }
  61.     else         { h = 2*g - goes_around(k-n, a, b, c, d, e, f, g, h, i, j); }
  62.     if (++k < n) { i = 2*h - i; }
  63.     else         { i = 2*h - goes_around(k-n, a, b, c, d, e, f, g, h, i, j); }
  64.     if (++k < n) { j = 2*i - j; }
  65.     else         { j = 2*i - goes_around(k-n, a, b, c, d, e, f, g, h, i, j); }
  66.  
  67.     cout << a << " " << b << " " << c << " " << d << " " << e << " "
  68.          << f << " " << g << " " << h << " " << i << " " << j << "\n";
  69. }
  70.  
Success #stdin #stdout 0s 3348KB
comments (?)
stdin
copy 
13
1 3 6 5 3 2 4 5 4 6 7 2 3
stdout
copy 
51 101 199 392 779 1555 3108 6212 12419 24834
https://ideone.com/7oJnut
"multinacci" series, 10 terms
language:
C++ (gcc 8.3)
created:
10 years ago
visibility:
secret

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!