Cod sursa(job #2423073)
Utilizator | Data | 20 mai 2019 18:44:26 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n;
void Citire()
{
f>>n;
int a,b;
while(n!=0)
{
n--;
f>>a>>b;
while(b)
{
int r=a%b;
a=b;
b=r;
}
g<<a<<endl;
}
}
int main()
{Citire();
cout << "Hello world!" << endl;
return 0;
}