Geometric progression


#include <stdio.h>
int main() {
long int a,r;
printf("Enter a\n");
scanf("%ld",&a);
printf("Enter r\n");
scanf("%ld",&r);
long int k=1,n;
printf("Enter n\n");
scanf("%ld",&n);
if(r==3||r==4)
{
  if(n%2!=0)
  {
    n = (n/2)+1;
    for(long i=1;i<n;i++)
    {
      k=k*r;
    }
    k= a*k;
    printf("%d",k);
  }
  else
  {
    n = n/2;
    for(long i=1;i<n;i++)
    {
      k=k*r;
    }
    k= a*k;
    printf("%d",k);
  }
}
}

OUTPUT:
Enter a
1
Enter r
3
Enter n
11
243


Comments

Popular posts from this blog

Finding the second largest in an array