Pagini recente » Cod sursa (job #1808811) | Cod sursa (job #2577797) | Cod sursa (job #3292301) | Clasamentul arhivei de probleme | Cod sursa (job #2588727)
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
ifstream f("multiplu.in");
ofstream g("multiplu.out");
//struct nod{int info;nod *urm;}*vf=NULL;
//nod *p=NULL;
//void intro(int info){
//p=new nod;
//p->info=info;
//p->urm=vf;
//vf=p;
//}
//void traversare(){
//p=vf;
//while(p!=NULL){
// cout<<p->info<<" ";
// p=p->urm;}
//}
//void pop(){
// if(vf==NULL);
// else{
//p=vf;
//vf=vf->urm;
//delete p;
// }
//}
int main ()
{
bool h=true;
int n,m=1,a,b,c1=1,c2=1,r1,r2,t1=0,t2=0;
f>>a>>b;
while(h){
c1=m*10;
c2=m*10+1;
r1=0;r2=0;
r1=c1%a;
r2=c1%b;
t1=r1+r2;
r1=0;r2=0;
r1=c2%a;
r2=c2%b;
t2=r1+r2;
if(t1>t2) m=c2;
if(t1<t2) m=c1;
if(m%a==0 && m%b==0) h=false;
}
g<<m;
}