SRM467 Div1 Easy(250) ShorterSuperSum
#include <numeric> using namespace std; class ShorterSuperSum { public: int calculate( int k, int n ); }; int ShorterSuperSum::calculate( int k, int n ) { int SS[15][15]; for ( int i=0; i<=k; i++ ) for ( int j=1; j<=n; j++ ) SS[i][j] = i==0 ? j : accumulate(SS[i-1]+1,SS[i-1]+j+1,0); return SS[k][n]; }