fork download
copy 
  1. #include <iostream>
  2. #include <cstring>
  3. using namespace std;
  4.  
  5. const int MAX_SIZE = 2000;
  6. const int LAST_LETTER = 'z';
  7.  
  8. bool isLetter(char c) {
  9.     return ('A' <= c && c <= 'Z') || ('a' <= c && c <= 'z');
  10. }
  11.  
  12. void addWords(char words[][MAX_SIZE + 1], char text[], int &lastPos) {
  13.     int length = strlen(text);
  14.     bool wasLetter = false;
  15.     for (int i = 0; i <= length; ++i) {
  16.         if (isLetter(text[i])) {
  17.         	char c[] = {text[i], 0};
  18.         	strcat(words[lastPos], c);
  19.         	wasLetter = true;
  20.         } else if (wasLetter) {
  21.             ++lastPos;
  22.             wasLetter = false;
  23.         }
  24.     }
  25. }
  26.  
  27. void interchangeSeq(char firstWord[], char secondWord[]) {
  28. 	char aux[MAX_SIZE + 1];
  29. 	strcpy(aux, firstWord);
  30. 	strcpy(firstWord, secondWord);
  31. 	strcpy(secondWord, aux);
  32. }
  33.  
  34. void sortWords(char words[][MAX_SIZE + 1]) {
  35.     for (int i = 0; words[i][0]; ++i) {
  36.         for (int j = i + 1; words[j][0]; ++j) {
  37.             if (strcmp(words[i], words[j]) > 0) {
  38.             	interchangeSeq(words[i], words[j]);
  39.             }
  40.         }
  41.     }
  42. }
  43.  
  44. bool isLowerLetter(char c) {
  45.     return 'a' <= c && c <= 'z';
  46. }
  47.  
  48. const char* greatestWord(char words[][MAX_SIZE + 1]) {
  49.     for (int i = 0; words[i][0]; ++i) {
  50.         int fr[LAST_LETTER + 1] = {0}, n = strlen(words[i]);
  51.         for (int j = 0; j <= n; ++j) {
  52.             ++fr[words[i][j]];
  53.             if (fr[words[i][j]] > 1) {
  54.                 break;
  55.             } else if (words[i][j] == 0) {
  56.                 return words[i];
  57.             }
  58.         }
  59.     }
  60.     return "Ist nicht vorhanden!";
  61. }
  62.  
  63. int main() {
  64.     char text[MAX_SIZE + 1], words[MAX_SIZE / 2 + 1][MAX_SIZE + 1] = {0};
  65.     int lastPos = 0;
  66.     while (cin.getline(text, MAX_SIZE + 1)) {
  67.         addWords(words, text, lastPos);
  68.     }
  69.     sortWords(words);
  70.     cout << greatestWord(words);
  71.     return 0;
  72. }
Success #stdin #stdout 0.01s 5684KB
comments (?)
stdin
copy 
Aabcadefg…abcd
!xyzd!!! xyxzd
stdout
copy 
abcd
https://ideone.com/M44NOI
language:
C++ (gcc 8.3)
created:
13 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!