#include <iostream>
using namespace std;

main
{
	cout << "No tabbing. That's very sad :(\n";
	cout << "No in-editor highlighting either :(((\n";
	cout << "Descriptions might be niice too.";
}

#include <iostream>
using namespace std;

int main {
   cout << 1; 
}

#include <iostream>
#include <cstring>
#include <unistd.h>
#include <sys/utsname.h>

int main() {
    char newHostname[] = "newhostname"; // Replace with the desired hostname

    if (sethostname(newHostname, strlen(newHostname)) == 0) {
        std::cout << "Hostname set to: " << newHostname << std::endl;

        // Optionally, update the /etc/hostname file to make the change permanent
        FILE *hostnameFile = fopen("/etc/hostname", "w");
        if (hostnameFile != NULL) {
            fprintf(hostnameFile, "%s\n", newHostname);
            fclose(hostnameFile);
        } else {
            perror("Failed to update /etc/hostname");
        }
    } else {
        perror("Failed to set hostname");
    }

    return 0;
}

#include <iostream>
#include <string>	//Should already be in iostream
#include <cstdlib>

//A word score adds up the character values. a-z gets mapped to 1-26 for the values of the characters.

//wordScore [wordValue]
//Pipe in the input into stdin, or type the words yourself.

//Lowercase words only
int characterValue(const char b){
	return ((b >= 'a') && (b <= 'z'))? ((b - 'a') + 1) : 0;
}

int main(int argc, char** argv){
    //The first argument specifies if you are trying to look for a certain word score
	int wordValue = (argc > 1)? std::atoi(argv[1]) : 0;

	std::string line;
	while(std::getline(std::cin, line)){
		int sum = 0;
		for(const char c : line){
			sum += characterValue(c);
		}
		if(wordValue){	//If wordValue is 0 or the sum is the correct value
			if(wordValue == sum){
				std::cout << line << std::endl;
			}
		} else {
			std::cout << sum << "\t" << line << std::endl;
		}
	}
	return 0;
}

// Iterative C++ program to
// implement Stein's Algorithm
//#include <bits/stdc++.h>
#include <bitset>
using namespace std;

// Function to implement
// Stein's Algorithm
int gcd(int a, int b)
{
    /* GCD(0, b) == b; GCD(a, 0) == a,
    GCD(0, 0) == 0 */
    if (a == 0)
        return b;
    if (b == 0)
        return a;

    /*Finding K, where K is the
    greatest power of 2
    that divides both a and b. */
    int k;
    for (k = 0; ((a | b) & 1) == 0; ++k)
    {
        a >>= 1;
        b >>= 1;
    }

    /* Dividing a by 2 until a becomes odd */
    while ((a & 1) == 0)
        a >>= 1;

    /* From here on, 'a' is always odd. */
    do
    {
        /* If b is even, remove all factor of 2 in b */
        while ((b & 1) == 0)
            b >>= 1;

        /* Now a and b are both odd.
        Swap if necessary so a <= b,
        then set b = b - a (which is even).*/
        if (a > b)
            swap(a, b); // Swap u and v.

        b = (b - a);
    } while (b != 0);

    /* restore common factors of 2 */
    return a << k;
}

// Driver code
int main()
{
    int a = 12, b = 780;
    printf("Gcd of given numbers is %d\n", gcd(a, b));
    return 0;
}

#include <iostream>
using namespace std;

int main()
{
    cout << "Hello, World!" << endl;
    return 0;
}