0 like 0 dislike
翻譯的工作有時候是依翻譯的字數來計價的,請設計一個程式計算一個句子中有幾個單字,在一個句子中被標點符號或是泛白字元隔開的可視為一個單子。

輸入說明:輸入會包含英文字母、數字以及標點符號,當程式遇到句點(.)時代表輸入結束。

輸出說明:請輸出一個整數代表輸 入的句子當中包含幾個單字。

輸入範例:

According to Josephus' account of the siege of Yodfat, he and his 40 soldiers were trapped in a cave by Roman soldiers.

輸出範例:

22
[Exercise] Coding (C) - asked in 2016-1 程式設計(一)AC by (18k points)
Available when: 2016-12-01 18:30:00 - Due to: 2016-12-01 21:00:00

reshown by | 649 views
0 0
Called for Help

86 Answers

0 like 0 dislike
Hidden content!
#include <stdio.h>

#include <stdlib.h>

#include <math.h>

#include <ctype.h>

int check1(char c)

{
** * *** * *** * * ** i=0;
* * * *** * * * * ***** ** *
** * * ** * * * * * ** ** * ** * *** * *
** * ** * * *** * * ** *** **** * * * * ** *
*** **** * * ***** * *** * * * **
* **** ** ** *** *** * ** i;

}



int check2(char c)

{
*** *** * ** * *** * * j=0;
** *** *** ** * ** ** * ** ** **
** * * * * ** ** ****** *** * ** *
** ** **** ** ** ** *** * **** **** * **** *** ** * * **
* *** ** * * * ** * * * * * *** ***
* * * ****** * ******* ** *** j;

}

int main()

{
******* ** *** *** ****** ** * * c;
** * ** *** * * * i=0,j=0;
* * * ***** * * * * * * **** * *** * * *** * *

    
* * **** * **** c!='.')
****** ** ***** ***** ***


* * *** * * ** * * * ** * * * * ****** ** * *** *
* * ** ** * * * *** * ** *** **** *****
* ** * ** ** **** ** * **** * ** ** * * * * *** *** ** *** ** *
* ** ** ** *** **
* **** ** * * * ****** ** * * * * * * **** *** * *****



return 0;

}
answered by (-248 points)
0 like 0 dislike
Hidden content!
* * * * * * * ** *
* * * *** ** ** ** **

int main (void)


char c;

int i = 0;

void * *** c)

{
** * **

i++;
** * * *

i++;
** * * ** *** ***
*** ** * * ** ** **** ** ** ** * * * ** **
** * * * * *** **** *** * ** 0;

}
* ;

}
* * **** * ** **** * *
* **** * **** * * ***
*

}



}
answered by (-140 points)
0 like 0 dislike
Hidden content!
#include<stdio.h>

 

 void judge(char c[100])

 {
* * * * ** * ******* * a1=0,a2=0,a3=0,a4=0,in;
** *** **** * **** *** ** ****** * && c[in];in++)

    {
** ** * *** * * * * ** * *** * ** * (48<=c[in] && c[in]<=57)
***** * * * ****** * * ** ***** * *** ** *
**** ******* *** * **** ** *** ***** ** ** * * ** *** * * * *
**** **** ** * * ** * * ** **** * ** ** **** ** **
* * *** * ** ** ** ** * * * ** * * * * *** if(65<=c[in] && c[in]<=90)
* *** ** * ** *** * * ** * *** *** ** *
* * ******** ** * ** * **** ** *** ** * * ** *** * * * ****
** *** * ** * ** ****** *** ** *** * * * * *** ***
*** * * ** *** ** *** ** * *** ***** **** ** * if (97<=c[in] && c[in]<=122)
** **** ***** *** * ** ** ** * ** ** * * **** **
* ****** * * ** * *** * *** **** * ** **** * * * * * * * * * **** ***
* * * * * * * * *** * * ** * * ** *
*** * * *** ******** * *** * * **** ** * * * * ** * * if(39<=c[in] && c[in]<=46)
**** * ** * ** * * **** * * **** ***** * * * *
** * * **** * * * * * * * * ** ** ******* * * * ****** * *
* * * ** * * **** ** ***** ***** * * ** * *
* ****** *** ** ** ** * * * * * * * ***** * *** *
** ** * ** ***** ** * ** **** ** * ** *** * * * * *
***** ** *** * **** * **** * * * ****** ** * ** ***** ** *** ***** *
** * * *** * * ** ** ****** ** ** ** * * *** ***
**** * * * ** **** ** **
** * * * ** **** *** * ** * * **** ** * * ** *

 }

 

 int main()

