Submission #1781200

---

Source Code Expand

#include<iostream>
#include<cctype>
#include<queue>
#include<cstdio>
#include<cmath>
#include<sstream>
#include<string>
#include<algorithm>
#include<cstring>
#include<vector>
#include<ctime>
#include<cstdlib>
#include<map>
#include<utility>
#include<iomanip>
#include<set>
#include<stack>
//#include<Windows.h>
using namespace std;
typedef long long ll;typedef pair<int,int> pii;
typedef pair<ll,ll> pll;typedef vector<string> vss;
typedef vector<int> vii;typedef vector<pii> vpi;
typedef vector<ll> vll;typedef vector<pll> vpl;
typedef unsigned long long ul;typedef queue<int> qii;typedef queue<pii> qpi;
int k,dis[100005];
priority_queue<pii,vector<pii>,greater<pii> > q;
int main()
{
	cin>>k;
	fill(dis,dis+k,1e9+7);
	q.push({1,1});dis[1]=1;
	while(!q.empty()){
		pii t=q.top();q.pop();
		if(dis[t.second]!=t.first) continue;
		for(int i=0;i<10;i++){
			int a=(t.second*10+i)%k;
			if(dis[a]>t.first+i){
				dis[a]=t.first+i;
				q.push(make_pair(dis[a],a));
			}
		}
	}
	cout<<dis[0]<<'\n';
	return 0;
}

Submission Info

Judge Result