結果

問題 No.1259 スイッチ
ユーザー kyoprounokyoprouno
提出日時 2021-01-03 17:42:51
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 41 ms / 2,000 ms
コード長 7,792 bytes
コンパイル時間 2,072 ms
コンパイル使用メモリ 178,632 KB
実行使用メモリ 34,288 KB
最終ジャッジ日時 2023-08-03 14:32:43
合計ジャッジ時間 7,283 ms
ジャッジサーバーID
(参考情報)
judge14 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 18 ms
18,856 KB
testcase_01 AC 18 ms
18,792 KB
testcase_02 AC 19 ms
18,796 KB
testcase_03 AC 18 ms
18,552 KB
testcase_04 AC 17 ms
18,564 KB
testcase_05 AC 18 ms
18,552 KB
testcase_06 AC 19 ms
18,756 KB
testcase_07 AC 17 ms
18,616 KB
testcase_08 AC 17 ms
18,756 KB
testcase_09 AC 19 ms
18,784 KB
testcase_10 AC 33 ms
28,112 KB
testcase_11 AC 39 ms
33,116 KB
testcase_12 AC 32 ms
27,648 KB
testcase_13 AC 27 ms
23,984 KB
testcase_14 AC 31 ms
26,064 KB
testcase_15 AC 26 ms
23,784 KB
testcase_16 AC 37 ms
30,724 KB
testcase_17 AC 30 ms
25,740 KB
testcase_18 AC 38 ms
32,320 KB
testcase_19 AC 38 ms
32,140 KB
testcase_20 AC 33 ms
28,112 KB
testcase_21 AC 41 ms
33,652 KB
testcase_22 AC 25 ms
23,476 KB
testcase_23 AC 37 ms
31,940 KB
testcase_24 AC 34 ms
28,576 KB
testcase_25 AC 33 ms
28,420 KB
testcase_26 AC 40 ms
34,220 KB
testcase_27 AC 37 ms
31,004 KB
testcase_28 AC 33 ms
28,572 KB
testcase_29 AC 37 ms
30,816 KB
testcase_30 AC 29 ms
26,248 KB
testcase_31 AC 35 ms
29,936 KB
testcase_32 AC 26 ms
23,552 KB
testcase_33 AC 41 ms
33,912 KB
testcase_34 AC 32 ms
27,016 KB
testcase_35 AC 35 ms
30,436 KB
testcase_36 AC 34 ms
29,376 KB
testcase_37 AC 33 ms
28,812 KB
testcase_38 AC 32 ms
27,896 KB
testcase_39 AC 39 ms
33,124 KB
testcase_40 AC 40 ms
33,392 KB
testcase_41 AC 37 ms
30,936 KB
testcase_42 AC 40 ms
33,780 KB
testcase_43 AC 32 ms
27,376 KB
testcase_44 AC 39 ms
32,956 KB
testcase_45 AC 41 ms
34,288 KB
testcase_46 AC 31 ms
27,104 KB
testcase_47 AC 41 ms
34,224 KB
testcase_48 AC 30 ms
26,116 KB
testcase_49 AC 40 ms
33,644 KB
testcase_50 AC 31 ms
26,988 KB
testcase_51 AC 26 ms
23,300 KB
testcase_52 AC 39 ms
33,184 KB
testcase_53 AC 30 ms
24,984 KB
testcase_54 AC 40 ms
33,124 KB
testcase_55 AC 25 ms
23,160 KB
testcase_56 AC 30 ms
26,004 KB
testcase_57 AC 38 ms
31,916 KB
testcase_58 AC 32 ms
27,788 KB
testcase_59 AC 34 ms
29,868 KB
testcase_60 AC 40 ms
34,172 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#pragma GCC optimize("O3")

#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif

#pragma region Macros

#define FOR(i, l, r) for(int i = (l) ;i < (r) ;i++)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n+1)
#define RFOR(i, l, r) for(int i = (l) ; i >= (r) ; i--)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPS(i, n) RFOR(i, n , 1)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template <class T = int>
using V = vector<T>;
template <class T = int>
using VV = V<V<T>>;
#define ll long long
using ld = long double;
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

#define VEC(type, name, size) \
	V<type> name(size);       \
	INPUT(name)
#define VVEC(type, name, h, w)    \
	VV<type> name(h, V<type>(w)); \
	INPUT(name)
#define INT(...)     \
	int __VA_ARGS__; \
	INPUT(__VA_ARGS__)
#define LL(...)     \
	ll __VA_ARGS__; \
	INPUT(__VA_ARGS__)
#define STR(...)        \
	string __VA_ARGS__; \
	INPUT(__VA_ARGS__)
#define CHAR(...)     \
	char __VA_ARGS__; \
	INPUT(__VA_ARGS__)
#define DOUBLE(...)     \
	DOUBLE __VA_ARGS__; \
	INPUT(__VA_ARGS__)
#define LD(...)     \
	LD __VA_ARGS__; \
	INPUT(__VA_ARGS__)

