This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//Coded by Chirath Nirodha
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define P push
#define I insert
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
const ll mod=1e9+7;
inline void io(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
void solve(){
io();
int n;cin>>n;
int sec=0,subsec=0,subsubsec=0;
for(int i=0;i<n;i++){
string a,b;cin>>a>>b;
if(a=="section"){
sec++;
subsec=subsubsec=0;
cout<<sec<<" "<<b<<endl;
}
else if(a=="subsection"){
subsec++;
subsubsec=0;
cout<<sec<<"."<<subsec<<" "<<b<<endl;
}
else{
subsubsec++;
cout<<sec<<"."<<subsec<<"."<<subsubsec<<" "<<b<<endl;
}
}
}
int main(){
io();
solve();
//int t;cin>>t;for(int i=0;i<t;i++)solve();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |