Cod sursa(job #1580179)
Utilizator | Data | 25 ianuarie 2016 17:34:50 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in" );
ofstream g("euclid2.out");
int cmmmdc(int a, int b)
{
while ( a!=b )
{
if ( a>b ) a-=b;
else b-=a;
}
return a;
}
int N,l,L;
int main()
{
f>>N;
for ( int i=1 ; i<=N ; i++ )
{
f>>l>>L;
g<<cmmmdc(l,L)<<'\n';
}
}