Answer:
#include <iostream>
using namespace std;
int main() {
int k;
double d;
string s;
cin >> k >> d >> s;
cout << s << " " << d << " " << k << "\n" << k << " " << d << " " << s; }
Explanation:
k is int type variable that stores integer values.
d is double type variable that stores real number.
s is string type variable that stores word.
cin statement is used to take input from user. cin takes an integer, a real number and a word from user. The user first enters an integer value, then a real number and then a small word as input.
cout statement is used to display the output on the screen. cout displays the value of k, d and s which entered by user.
First the values of k, d and s are displayed in reverse order. This means the word is displayed first, then the real number and then the integer separated again by EXACTLY one space from each other. " " used to represent a single space.
Then next line \n is used to produce a new line.
So in the next line values of k, d and s are displayed in original order (the integer , the real, and the word), separated again by EXACTLY one space from each other.
The program along with the output is attached.
Answer:
I need to send black-and-white images in a print-ready format. Therefore, here are the steps I’d follow:
First, I’d shoot my images.
I’d use Photoshop to modify or correct the color of the images.
I’d convert the images into black-and-white versions.
I’d save the selected files in the TIFF format. This method will ensure that the images retain their quality and are print-ready.
I’d also convert these files into the JPEG format to get good-quality, low-resolution images for the client’s web publishing.
The Art Director requires images that they can modify, if required. Therefore, I’ll include files in the TIFF and PSD formats. These are open files and anyone can modify them.
I’d send all these saved copies to the magazine for their work.
Explanation:
just did it and it gave me this answer:)
Answer:
Flowchart of an algorithm (Euclid's algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≥ A yields "yes" or "true" (more accurately, the number b in location B is greater than or equal to the number a in location A) THEN, the algorithm specifies B ← B − A (meaning the number b − a replaces the old b). Similarly, IF A > B, THEN A ← A − B. The process terminates when (the contents of) B is 0, yielding the g.c.d. in A. (Algorithm derived from Scott 2009:13; symbols and drawing style from Tausworthe 1977).
Explanation:
Flowchart of an algorithm (Euclid's algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≥ A yields "yes" or "true" (more accurately, the number b in location B is greater than or equal to the number a in location A) THEN, the algorithm specifies B ← B − A (meaning the number b − a replaces the old b). Similarly, IF A > B, THEN A ← A − B. The process terminates when (the contents of) B is 0, yielding the g.c.d. in A. (Algorithm derived from Scott 2009:13; symbols and drawing style from Tausworthe 1977).
3-4 minutes is about right is say
