Cod sursa(job #1987641)
| Utilizator | Data | 31 mai 2017 14:24:13 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int i,n,a,b;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>n;
for (i=1;i<=n;i++)
{
int c;
f>>a>>b;
while(b)
{
c=a%b;
a=b;
b=c;
}
g<<a<<"\n";
}
return 0;
}
