Cod sursa(job #2015371)
Utilizator | Data | 25 august 2017 22:44:55 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <bits/stdc++.h>
using namespace std;
FILE *F=fopen("euclid2.in", "r"), *G=fopen("euclid2.out", "w");
int n, x, y;
int main()
{
fscanf(F, "%d ", &n);
while(n--)
{
fscanf(F, "%d %d ",&x, &y);
fprintf(G, "%d\n", __gcd(x, y));
}
return 0;
}