Pagini recente » Cod sursa (job #2676986) | Cod sursa (job #1056308) | Cod sursa (job #1913172) | Cod sursa (job #2972396) | Cod sursa (job #1358822)
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <list>
#include <queue>
using namespace std;
int a,b,tests;
int gcd(int a, int b) {
int t;
while (b!=0) {
t = b;
b = b % a;
a = t;
}
return a;
}
int main(int argc, char **argv)
{
FILE *f = fopen("euclid2.in","r");
FILE *g = fopen("euclid2.out","w");
fscanf(f,"%d",&tests);
for (int t=0;t<tests;t++) {
fscanf(f,"%d%d",&a,&b);
fprintf(g,"%d\n",gcd(a,b));
}
return 0;
}