Cod sursa(job #2277041)
Utilizator | Data | 5 noiembrie 2018 18:59:20 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
int i,T,s[200000];
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int euclid( int a, int b)
{
while(a != b)
{
if(a > b)
a = a - b;
if(b > a)
b = b - a;
}
return a;
}
int main() {
f>>T;
for(i=1;i<=T*2;i++)
f>>s[i];
for(i=1;i<T*2;i++)
{
g<<euclid(s[i],s[i+1])<<endl;
i++;
}
}