기본 콘텐츠로 건너뛰기

2447 : 별 찍기 - 10 (미제) [C++]

#include <iostream>

using namespace std;

void Print(int l, int n, int odd)
{
 if ((n + 1) == l)
  return;

 if ((odd % 2) == 0)
 {
  switch (l % 9)
  {
  case 1: cout << "*********         *********" << endl; break;
  case 2: cout << "* ** ** *         * ** ** *" << endl; break;
  case 3: cout << "*********         *********" << endl; break;
  case 4: cout << "***   ***         ***   ***" << endl; break;
  case 5: cout << "* *   * *         * *   * *" << endl; break;
  case 6: cout << "***   ***         ***   ***" << endl; break;
  case 7: cout << "*********         *********" << endl; break;
  case 8: cout << "* ** ** *         * ** ** *" << endl; break;
  case 0: cout << "*********         *********" << endl; odd += 1; break;
  }
 }
 else if((odd %2) == 1)
 {
  switch (l % 9)
  {
  case 1: cout << "***************************" << endl; break;
  case 2: cout << "* ** ** ** ** ** ** ** ** *" << endl; break;
  case 3: cout << "***************************" << endl; break;
  case 4: cout << "***   ******   ******   ***" << endl; break;
  case 5: cout << "* *   * ** *   * ** *   * *" << endl; break;
  case 6: cout << "***   ******   ******   ***" << endl; break;
  case 7: cout << "***************************" << endl; break;
  case 8: cout << "* ** ** ** ** ** ** ** ** *" << endl; break;
  case 0: cout << "***************************" << endl; odd += 1; break;
  }
 }

 Print(l + 1, n, odd);
}

int main()
{
 int N;
 cin >> N;

 Print(1, N, 1);

 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