void scan(int &a) { cin >> a;}
void scan(long long &a) { cin >> a;}
void scan(char &a) { cin >> a;}
void scan(double &a) { cin >> a;}
void scan(long double &a) { cin >> a;}
void scan(char a[]) { scanf("%s", a);}
void scan(string &a) { cin >> a;}
template <class T>
void scan(V<T> &);
template <class T, class L>
void scan(pair<T, L> &);
template <class T>
void scan(V<T> &a){
	for(auto &i : a) scan(i);
}
template <class T, class L>
void scan(pair<T, L> &p){
	scan(p.first);
	scan(p.second);
}
template <class T>
void scan(T &a) { cin >> a;}
void INPUT() {}
template <class Head, class... Tail>
void INPUT(Head &head, Tail &... tail){
	scan(head);
	INPUT(tail...);
}
template <class T>
inline void print(T x) { cout << x << '\n'; }
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
	is >> p.first >> p.second;
	return is;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
	os << p.first << " " << p.second;
	return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
	for(T &in : v) is >> in;
	return is;
}
template <class T>
ostream &operator<<(ostream &os, const V<T> &v) {
	REP(i, SZ(v)) {
		if(i) os << " ";
		os << v[i];
	}
	return os;
}
//debug
template <typename T>
void view(const V<T> &v) {
	cerr << "{ ";
	for(const auto &e : v) {
		cerr << e << ", ";
	}
	cerr << "\b\b }";
}
template <typename T>
void view(const VV<T> &vv) {
	cerr << "{\n";
	for(const auto &v : vv) {
		cerr << "\t";
		view(v);
		cerr << "\n";
	}
	cerr << "}";
}
template <typename T, typename U>
void view(const V<pair<T, U>> &v) {
	cerr << "{\n";
	for(const auto &c : v) cerr << "\t(" << c.first << ", " << c.second << ")\n";
	cerr << "}";
}
template <typename T, typename U>
void view(const map<T, U> &m) {
	cerr << "{\n";
	for(auto &t : m) cerr << "\t[" << t.first << "] : " << t.second << "\n";
	cerr << "}";
}
template <typename T, typename U>
void view(const pair<T, U> &p) { cerr << "(" << p.first << ", " << p.second << ")"; }
template <typename T>
void view(const set<T> &s) {
	cerr << "{ ";
	for(auto &t : s) {
		view(t);
		cerr << ", ";
	}
	cerr << "\b\b }";
}
template <typename T>
void view(T e) { cerr << e; }
#ifdef LOCAL
void debug_out() {}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
	view(H);
	cerr << ", ";
	debug_out(T...);
}
#define debug(...)                                           \
	do {                                                     \
		cerr << __LINE__ << " [" << #__VA_ARGS__ << "] : ["; \
		debug_out(__VA_ARGS__);                              \
		cerr << "\b\b]\n";                                   \
	} while(0)
#else
#define debug(...) (void(0))
#endif
template <class T>
V<T> press(V<T> &x) {
	V<T> res = x;
	sort(all(res));
	res.erase(unique(all(res)), res.end());
	REP(i, SZ(x)) {
		x[i] = lower_bound(all(res), x[i]) - res.begin();
	}
	return res;
}
template <class T>
inline bool chmin(T &a, T b) {
	if(a > b) {
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b) {
	if(a < b) {
		a = b;
		return true;
	}
	return false;
}
inline void Yes(bool b = true) { cout << (b ? "Yes" : "No") << '\n'; }
inline void YES(bool b = true) { cout << (b ? "YES" : "NO") << '\n'; }
inline void err(bool b = true) {
	if(b) {
		cout << -1 << '\n';
		exit(0);
	}
}
template <class T>
inline void fin(bool b = true, T e = 0) {
	if(b) {
		cout << e << '\n';
		exit(0);
	}
}
template <class T>
T divup(T x, T y) { return (x + (y - 1)) / y; }
template <typename T>
T pow(T a, long long n, T e = 1) {
	T ret = e;
	while(n) {
		if(n & 1) ret *= a;
		a *= a;
		n >>= 1;
	}
	return ret;
}
struct iofast {
	iofast() {
		ios_base::sync_with_stdio(false);
		cin.tie(nullptr);
		cout << fixed << setprecision(15);
	}
} iofast_;
const int inf = 1e9;
const ll INF = 1e18;
#pragma endregion


inline int topbit(unsigned long long x){
	return x?63-__builtin_clzll(x):-1;
}

inline int popcount(unsigned long long x){
	return __builtin_popcountll(x);
}

inline int parity(unsigned long long x){//popcount%2
	return __builtin_parity(x);
}
const ll mod = 1e9+7;

struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
 
  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
  vector<mint> fact, ifact;
  combination(ll n):fact(n+1),ifact(n+1) {
    assert(n < mod);
    fact[0] = 1;
    for (ll i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (ll i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(ll n, ll k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
  mint p(ll n, ll k) {
    return fact[n]*ifact[n-k];
  }
} c(1000005);

int main(){
    LL(N,K,M);
    if(N==1){
        cout << 1 << endl;
        return 0;
    }
    mint sum=0;
    V<mint> p(N+1),q(N+1);
    p[0]=1,q[0]=1;
    REP(i,N){
        p[i+1]=p[i]*(i+1);
        q[i+1]=q[i]*N;
    }
    for(ll i=1;i<=N;i++){
        if(K%i==0){
            mint a=p[N];
            a/=N;
            a/=p[N-i];
            a*=q[N-i];
            sum+=a;
        }
    }
    if(M==1) cout << sum << endl;
    else{
        mint ans=q[N]-sum;
        ans/=(N-1);
        cout << ans << endl;
    }
    return 0;
}
0