Cod sursa(job #1193121)
| Utilizator | Data | 30 mai 2014 23:26:32 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
long cmmdc(long a,long b){
if(b==0)
return a;
long r=a%b;
while(r){
a=b;
b=r;
r=a%b;
}
return b;
}
int main(){
int n;
long a,b;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
fin>>n;
for(int i=1;i<=n;i++){
fin>>a>>b;
fout<<cmmdc(a,b)<<'\n';
}
return 0;
}
