Submission #59217816


Source Code Expand

#include <bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using namespace atcoder;
#define all(a) a.begin(),a.end()
#define compress(a) sort(all(a));a.erase(unique(all(a)),a.end())
typedef long long ll;
typedef pair<ll,ll> P;
typedef modint1000000007 mi;
constexpr ll mod=1000000007;
ll n,b;
vector<ll>ans;
vector<ll>prod;

void dfs1(ll x,ll p,ll k){
	if(k==0){
		prod.push_back(p);
		return;
	}
	for(int i=x;i<=9;i++){
		dfs1(i,p*i,k-1);
	}
}

ll prod_dgt(ll x){
	ll res=1;
	while(x){
		res*=x%10;
		x/=10;
	}
	return res;
}

int main(){
	cin>>n>>b;
	string s=to_string(b);
	rep(i,s.size()){
		if(s[i]=='0'){
			ans.push_back(b);
			break;
		}
	}
	dfs1(1,1,11);
	compress(prod);

	for(auto e:prod){
		ll m=b+e;
		if(prod_dgt(m)==e)ans.push_back(m);
	}

	ll ret=0;
	for(auto e:ans){
		if(e<=n)ret++;
	}
	cout<<ret<<endl;

}

Submission Info

Submission Time
Task 025 - Digit Product Equation(★7)
User Rho17
Language C++ 20 (gcc 12.2)
Score 7
Code Size 930 Byte
Status AC
Exec Time 5 ms
Memory 4428 KiB

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:3:31: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
    3 | #define rep(i,n) for(int i=0;i<(n);i++)
      |                               ^
Main.cpp:38:9: note: in expansion of macro ‘rep’
   38 |         rep(i,s.size()){
      |         ^~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 7 / 7
Status
AC × 3
AC × 32
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
in01.txt AC 5 ms 4192 KiB
in02.txt AC 5 ms 4252 KiB
in03.txt AC 5 ms 4252 KiB
in04.txt AC 5 ms 4256 KiB
in05.txt AC 5 ms 4200 KiB
in06.txt AC 5 ms 4256 KiB
in07.txt AC 5 ms 4180 KiB
in08.txt AC 5 ms 4180 KiB
in09.txt AC 5 ms 4272 KiB
in10.txt AC 5 ms 4260 KiB
in11.txt AC 5 ms 4172 KiB
in12.txt AC 5 ms 4244 KiB
in13.txt AC 5 ms 4428 KiB
in14.txt AC 5 ms 4240 KiB
in15.txt AC 5 ms 4244 KiB
in16.txt AC 5 ms 4332 KiB
in17.txt AC 5 ms 4216 KiB
in18.txt AC 5 ms 4200 KiB
in19.txt AC 5 ms 4188 KiB
in20.txt AC 5 ms 4176 KiB
in21.txt AC 5 ms 4244 KiB
in22.txt AC 5 ms 4428 KiB
in23.txt AC 5 ms 4196 KiB
in24.txt AC 5 ms 4276 KiB
in25.txt AC 5 ms 4256 KiB
in26.txt AC 5 ms 4204 KiB
in27.txt AC 5 ms 4332 KiB
in28.txt AC 5 ms 4192 KiB
in29.txt AC 5 ms 4276 KiB
sample_01.txt AC 5 ms 4212 KiB
sample_02.txt AC 5 ms 4272 KiB
sample_03.txt AC 5 ms 4180 KiB