Change this: if (y == 1) int gender = askGender(); To this: int gender; if (y == 1) gender = askGender(); Or even better this: int gender = 0; // default: 0 if (y == 1) gender = askGender();
This seems like it was purposefully un-optimized. I would assume that the time constraints are coming from modding a variable 100,000,000,000 times. But wait, that is not all. Not only do you mod a variable that many times, but when a variable modded to 0, you iterate another 11 times over each char in “Hello … Read more
uint num=/* your input */; // that’s the number of digits required to print // num in base 10; uint ceil_log10 = 1; for(uint i = 10; num > 10; i = i*10) { num -= (num % i); ceil_log10++; } Any number < 10 needs one digit. Any number >= 10 will enter the … Read more
To optimise code, you either try to change the algorithm after analysing the complexity of it and finding one with a lower complexity. There is no magic behind this task, you have to research to figure it out. Or you profile the code using dedicated tools which are platform dependent. A profiler will tell you … Read more
On Windows use ShellExecute with open command and just pass the path to the PDF file. system will do the rest.
At the beginning you must declare the variable : int array[100], beg, mid, end, i, num, n; N is the only variable that you don’t declare but use.
Examples of two approaches, assuming that it’s the index you’re interested in. Calling a function when an element is found: void search(const std::vector<int>& v, int x, std::function<void(int)> index_handler) { for (int i = 0; i < v.size(); ++i) { if (v[i] == x) { index_handler(i); } } } Letting the caller determine the starting point … Read more
int main(){ int n; cout<<“Enter a number: “; cin>>n; cout<<n<<” is defrayed as”<<endl; for(int i=1;i<=n/2;i++){ cout<<i<<“+”<<n-i<<” “; } cout<<endl; }
The amount of time required to execute the core of your program you’ve written is incredibly small. Figure that it consists of three or four assembly instructions, and at several gigahertz that will only require a couple of nanoseconds to run. That’s such a small amount of time that it’s vastly below the detection threshold … Read more
I am not going to give you the answer, but I will give some hints. The palindrome program is taking a string and comparing characters. More specifically, it is taking the first character, comparing it to the second-to-last, and seeing if they match. If they do, compare the second character to the third-to-last, and continue … Read more