Cod sursa(job #2140524)
| Utilizator | Data | 23 februarie 2018 16:22:06 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n;
long long a,b,d;
int euclid(int x,int y){
while(b!=0){
d=a%b;
a=b;
b=d;
}
return a;
}
int main(){
f>>n;
for(int i=1;i<=n;i++){
f>>a>>b;
g<<euclid(a,b)<<endl;
}
return 0;
}
