기본 콘텐츠로 건너뛰기

6064 : 카잉 달력 [C++]

#include <iostream>

using namespace std;

class KaIn
{
private:
 int M, N, x, y;
public:
 KaIn(int _m, int _n, int _x, int _y);
 int GetCount();
};

KaIn::KaIn(int _m, int _n, int _x, int _y)
{
 if (_m < _n)
 {
  this->M = _m; this->N = _n; this->x = _x; this->y = _y;
 }
 else
 {
  this->M = _n; this->N = _m; this->x = _y; this->y = _x;
 }
}

int KaIn::GetCount()
{
 int _X = 1; int _Y = 1;
 bool IsOk = false;
 int Count = 1;

 while (true)
 {
  if (_X < this->M && _Y < this->N)
  {
   _X++; _Y++;
   Count++;
  }
  else if (_X == this->M && _Y < this->N)
  {
   _X = 1; _Y++;
   Count++;
  }
  else if (_X < this->M && _Y == this->N)
  {
   _X++; _Y = 1;
   Count++;
  }
  else if (_X == this->M && _Y == this->N)
  {
   _X = 1; _Y = 1;
   Count++;
  }
  if (_X == this->x && _Y == this->y)
  {
   IsOk = true;
   break;
  }
  if (_X == this->M && _Y == this->N)
   break;
 }

 if (this->x == this->M && this->y == this->N)
  return Count;
 else if (!IsOk)
  return -1;
 else
  return Count;
}

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

 while (testcase--)
 {
  int M, N, x, y;
  cin >> M >> N >> x >> y;

  KaIn Calendar(M, N, x, y);

  int Count = Calendar.GetCount();

  cout << Count << endl;
 }
}

댓글

이 블로그의 인기 게시물

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