What will be the output of the following code in C++?
#include <stdio.h>
int ETF(int n)
{
int a, result = n;
for (a = 2; a * a <= n; ++a)
{
if (n % a == 0)
{
while (n % a == 0)
n = n / a;
result = result - result / a;
}
}
if (n > 1)
result = result - result / n;
return result;
}
int main()
{
int n;
for (n = 1; n <= 4; n++)
printf("%d\n", ETF(n));
return 0;
}
#include <stdio.h>
int ETF(int n)
{
int a, result = n;
for (a = 2; a * a <= n; ++a)
{
if (n % a == 0)
{
while (n % a == 0)
n = n / a;
result = result - result / a;
}
}
if (n > 1)
result = result - result / n;
return result;
}
int main()
{
int n;
for (n = 1; n <= 4; n++)
printf("%d\n", ETF(n));
return 0;
}A. 0 1 2 3
B. 0 1 2 4
C. 1 1 2 2
D. 1 2 3 4
Answer: Option C
Related Questions on Miscellaneous on Data Structures
Which data structure is used to implement a binary heap efficiently?
A. Array
B. Linked List
C. Stack
D. Queue
In which scenario would you use a Bloom Filter?
A. For implementing a stack-based algorithm
B. To maintain a balanced binary tree
C. For efficient sorting of elements
D. To test membership in a large dataset
A. Queue
B. Stack
C. Heap
D. Array

Join The Discussion