Cod sursa(job #663753)
Utilizator | Data | 18 ianuarie 2012 21:46:06 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream>
using namespace std;
int n,m,i,x,y;
int cmmdc(int a,int b)
{
int r;
r=a%b;
while(r)
{
a=b;
b=r;
r=a%b;
}
return b;
}
int main()
{
ifstream f("cmmdc.in");
ofstream g("cmmdc.out");
f>>n;
for(i=1;i<=n;i++)
{
f>>x>>y;
g<<cmmdc(x,y)<<"\n";
}
return 0;
}