Codeforce 1139D Step to one(概率dp+容斥原理)
#include<iostream>
#include<cmath>
#include<ctime>
#include<cstdlib>
#include<cstdio>
using namespace std;
typedef long long ll;
const int N=1e5+10;
const ll mod=1e9+7;
ll dp[N];
int fac[20];
int p=1;
ll f(int n,int x)
{
..
原创
2020-12-04 00:12:33 ·
151 阅读 ·
0 评论