#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;
}

#include <iostream>
using namespace std;

int main() {


    int arr[5];
    
    for(int i = 0; i < 5; i++) {
        arr[i] = i;
    }

    for(int i = 0; i < 5; i++) {
        cout << "Outputting array info at position " << i + 1 << ": " << arr[i] << endl;
    }

    for(int i=0;i<5;i++)
	{		
		for(int j=i+1;j<5;j++)
		{
			if(arr[i]>arr[j])
			{
				int temp=arr[i];
				arr[i]=arr[j];
				arr[j]=temp;
			}
		}
	}

    cout << endl;

    for(int i = 0; i < 5; i++) {
        cout << "Outputting sorted array info at position " << i + 1 << ": " << arr[i] << endl;
    }

    return 0;
}

#include <iostream>
using namespace std;

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

/*
Good morning! Here's your coding interview problem for today.

This problem was asked by Stripe.

Given an array of integers, find the first missing positive integer in linear time and constant space. In other words, find the lowest positive integer that does not exist in the array. The array can contain duplicates and negative numbers as well.

For example, the input [3, 4, -1, 1] should give 2. The input [1, 2, 0] should give 3.

You can modify the input array in-place.
*/
#include <iostream>
using namespace std;

int calcMissing(int* input, int size)
{
	int sum = 0;
	int n = 1; //add one to account for missing value
	for(int i = 0; i < size; i++)
	{
	if(input[i] > 0)
	{
	sum += input[i];
	n++;
	}
	}

	//If no numbers higher than 0, answer is 1
	if(sum == 0)
	return 1;

	return (n*(n+1)/2) - sum; //Formula is expectedSum - actualSum
	/* expectedSum = n*(n+1)/2, the formula for sum(1, n) */
}

int main()
{

	cout << calcMissing(new int[4]{3, 4, -1, 1}, 4) << endl;
	cout << calcMissing(new int[3]{1, 2, 0}, 3) << endl;

	//No positive numbers
	cout << calcMissing(new int[1]{0}, 1) << endl;
}

#include <iostream>
#include <fstream>
#include <string>
#include <cstring>

using namespace std;

//This program makes a new text file that contains all combinations of two letters.
// aa, ab, ..., zy, zz

int main(){
	string filename = "two_letters.txt";

	ofstream outFile;
	outFile.open(filename.c_str());

	if(!outFile.is_open()){
		cout << "Something's wrong. Closing..." << endl;
		return 0;
	}

	for(char first = 'a'; first <= 'z'; first++){
		for(char second = 'a'; second <= 'z'; second++){
			outFile << first << second << " ";
		}
		outFile << endl;
	}

	return 0;
}

int main()