{
* ** ** * * * ****** ****** * * c[100];
* ** * * *** *** * *** *
** ** **** ***** *** *** * ***

    
** * ** * ** *** * * ** 0;

 }
answered by (-124 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>

#include <stdlib.h>

#include <math.h>

#include <ctype.h>

int check1(char c)

{
** * ** * *** * ** **** i=0;
**** ******** ** * *** * *
* ******** * *** * * * * * * * *
** *** * * * * * * * ** ** ** *** **** * ** ** ** *
***** *** * ** ****** * *** * ** ***
* ** ** * *** ** * ** ** * i;

}



int check2(char c)

{
* ** **** * * ** ** j=0;
* ** ** * *** * * ** ** * **
* * ****** *** *** * * * **** **** * * *
* * * * * **** ***** ** * * ** **** ***** * ****** *
* ** ****** * *** *** *** ***** **** * * *
***** * ** * * * * j;

}

int main()

{
* * * * ** ** * ***** * c;
*** ***** ***** **** * * * i=0,j=0;
* ** * * * * * * ** ***** * * **

    
*** * ** ** ** ** * c!='.')
* ** ***** *** **** * ****


*** **** ** ** ** * * * **** ***** ** *
* ** * *** * * ** ** **** * * * *** ** ***
* ** **** ** ***** * * * * ***** * ** ** **** * * * * ** ** *
** *** ** *** * * ***
* ** * ** ** * ** * ***** * ****** ** * * ** * ***** * ** * *****



return 0;

}
answered by (-248 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>

#include <stdlib.h>

#include <math.h>

#include <ctype.h>

int check1(char c)

{
**** * ****** * * ** ** i=0;
* * * * **** * ******* *
* * * *** * * ** * **** * **
** ** ** * * * ******* * *** **** * * ** *** * ** * *
*** ** ** * ** * ** ** * ** ** *
* ** ***** ** ** ** ** * ** * i;

}



int check2(char c)

{
* * ****** * * ** **** j=0;
** * ** ***** ** ** * * *
** * * * * * * ** **** * * *** ** ** *
* * * ** * ** ***** * * * * * ** * * ** * **** ** *
* * *** ** * ** * ** *** ******* **
* ***** * * * ***** j;

}

int main()

{
** ****** * *** ** * *** * ** c;
*** * ** ** ** **** * * *** *** i=0,j=0;
** **** ** ** ** * **** * * * *** **
** * * * * *** **** * * * *** to Josephus' account of the siege of Yodfat, he and his 40 soldiers were trapped in a cave by Roman soldiers.)
* * * * *** ***** * **
* ** * * ** * ** ** * ** ** *** * * *** **
* * * * * * * *****
* * *** * ** * * ***** * c!='.')
* * **** * ** * * * **


***** ** *** * * *** *** * * * * *
** * ** ** *** ** * * * * * * * * *** * ***********
** ** * * ** * *** ** ** ***** ** ** * * * ** * **** * **** * * *
*** ** * * ** ***
* * **** **** * * * * * * * ** * * * *** ****



return 0;

}
answered by (-248 points)
0 like 0 dislike
Hidden content!
* *** ** ** ***
** **** ** * * * *

int main **
* ***

char c;

int i = 0;

void *** c)

{
* * * * *
* *
**** ***

*** * *** ** ** **
**** * * *** * * *** * 0;

}
* * ;

}
* * ** ** *** ****** * **
* *

}
* **** ******* *****
* 0;

}
answered by (-140 points)
0 like 0 dislike
Hidden content!
# include <stdio.h>

