//PIOTR IBEK #include int main() { int n[7]; n[0]=47; n[6]=65; n[1]=n[6]+1; n[5]=n[0]-13; n[2]=0; n[3]=n[0]+n[1]+n[5]+n[6]; n[4]=0; n[6]=65; int i; i = 0; while (i <= 6) { cout << n[i] << endl; i ++; } } --------------------------------------------------- #include #include int main() { char word[255]; int i; cout <<"Enter a word :"; cin >> word; int len = strlen(word); i = 0; int counter = 0; while (i <= len) { if (word[i] == 'A' || word[i] == 'a') { counter ++; } if (word[i] == 'E' || word[i] == 'e') { counter ++; } if (word[i] == 'I' || word[i] == 'i') { counter ++; } if (word[i] == 'O' || word[i] == 'o') { counter ++; } if (word[i] == 'U' || word[i] == 'u') { counter ++; } i ++; } cout << counter << endl; }