And the cost is called "zero cost"

c with classes sounds good

c with classes sounds good

c with classes sounds good

Hello, could you help me can I move a pointer of the file to specific line if lines have different length? example of file name:x1 foundationYear:2000 tax:1 legalAddress:leg1 street, actualAddress:act street name:x2 foundationYear:2001 tax:2 legalAddress:SFSDFS street, actualAddress:act2 street name:x3 foundationYear:2002 tax:3 legalAddress:BLAH BLAH street, actualAddress:act3 street

Preparing for C++ interview. Have intermediate experience and knowledge about C++. Want to be expert in C++? Anyone please guide and show some path to achieve same.

Prepare OOPs concepts

Okey Thank you. Theoretical I guess I have gained somewhat. Do you know any platform to be expert on practical OPPS concepts?

Okey Thank you. Theoretical I guess I have gained somewhat. Do you know any platform to be expert on practical OPPS concepts?

RIP cppcast 😢

it stopped?

they said maybe ... rob has a new job not doing c++, so felt it was right time to end

No, it was initiated by rob (thats not meant as a negative) as he felt it was time to take a hiatus as he wasnt doing and c++ (c#) ... jason said he was continuing c++ weekly

in this question i try to use simple recursive approach by traversing all the paths possible, this approach works but gives TLE which is obvious. Then i thought to use DP but then i am getting wrong answer. Can anyone please help out why? Here is the code link: https://pastebin.com/93Hr0Fww Here is the question link: https://leetcode.com/problems/shortest-path-in-binary-matrix/

Let's suppose the base call returned 1 then the call prev to it will return 1+1=2, and further prev calls will return 3 4 5 and so on

The cnt variable is useless. You always return 1 if the destination node is directly reachable from the node on which the current dp call is being made. So you may as well removethat variable and just return 1. On the first reading of your code,I thought cnt is whereyou will keep track ofthe number of steps and set dp to that value and thought you weren't doing it. It seems fine. I will look into it again

The cnt variable is useless. You always return 1 if the destination node is directly reachable from the node on which the current dp call is being made. So you may as well removethat variable and just return 1. On the first reading of your code,I thought cnt is whereyou will keep track ofthe number of steps and set dp to that value and thought you weren't doing it. It seems fine. I will look into it again

Could you find the issue

Could you find the issue

The solution seems fine to me on going through it superficially. Try using a debugger to see what the issue is. Your DP equation seems right. Btw you can also initialize those elements of dp where grid[i ][j] == 1 to some value like -1 instead of checking for that using a condition.

I tried to print dp array but I still can't understand what's wrong

Hi, can anyone help me to read a specific line from a file without line number, i mean like with a some word? In c programming

QUESTION ABOUT BASIC C: let's say I declare a static pointer, initialize it to some dynamically allocated memory inside a function, and then use it as the return value of the function, which in turn is used in my program as the value given to another pointer inside main(). If I use free() with the pointer I created inside main() which holds the value returned from the function as argument, will it successfully deallocate the memory I allocated inside the original function?

You can see a pointer as an address, when you allocate some memory you are getting an address to that memory that you save to the pointer. When you return it as a value, the returned pointer will point to the same memory, so when you free that pointer, that same memory will be freed (and then the pointer that is saved as static variable or any copies of this pointer will become dangling pointers, meaning that they will point to freed memory)

Suppose, you call Rotate ByK(a, 1000000000). You will find that your program takes a lot of time. How can you optimize your program? How can i solve this?

i have this simple code but it is causing segfault when i do s->current = 0; i would like to understand why it is happening so i can study it a little better: #include <stdio.h> typedef struct { int current; } stack; stack* stack_new() { stack *s; s->current = 0; return s; }

you haven't initialize s yet:

Suppose, you call Rotate ByK(a, 1000000000). You will find that your program takes a lot of time. How can you optimize your program? How can i solve this?

oh, thx :) my mistake was that i was treating the pointer like if it was a struct that is automatically initialized, example: stack my_stack; my_stack.current = 0; which is different to: stack* my_stack_pointer; my_stack_pointer->current = 0; // segfault

can we be study partners

#include <iostream> using namespace std; //Operator Overloading class OperatorClass { private: int x, y; public: OperatorClass(int a = 0, int b = 0) { x = a; y = b; } void Print() { cout << "x=" << x << ",y=" << y << endl; } //Unar Operator void operator-() { x = -x; y = -y; } void operator++() { cout << "Pre increment "; ++x; ++y; } void operator++(int a) { cout << "Post increment "; x++; y++; } //Binary Operator OperatorClass operator+(OperatorClass T) { OperatorClass Temp; Temp.x = x + T.x; Temp.y = y + T.y; return Temp; } OperatorClass operator+(int k) { OperatorClass Temp(x+k, y+k); return Temp; } void operator+=(OperatorClass T) { x += T.x; y += T.y; } OperatorClass operator*(OperatorClass T) { OperatorClass Temp(x * T.x, y * T.y); return Temp; } OperatorClass operator-(OperatorClass T) { OperatorClass Temp(x - T.x, y - T.y); return Temp; } bool operator>(OperatorClass T) { if (x > T.x && y > T.y) return true; else return false; } bool operator==(OperatorClass T) { return (x == T.x && y == T.y); } int operator[](int i) { if (i == 0) return x; else if (i == 1) return y; else return 0; } };

Archive function overloading in c++