Cod sursa(job #2970069)
Utilizator | Data | 24 ianuarie 2023 11:32:51 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n;
struct {
int x,y;
}v[100005];
int euclid(int a,int b)
{
int r=a%b;
while(r)
{
a=b;
b=r;
r=a%b;
}
return b;
}
int main()
{
f>>n;
for(int i=1;i<=n;i++)
{
f>>v[i].x>>v[i].y;
g<<euclid(v[i].x,v[i].y)<<" ";
g<<"\n";
}
return 0;
}