Cod sursa(job #1989247)
Utilizator | Data | 6 iunie 2017 17:12:37 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a,int b)
{
int c;
while (b!=0)
{
c=a%b;
a=b;
b=c;
}
return a;
}
int main()
{
int n,a,b;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>n;
for(int i=1; i<=n; ++i)
{
f>>a>>b;
g<<gcd(a,b)<<'\n';
}
return 0;
}