
Both of the previous answers are correct.
On my machine, with VS2019, this code
static void Main(string[] args)
{
Stopwatch sw = new Stopwatch();
double result=0.0;
sw.Start();
{
for (int i = 1; i < 100000000; i++)
{
result += Math.Sin((i * 25.0) / i * i);
}
}
sw.Stop();
Console.WriteLine(sw.ElapsedMilliseconds.ToString());
Console.WriteLine(string.Format("{0}",result));
} produces
4739
7,98150964297362
While the following
int main()
{
int start = clock();
double result = 0.0;
for (size_t i = 1; i < 100000000; i++)
{
result += sin((i * 25.0) / i * i);
}
int end = clock(); std::cout << (1000.0 * (end  start) / CLOCKS_PER_SEC) << "\n";
std::cout << result << "\n";
} outputs
4153
7.98151
"In testa che avete, Signor di Ceprano?"
 Rigoletto





how to create
image background datagrid






Anything not in the foreground, is considered as being in the background.
"Before entering on an understanding, I have meditated for a long time, and have foreseen what might happen. It is not genius which reveals to me suddenly, secretly, what I have to say or to do in a circumstance unexpected by other people; it is reflection, it is meditation."  Napoleon I





could you guys recommend me a file IO library. I need not just the library itself but also some explanations to it, like an article.





Not sure what you're looking for. C and C++ have file I/O.
For C++, start here[^]. Directorylevel stuff was added in C++17 as <filesystem>[^].
For C, look here[^].





thanks Greg, I find that useful feedback





Is there something wrong with standard libraries ifstream/ofstream? If that's not to your liking, for some reason, maybe boost io or iostreams?
Without a bit more context, it's not clear what you're looking for.
Keep Calm and Carry On








Ask Away!. But maybe before you do, take a look at some of the threads posted here, and some of the questions and replies in the Quick Answers section. We don't do you work for you, but we're willing to help you with issues you may have. So questions like "why does this program produce unexpected results", or "why doesn't this compile" are likely to get answers. So are questions like "I'm trying to do X. Should I use a vector or a list?." But questions that ask "Implement a linked list, insert some values, sort and print the list", with no indication that you've made any attempt to solve the question yourself are likely to be either ignored or get a "We don't do homework" type of reply.
Keep Calm and Carry On





Well, aside from asking this exact question again (ok, you might ask it again to assert that VN and/or K5 is/are NOT robots I guess), use keywords in your PROGRAM by typing them into the "search" here at CP. The Discussions are titled and the QA is tagged. So keep those two things in mind also.
And.
Have a great day!





c ++ who can show me the direction of this article. There is an undirected star graph consisting of nodes labeled 1 to n. A star graph is a graph in which there is a central node and exactly n  1 edges connecting the central node to every other node.
You are given a 2Dedges integer array where each edge edges[i] = [ui, vi] indicates that there is an edge between the nodes ui and vi. Returns the center of the given star graph.
Input: edges =
4
1,2
5,1
1,3
1,4
Output: 1





And...
What's the problem?
Count the connections of each node.
"In testa che avete, Signor di Ceprano?"
 Rigoletto





#include <iostream>
using namespace std;
bool checkSquareNumber(int num)
{
int i=0;
while(i*i <= num)
{
if(i*i==num)
return true;
i++;
}
return false;
}
int squareNumber(int num)
{
int i=0;
while(i*i <= num)
{
if(i*i==num)
return i;
i++;
}
return i;
}
int numberOfStep(int num)
{
int cnt =0;
int i =0;
while(num)
{
if(checkSquareNumber(num)== true)
{
num = squareNumber(num);
cnt++;
}
else if(num%3==0)
{
num = num/3;
cnt++;
}
else if(num%2==0)
{
num/=2;
cnt++;
}
else
{
num;
cnt++;
}
}
return cnt;
}
int main()
{
int num,t;
cin>>t;
while(t)
{
cin>>num;
cout<<numberOfStep(num)<<endl;
}
return 0;
}





Quote: I'm having a problem with my code. can anyone point out where my error is?. i am trying to count the minimum number of steps to get any number to 0





Ok, so it appears the rules of this game are:
 If a number is a perfect square, take its square root
 if a number is divisible by 3, divide it by 3
 if a number is divisible by 2, divide it by 2
 otherwise, subtract 1.
So, given an input of 32, we'd go 32 > 16 > 4 > 2 > 1 > 0 for 5 steps.
and given 75, we'd go 75 > 25 > 5 > 4 > 2 > 1 > 0 for 6 steps.
Now, what problem are you having? A quick glance over the code didn't show any obvious errors.
Your checkSquareNumber() and squareNumber() functions are quite inefficient. You'd be better off googling a better square root algorithm (or just using the library sqrt() function). Ad since they are doing the same thing, they could be combined (return 1 if it is not a perfect square, and you can replace the two calls with one)
Truth,
James





Quote: i am having problem with my code. where the first condition to check if the original number is a perfect square. can you point out where my error is or point me to a better direction for this problem. i am trying to count the minimum number of steps to convert any number to 0





If you are not happy with the output produced by your code, then you should post here an example of input data (i.e. the sarting value of num ), together withe the expected result. Otherwise, how could we possibly help?
"In testa che avete, Signor di Ceprano?"
 Rigoletto





intput: 2 10 32
output: 4 5
modified 22Jun22 4:57am.





Quote: the problem is I can't run my code





A quick run with the debugger would spot immediately the bug: if num becomes 1 then your code end in a infinite loop, because 1 is a perfect square of itself. For a quick fix, replaceQuote: if(checkSquareNumber(num)== true) with
if(num > 1 && checkSquareNumber(num)== true)
"In testa che avete, Signor di Ceprano?"
 Rigoletto





The two functions checkSquareNumber and squareNumber should both start their calculations at 2, rather than 0. For square roots, zero is meaningless and 1 is the square root of itself.





Message Closed
modified 15May23 19:06pm.