# include <ctype.h>



 int main()

 {
**** * ** * * * **** * c;


***** *** *** * * i = 0,b = 0;


* *** * * * ***** ** ** **** ** **** &c);
** ** ******** *** **** c != '.')
** ** * ***** **** **
* * *** * *** **** * * ** * ** * * * * * **






* ** * * ** * ** *** * * * * * ** * += 1;


* **** * * *** * *** * * * * ** * *** ***** **** **** * &c);
** ****** * * * ** **** * *** ** * ** ****
*** ** *** * * ***** * * ** ** *** ***** * ** ** *


* * ** * *** * ** * ****** * ** i);


*** *** * *** * * ** * 0;



}
answered by (-158 points)
0 like 0 dislike
Hidden content!
** * ** * * ** *
*** * *** ** *** ** * *** *
* main **
***
* ** c;

int i = 0;
* *** * c)

{
* * * *
*
*** * *
* *
* * ;

}
** ** ***** ** *** * * * * *
* *

}








*** *** ** * *
* * 0;

}
answered by (-140 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>

#include <stdlib.h>

#include <math.h>

#include <ctype.h>

int check1(char c)

{
* ** ** * * i=0;
*** * * *** ** * * * * * **
**** ** * ** * *** *** ** * **** * ** **
*** ** * * ** **** ** *** ** * ** **** ** * * ***
* * * ** * * * ** ** ** * ***
* * *** ** *** *** *** i;

}



int check2(char c)

{
********** ** **** *** * j=0;
** ** ** * *** * ** ****** *
** * ** * ** ** * * * * ** *** *
* * ***** *** ** * ** ** * ******** ** * * * ** **
*** * * * ** * * ** * ***** * *
*** * * ** ** **** * *** ** * j;

}

int main(void)

{
* * * * * * * **** * * c;
* * ** ** *** * ** * i=0,j=0;
** * * * ** * *** ** * * ** * * * ** ***
*** **** * * ***** * c!='.')
** ** * * ** *** **** *


* * * ** ** ** * * ***** *** * * ** *** ** *
* ** ** * ** ************** * * * *** ******* *
* ** *** **** ***** * * * ** ** ** * * * * * ** ******* * ******

    }
*** ** * * ***** * * * * * * * ** * ** ** * * ** ** ** * * **



return 0;

}
answered by (-248 points)
0 like 0 dislike
Hidden content!
* ** ** * *** *
* ***** ** * *

int main ** *
* *
c ;

int i = 0;
* *** ************ ** ** * ***
*****


* * c)

{
* * ** ** *
**
** *

*** * ;

}




** * * *** **
* 0;

}
answered by (-140 points)
Get it on Google Play Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.68.65.206
©2016-2021

Related questions

0 like 0 dislike
16 answers
[Exercise] Coding (C) - asked Dec 1, 2016 in 2016-1 程式設計(一)AC by Shun-Po (18k points)
Available when: 2016-12-01 18:30:00 - Due to: 2016-12-01 21:00:00
| 226 views
0 like 0 dislike
49 answers
[Exercise] Coding (C) - asked Dec 1, 2016 in 2016-1 程式設計(一)AC by Shun-Po (18k points)
Available when: Unlimited - Due to: Unlimited
| 386 views
0 like 0 dislike
62 answers
[Exercise] Coding (C) - asked Dec 1, 2016 in 2016-1 程式設計(一)AC by Shun-Po (18k points)
Available when: 2016-12-01 18:30:00 - Due to: 2016-12-01 21:00:00
| 416 views
0 like 0 dislike
21 answers
[Exercise] Coding (C) - asked Dec 1, 2016 in 2016-1 程式設計(一)AC by Shun-Po (18k points)
Available when: 2016-12-01 18:30:00 - Due to: 2016-12-01 21:00:00
| 220 views
0 like 0 dislike
0 answers
[Resource] asked Dec 1, 2016 in 2016-1 程式設計(一)AC by Shun-Po (18k points)
Available when: Unlimited - Due to: Unlimited
| 10 views
11,166 questions
132,626 answers
131,350 comments
3,823 users