기본 콘텐츠로 건너뛰기

1427 : 소트인사이드 [C++]

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

using namespace std;

class SelectionSort
{
private:
 vector<int> data;
 int Size;
public:
 SelectionSort(string input, int n);
 void selection_sort(int left, int right);
 void print();
};

SelectionSort::SelectionSort(string input, int n)
{
 Size = n;

 for (int i = 0; i < input.size(); i++)
  data.push_back(input.at(i) - '0');
}

void SelectionSort::selection_sort(int left, int right)
{
 for (int i = 0; i < Size; i++)
 {
  int Most = data[i];
  int Mostj = 0;
  for (int j = i; j < Size; j++)
  {
   if (Most <= data[j])
   {
    Mostj = j;
    Most = data[j];
   }
  }
  int Temp = data[i];
  data[i] = data[Mostj];
  data[Mostj] = Temp;
 }
}

void SelectionSort::print()
{
 for (int i = 0; i < Size; i++)
  cout << data[i];
}


int main()
{
 string Input;
 getline(cin, Input, '\n');

 SelectionSort S(Input, Input.size());

 S.selection_sort(0, Input.size() - 1);
 S.print();

 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