fork download
copy 
  1. #include <stdio.h>
  2.  
  3. int gcd(int m,int n);
  4.  
  5. int main(){
  6.     int a,b;
  7.     scanf("%d %d",&a,&b);
  8.     printf("a=%d,b=%d\n",a,b);
  9.     printf("最大公約数は %d\n",gcd(a,b));
  10.     return 0;
  11. }
  12.  
  13. //m=51,n=273
  14. int gcd(int m,int n){
  15.     int r;
  16.  
  17.     r=n%m;
  18.  
  19.     printf("m=%d,n=%d,r=%d\n",m,n,r);
  20.     if(r==0){
  21.         return m;
  22.     }
  23.     else{
  24.         n=m;
  25.         m=r;
  26.         return gcd(m,n);
  27.     }
  28. }
Success #stdin #stdout 0s 5276KB
comments (?)
stdin
copy 
51 273
stdout
copy 
a=51,b=273
m=51,n=273,r=18
m=18,n=51,r=15
m=15,n=18,r=3
m=3,n=15,r=0
最大公約数は 3
https://ideone.com/x37rLb
language:
C (gcc 8.3)
created:
93 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!