Program to calculate GCD using Euclid algorithm

gcd_euclid

#include <stdio.h>

int gcd(int l,int s){
  if(l%s==0){
    return s;
  }

  int q=l/s;
  int r=l%s;
  gcd(s,r);
}

int main(int argc, char *argv[]){
  if(argc<3 || argc > 3 ){
    printf("Only two integer arguments are allowed.\n");
    return 1;
  }
  
  // Program starts here :
  int a=atoi(argv[1]);
  int b=atoi(argv[2]);
  
  int s=a<b?a:b;
  int l=a+b-s;
  
  int res=gcd(l,s);
  printf("Result is : %d\n",res);

  return 0;
}