全排列
#include<stdio.h>
#include<iostream>
#include<map>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<vector>
#define ll long long
using namespace std;
int a[10]={0,1,2,3,4,5,6,7,8,9};
bool check()
{
if(a[1]<=a[0]||a[2]<=a[0])
{
return 0;
}
if(a[3]<=a[1]||a[4]<=a[1])
{
return 0;
}
if(a[4]<=a[2]||a[5]<=a[2])
{
return 0;
}
if(a[6]<=a[3]||a[7]<=a[3])
{
return 0;
}
if(a[7]<=a[4]||a[8]<=a[4])
{
return 0;
}
if(a[8]<=a[5]||a[9]<=a[5])
{
return 0;
}
return 1;
}
int main()
{
int ans=0;
do
{
if(check()) ans++;
}while(next_permutation(a,a+10));
printf("%d\n",ans);
return 0;
}