Answer:
// Program is written in C++ Programming Language
// Comments are used for explanatory purpose
// Program starts here
#include<iostream>
using namespace std;
int main()
{
// Declare integer variable n which serves as the quotient.
int n;
// Prompt to enter any number
cout<<"Enter any integer number: ";
cin>>n;
// Check for divisors using the iteration below
for(int I = 1; I<= n; I++)
{
// Check if current digit is a valid divisor
if(n%I == 0)
{
// Print all divisors
cout<<I<<" ";
}
}
return 0;
}
Answer:
The answer is "Option A".
Explanation:
The dynamic search ads also known as interactive contextual ads, that utilizes google advanced website browsing technologies to dynamically address relevant results requests based on the quality of a chain's website. These ads are beneficial for strategies, and other choices were wrong which can be described as follows:
- In option B, It helps to upload all the dynamic search ads URLs quickly.
- In option C, It helps to control computer service.
- In option D, It increases the network traffic.
Answer:
#include <iostream>
#include <cstdlib>
using namespace std;
int main() {
int[] array = new int[10];
int index = 0;
while(index < array.size()){
int number = (rand() % 100) + 1;
for (int i = 0; i < 1; i++) {
array[index] = number;
cout<< "Position "<< index << "of the array = "<< number << endl;
++index;
}
}
}
Explanation:
The while loop in the source code loops over a set of code ten times, The for loop only loops once to add the generated random number between 1 and 100 to the array of size 10. At the end of the for loop, the index location and the item of the array is printed out on the screen. The random number is generated from the 'rand()' function of the C++ standard library.
You need answers to the question
Answer:
#include<iostream>
using namespace std;
int main (){
int n1, n2;
cout<<"Enter 1st number";
cin>>n1;
cout<<"Enter 2nd number";
cin>>n2;
if(n1<n2){
cout<<"The 1st number is the smallest"<<endl<<" is= "<<n1;
}
else{
cout<<"The 2nd number is the smallest"<<endl<<" is= "<<n2;
}
}
return 0;
