Cod sursa(job #1344556)
Utilizator | Data | 16 februarie 2015 20:19:57 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in" );
ofstream g("euclid2.out");
int magic(long int a,long int b){
while(a%b!=0){
long int rest=a%b;
a=b;
b=rest;
} g<<b<<endl;
return 1;
}
int main()
{
int n;f>>n;
for( int i=0;i<n;i++){
long int a,b;
f>>a>>b;
magic(a,b);
}
}