@programminginc - страница 3491

Patrice

Freecodecamp on YouTube has great C++ & Python tutorials.

Dm

So plz can anyone help me

Just Google C++ roadmap and you will find GitHub with really big bunch of information

jaebie

how to have a non-recursive solution for fibonacci in c++

Ludovic 'Archivist'

how to have a non-recursive solution for fibonacci in c++

I'll give it to you in the wrong language, do the translation yourself: proc Fibonacci(n: int): int = var first = 0 second = 1   for i in 0 .. <n: swap first, second second += first   result = first

Dm

I'll give it to you in the wrong language, do the translation yourself: proc Fibonacci(n: int): int = var first = 0 second = 1   for i in 0 .. <n: swap first, second second += first   result = first

Looks like TCL breh

Ludovic 'Archivist'

Looks like TCL breh

It is nim

`` 🇫🇷 ;; ce serai ta blonde ce soir, si c'est ce que tu aimes

Looks like TCL breh

Like pascal

Ludovic 'Archivist'

(I don't know anything about nim BTW, this is some copy-paste)

Dm

It is nim

Ow no. I spent lots lite to work with it hah

Dm

(I don't know anything about nim BTW, this is some copy-paste)

Ow okay :( you cannot understand my pain.

Ludovic 'Archivist'

I chose to send it in nim because it is close enough in terms of paradigm but far enough in terms of syntax. Looks easy enough tho (but I hate indent based languages with a passion)

Dm

I chose to send it in nim because it is close enough in terms of paradigm but far enough in terms of syntax. Looks easy enough tho (but I hate indent based languages with a passion)

Wow. Someone who hate python. Never saw someone who hates passions based languages

Danial

Hey people dose enybidyknows a good book recommendation wich that book have exercises and problems to solve?! And answer too! And explanation! I will be thsnkful!

Danial

Hey people dose enybidyknows a good book recommendation wich that book have exercises and problems to solve?! And answer too! And explanation! I will be thsnkful!

For c language !

Ludovic 'Archivist'

Hey people dose enybidyknows a good book recommendation wich that book have exercises and problems to solve?! And answer too! And explanation! I will be thsnkful!

Modern C for all your explanation needs

Ludovic 'Archivist'

I need to work out some sort of exercise list someday

the best for everyone

#include <stdio.h> #include <math.h> int getArmstrongNumber(int number); int isArmstrong(int ); int getArmstrongNumber(int number) { int count=0; while(number>0 ) { number=number/10; count++; } return count ; } int isArmstrong(int m){ int sum = 0; int count= getArmstrongNumber(m); int temp=m; while (0>m){ sum = sum+ pow(m%10,count); // it should be two argument الأس والذي هو الرقم الأساسي مع الأس m=m/10; } return temp == sum ; } int main() { // printf("%d /n", getArmstrongNumber(1234 == 4)); for (int i = 0; i <50000 ; ++i) { if(isArmstrong(i)) printf("%d is Armstrong number \n",i); } }

the best for everyone

what is the mistake in this

olli

what is the mistake in this

while (0>m){ this doesn't look right, did you mean while(m > 0)? Also, getArmstrongNumber seems like a bad name to get the number of digits of a number in base 10.

ɛ n h ᴀ n c ɛ ґ 🧟‍♂️

class SinglyLinkedList { private: struct Node{ int Value; int key; Node *next; }; Node *Head; }; I have this code in a header file and I’m trying to return a pointer of type Node with a function in my implementation file but it doesn’t seem to work (the code works fine if i implement it in the header file). Error says Node doesn’t name a type Can someone explain to me why it isn’t working?

labyrinth

if b, c inherit baseA and d inherits both b and c, is there a way to avoid ambiguity that arise from members in baseA?

Anonymous

if b, c inherit baseA and d inherits both b and c, is there a way to avoid ambiguity that arise from members in baseA?

Make b and c inherit from baseA using virtual inheritance

Anonymous

If you can't do that, then specifically qualify the member in baseA using b:: or c:: to specify the path in which it should be resolved

Anonymous

class SinglyLinkedList { private: struct Node{ int Value; int key; Node *next; }; Node *Head; }; I have this code in a header file and I’m trying to return a pointer of type Node with a function in my implementation file but it doesn’t seem to work (the code works fine if i implement it in the header file). Error says Node doesn’t name a type Can someone explain to me why it isn’t working?

Could be because Node is private. If the function is a member function of SinglyLinkedList, it would not be an issue.

labyrinth

If you can't do that, then specifically qualify the member in baseA using b:: or c:: to specify the path in which it should be resolved

what if i were to use a member in baseA, I think i tried that but vscode gave me warning of ambiguity

labyrinth

oh i tried again it worked

labyrinth

If you can't do that, then specifically qualify the member in baseA using b:: or c:: to specify the path in which it should be resolved

can i get away with using member = b::member? i still got warning but i think it should compile

labyrinth

can i get away with using member = b::member? i still got warning but i think it should compile

guess using could just apply to class member function

jaebie

How to create a c++ program where you need to swap two numbers in different variables

jaebie

How to create a c++ program where there is a functiom that will calculate the distance between two points

klimi

How to create a c++ program where you need to swap two numbers in different variables

Think about the task in head what needs to be done and how it could be done. Open your editor. Write the code. Try running it. If it runs correctly, congratulations, if not, go through the code and check for any mistakes. if that doesn't help, look into your design if you haven't overlooked something.

ɛ n h ᴀ n c ɛ ґ 🧟‍♂️

Could be because Node is private. If the function is a member function of SinglyLinkedList, it would not be an issue.

I’ve tried making it public but still got the same error

mj12

I’ve tried making it public but still got the same error

try SinglyLinkedList::Node

ɛ n h ᴀ n c ɛ ґ 🧟‍♂️

try SinglyLinkedList::Node

Node was not declared in this scope

ɛ n h ᴀ n c ɛ ґ 🧟‍♂️

try SinglyLinkedList::Node

SinglyLinkedList::Node SinglyLinkedList::*chechNodeExists(Node *obj){ Node *temp = nullptr; Node *ptr = Head; while(ptr){ if (ptr->key == obj->key){ temp = ptr; } ptr = ptr->next; } return temp; }

mj12

SinglyLinkedList::Node SinglyLinkedList::*chechNodeExists(Node *obj){ Node *temp = nullptr; Node *ptr = Head; while(ptr){ if (ptr->key == obj->key){ temp = ptr; } ptr = ptr->next; } return temp; }

it returns a pointer, so your returntype should be SinglyLinkedList::Node* whilst the symbol is called SinglyLinkedList::chechNodeExists

ɛ n h ᴀ n c ɛ ґ 🧟‍♂️

it returns a pointer, so your returntype should be SinglyLinkedList::Node* whilst the symbol is called SinglyLinkedList::chechNodeExists

It works now Thanks man