Submission #8881091
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define ll long long #define ld long double #define rep(i,h) for(int i = 0; i < h; ++i) #define rep1(i,h) for(int i = 0; i <= h; ++i) #define rep2(i,n,h) for(int i = n; i < h; ++i) #define rep3(l,n,h) for(int l = n; l <= h; ++l) typedef pair<int,int> int_pair; typedef pair<string,string> string_pair; int main(void) { int n,a,b,count = 0; string ans; cin >> n >> a >> b; while(n > 0) { count++; if(count % 2 == 1) { n -= a; ans = "Ant"; }else { n -= b; ans = "Bug"; } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 小石を取るゲーム |
User | shion0625 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 692 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 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 | sample_01.txt, sample_02.txt, 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 | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 1 ms | 256 KB |
subtask1_04.txt | AC | 1 ms | 256 KB |
subtask1_05.txt | AC | 1 ms | 256 KB |
subtask1_06.txt | AC | 1 ms | 256 KB |
subtask1_07.txt | AC | 1 ms | 256 KB |
subtask1_08.txt | AC | 1 ms | 256 KB |
subtask1_09.txt | AC | 1 ms | 256 KB |
subtask1_10.txt | AC | 1 ms | 256 KB |
subtask1_11.txt | AC | 1 ms | 256 KB |
subtask1_12.txt | AC | 1 ms | 256 KB |
subtask1_13.txt | AC | 1 ms | 256 KB |