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