Submission #3088014
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <string> #include <map> #include <cmath> #include <queue> #include <numeric> #include <climits> #include <iterator> #include <iomanip> #include <stack> #include <bitset> #include <functional> using namespace std; const constexpr int INF = 1e9; //typedef std::pair<std::string,double> P; #define FOR(i, a, n) for (ll i = (ll)a; i<(ll)n; ++i) #define REP(i, n) FOR(i, 0, n) typedef long long ll; typedef vector<int> VI; const constexpr ll MOD = 1e9+7; vector<pair<int, int> > vp; struct Less { bool operator()(const pair<int, int>& x, const pair<int, int>& y) const { return x.first > y.first; } }; ll GCD(ll a, ll b){ if(b==0) return a; return GCD(b, a%b); } //グラフの隣接リスト VI g[200010]; //頂点の入次数を管理 int h[100010]; string s; int main(void) { int N, A, B; cin >> N >> A >> B; while(1){ N-=A; if(N<=0){ cout << "Ant" << endl; break; } N-=B; if(N<=0){ cout << "Bug" << endl; break; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 小石を取るゲーム |
User | hamray |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1201 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 4992 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 | 3 ms | 4992 KB |
sample_02.txt | AC | 3 ms | 4992 KB |
subtask1_01.txt | AC | 3 ms | 4992 KB |
subtask1_02.txt | AC | 3 ms | 4992 KB |
subtask1_03.txt | AC | 3 ms | 4992 KB |
subtask1_04.txt | AC | 3 ms | 4992 KB |
subtask1_05.txt | AC | 3 ms | 4992 KB |
subtask1_06.txt | AC | 3 ms | 4992 KB |
subtask1_07.txt | AC | 3 ms | 4992 KB |
subtask1_08.txt | AC | 3 ms | 4992 KB |
subtask1_09.txt | AC | 3 ms | 4992 KB |
subtask1_10.txt | AC | 3 ms | 4992 KB |
subtask1_11.txt | AC | 3 ms | 4992 KB |
subtask1_12.txt | AC | 3 ms | 4992 KB |
subtask1_13.txt | AC | 3 ms | 4992 KB |