This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
using namespace std;
int main()
{
int n;
cin>>n;
string a[n],b[n];
double l[n];
double temp=0,temp1=0,temp2=0;
for(int i=0;i<n;i++)
{
cin>>a[i]>>b[i];
if(a[i]=="section"){l[i]=temp+1;temp++;}
if(a[i]=="subsection"){l[i]=temp+((temp1+1)/10);temp1++;}
if(a[i]=="subsubsection"){l[i]=temp+(temp1/10);temp2++;}
}
for(int i=0;i<n;i++)
{
if(a[i]!="subsubsection")
cout<<l[i]<<' '<<b[i]<<endl;
else cout<<l[i]<<'.'<<temp2<<' '<<b[i]<<endl;
}
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... |