Cod sursa(job #1419306)
Utilizator | Data | 15 aprilie 2015 12:36:07 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
int cmmdc(int a,int b)
{
int r;
while(b>0)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n,i,a,b;
f>>n;
for(i=0;i<n;i++)
{
f>>a>>b;
g<<cmmdc(a,b)<<endl;
}
f.close();
g.close();
return 0;
}