Cod sursa(job #1193096)
| Utilizator |  Mircea Octavian Mirc100 |
Data | 30 mai 2014 23:01:23 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
#include<iostream>
using namespace std;
long cmmdc(long a, long b){
int r=a%b;
while(r){
a=b;
b=r;
r=a%b;
}
return b;
}
int main(){
int n;
long x,y;
ifstream fin("euclid.in");
ofstream fout("euclid.out");
fin>>n;
for(int i=1;i<=n;i++){
fin>>x>>y;
fout<<cmmdc(x,y)<<endl;
}
fout.close();
}
