Cod sursa(job #1000769)
Utilizator | Data | 23 septembrie 2013 18:41:51 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int gcd(int a, int b)
{
while(a!=b){
if(a>b)
a = a-b;
else
b=b-a;
}
return a;
}
int main()
{
int n;
fin >> n;
for(int i=0;i<n;i++){
int a,b;
fin >> a;
fin >> b;
fout << gcd(a,b) << '\n';
}
return 0;
}