Hi there. Does anyone sometimes not know how to normally output ascii characters from a file(txt) to the console in VS 2019 ?

What do you mean? Describe it more detail, or show it on the screenshot

How to make function overloading?

Also in gcc you can fill array like 4) char x[16] = { [0 … 15] = 0 };

Also in gcc you can fill array like 4) char x[16] = { [0 … 15] = 0 };

Which gcc version is this ? I got Compile Error

I want to output it from a text file ░, but it outputs this to me _

It could be because your file contains ASCII characters that are not printable.

Organize a stack to store integers. For the stack, use the unsigned short array. Demonstrate adding an element, removing an element, adding to an overflowing stack, removing from an empty stack. After each example, output the contents of the stack.

can I solve this problem?

This is a GCC extension and not standard compliant. The C99 Standard which introduced designated initializers allows only one ICE (Integer Constant Expression) in the index and not a range which is a GCC extension. The reason why you are getting a compiler error is probably because you are compiling using strict flags which disables these extensions. https://gcc.gnu.org/onlinedocs/gcc/Designated-Inits.html

Hi to all. I'm stuck and I can't figure out how I can get what I need. I need to find all n elements, they are thus x1 = 1, x2 = 2, x3 = 3 x4 = x1 + x2 + x3, x5 = x4 + x3 + x2, x6 = x5 + x6 + x4, ie from the previous three the following turns out. I solved the problem correctly, but I don't understand how to implement it with code. I hope for help

Hi to all. I'm stuck and I can't figure out how I can get what I need. I need to find all n elements, they are thus x1 = 1, x2 = 2, x3 = 3 x4 = x1 + x2 + x3, x5 = x4 + x3 + x2, x6 = x5 + x6 + x4, ie from the previous three the following turns out. I solved the problem correctly, but I don't understand how to implement it with code. I hope for help

you are done

Thank you, I have another question it can be recursively function ?

Thank you, I have another question it can be recursively function ?

I want to output it from a text file ░, but it outputs this to me _

Please don't forget if you are creating a recursive function, you should have a stopping point like: if (i == 0) { return; } Also don't forget pointers, they can be very useful too.

Thank you very much, everything worked out

I wnated to know what people think about VLAs. How dangerous are they? If they are, why does cpp has has vectors? Am I just overthinking?

so what does C has for var lenght arrays?

C99 and above support VLA edit : C11 made it optional

VLA is bad because it can cause stack overflow, and IT'S VERY SLOW

sorry, care to explain why exactly it would be slow?

do I just malloc()?

Maybe ? malloc(sizeof(type) * N) ?

https://www.reddit.com/r/cpp/comments/s4u3sn/comment/hswb5vq/?utm_source=share&utm_medium=web2x&context=3 https://www.reddit.com/r/cpp/comments/s4u3sn/comment/hswdzzz/?utm_source=share&utm_medium=web2x&context=3

You're just linking a reddit post of yourself, quoting the exact same thing that you did in this chat here before. how does this explain why it's slow?

Damn, sorry. I can't post the comment link. But you can find explanation on the reply

Hello, my code can be compiled by gcc7.3 with c++17 flag and clang6.0 with c++17 flag, but when I try to compiled it by msvc19.31.31107.0 with /std:c++17, it reports error. Then I try to compile with /std:c++latest, it works. Is my code using non-standard feature of c++? msvc with /std:c++17 says the expression result is not constant. I had a constexpr variable as constexpr bool is_vector_not_map = std::is_same_v<PositionType, std::vector<Size>> || std::is_same_v<PositionType, std::vector<std::pair<Symmetry, Size>>>; where Symmetry, Size, PositionType are all typename. and msvc report the error above when I try to do this: if constexpr (is_vector_not_map) { ... } else { ... }.

Conditionals Fill in the blanks to compare the variables and print "hello" to the screen: int a = 13; int b = 12; ____ (a > ____) { printf("hello"); }

Must be an issue on msvc. This code seems fine.

Hi, I have this class (pastebin) and somewhere along the line Valgrind gives me: ==271538== Use of uninitialised value of size 8 ...other stuff... ==271538== Uninitialised value was created by a heap allocation ==271538== at 0x48472F3: operator new[](unsigned long) (in /usr/lib/valgrind/vgpreload_memcheck-amd64-linux.so) ==271538== by 0x11361B: Array<double>::Array(unsigned long) (array.hpp:15) last one in line 12 of the code shared. Anyone can tell me why? Doesn't new double[n] allocates and initializes?

Hi, I have this class (pastebin) and somewhere along the line Valgrind gives me: ==271538== Use of uninitialised value of size 8 ...other stuff... ==271538== Uninitialised value was created by a heap allocation ==271538== at 0x48472F3: operator new[](unsigned long) (in /usr/lib/valgrind/vgpreload_memcheck-amd64-linux.so) ==271538== by 0x11361B: Array<double>::Array(unsigned long) (array.hpp:15) last one in line 12 of the code shared. Anyone can tell me why? Doesn't new double[n] allocates and initializes?

Also, a minor thing, but it's better to use nullptr instead of NULL in C++

Also your move constructor should probably set size of the other array to zero, otherwise that object has inconsistent size and data

Why would it be a problem if I'm deleting the other object immediately after?

// { Driver Code Starts // Program to find the maximum profit job sequence from a given array // of jobs with deadlines and profits #include<bits/stdc++.h> using namespace std; // A structure to represent a job struct Job { int id; // Job Id int dead; // Deadline of job int profit; // Profit if job is over before or on deadline }; // } Driver Code Ends /* struct Job { int id; // Job Id int dead; // Deadline of job int profit; // Profit if job is over before or on deadline }; */ class Solution { public: //Function to find the maximum profit and the number of jobs done. vector<int> JobScheduling(Job arr[], int n) { // your code here vector<vector<int>> m(n); for(int i=0;i<n;i++) { if(m[arr[i].dead].size()) { m[arr[i].dead][0]=max(m[arr[i].dead][0],arr[i].profit); } m[arr[i].dead].push_back(arr[i].profit); } int task=0; int profit=0; for(auto x: m) { if(x[0]) { task+=1; profit+=x[0]; } } return {task,profit}; } }; // { Driver Code Starts. // Driver program to test methods int main() { int t; //testcases cin >> t; while(t--){ int n; //size of array cin >> n; Job arr[n]; //adding id, deadline, profit for(int i = 0;i<n;i++){ int x, y, z; cin >> x >> y >> z; arr[i].id = x; arr[i].dead = y; arr[i].profit = z; } Solution ob; //function call vector<int> ans = ob.JobScheduling(arr, n); cout<<ans[0]<<" "<<ans[1]<<endl; } return 0; } // } Driver Code Ends

I advise you to learn how to use the tools in your toolchain. It probably features a few debugging tools that will immediately answer your question. On Unix-like systems gdb, valgrind, lldb can provide you with good debugging information. Alternatively, if you do not have a debugger, use std::vector::at instead of std::vector::operator[]