Cod sursa(job #1991065)
Utilizator | Ionita Sergiu1256 | Data | 14 iunie 2017 20:38:21 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
class Fuckyou {
struct my {
int a, b;
} v[100100];
int n;
public:
inline int cmmdc(int x,int y) {
if (y == 0) return x;
return cmmdc(y, x%y);
}
inline void fuck() {
fin >> n;
for (int i(1);i <= n;i++)
fin >> v[i].a >> v[i].b;
for (int j(1);j <= n;j++)
fout << cmmdc(v[j].a,v[j].b);
}
};
int main() {
Fuckyou n;
n.fuck();
return 0;
}