Cod sursa(job #2433700)
Utilizator | Data | 28 iunie 2019 17:03:48 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
int main()
{
int n,i,a,b,k;
ifstream f ("euclid2.in");
ofstream g ("euclid2.out");
f>>n;
for(i=0;i<n;i++)
{
f>>a>>b;
if(a<b) swap(a,b);
k=a - (a/b)*b;
while(k)
{
a=b;
b=k;
k=a - (a/b)*b;
}
g<<b<<endl;}
return 0;
}