#include <stdio.h>
#include <stdlib.h>

#define N 10
//Bai 1
//Cach 1: Ham tra ve day phan tu dinh gom m phan tu cua day B
findPeeks(int A[], int n, int B[], int *m){
    int k=0;
    if (n<=0) {
        *m = 0;
        return;
    }
    if (n==1) {
        B[k] = A[0];
        *m = 1;
        return;
    }

    if (A[0]>A[1]) {
        B[k] = A[0];
        k++;
    }
    int i;
    for (i=1;i<n-1;i++)
    if (A[i]>A[i-1] && A[i]>A[i+1]){
        B[k] = A[i];
        k++;
    }
    if (A[n-1]>A[n-2]) {
        B[k] = A[n-1];
        k++;
    }
    *m = k;
}

//Cach 2: Ham tra ve so phan tu cua day phan tu dinh chua trong day B
int findPeeks2(int A[], int n, int B[]){
    int k=0;
    if (n<=0) {
        return 0;
    }
    if (n==1) {
        B[k] = A[0];
        return 1;
    }

    if (A[0]>A[1]) {
        B[k] = A[0];
        k++;
    }
    int i;
    for (i=1;i<n-1;i++)
    if (A[i]>A[i-1] && A[i]>A[i+1]){
        B[k] = A[i];
        k++;
    }
    if (A[n-1]>A[n-2]) {
        B[k] = A[n-1];
        k++;
    }
    return k;
}

//Cach 3: Ham tra ve day phan tu dinh gom m phan tu cua day B
//void findPeeks3(int A[], int n, int B[], int &m){
//}

//Bai 2

//Cach 1
inputString(char **s){
    const int MAX = 200;
    char st[MAX];
    printf("Nhap chuoi:");
    scanf("%s", st);
    *s = malloc(strlen(st)+1);
    strcpy(*s, st);
}
//Cach 2
char * inputString2(){
    const int MAX = 200;
    char st[MAX];
    printf("Nhap chuoi:");
    scanf("%s", st);
    char *s = malloc(strlen(st)+1);
    strcpy(s, st);
    return s;
}

//Ham tra ve so tu co trong chuoi s
int wordCount(char s[]){

    return 0;
}

int main()
{
    char * s = NULL;
    //const int MAX = 200;
    //s = malloc(MAX);
    //inputString(&s);

    s = inputString2();

    printf("Chuoi da nhap:%s", s);

    printf("So tu trong chuoi: %d", wordCount(s)) ;

}