//
// 114_gcd.cpp
// changlle
//
// Created by user on 1/4/16.
// Copyright (c) 2016 user. All rights reserved.
//
#include <iostream>
using namespace std;
int gcd (int a, int b) {
if (b==0) return a;
return gcd(b,a%b);
}
int main() {
int a=2458;
int b=34356;
cout<<gcd(a,b)<<endl;
return 0;
}
114_辗转相除法
最新推荐文章于 2023-04-21 15:36:38 发布