Cod sursa(job #3322147)
| Utilizator | Data | 12 noiembrie 2025 21:58:15 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<iostream>
#include <fstream>
using namespace std;
int main ()
{
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
int T,n1,n2,r;
fin>>T;
for(int i=1; i<=T; i++)
{
fin>>n1>>n2;
while(n2)
{
r=n1%n2;
n1=n2;
n2=r;
}
fout<<n1<<" ";
}
return 0;
}
