Cod sursa(job #2658700)
| Utilizator | Data | 14 octombrie 2020 20:16:22 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
#include <list>
#include <map>
#include <math.h>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int a, int b)
{
if(!b)return a;
return cmmdc(b, a%b);
}
int main(){
int n;
f>>n;
for(int i=1;i<=n;i++)
{
int a , b;
f>>a>>b;
g<<cmmdc(a, b)<<endl;
}
return 0;
}
