Cod sursa(job #1006903)
Utilizator | Data | 7 octombrie 2013 21:30:53 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int T, i, a, b;
int divcom(int a, int b){
while(b!=0){
if(a>b)
a=a-b;
else
a=b-a;
}
return a;
}
int main(){
fin>>T;
for(i=1; i<T; i++)
fin>>a;
fin>>b;
divcom(a, b);
return 0;
}