Cod sursa(job #1274087)
Utilizator | Data | 23 noiembrie 2014 11:59:05 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
long long cmmdc(long long x, long long y)
{
while(x!=0 && y!=0)
if(x>y)
x=x%y;
else
y=y%x;
return x+y;
}
int t,i;
long long x,y;
int main()
{
f>>t;
for(i=1;i<=t;i++)
{
f>>x>>y;
g<<cmmdc(x,y)<<"\n";
}
}