Cod sursa(job #2426986)
| Utilizator | Data | 30 mai 2019 12:36:59 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <cmath>
#include <fstream>
#include <iomanip>
using namespace std;
int gcd(int m, int n)
{
while (m != 0)
{
int r = n % m;
n = m;
m = r;
}
return n;
}
int main()
{
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int t, v1[100001], v2[100001], aux;
fin >> t;
for (int i = 1; i <= t; i++)
{
fin >> v1[i] >> v2[i];
fout<<gcd(v1[i], v2[i])<<endl;
}
system("pause>nul");
}
