#ifndef  FUNCS2_CPP
#define  FUNCS2_CPP

#define PI  3.14159
#include<iostream.h>
#include<math.h>
long int AddDevide(int num1,int num2)
{
  long  temp=num1; int result=0;
  while(temp >0 )
  {
    temp-=num2;
    result++;
  }
 return result;
}

long AddMultiply(int num1,int num2)
{
 long  result=0 ;

 for (int i=0;i<num2; i++)
      result+=num1;
 return result;
}

float  Area(float radius)
{
  return(PI*radius*radius);
}

float Area(float height ,float width)
{
  return(height*width);
}

long sums(int size,int num[]);
float  avgs(int size,int num[])
{
  return(sums(size,num)/size);
}




long    TimeToSec(int hours,int minutes,int seconds)
{
  long secs;
  secs=3600*hours+60*minutes+seconds;
  return secs;
}



void    SecToTime(long seconds,int *Time)
{
 int h,m,s;
 int result;
 long remain;
 result=seconds/3600;
 remain=seconds%3600;
 *Time=result;         //hours
 result = remain/60;
 remain = remain%60;
 *(Time+1)=result;   //minute
 *(Time+2) = remain ;  //seconds

}

int   DaysTillDate(int d,int m ,int y)
{
  int days=0;
  int mounths[12]={31,28,31,30,31,30,31,31,30,31,30,31};
  if(y%4==0)
    mounths[1]=29;
  for(int i=0; i<m-1; i++)
      days+=mounths[i];
  days+=d;
  return days;
}

void  Difftime(int h1,int m1,int s1,int h2,int m2,int s2,int *Time)
{
  long diffsec;
  diffsec=TimeToSec(h1,m1,s1) - TimeToSec(h2,m2,s2);
  SecToTime(diffsec,Time);
}
long factorial(int num)
{
 long  facto=1 ;
 if(num==1)
    return facto;
 facto = num*factorial(num-1);
}




void Give_Key(void)
{
cout<<"\nPlease give any key \n" ;
}

long Round(double);
double  IntegralT(double lim1,double lim2,double acc)
{
  double h,NumOfH,Integ=0.0,x=lim1 ; //NumOfH is a number of h's in range
  long    iNumOfH;
  h = sqrt(acc*6.0); //the distance between 2 closest points in the range
  NumOfH=(lim2-lim1)/h ;
  iNumOfH=Round(NumOfH)+1;
  h=(lim2-lim1)/((double)iNumOfH);
  for(int i=0; i<iNumOfH; i++)
  {
     Integ+= (x*x)+(x+h)*(x+h);
     x+=h;
  }
   Integ*= (h/2.0);
  return Integ;
}



 void LineK(int,int);

void Kefel(int height,int width)
{
// void LineK(int,int);
  for(int i=0; i<height ;i++)
     LineK(i+1,width);

}

void LineK(int number,int length)

{
 int  NumberConst=number;
  for(int i=0;i<length;i++)
   {
     cout<<number<<" ";
     number+=NumberConst;
   }
  cout<<"\n";
}

int maxs(int size,int num[])
{
  int  max=num[0];
  for(int i=1;i<size;i++)
  {
     if(max<num[i])
       max=num[i];
  }
  return max;
}


int mins(int size,int num[])
{
  int  min=num[0];
  for(int i=1;i<size;i++)
  {
     if(min>num[i])
       min=num[i];
  }
  return min;
}


long NMember(int first,int diff,int nMember)
{
 long result = first;
 for(int i=0; i<nMember-1; i++)
     result+=diff;
 return result;
}
long  Round(double number)
{
  long int  round ;
  round = (long int)number;
  if( (number-round)>=0.5 )
     round++;
  return round ;
}

double Perimeter(float radius)
{
 return (2.0*PI* radius);
}

double Perimeter(float height  ,float width)
{
 return(2.0*(height+width));
}

double power(double base,double pow)
{
  double power=1.0;
  for(int i=0; i<pow; i++)
      power*=base;
  return power;
}

int PrimeNum(int num)
{
  int flag=0;
  for(int i=2; i<=num/2; i++)
   {
     if(num%i==0)
       return 0;
   }
  return 1;
}

void Swap(int& a,int& b)
{
  int c;
  c=a;
  a=b;
  b=c;  
}
void Swap(double& a,double& b)
{
  double c;
  c=a;
  a=b;
  b=c;  
}

long SumOfArith(int first,int diff,int nMember)
{
 long sum=0;
 for(int i=1; i<=nMember;i++)
   sum+= NMember(first,diff,i);
 return sum;
}
int SumOfDigits(long num)
{
  int sum=0;
 while(num>0)
 {
  sum+=num%10;
  num/=10;
 }
 return sum;
}

long SumOfPrecedeNum(int num)
{
 long sum=0;
 while(num>0)
 {
   sum+=(num--);
 }
 return sum ;
}

long sums(int size,int num[])
{
  long sum=0;
  for(int i=0;i<size;i++)
     sum+=num[i];
  return sum;
}


#endif