Description
Input
Output
Sample Input
stable marriage problem Consists of Matching members
Sample Output
7
#include <iostream>
#include <cstring>
using namespace std;
int main()
{char str[100];int n=0,i;gets(str);for(i=0;str[i]!='\0';i++){if(str[i]!=' '&&str[i+1]==' ')n++;}cout<<n+1<<endl;return 0;
}