Exercises to solve (With Answers)
Write a program to calculate take the number and calculates the triangular length.
int main ()
{
int n, triangular_limit,tmp;
cout<<"Enter a number";
cin>>n;
cout<<"Enter the limit to the triangular";
cin<<triangular_limit;
for(tmp = 1;tmp <= triangular_limit;tmp = tmp +1)
{
n = n + tmp;
}
cout<<"Result is"<<n;
return 0;
}
===============================================================================================
Write a program to find the Greatest Common Divisor of two non negative integers.
int main()
{
int u,v,tmp;
cout<<"Enter two non-negative integers";
cin>>u;
cin>>v;
while(v != 0)
{
tmp = u%v;
u = v;
v = tmp;
}
cout<<"The Greatest Common Divisor is"<<u;
}
===============================================================================================
Determine a year given is a leap year or not.
int main ()
{
int year, reminder4,reminder100,reminder400;
cout<<"Enter a year" ;
cin>>year;
reminder4 = year % 4;
reminder100 = year % 100;
reminder400 = year % 400;
if(reminder4 == 0 && reminder100 != 0 || reminder400 == 0)
{
cout<<"It is a leap year";
}
else
{
cout<<"It is not a leap year";
}
}
===============================================================================================
Write a program which determines the number is positive or negative.
int main()
{
int num;
cout<<"Enter a number";
cin>>num;
if(num < 0)
{
cout<<"Number is negative";
}
else if (num == 0)
{
cout<<"You entered a zero";
}
else
{
cout<<"The number is positive";
}
}
===============================================================================================
Generate a table of prime numbers
int main ()
{
int tmp,tmp2,prime_result;
for(tmp = 2; tmp <=100; ++tmp)
{
prime_result = 1;
for(tmp2 = 2; tmp2 < tmp; ++tmp2)
{
if(tmp % tmp2 == 0)
{ prime_result = 0;}
if(prime_result != 0)
{
cout<<tmp;
}
}
}
===============================================================================================
Go to part 2
int main ()
{
int n, triangular_limit,tmp;
cout<<"Enter a number";
cin>>n;
cout<<"Enter the limit to the triangular";
cin<<triangular_limit;
for(tmp = 1;tmp <= triangular_limit;tmp = tmp +1)
{
n = n + tmp;
}
cout<<"Result is"<<n;
return 0;
}
===============================================================================================
Write a program to find the Greatest Common Divisor of two non negative integers.
int main()
{
int u,v,tmp;
cout<<"Enter two non-negative integers";
cin>>u;
cin>>v;
while(v != 0)
{
tmp = u%v;
u = v;
v = tmp;
}
cout<<"The Greatest Common Divisor is"<<u;
}
===============================================================================================
Determine a year given is a leap year or not.
int main ()
{
int year, reminder4,reminder100,reminder400;
cout<<"Enter a year" ;
cin>>year;
reminder4 = year % 4;
reminder100 = year % 100;
reminder400 = year % 400;
if(reminder4 == 0 && reminder100 != 0 || reminder400 == 0)
{
cout<<"It is a leap year";
}
else
{
cout<<"It is not a leap year";
}
}
===============================================================================================
Write a program which determines the number is positive or negative.
int main()
{
int num;
cout<<"Enter a number";
cin>>num;
if(num < 0)
{
cout<<"Number is negative";
}
else if (num == 0)
{
cout<<"You entered a zero";
}
else
{
cout<<"The number is positive";
}
}
===============================================================================================
Generate a table of prime numbers
int main ()
{
int tmp,tmp2,prime_result;
for(tmp = 2; tmp <=100; ++tmp)
{
prime_result = 1;
for(tmp2 = 2; tmp2 < tmp; ++tmp2)
{
if(tmp % tmp2 == 0)
{ prime_result = 0;}
if(prime_result != 0)
{
cout<<tmp;
}
}
}
===============================================================================================
Go to part 2