Cod sursa(job #721256)
Utilizator | Data | 23 martie 2012 14:57:27 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int n , x , y , i;
void cmmdc(int a , int b)
{
int c;
while(b)
{
c=a%b;
a=b;
b=c;
}
out<<a<<"\n";
}
int main()
{
in>>n;
for(i=1;i<=n;i++)
{
in>>x>>y;
cmmdc(x,y);
}
return 0;
}