기본 콘텐츠로 건너뛰기

10845 : 큐(미제) [C++]

#include <iostream>
#include <vector>
#include <string>

using namespace std;

class Q
{
private:
vector<int> Queue;
public:
void Push(int x);
int Pop();
int GetSize();
bool Empty();
int GetFront();
int GetBack();
};


void Q::Push(int x)
{
this->Queue.push_back(x);
}

int Q::Pop()
{
return this->Queue[0];
this->Queue.erase(this->Queue.begin());
}

int Q::GetSize()
{
return this->Queue.size();
}

bool Q::Empty()
{
return this->Queue.empty();
}

int Q::GetFront()
{
return this->Queue.front();
}
int Q::GetBack()
{
return this->Queue.back();
}

int main()
{
Q Queue;

int Case;
cin >> Case;

while (Case--)
{
string Input = "";
getline(cin, Input, '\n');
switch (Input.at(0))
{
case 'p':
if (Input.at(1) == 'u')
{
int index = Input.find(' ');
int value = stoi(Input.substr(index + 1, Input.size() - 1));
Queue.Push(index);
}
else
{
cout << Queue.Pop();
}
break;
case 's':
cout << Queue.GetSize(); break;
case 'e':
if (Queue.Empty()) cout << "1";
else cout << "0";
break;
case 'f':
cout << Queue.GetFront(); break;
case 'b':
cout << Queue.GetBack(); break;
}
}

return 0;
}

댓글

이 블로그의 인기 게시물

1978 : 소수 찾기 [C++]

# include < iostream > # include < vector > using namespace std ; int main ( ) { cin . tie ( NULL ) ; vector < int > Primes ; Primes . push_back ( 2 ) ; Primes . push_back ( 3 ) ; for ( int i = 4 ; i < 1000 ; i + + ) { bool IsPrime = true ; if ( i % 2 = = 0 | | i % 3 = = 0 ) continue ; for ( int j = 4 ; j < i ; j + + ) { if ( i % j = = 0 ) { IsPrime = false ; break ; } } if ( IsPrime ) Primes . push_back ( i ) ; } int N , Count = 0 ; cin > > N ; for ( int i = 0 ; i < N ; i + + ) { int Input ; cin > > Input ; for ( int j = 0 ; j < Primes . size ( ) ; j + + ) if ( Input = = Primes [ j ] ) Count + + ; } cout < < Count < < " \n " ; return 0 ; }

10828 : 스택 [Python]

Stack = [ ] def push ( num ) : Stack . append ( int ( num ) ) def pop ( ) : if len ( Stack ) > 0 : print ( Stack . pop ( ) ) else : print ( - 1 ) def size ( ) : print ( len ( Stack ) ) def empty ( ) : if len ( Stack ) == 0 : print ( 1 ) else : print ( 0 ) def top ( ) : if len ( Stack ) > 0 : print ( Stack [ len ( Stack ) - 1 ] ) else : print ( - 1 ) TestCase = int ( input ( ) ) while TestCase > 0 : Command = input ( ) if Command == 'top' : top ( ) elif Command == 'pop' : pop ( ) elif Command == 'empty' : empty ( ) elif Command == 'size' : size ( ) else : push ( Command [ 5 : ] ) TestCase - = 1