Cod sursa(job #1112504)
Utilizator | Data | 19 februarie 2014 20:01:09 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int a,int b)
{while(a!=b)
if(a>b)
a-=b;
else b-=a;
return a;}
int main()
{int a,b,n;
f>>n;
for(int i=1;i<=n;i++)
{f>>a>>b;
g<<cmmdc(a,b)<<endl;}
f.close();
g.close();
return 0;}