#246909 (C++14) No.8 N言っちゃダメゲーム

• 問題: No.8 N言っちゃダメゲーム
• ユーザー: akusyounin2412
• 提出日時: 2018-03-24 22:35:07
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 8 ms / 5,000 ms
• コード長: 1,870 bytes
• コンパイル時間: 847 ms
• コンパイル使用メモリ: 117,128 KB
• 実行使用メモリ: 7,632 KB
• 最終ジャッジ日時: 2023-09-07 08:58:47
• 合計ジャッジ時間: 1,626 ms
• ジャッジサーバーID （参考情報）: judge11 / judge13

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	3 ms; 7,532 KB
testcase_01	AC	3 ms; 7,540 KB
testcase_02	AC	3 ms; 7,632 KB
testcase_03	AC	8 ms; 7,572 KB
testcase_04	AC	8 ms; 7,568 KB
testcase_05	AC	8 ms; 7,576 KB
testcase_06	AC	8 ms; 7,624 KB
testcase_07	AC	8 ms; 7,580 KB
testcase_08	AC	8 ms; 7,584 KB
testcase_09	AC	8 ms; 7,572 KB
testcase_10	AC	8 ms; 7,568 KB

ソースコード

# include <iostream>
# include <algorithm>
#include <array>
# include <cassert>
#include <cctype>
#include <climits>
#include <numeric>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <tuple>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
# include <chrono>
# include <random>
# include <limits.h>
# include <unordered_map>
# include <unordered_set>
# include <deque>
# include <cstdio>
# include <cstring>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr long long MOD = 1000000000 + 7;
constexpr long long INF = std::numeric_limits<long long>::max();
const double PI = acos(-1);
#define fir first
#define sec second
typedef pair<LL, LL> Pll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, pair<LL, bitset<100001>>> Pbll;
typedef pair<LL, pair<LL, vector<LL>>> Pvll;
typedef pair<LL, LL> Vec2;
struct Tll { LL first, second, third; };
typedef pair<LL, Tll> Ptll;
#define rep(i,rept) for(LL i=0;i<rept;i++)
#define Mfor(i,mf) for(LL i=mf-1;i>=0;i--)
LL h, w, n, m, k, s, t, q, sum, last[10], ans, cnt, a[200010],b[200010], dp[200010];
struct Edge { LL to, cost,mon; };
string str;
bool f[200010];
void YN(bool f) {
	if (f)
		cout << "YES" << endl;
	else
		cout << "NO" << endl;
}
void yn(bool f) {
	if (f)
		cout << "Yes" << endl;
	else
		cout << "No" << endl;
}
vector<Edge>vec[100000];
LL ff(LL x) {
	if (dp[x] != 0)return dp[x];
	if (x / 10 > 0) {
		LL ss = 0, num = x;
		while (num > 0) {
			ss += num % 10;
			num /= 10;
		}
		dp[x] = ff(ss);
	}
	else dp[x] = x;
	return dp[x];
}
int main() {
	cin >> n;
	rep(i, n) {
		LL x, y;
		cin >> x >> y;
		x--;
		x %= (y + 1);
		bitset<1000000>bi = x;
		cout << (bi.count() != 0 ? "Win" : "Lose") << endl;
	}
	
	return 0;
}