Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 3 years ago.
Improve this question
I am facing a problem. The maximum binary number I am able to convert is 1000000000000000000. Is there any way to convert a binary number larger than this?
There is a function called strtoull (string to unsigned long long integer) which should work, follow the link for an example. https://en.cppreference.com/w/cpp/string/byte/strtoul
Related
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 2 years ago.
Improve this question
I wanna write a c++ program that read a double value and after reading it print only the fraction of that number, for example if the input was 14.25 then the output must be 0.25
should include iomanip to it?
One approach would be to
Round the number down to the nearest integer - you can use the floor() function (http://www.cplusplus.com/reference/cmath/floor/)
Subtract that integer from the original number to get the result
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 6 years ago.
Improve this question
I am trying to generate array of integers within specific limit using random number generator but I want exact same array every time .
Seed your generator with the same seed value every time and it will produce the same sequence of numbers (true for most generators).
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 6 years ago.
Improve this question
I would like to be able to convert a string such as "(5+6)*6" and get the resulting integer from that equation. It is important that it starts out as a string.
You can use library fastmathparser for c++.
In link is example how use this library.
If you really want write alone this parser, I recomended use Shunting-yard algorithm
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 9 years ago.
Improve this question
I am very restricted in memory usage.
I need to store a datetime in my program. Precision is one second. Only 4 bytes for one datetime value.
What is the best way to achieve this?
Pick the earliest date/time you need to represent and mark that your epoch. Then use a four byte unsigned type as seconds-since-epoch. Be aware this will only give you a ~68 year range but that's all you can get with your restrictions.
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 9 years ago.
Improve this question
I would like to know the difference and how to choose the polynomial generator for different crc ?
And in some C code they have look up table to compute crc and some of them do it by xor truth table. but in both the cases it is 1byte data array. Its confusing . Could somebody explain this as well ?
Thanks.!