Submission #19254

#	Time	Username	Problem	Language	Result	Execution time	Memory
19254		kaTkaHr	동전 (kriii4_E)	C++14	100 / 100	253 ms	2100 KiB

D

#include <stdio.h>
#include<vector>
#include <algorithm>
#include <map>

using namespace std;

typedef long long ll;

const int MX = 255, MM = 1000000007;

ll rv(ll A){
	ll R = 1, B = MM-2;
	while(B){
		if( B&1 ) R = R * A % MM;
		A = A * A % MM; B /= 2;
	}
	return R;
}

struct frac{
	ll A, B;
	frac(ll A):A(A), B(1){}
	frac(ll a, ll b){
		A = (a%MM+MM) % MM;
		B = (b%MM+MM) % MM;
	}
	frac(){A = 0, B = 1;}
	frac operator+ (const frac &l)const{
		return frac((A * l.B + B * l.A) % MM, B * l.B % MM);
	}
	frac operator*(const frac &l)const{
		return frac(A*l.A % MM, B*l.B % MM);
	}
	frac operator/(const frac &l)const{
		return frac(A*l.B % MM, B*l.A % MM);
	}
	frac operator- (const frac &l)const{
		return frac((A*l.B - B*l.A%MM + MM) % MM, B*l.B % MM);
	}
	ll v(){ return A * rv(B) % MM; }
};

frac T[MX][MX];

int main()
{
	int N;
	scanf("%d", &N);
	T[0][0] = 1;
	for(int i = 1; i <= N; i++){
		T[i][i] = 1;
		for(int j = 0; j <= N; j++){
			for(int k = 1; k <= i; k++){
				T[i][j] = T[i][j] + T[i-k][j^(k-1)];
			}
		}
	}
	printf("%lld\n", T[N][0].v());
}

• Subtask 1: 5 / 5
• Subtask 2: 95 / 95