Bonita Montero writes:

#include <iostream>
#include <vector>
#include <numeric>

using namespace std;

int main()
{
vector<double> row;
double k = 1, f = 1, fRev = 1;
do
row.emplace_back( fRev ),
f *= k++,
fRev = 1 / f;
while( fRev );
auto acc = [&]( size_t n ) { return
accumulate( make_reverse_iterator( row.begin() + n ), row.rend(), 0.0 ); };
size_t n = row.size();
for( double e = acc( n ), eNext; (eNext = acc( n - 1 )) == e; --n, e
= eNext );
cout << n << endl;
}

This code is an example of an average-ranked entry in the obfuscated C++ contest.

--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)