D24:divisor and multiple (divisor and multiple, translation + solution)

The original title is ：OpenJudge - 24:Divisor and Multiple

translate ：

describe ： Given D and M,D yes A、B The divisor of ,M yes A、B Multiple . seek A and B;
Input ： Two no more than 100 The positive integer D and M;
Output ： Two integers A and B.
Code ：

#include<iostream>
using namespace std;
int main()
{
	int d,m,i,f=1;
	cin>>d>>m;
	for(int i=2*d;i<m;i+=d)
		if(m%i==0){
			if(f){	
				cout<<i<<" ";
				f=0;
			}
			else{
				cout<<i;
				break;
			}
		}
	return 0;
}