제출 #499441

#제출 시각아이디문제언어결과실행 시간메모리
499441adamKaučuk (COCI21_kaucuk)C++14
10 / 50
1 ms204 KiB
#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+1)/100);temp2++;} } for(int i=0;i<n;i++) { if(a[i]!="subsubsection") cout<<l[i]<<' '<<b[i]<<endl; else { int h=(l[i]*100); double u=h%10; cout<<l[i]-(u/10)<<'.'<<h<<' '<<b[i]; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...