답안 #152309

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
152309 2019-09-07T11:16:31 Z cheetose Asceticism (JOI18_asceticism) C++11
100 / 100
15 ms 2040 KB
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

ll fac[100002];
ll inv[100002];
ll nCr(int n, int r)
{
	if(r>n)return 0;
	ll c = fac[n];
	c = (c*inv[r]) % MOD;
	c = (c*inv[n - r]) % MOD;
	return c;
}
int main() {
	int n,k;
	scanf("%d%d",&n,&k);
	k--;
	fac[0] = inv[0] = 1;
	fup(i, 1, 100001, 1)
		fac[i] = (fac[i - 1] * i) % MOD;
	inv[100001] = POW(fac[100001], MOD - 2);
	fdn(i, 100000, 1, 1)
		inv[i] = (inv[i + 1] * (i+1)) % MOD;
	ll ans=0;
	fup(i,0,k,1)
	{
		ll t=(nCr(n+1,i)*POW(k+1-i,n))%MOD;
		if(i&1)ans=(ans-t)%MOD;
		else ans=(ans+t)%MOD;
		if(ans<0)ans+=MOD;
	}
	printf("%lld",ans);
}

Compilation message

asceticism.cpp: In function 'int main()':
asceticism.cpp:75:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&k);
  ~~~~~^~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1912 KB Output is correct
2 Correct 5 ms 1912 KB Output is correct
3 Correct 5 ms 1912 KB Output is correct
4 Correct 5 ms 1912 KB Output is correct
5 Correct 5 ms 1912 KB Output is correct
6 Correct 5 ms 1912 KB Output is correct
7 Correct 5 ms 1912 KB Output is correct
8 Correct 5 ms 1912 KB Output is correct
9 Correct 5 ms 1916 KB Output is correct
10 Correct 5 ms 1912 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1912 KB Output is correct
2 Correct 5 ms 1912 KB Output is correct
3 Correct 5 ms 1912 KB Output is correct
4 Correct 5 ms 1912 KB Output is correct
5 Correct 5 ms 1912 KB Output is correct
6 Correct 5 ms 1912 KB Output is correct
7 Correct 5 ms 1912 KB Output is correct
8 Correct 5 ms 1912 KB Output is correct
9 Correct 5 ms 1916 KB Output is correct
10 Correct 5 ms 1912 KB Output is correct
11 Correct 5 ms 1912 KB Output is correct
12 Correct 5 ms 1912 KB Output is correct
13 Correct 5 ms 1916 KB Output is correct
14 Correct 5 ms 1912 KB Output is correct
15 Correct 5 ms 1936 KB Output is correct
16 Correct 4 ms 1912 KB Output is correct
17 Correct 5 ms 1912 KB Output is correct
18 Correct 5 ms 1912 KB Output is correct
19 Correct 5 ms 1988 KB Output is correct
20 Correct 5 ms 1912 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1912 KB Output is correct
2 Correct 5 ms 1912 KB Output is correct
3 Correct 5 ms 1912 KB Output is correct
4 Correct 5 ms 1912 KB Output is correct
5 Correct 5 ms 1912 KB Output is correct
6 Correct 5 ms 1912 KB Output is correct
7 Correct 5 ms 1912 KB Output is correct
8 Correct 5 ms 1912 KB Output is correct
9 Correct 5 ms 1916 KB Output is correct
10 Correct 5 ms 1912 KB Output is correct
11 Correct 5 ms 1912 KB Output is correct
12 Correct 5 ms 1912 KB Output is correct
13 Correct 5 ms 1916 KB Output is correct
14 Correct 5 ms 1912 KB Output is correct
15 Correct 5 ms 1936 KB Output is correct
16 Correct 4 ms 1912 KB Output is correct
17 Correct 5 ms 1912 KB Output is correct
18 Correct 5 ms 1912 KB Output is correct
19 Correct 5 ms 1988 KB Output is correct
20 Correct 5 ms 1912 KB Output is correct
21 Correct 5 ms 1912 KB Output is correct
22 Correct 5 ms 1912 KB Output is correct
23 Correct 5 ms 1912 KB Output is correct
24 Correct 5 ms 2040 KB Output is correct
25 Correct 5 ms 1912 KB Output is correct
26 Correct 5 ms 1912 KB Output is correct
27 Correct 5 ms 1908 KB Output is correct
28 Correct 5 ms 1912 KB Output is correct
29 Correct 5 ms 1912 KB Output is correct
30 Correct 5 ms 1912 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1912 KB Output is correct
2 Correct 5 ms 1912 KB Output is correct
3 Correct 5 ms 1912 KB Output is correct
4 Correct 5 ms 1912 KB Output is correct
5 Correct 5 ms 1912 KB Output is correct
6 Correct 5 ms 1912 KB Output is correct
7 Correct 5 ms 1912 KB Output is correct
8 Correct 5 ms 1912 KB Output is correct
9 Correct 5 ms 1916 KB Output is correct
10 Correct 5 ms 1912 KB Output is correct
11 Correct 5 ms 1912 KB Output is correct
12 Correct 5 ms 1912 KB Output is correct
13 Correct 5 ms 1916 KB Output is correct
14 Correct 5 ms 1912 KB Output is correct
15 Correct 5 ms 1936 KB Output is correct
16 Correct 4 ms 1912 KB Output is correct
17 Correct 5 ms 1912 KB Output is correct
18 Correct 5 ms 1912 KB Output is correct
19 Correct 5 ms 1988 KB Output is correct
20 Correct 5 ms 1912 KB Output is correct
21 Correct 5 ms 1912 KB Output is correct
22 Correct 5 ms 1912 KB Output is correct
23 Correct 5 ms 1912 KB Output is correct
24 Correct 5 ms 2040 KB Output is correct
25 Correct 5 ms 1912 KB Output is correct
26 Correct 5 ms 1912 KB Output is correct
27 Correct 5 ms 1908 KB Output is correct
28 Correct 5 ms 1912 KB Output is correct
29 Correct 5 ms 1912 KB Output is correct
30 Correct 5 ms 1912 KB Output is correct
31 Correct 5 ms 1912 KB Output is correct
32 Correct 5 ms 1912 KB Output is correct
33 Correct 5 ms 1912 KB Output is correct
34 Correct 6 ms 1912 KB Output is correct
35 Correct 13 ms 1912 KB Output is correct
36 Correct 14 ms 1912 KB Output is correct
37 Correct 15 ms 1912 KB Output is correct
38 Correct 6 ms 1912 KB Output is correct
39 Correct 8 ms 1912 KB Output is correct
40 Correct 9 ms 1912 KB Output is correct