1 solutions
-
1
#include <bits/stdc++.h> using namespace std; queue<int>ppp; int x,y,n; int main(){ cin>>n; for(int i=0;i<n;i++){ cin>>x; switch(x){ case 1 : cin>>y; ppp.push(y); break; case 2 : if(ppp.empty())cout<<"ERR_CANNOT_POP"<<endl; else ppp.pop(); break; case 3 : if(ppp.empty())cout<<"ERR_CANNOT_QUERY"<<endl; else cout<<ppp.front()<<endl; break; case 4 : cout<<ppp.size()<<endl; break; } } return 0; }
- 1
Information
- ID
- 1115
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 6
- Tags
- # Submissions
- 54
- Accepted
- 19
- Uploaded By