- Hey everyone, so I have a few challenges for you and all of them are more for the advanced C++ programmer. Try not to use Google if you can. When you are done post your solution and which challenge it is for. Here are the rules:
Rules:- No use of any functions
- No use of the '%', '*', and '/' operators
- No use of any classes
The challenges below should be placed in their own method and you should try and make it as small as you can, 1 line being the best if possible. Here are the challenges:
Challenges:- Make a function that takes a number as a parameter. Return an integer that is the power of two of the inputted number. So for example if the parameter is 5, it will return 25.
- Make a function that takes a number as a parameter. Return an integer that is the number divided by two. So for example if the parameter is 10, it will return 5.
- Make a function that takes a number as a parameter. Return a boolean value where true will be returned if the parameter is even or false if the parameter is odd. So for example if the parameter is 3 it will return false because it is odd.
HINT:
Use Bitwise operators!!!
Goodluck Everyone!
~Baseball435
Discuss C++ Challenges - Advanced
- Thread starter baseball435
- Start date
- Replies 21
- Views 6K
You tell us to not use function but in quest u tell us to write function 
C++:
#include <iostream>
#include <conio.h>
#include <math.h>
using namespace std;
int main()
{
double number;
cout << "Enter number to pow: ";
cin >> number;
cout << "pow(" << number << ")=" << pow(number,2) << endl;
return( 0 );
}
solution for your first question. The code is in c#
I did it c# since the vc# ide was open when I read this post. So don't say "Ah! c#? I asked in c++". The point is your problem getting solved.
public int pow(int i) //c++ equivalent
{
int j;
p=0
for(j=0;j<i;j++)
{
p=p+i;
}
return p;
}
I did it c# since the vc# ide was open when I read this post. So don't say "Ah! c#? I asked in c++". The point is your problem getting solved.
public int pow(int i) //c++ equivalent
{
int j;
p=0
for(j=0;j<i;j++)
{
p=p+i;
}
return p;
}
using System;
class MainCall
{
public static void Main()
{
int a,p=0;
a=Convert.ToInt32(Console.ReadLine());
for (int j = 0; j < a; j++) // This is the core stuff. This loop perform the power function use this loop within any function
{
p = p + a;
}
Console.WriteLine("The answer is {0}",p);
Console.ReadLine();
}
}
class MainCall
{
public static void Main()
{
int a,p=0;
a=Convert.ToInt32(Console.ReadLine());
for (int j = 0; j < a; j++) // This is the core stuff. This loop perform the power function use this loop within any function
{
p = p + a;
}
Console.WriteLine("The answer is {0}",p);
Console.ReadLine();
}
}
And about your third problem:
public bool eoo(int i) // c++ equivalent
{
int j;
for(j=0;j<=i;j=j+2)
{
if(j==i)
{
return true;
}
else
{
continue;
}
}
return false;
}
The code is in c#:
public bool eoo(int i) // c++ equivalent
{
int j;
for(j=0;j<=i;j=j+2)
{
if(j==i)
{
return true;
}
else
{
continue;
}
}
return false;
}
The code is in c#:
using System;
class MainCall
{
public static void Main()
{
int a,p=0;
a=Convert.ToInt32(Console.ReadLine());
FunctionEX fe = new FunctionEX();
Console.WriteLine(fe.eoo(a));
Console.ReadLine();
}
}
class FunctionEX
{
public bool eoo(int i)
{
for (int j = 0; j <= i; j = j + 2)
{
if (j == i)
{
return true;
}
else
{
continue;
}
}
return false;
}
}
class MainCall
{
public static void Main()
{
int a,p=0;
a=Convert.ToInt32(Console.ReadLine());
FunctionEX fe = new FunctionEX();
Console.WriteLine(fe.eoo(a));
Console.ReadLine();
}
}
class FunctionEX
{
public bool eoo(int i)
{
for (int j = 0; j <= i; j = j + 2)
{
if (j == i)
{
return true;
}
else
{
continue;
}
}
return false;
}
}
Solution for the second, C++.
Crazywink
C++:
#include <iostream>
using namespace std;
int main()
{
unsigned int Value;
cout << "Enter value to be divided: ";
cin >> Value;
Value = Value >> 1;
cout << "\n" << "Your new value is: " << Value << "\n";
}Crazywink
Haha they are all very good! I ment to say in the thread no for loops or while loops but you worked with them well! Good job! I was looking for bitwise operation solutions but these are very good! If you guys want I can post the solution using bitwise operations in a spoiler in the main thread
So I'll make some more advance task for you now .
What to do:
Fully work AVL TREE with some nice show of tree ( natural representative of tree)
How the program should work :
1. Menu
2. Insert Node
3. Delete Node
4. Show empty tree
5 Show tree
6. Add to node random nodes ( user can tell program how many node's need to be add)
7. Exit
This is how AVL TREE LOOK LIKE and this is how it's should be show in program ( ofc without circle ).
What to do:
Fully work AVL TREE with some nice show of tree ( natural representative of tree)
How the program should work :
1. Menu
2. Insert Node
3. Delete Node
4. Show empty tree
5 Show tree
6. Add to node random nodes ( user can tell program how many node's need to be add)
7. Exit
This is how AVL TREE LOOK LIKE and this is how it's should be show in program ( ofc without circle ).
This is quite advancedSo I'll make some more advance task for you now .
What to do:
Fully work AVL TREE with some nice show of tree ( natural representative of tree)
How the program should work :
1. Menu
2. Insert Node
3. Delete Node
4. Show empty tree
5 Show tree
6. Add to node random nodes ( user can tell program how many node's need to be add)
7. Exit
This is how AVL TREE LOOK LIKE and this is how it's should be show in program ( ofc without circle ).
If I have time I'll take a wack at it.... I just did this stuff over the summer in my Uni class.Only thing that doesn't sound correct to me is, since this is a an AVL binary tree.... that is, self balancing, I dont think it makes much sense to implement #6 that is, add a node to random nodes? because that defeats the purpose of any tree! especially the AVL tree
anyway, I hope I have time... this is fun
yeah 6 is a bit wrong my bad i was mean that you add random number to node and tree should self balanced and this is not so advance but i recommend to make first of all the binary tree than just make it AVL
my bad i was mean that you add random number to node and tree should self balanced and this is not so advance but i recommend to make first of all the binary tree than just make it AVL
Hey BlackPitch take a look at my av tree l I post the project on my website enjoy.
link to project
https://manycalculator.webs.com/avlproject/index.html
Greets,
voidisalive
link to project
https://manycalculator.webs.com/avlproject/index.html
Greets,
voidisalive
Attention! Before you post:
Read the How to Ask Questions Guide
99% of questions are answered in the Beginner's Guide, do it before asking a question.
No Hack Requests. Post in the correct section. Search the forum first. Read the rules.
How to make a good post:
- Fill out the form correctly
- Tell us the game name & coding language
- Post everything we need to know to help you
- Ask specific questions, be descriptive
- Post errors, line numbers & screenshots
- Post code snippets using code tags
- If it's a large project, zip it up and attach it
If you do not comply, your post may be deleted. We want to help, please make a good post and we will do our best to help you.
