Cod sursa(job #275033)
Utilizator | Data | 10 martie 2009 10:19:15 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
long long t,a,b,n,i,r;
long long cmmdc(long long a,long long b)
{
while(b!=0){r=a%b; a=b; b=r; }
return a;
}
void ReadData()
{f>>n;
for(i=1;i<=n;i++)
{ f>>a>>b; t=cmmdc(a,b); g<<t<<endl;}
}
int main()
{ReadData();
f.close();
g.close();
return 0;}