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