Artifact 806ffff6ad427e2d23faf598d6a40a2d21a08908
#include <iostream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <iterator>
#include <functional>
#include <complex>
#include <queue>
#include <stack>
#include <cmath>
#include <cassert>
#include <tuple>
using namespace std;
typedef long long LL;
typedef complex<double> CMP;
class JumpFurther { public:
int furthest(int N, int badStep)
{
int sigma = 0;
for(int X=1; X<=N; ++X)
{
sigma += X;
if(sigma == badStep)
--sigma;
}
return sigma;
}
};
// BEGIN CUT HERE
#include <ctime>
double start_time; string timer()
{ ostringstream os; os << " (" << int((clock()-start_time)/CLOCKS_PER_SEC*1000) << " msec)"; return os.str(); }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v)
{ os << "{ ";
for(typename vector<T>::const_iterator it=v.begin(); it!=v.end(); ++it)
os << '\"' << *it << '\"' << (it+1==v.end() ? "" : ", "); os << " }"; return os; }
void verify_case(const int& Expected, const int& Received) {
bool ok = (Expected == Received);
if(ok) cerr << "PASSED" << timer() << endl; else { cerr << "FAILED" << timer() << endl;
cerr << "\to: \"" << Expected << '\"' << endl << "\tx: \"" << Received << '\"' << endl; } }
#define CASE(N) {cerr << "Test Case #" << N << "..." << flush; start_time=clock();
#define END verify_case(_, JumpFurther().furthest(N, badStep));}
int main(){
CASE(0)
int N = 2;
int badStep = 2;
int _ = 3;
END
CASE(1)
int N = 2;
int badStep = 1;
int _ = 2;
END
CASE(2)
int N = 3;
int badStep = 3;
int _ = 5;
END
CASE(3)
int N = 1313;
int badStep = 5858;
int _ = 862641;
END
CASE(4)
int N = 1;
int badStep = 757065;
int _ = 1;
END
CASE(5)
int N = 2000;
int badStep = 123456;
int _ = -1;
END
CASE(6)
int N = 2000;
int badStep = 3;
int _ = -1;
END
CASE(7)
int N = 2000;
int badStep = 4000000;
int _ = -1;
END
}
// END CUT HERE