Please enter your email address or userHandle.
Shubham wrote a sequence of words. The words are written using the rules given below:
You need to find the number of words in the string.
The first line of input contains T denoting the number of testcases. T testcases follow. Each testcase contains a single line of input that contains the string s.
For each testcase, in a new line, print the number of words in s.
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Login to access your submissions.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.