Pagini recente » Cod sursa (job #979584) | Cod sursa (job #1017706) | ten1 | Cod sursa (job #70390) | Cod sursa (job #1056707)
#include <fstream>
#include <queue>
using namespace std;
ifstream in ("cifre4.in");
ofstream out("cifre4.out");
long long bfs (int n, int k)
{
queue<int> myQueue;
myQueue.push(2);
myQueue.push(3);
myQueue.push(5);
myQueue.push(7);
while (true)
{
long long nr = myQueue.front();
myQueue.pop();
if (nr > 5 * 1000000)
break;
myQueue.push(nr * 10 + 2);
myQueue.push(nr * 10 + 3);
myQueue.push(nr * 10 + 5);
myQueue.push(nr * 10 + 7);
if (nr % k == n)
return nr;
}
return -1;
}
int main()
{
out << bfs (51,1123);
}