Submission #223469
Source Code Expand
#include <bits/stdc++.h> #define mp make_pair #define pb push_back #define all(x) (x).begin(),(x).end() #define rep(i,n) for(ll i=0;i<(n);i++) using namespace std; typedef long long ll; typedef unsigned long long ull; typedef vector<bool> vb; typedef vector<int> vi; typedef vector<vb> vvb; typedef vector<vi> vvi; typedef pair<int,int> pii; const int INF=1<<29; const double EPS=1e-9; const int dx[]={1,0,-1,0},dy[]={0,-1,0,1}; int n,a,b; int main(){ cin >> n >> a >> b; int turn = 0; while(n){ if(turn == 0){ if(n-a <= 0){ cout << "Ant" << endl; return 0; } turn = 1; n -= a; }else if(turn == 1){ if(n -b <= 0){ cout << "Bug" << endl; return 0; } turn = 0; n -= b; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 小石を取るゲーム |
User | togatoga |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 912 Byte |
Status | AC |
Exec Time | 22 ms |
Memory | 924 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 20 ms | 844 KB |
sample_02.txt | AC | 21 ms | 804 KB |
subtask1_01.txt | AC | 21 ms | 704 KB |
subtask1_02.txt | AC | 21 ms | 696 KB |
subtask1_03.txt | AC | 21 ms | 672 KB |
subtask1_04.txt | AC | 21 ms | 804 KB |
subtask1_05.txt | AC | 20 ms | 920 KB |
subtask1_06.txt | AC | 20 ms | 748 KB |
subtask1_07.txt | AC | 21 ms | 804 KB |
subtask1_08.txt | AC | 22 ms | 800 KB |
subtask1_09.txt | AC | 21 ms | 924 KB |
subtask1_10.txt | AC | 21 ms | 796 KB |
subtask1_11.txt | AC | 21 ms | 800 KB |
subtask1_12.txt | AC | 21 ms | 676 KB |
subtask1_13.txt | AC | 21 ms | 748 KB |