2021-03-25

2021/3/25
【蓝桥杯】历届试题 带分数

http://lx.lanqiao.cn/problem.page?gpid=T26#submitpanel

只有9位数,直接next_permutation暴力穷尽即可,就是模拟的过程有些麻烦

#include<iostream>
#include<algorithm>
#include<cstring>
#define ll long long
#define mm msmset
using namespace std;
//======================================


ll n;
int arr[9]={1,2,3,4,5,6,7,8,9};
bool fenshu(ll temp,int x)
{
	ll sum=0,p=0;
	ll pow10=1;
	for(int i=x;i<9;i++)
		{ 
		sum=sum*10+arr[i];
		pow10*=10;
		}
	for(int i=x;i<9;i++)
	{
		pow10/=10;
		sum%=pow10;
		p=p*10+arr[i];
		if(temp*sum+p==n*sum) return true;
	}
	return false;
}
bool adjust()
{
	ll temp=0;
	for(int i=0;i<n;i++)
	{
	temp=temp*10+arr[i];
	if(temp>n) break;
	if(fenshu(temp,i+1)) return true;
	}
	return false;
}
int ans=0;
int main()
{
 	cin>>n;
 	do
 	{
 		if(adjust()) ans++;
	 }while(next_permutation(arr,arr+9));
	 cout<<ans;
	 return 0;
}