Cod sursa(job #2851627)
Utilizator | Data | 18 februarie 2022 22:07:27 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int sht(int a, int b)
{
while(a != b)
{
if(a > b)
a -= b;
else
b -= a;
}
return a;
}
int i, N, v[214748364];
int main()
{
f>>N;
for(i = 1; i<= 2 * N; i = i+2)
{
f>>v[i]>>v[i+1];
g<<sht(v[i], v[i+1])<<endl;
}
f.close();
g.close();
}