結果

問題 No.1003 サイコロの実装 (1)
ユーザー heno_code
提出日時 2020-03-27 03:04:55
言語 C++14
(gcc 9.3.0)
結果
AC  
実行時間 3 ms
コード長 2,884 Byte
コンパイル時間 903 ms
使用メモリ 8,948 KB
最終ジャッジ日時 2020-03-27 03:04:59

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
scramble_00 AC 2 ms
8,940 KB
scramble_01 AC 3 ms
6,896 KB
scramble_02 AC 2 ms
8,944 KB
scramble_03 AC 2 ms
8,948 KB
scramble_04 AC 2 ms
8,940 KB
scramble_05 AC 2 ms
8,944 KB
scramble_06 AC 2 ms
6,900 KB
scramble_07 AC 2 ms
6,900 KB
scramble_08 AC 2 ms
6,900 KB
scramble_09 AC 2 ms
8,900 KB
scramble_10 AC 2 ms
8,944 KB
scramble_11 AC 2 ms
6,896 KB
scramble_12 AC 2 ms
6,904 KB
scramble_13 AC 2 ms
8,900 KB
scramble_14 AC 3 ms
8,900 KB
scramble_15 AC 2 ms
8,940 KB
scramble_16 AC 2 ms
6,900 KB
scramble_17 AC 2 ms
6,896 KB
scramble_18 AC 2 ms
8,900 KB
scramble_19 AC 3 ms
8,944 KB
scramble_20 AC 2 ms
6,900 KB
scramble_21 AC 2 ms
8,940 KB
scramble_22 AC 2 ms
6,900 KB
scramble_23 AC 2 ms
8,944 KB
scramble_24 AC 2 ms
6,900 KB
scramble_25 AC 2 ms
8,900 KB
scramble_26 AC 2 ms
8,940 KB
scramble_27 AC 2 ms
8,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll a, ll n, ll m = mod) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 10000;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };


void solve() {
	ll n; cin >> n;
	if (n % 6 == 0) {
		cout << "Yes" << endl;
	}
	else {
		cout << "No" << endl;
	}
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(7);
	//init_f();
	//init();
	//int t; cin >> t; rep(i, t)solve();
	solve();
	stop
		return 0;
}
0