#include <stdio.h>
#include <stdlib.h>
#include <string.h>
char *sub(const char*s,char *z) /* substring mit ausschließlich aufsteigender ASCII-Zeichenfolge ab 1. Position */
{
while(*s)
{
if(*z)
{
else
break;
}
else
*z=*s;
++s;
}
return z;
}
char *folgensuche(const char* str, char* ziel)
{
while(*str) /* ab jeder Position suchen und mit bisher längstem Substring vergleichen */
{
char z[64000]="";
}
return ziel;
}
int main()
{
const char *str="kotafgovlav";
char ziel[64000]="";
puts(folgensuche
(str
,ziel
));
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxzdGRsaWIuaD4KI2luY2x1ZGUgPHN0cmluZy5oPgoKY2hhciAqc3ViKGNvbnN0IGNoYXIqcyxjaGFyICp6KSAgLyogc3Vic3RyaW5nIG1pdCBhdXNzY2hsaWXDn2xpY2ggYXVmc3RlaWdlbmRlciBBU0NJSS1aZWljaGVuZm9sZ2UgYWIgMS4gUG9zaXRpb24gKi8KewoJd2hpbGUoKnMpCgl7CgkJaWYoKnopCgkJewoJCQlpZih6W3N0cmxlbih6KS0xXTwqcykKCQkJc3RybmNhdCh6LHMsMSk7CgkJCWVsc2UKCQkJYnJlYWs7CgkJfQoJCWVsc2UKCQkqej0qczsKCQkrK3M7Cgl9CglyZXR1cm4gejsKfQoKY2hhciAqZm9sZ2Vuc3VjaGUoY29uc3QgY2hhciogc3RyLCBjaGFyKiB6aWVsKQp7Cgl3aGlsZSgqc3RyKSAvKiBhYiBqZWRlciBQb3NpdGlvbiBzdWNoZW4gdW5kIG1pdCBiaXNoZXIgbMOkbmdzdGVtIFN1YnN0cmluZyB2ZXJnbGVpY2hlbiAqLwoJewoJCWNoYXIgels2NDAwMF09IiI7CgkJaWYoc3RybGVuKHN1YihzdHIrKyx6KSk+c3RybGVuKHppZWwpKQoJCXN0cmNweSh6aWVsLHopOwoJfQoJcmV0dXJuIHppZWw7Cn0KCmludCBtYWluKCkKewogICAgY29uc3QgY2hhciAqc3RyPSJrb3RhZmdvdmxhdiI7CgogICAgY2hhciB6aWVsWzY0MDAwXT0iIjsKCiAgICBwdXRzKGZvbGdlbnN1Y2hlKHN0cix6aWVsKSk7CgogICAgcmV0dXJuIDA7Cn0K