Cod sursa(job #2041796)
Utilizator | Data | 17 octombrie 2017 19:23:34 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n;
int a, b;
ifstream be("euclid2.in");
be>>n;
ofstream ki("euclid2.out");
for(int i = 0; i < n; i++)
{
be>>a>>b;
while(a)
{
if(a < b)
swap(a,b);
a = a % b;
}
ki<<b<<"\n";
}
return 0;
}