//04,05,2007 Greek_Hunter(grehunter)
//SIMPLE_INTEGRAL_FINDER
#include <iostream>

using namespace std;

class Integral_1
{
public:
void increasepower();
void print_();
Integral_1();
void print_result();
private:
int mul1mul2pow1pow2;
};

int main()
{
Integral_1 equ;
equ.print_();
equ.increasepower();
equ.print_result();
return 0;
}
Integral_1::Integral_1()//default constructor
{
int m1m2p1p2;
cout<<"\n\nEnter multiple of the first variable (x): "<<endl;
cin >>m1;
cout <<"\nEnter multiple of the second variable (y): "<<endl;
cin >>m2;

mul1=m1;
mul2=m2;

cout <<"\n\nEnter the power of the first variant (x): "<<endl;
cin >>p1;
cout <<"\nEnter the power of the second variant (y): "<<endl;
cin >>p2;

pow1=p1;
pow2=p2;
}
void Integral_1 :: print_(void)
{
cout <<"\nThe given equation is:"<<mul1<<"*x"<<"^"<<pow1
<<"+"<<mul2<<"*y"<<"^"<<pow2 <<endl;
}
void Integral_1 :: increasepower(void)
{
pow1++;
pow2++;
}
void Integral_1 :: print_result(void)
{
cout <<"\nThe integral of the equation is as follows: "<<endl;
cout <<"\t\t( "<<mul1<<"/"<<pow1<<"*x^"<<pow1<<" )+"
<<"( "<<mul2<<"/"<<pow2<<"*y^"<<pow2<<" )"<<endl;
}