結果
| 問題 | No.1259 スイッチ |
| コンテスト | |
| ユーザー |
 suta28407928
|
| 提出日時 | 2020-10-16 23:35:56 |
| 言語 | C++14 (gcc 15.2.0 + boost 1.89.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 4,003 bytes |
| 記録 | |
| コンパイル時間 | 1,539 ms |
| コンパイル使用メモリ | 112,832 KB |
| 最終ジャッジ日時 | 2026-04-03 02:49:28 |
| 合計ジャッジ時間 | 3,012 ms |
|
ジャッジサーバーID （参考情報） |
judge3_0 / judge2_1 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp:74:16: error: 'std::uint_fast64_t' has not been declared
74 | template <std::uint_fast64_t Modulus> class modint {
| ^~~~~~~~~~~~~
main.cpp:22:1: note: 'std::uint_fast64_t' is defined in header '<cstdint>'; this is probably fixable by adding '#include <cstdint>'
21 | #include <complex>
+++ |+#include <cstdint>
22 | using namespace std;
main.cpp:75:20: error: 'uint_fast64_t' in namespace 'std' does not name a type [-Wtemplate-body]
75 | using u64 = std::uint_fast64_t;
| ^~~~~~~~~~~~~
main.cpp:75:15: note: 'std::uint_fast64_t' is defined in header '<cstdint>'; this is probably fixable by adding '#include <cstdint>'
75 | using u64 = std::uint_fast64_t;
| ^~~
main.cpp:78:3: error: 'u64' does not name a type [-Wtemplate-body]
78 | u64 a;
| ^~~
main.cpp:80:26: error: 'u64' does not name a type [-Wtemplate-body]
80 | constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
| ^~~
main.cpp:81:13: error: 'u64' does not name a type [-Wtemplate-body]
81 | constexpr u64 &value() noexcept { return a; }
| ^~~
main.cpp:82:19: error: 'u64' does not name a type [-Wtemplate-body]
82 | constexpr const u64 &value() const noexcept { return a; }
| ^~~
main.cpp: In function 'int main()':
main.cpp:161:9: error: 'mint' was not declared in this scope; did you mean 'uint'?
161 | mint ans = 0;
| ^~~~
| uint
main.cpp:164:21: error: expected ';' before 'cnt'
164 | mint cnt = com(n-1,i-1) * fac[i-1];
| ^~~~
| ;
main.cpp:165:17: error: 'cnt' was not declared in this scope; did you mean 'int'?
165 | cnt *= modpow(n,n-i,mod);
| ^~~
| int
main.cpp:166:17: error: 'ans' was not declared in this scope; did you mean 'abs'?
166 |
ソースコード
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <ctime>
#include <complex>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 1020000;
ll dy[8] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-10;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
if(a>b){
a = b; return true;
}
else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
if(a<b){
a = b; return true;
}
else return false;
}
template<typename T> inline void print(T &a){
for(auto itr = a.begin(); itr != a.end(); itr++){
cout << *itr << " ";
}
cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){
cout << "debug: " << a << " " << b << "\n";
}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
cout << "debug: " << a << " " << b << " " << c << "\n";
}
void mark() {cout << "#" << "\n";}
ll pcount(ll x) {return __builtin_popcountll(x);}
const int mod = 1e9 + 7;
//const int mod = 998244353;
template <std::uint_fast64_t Modulus> class modint {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
constexpr u64 &value() noexcept { return a; }
constexpr const u64 &value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr modint &operator/=(modint rhs) noexcept {
u64 exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
using mint = modint<mod>;
vector<ll> fac(MAX), finv(MAX), inv(MAX);
void comInit(){
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for(ll i=2; i<MAX; i++){
fac[i] = fac[i-1]*i % mod;
inv[i] = mod - inv[mod%i] * (mod/i) % mod;
finv[i] = finv[i-1] * inv[i] % mod;
}
}
ll com(ll n, ll k){
if(n < k) return 0;
if(n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n-k] % mod) % mod;
}
ll modpow(ll x, ll n, ll mod){
ll res = 1;
while(n > 0){
if(n & 1) res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
int main(){
ll n,k,m; cin >> n >> k >> m;
comInit();
mint ans = 0;
for(int i=n; i>=1; i--){
if(k % i != 0) continue;
mint cnt = com(n-1,i-1) * fac[i-1];
cnt *= modpow(n,n-i,mod);
ans += cnt;
}
if(m == 1) cout << ans.value() << "\n";
else{
mint as = modpow(n,n,mod);
ans = (as - ans) / (n-1);
cout << ans.value() << "\n";
}
}