Problem:
Score : 100 points

Problem Statement

Alice and Bob are playing One Card Poker.

One Card Poker is a two-player game using playing cards.

Each card in this game shows an integer between 1 and 13, inclusive.

The strength of a card is determined by the number written on it, as follows:

Weak 2 < 3 < 4 < 5 < 6 < 7 < 8 < 9 < 10 < 11 < 12 < 13 < 1 Strong

One Card Poker is played as follows:

Each player picks one card from the deck. The chosen card becomes the player's hand.

The players reveal their hands to each other. The player with the stronger card wins the game.

If their cards are equally strong, the game is drawn.

You are watching Alice and Bob playing the game, and can see their hands.

The number written on Alice's card is A, and the number written on Bob's card is B.

Write a program to determine the outcome of the game.

Constraints

1≦A≦13

1≦B≦13

A and B are integers.

Input

The input is given from Standard Input in the following format:

A B

Output

Print Alice if Alice will win. Print Bob if Bob will win. Print Draw if the game will be drawn.

Sample Input 1

8 6

Sample Output 1

Alice

8 is written on Alice's card, and 6 is written on Bob's card.
Alice has the stronger card, and thus the output should be Alice.

Sample Input 2

1 1

Sample Output 2

Draw

Since their cards have the same number, the game will be drawn.

Sample Input 3

13 1

Sample Output 3

Bob

Solution in C++14 (GCC 5.4.1) (judge verdict: Runtime Error)

#include<bits/stdc++.h>
using namespace std;
const int N_MAX = 40, ab_MAX = 10,inf=100000000;
int dp[N_MAX + 1][N_MAX*ab_MAX + 1][N_MAX*ab_MAX + 1];
int main() {
	int N, ma, mb; cin >> N >> ma >> mb;
	for (int i = 0; i < N_MAX + 1; i++) {
		for (int j = 0; j < N_MAX*ab_MAX + 1; j++) {
			for (int k = 0; k < N_MAX*ab_MAX + 1; k++) {
				dp[i][j][k] = inf;
			}
		}
	}
	dp[0][0][0] = 0;
	int A[N], B[N], C[N];
	for (int i = 0; i < N; i++) cin >> A[i] >> B[i] >> C[i];
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N_MAX*ab_MAX + 1; j++) {
			for (int k = 0; k < N_MAX*ab_MAX + 1; k++) {
				if (dp[i][j][k] == inf) continue;
				dp[i + 1][j][k] = min(dp[i + 1][j][k], dp[i][j][k]);
				dp[i + 1][j + A[i]][k+ B[i]] = min(dp[i + 1][j + A[i]][k + B[i]], dp[i][j][k] + C[i]);
			}
		}
	}
	int ans = inf;
	for (int j = 1; j < N_MAX*ab_MAX + 1; j++) {
		for (int k = 1; k < N_MAX*ab_MAX + 1; k++) {
			//if (dp[N][j][k] == inf) continue;
			if (ma*k == mb * j)  ans = min(ans, dp[N][j][k]);
		}
	}
  if(ans==inf) {cout<<-1<<endl; return 0;}
	cout << ans << endl;
}