# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
499461 | Alisaf9 | Kaučuk (COCI21_kaucuk) | C++14 | 1 ms | 332 KiB |
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 <bits/stdc++.h>
using namespace std;
int main()
{
int n,x=0,c=0,d=0,u;
string s[50];
pair<pair<int,int>,int>pp[1000];
cin>>n;
u=n+1;
for(int i=0;i<n;i++)
{
cin>>s[i]>>s[u];
if(s[i]=="section")
{
x++;
cout<<x<<" "<<s[u]<<endl;
}
else if(s[i]=="subsection")
{
c++;
cout<<x<<"."<<c<<" "<<s[u]<<endl;
}
else if(s[i]=="subsubsection")
{
d++;
cout<<x<<"."<<c<<"."<<d<<" "<<s[u]<<endl;
}
u++;
}
}
Compilation message (stderr)
# | 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... |