#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<bitset>
#include<stack>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
#include"grader.cpp"
/*
cout<<setprecision(20);
cin.tie(0);
ios::sync_with_stdio(false);
*/
const llint mod=998244353;
const llint big=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>bool mineq(T& a,U b){if(a>b){a=b;return true;}return false;}
template <class T,class U>bool maxeq(T& a,U b){if(a<b){a=b;return true;}return false;}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
int que=0;
vector<array<int,20>>mae;
vector<int>fuka;
string mozi;
void Init(void){
fuka.pub(0);
mozi.pub('#');
array<int,20>kore={0};
mae.pub(kore);
que++;
}
void TypeLetter(char L){
fuka.pub(fuka.back()+1);
mozi.pub(L);
array<int,20>kore={0};
int gen=que-1;
for(int h=0;h<20;h++){
kore[h]=gen;
gen=mae[gen][h];
}
mae.pub(kore);
que++;
}
void UndoCommands(int U){
int bas=que-U-1;
fuka.pub(fuka[bas]);
mozi.pub(mozi[bas]);
mae.pub(mae[bas]);
que++;
}
char GetLetter(int P){
int M=fuka.back()-P-1;
int gen=que-1;
for(int h=0;h<20;h++){
if(M&(1<<h)){gen=mae[gen][h];}
}
return mozi[gen];
}
Compilation message
/tmp/ccMkuRor.o: In function `main':
scrivener.cpp:(.text.startup+0x0): multiple definition of `main'
/tmp/ccF8GZlh.o:grader.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status
