Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

先贴一个bfs，再看看dfs

Posted by TSERROF at 2012-10-19 11:01:38 on Problem 1426

#include<iostream>
#include <queue>
using namespace std;
int n;
long long BFS()
{
	queue<long long>ans;
	while(!ans.empty())ans.pop();
	ans.push(1);
	while(!ans.empty())
	{
		if(ans.front()%n==0)return ans.front();
		long long temp=ans.front();
		ans.pop();
		ans.push(temp*10);
		ans.push(temp*10+1);
	}
	return 0;
}
int main()
{
	while(cin>>n && n)cout<<BFS()<<endl;
	return 0;
}

Followed by:

Re:先贴一个bfs，再看看dfs (470) TSERROF 2012-10-19 11:47:19
Re:改进了一点点，变成32ms 740kb了，虽然也不快 (499) TSERROF 2012-10-19 11:48:43
Re:DFS也过了，可是用了170ms，好吧 (221) TSERROF 2012-10-19 11:55:26

Post your reply here:

Home Page Go Back To top