Cod sursa(job #2501627)
Utilizator | Data | 30 noiembrie 2019 03:17:11 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
#include <string>
#include <cmath>
#include <algorithm>
const int MOD=20173333;
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int main()
{
long long int t,a,b,r;
f>>t;
for(int i=1;i<=t;i++)
{
f>>a>>b;
r=a%b;
while(r!=0)
{
a=b;
b=r;
r=a%b;
}
g<<b<<endl;
}
}