Cod sursa(job #1571773)
Utilizator | Data | 18 ianuarie 2016 15:03:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cmmdc.in");
ofstream g("cmmdc.out");
void Cmmdc(int a,int b)
{ int c;
while(b)
{ c=a%b;
a=b; b=c;
}
return a;
}
int main()
{ int i,x,y;
f>>n;
for(i=1;i<=n;i++)
{ f>>x>>y;
g<<Cmmdc(x,y);
}
return 0;
}