Artifact 622c85edd2a0b0bfba95ae3b3b53a8d0c0156f5c
#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 <cstring>
using namespace std;
typedef long long LL;
typedef complex<double> CMP;
class LockersDivOne { public:
int lastOpened(int N)
{
vector<int> v;
for(int i=1; i<=N; ++i)
v.push_back(i);
int last = -1;
for(int s=2; !v.empty(); ++s) {
vector<int> vv;
for(int i=0; i<v.size(); ++i)
if( i%s>0 )
vv.push_back(v[i]);
else
last = v[i];
v.swap(vv);
}
return last;
}
};
// 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(_, LockersDivOne().lastOpened(N));}
int main(){
CASE(0)
int N = 9;
int _ = 6;
END
CASE(1)
int N = 42;
int _ = 42;
END
CASE(2)
int N = 314;
int _ = 282;
END
CASE(4)
int N = 1;
int _ = 1;
END
CASE(5)
int N = 2;
int _ = 2;
END
CASE(6)
int N = 3;
int _ = 2;
END
CASE(7)
int N = 4;
int _ = 4;
END
CASE(7)
int N = 5;
int _ = 4;
END
CASE(7)
int N = 6;
int _ = 6;
END
CASE(7)
int N = 7;
int _ = 6;
END
CASE(7)
int N = 8;
int _ = 6;
END
CASE(3)
int N = 2000000;
int _ = -1;
END
}
// END CUT HERE