C++ Attribute Parser

#include <bits/stdc++.h>using namespace std;int main(){int n, q,i;cin>>n>>q;string temp;vector<string> hrml;vector<string> quer;cin.ignore();for(i=0;i<n;i++){    getline(cin,temp);    hrml.push_back(temp);}for(i=0;i<q;i++){    getline(cin,temp);    quer.push_back(temp);}map<string, string> m;vector<string> tag;for(i=0;i<n;i++){    temp=hrml[i];    temp.erase(remove(temp.begin(), temp.end(), '\"' ),temp.end());    temp.erase(remove(temp.begin(), temp.end(), '>' ),temp.end());    if(temp.substr(0,2)=="</")    {        tag.pop_back();    }    else    {        stringstream ss;        ss.str("");        ss<<temp;        string t1,p1,v1;        char ch;        ss>>ch>>t1>>p1>>ch>>v1;        string temp1="";        if(tag.size()>0)        {            temp1=*tag.rbegin();            temp1=temp1+"."+t1;        }        else            temp1=t1;        tag.push_back(temp1);        m[*tag.rbegin()+"~"+p1]=v1;        while(ss)        {            ss>>p1>>ch>>v1;            m[*tag.rbegin()+"~"+p1]=v1;        }    }}for(i=0;i<q;i++){    if (m.find(quer[i]) == m.end())        cout << "Not Found!\n";    else        cout<<m[quer[i]]<<endl;}return 0;

Source: programmingwithbasics.com

Similar codes

2 votes347 views2 answers
C++ while true loop
C++
0 vote369 views1 answer
Binpow in fenwick tree
C++
0 vote331 views1 answer
Lcm function c++
C++
1 vote312 views1 answer
Priority queue c++ type of pairs
C++
0 vote347 views1 answer
Udo apt install dotnet-sdk-5
C++
0 vote305 views1 answer
Copy assignment operator in c++
C++
0 vote329 views1 answer
Javidx9 age
C++
0 vote310 views2 answers
Power in c++
C++
9 votes319 views3 answers
How to iterate in string in c++
C++
1 vote320 views1 answer
Optimized Bubble Sort
C++