Submission #1781204

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cmath>
#include <stdio.h>
#include <deque> 
#include <stdlib.h>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <string.h>
#include <stack>
#define Endl endl
#define mp make_pair
#define rep(N) for(int i=0;i<N;i++)
#define repj(N) for(int j=0;j<N;j++)
#define ll long long 
#define pii pair<int,int>
#define For(I,N) for(int I=0;I<N;I++)
#define cinone(N) int N;cin>>N;
#define scanfone(N) int N;cin>>N;
#define cingroup(N,M) int N[M];for(int yiuytvnm=0;yiuytvnm<M;yiuytvnm++) cin>>N[yiuytvnm];
#define scanfgroup(N,M) int N[M];for(int qrwuoiq=0;qrwuoiq<M;qrwuoiq++) scanf("%d",&N[qrwuoiq]);
typedef unsigned long long ull;
using namespace std;
priority_queue <int,vector<int>,greater<int> > que;
int dist[100005];

int main()
{
//	freopen("input.txt","r",stdin);
	int n;
	cin>>n;
	memset(dist,0x3f,sizeof(dist));
	que.push(1);
	dist[1]=1;
//	for(int i=1;i<10;i++)
//	{
//		que.push(i%n);
//		dist[i%n]=i;
//	}
	while(que.size())
	{
		int now=que.top();
		que.pop();
		for(int i=0;i<10;i++)
		{
			int x=(now*10+i)%n;
			if(dist[x]>dist[now]+i)
			{
				dist[x]=dist[now]+i;
				que.push(now);
			}
		}
	}
	cout<<dist[0]<<endl;
	return 0;
}

Submission Info

Judge Result