📘 Day 8 – Teacher's Day Challenge | Way Too Long Words

🗓️ Date: August 01, 2025
🧩 Platform: Codeforces
🔢 Problems Solved Today: 1
🎯 Focus Topic: Strings, Length Checking, Abbreviation

---

🔗 Table of Contents

• Problem 1 – Way Too Long Words

• Daily Summary

---

🧩 Problem 1 – Way Too Long Words

📚 Difficulty: Easy
🧠 Concepts: String Manipulation, Conditional Statements

---

📄 Problem Statement (Summary):
You are given n words.
If a word has more than 10 characters, abbreviate it as:
first letter + (length - 2) + last letter
Else, print the word as it is.

Examples:

• "localization" → "l10n"

• "word" → "word" (no change)

---

💡 Approach:

• Take input n for number of words.

• Store all words in a vector.

• Loop through each word:

  • If its length ≤ 10 → print as-is.

  • Else → print first character + (length - 2) + last character.

---

🧪 Code (C++):

#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main()
{
    int n;
    cin >> n;
    vector<string> words(n);
    for (int i = 0; i < n; i++)
    {
        cin >> words[i];
    }
    for (int i = 0; i < n; i++)
    {
        if (words[i].length() <= 10)
            cout << words[i] << endl;
        else
        {
            int len = words[i].length();
            cout << words[i].at(0) << len - 2 << words[i].at(len - 1) << endl;
        }
    }
    return 0;
}

---

📸 Submission Screenshot:

---

📝 Example:
Input:

4  
word  
localization  
internationalization  
pneumonoultramicroscopicsilicovolcanoconiosis

Output:

word  
l10n  
i18n  
p43s

---

✅ Key Takeaways:

• Length-based logic is common in string problems.

• length() - 2 gives characters between first and last.

• Use at(0) and at(length - 1) to access boundary letters.

• Clean and simple loops help process input efficiently.

---

📈 Daily Summary

---

🏷️ Tags:
#codeforces #stringmanipulation #cpp #abbreviation #logicbuilding #43DaysChallenge