C Program to find LCM of given numers using Recursion?

Question

Given an array of integers (possibly some of the elements negative), write a C program to find out the *maximum product* possible by adding 'n' consecutive integers in the array, n <= ARRAY_SIZE.

Also give where in the array this sequence of n integers starts.

Answer 1

CODE:

#include<stdio.h>

int lcm(int,int);

int main(){
  int a,b,l;

  printf("Enter any two positive integers ");
  scanf("%d%d",&a,&b);

  if(a>b)
    l = lcm(a,b);
  else
    l = lcm(b,a);

  printf("LCM of two integers is %d",l);
  return 0;
 }

int lcm(int a,int b){
  static int temp = 1;

  if(temp % b == 0 && temp % a == 0)
     return temp;

  temp++;
  lcm(a,b);

  return temp;
 }

Sample output:
Enter any two positive integers 5 2
LCM of two integers is 10

Comments

Thanks  Shivaranjini