Cod sursa(job #1727936)
| Utilizator | Data | 11 iulie 2016 21:56:24 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <cstdio>
using namespace std;
int euclid(int a,int b)
{
while(a != b)
{
if(a > b)
a = a - b;
if(b > a)
b = b - a;
}
return a;
}
int main()
{ int p,n;
FILE *f=fopen("euclid2.in","r"),*g=fopen("euclid2.out","w");
fscanf(f,"%d",&n);
int x1,x2;
for(int i=1;i<=n;i++)
{
fscanf(f,"%d%d",&x1,&x2);
p=euclid(x1,x2);
fprintf(g,"%d",p); fprintf(g,"\n");
}
return 0;
}
