#include <bits/stdc++.h> using namespace std; int main() { string s; getline(cin, s); int len = s.size(); int maxlen = 0, minlen = 101, sum = 0; int pos1 = -1, pos2 = -1; for (int i = 0; i <= len; i++) { // 如果当前字符是字母，则累加单词长度 if (i < len && (s[i] != ' ' && s[i] != ',')) { sum++; } else { // 如果sum大于0，说明是一个有效的单词 if (sum > 0) { // 更新最长单词 if (sum > maxlen) { maxlen = sum; pos1 = i - sum; } // 更新最短单词 if (sum < minlen) { minlen = sum; pos2 = i - sum; } sum = 0; } } } // 如果整个句子没有单词 if (pos1 != -1) { // 输出最长单词 for (int j = pos1; j < pos1 + maxlen; j++) { cout << s[j]; } cout << endl; } if (pos2 != -1) { // 输出最短单词 for (int j = pos2; j < pos2 + minlen; j++) { cout << s[j]; } cout << endl; } return 0; }