Cod sursa(job #3315320)
| Utilizator | Data | 13 octombrie 2025 20:10:42 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
int euclid(int a, int b);
int main()
{
int i, n, a, b;
fin>>n;
for(i = 1; i <= n; i++)
{
fin>>a>>b;
fout<<euclid(a, b)<<'\n';
}
return 0;
}
int euclid(int a, int b)
{
int r;
while(b)
{
r = a % b;
a = b;
b = r;
}
return a;
}
