Cod sursa(job #1901865)
Utilizator | Data | 4 martie 2017 11:39:13 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <cstdio>
using namespace std;
FILE *f=fopen("euclid2.in","r");
FILE *g=fopen("euclid2.out","w");
int gcd(int a,int b)
{
if(!b) return a;
return gcd(b,a%b);
}
int main()
{
int a,b;
int N;
fscanf(f,"%d",&N);
for(int i=1;i<=N;i++)
{
fscanf(f,"%d %d",&a,&b);
fprintf(g,"%d\n",gcd(a,b));
}
fclose(f);
fclose(g);
return 0;
}