大意:
问你有多少种方法使 n n n 个棋子同一列,同一行。
思路:
错排和高精度
此题就是将 P1595 加上了高精度。
错排模板:
f[0] = 1;
f[1] = 0;
for(int i = 2;i <= n;i++){
f[i] = (i - 1) * (f[i - 1] + f[i - 2]);
}
高精度模板:
void add(int m){//高精乘和高精加,把f[i] = (i - 1) * (f[i - 1] + f[i - 2]) 高精化
int x = 0;
for(int i = 1;i < 100001;i++){//高精加
f[m][i] = f[m - 1][i] + f[m - 2][i] + x;
x = f[m][i] / 10;
f[m][i] %= 10;
}
x = 0;
for(int i = 1;i < 100001;i++){//高精乘
f[m][i] = f[m][i] * (m - 1) + x;
x = f[m][i] / 10;
f[m][i] %= 10;
}
}
代码:
代码 1:
#include<bits/stdc++.h>//直接高精计算
using namespace std;
int n;
int f[201][100001];
void add(int m){//高精
int x = 0;
for(int i = 1;i < 100001;i++){//高精加
f[m][i] = f[m - 1][i] + f[m - 2][i] + x;
x = f[m][i] / 10;
f[m][i] %= 10;
}
x = 0;
for(int i = 1;i < 100001;i++){//高精乘
f[m][i] = f[m][i] * (m - 1) + x;
x = f[m][i] / 10;
f[m][i] %= 10;
}
}
int main(){
scanf("%d",&n);
f[2][1] = 1;//正在初始化
if(n == 1||n == 2){//特判
printf("%d",n - 1);
return 0;
}
for(int i = 3;i <= n;i++){//递推中
add(i);
}
int a = 100001;//位数弄大点
while(f[n][a] == 0){//去前缀0
a--;
}
while(a){//输出
printf("%d",f[n][a--]);
}
return 0;
}
代码 2 (重载运算符):
#include<bits/stdc++.h>
using namespace std;
const int MAXN=5005;
struct bign {//重载运算符模板
int len, s[MAXN];
bign () {
memset(s, 0, sizeof(s));
len = 1;
}
bign (int num) {
*this = num;
}
bign (const char *num) {
*this = num;
}
bign operator = (const int num) {
char s[MAXN];
sprintf(s, "%d", num);
*this = s;
return *this;
}
bign operator = (const char *num) {
for(int i = 0; num[i] == '0'; num++) ;
len = strlen(num);
for(int i = 0; i < len; i++) s[i] = num[len-i-1] - '0';
return *this;
}
bign operator + (const bign &b) const {
bign c;
c.len = 0;
for(int i = 0, g = 0; g || i < max(len, b.len); i++) {
int x = g;
if(i < len) x += s[i];
if(i < b.len) x += b.s[i];
c.s[c.len++] = x % 10;
g = x / 10;
}
return c;
}
void clean() {
while(len > 1 && !s[len-1]) len--;
}
bign operator * (const bign &b) {
bign c;
c.len = len + b.len;
for(int i = 0; i < len; i++) {
for(int j = 0; j < b.len; j++) {
c.s[i+j] += s[i] * b.s[j];
}
}
for(int i = 0; i < c.len; i++) {
c.s[i+1] += c.s[i]/10;
c.s[i] %= 10;
}
c.clean();
return c;
}
string str() const {
string res = "";
for(int i = 0; i < len; i++) res = char(s[i]+'0')+res;
return res;
}
};
ostream& operator << (ostream &out, const bign &x) {
out << x.str();
return out;
}
bign d[2001];
int n;
int main(){
cin >> n;
d[2] = 1;
for(int i = 3;i <= n;i++){
d[i] = (d[i - 1] + d[i - 2]) * (i - 1);
}
cout << d[n];
return 0;
}