The answer is simply "Lead Photographer"
Answer:
#include <iostream>
using namespace std;
int main() {
int num, check=0;
for(int num = 1; num<=100;num++){
for(int i = 2; i <= num/2; i++) {
if(num % i == 0)
{
check=1;
break; } }
if (check==0) { cout <<num<<" "; }
check = 0;
}
return 0;
}
Explanation:
This line declares num as integer which represents digits 1 to 100.
A check variable is declared as integer and initialized to 0
<em> int num, m=0, check=0;
</em>
This for loop iterates from 1 to 100
for(int num = 1; num<=100;num++){
This iterates from 2 to half of current digit
for(int i = 2; i <= num/2; i++) {
This checks for possible divisors
if(num % i == 0)
{
If found, the check variable is updated to 1
check=1;
And the loop is terminated
break; } }
The following if statement prints the prime numbers
if (check==0) { cout <<num<<" "; }
check = 0;
}
Answer:
Dex: 84
Hex: 54
Bin: (1010100)
Explanation:
You keep on dividing by 16 until you get 0 to find the hexadecimal then use the remainders from the last to the first.
Answer:
200
Explanation:
Because int number can not carry decimal point.
