United
Would you like to react to this message? Create an account in a few clicks or log in to continue.
United


 
IndeksIndeks  Latest imagesLatest images  PencarianPencarian  PendaftaranPendaftaran  LoginLogin  

 

 Jawaban ACM Volume XI

Go down 
PengirimMessage
Zhaowei
Admin
Zhaowei


Jumlah posting : 296
Join date : 20.05.09
Age : 34
Lokasi : United

Jawaban ACM Volume XI Empty
PostSubyek: Jawaban ACM Volume XI   Jawaban ACM Volume XI I_icon_minitimeMon Aug 03, 2009 2:37 pm

#include
#include

int main(void)
{
char str[20][10][10];
int i,j,a,b,n[20];
scanf("%d",&a);
for(i=0;i
{
n[i]=0;
scanf("%d",&b);
for(j=0;j
{

scanf("%s",str[i][j]);
if(strcmp(str[i][j],"sheep")==0)
{
n[i]++;
}
}

}
for(i=0;i
{
printf("\nCase %d: This list contains %d sheep.\n",i+1,n[i]);
}

return 0;
}
Kembali Ke Atas Go down
https://zhaowei.indonesianforum.net
 
Jawaban ACM Volume XI
Kembali Ke Atas 
Halaman 1 dari 1
 Similar topics
-
» Jawaban Tugas OFC AI (NLP)

Permissions in this forum:Anda tidak dapat menjawab topik
United :: Community :: Binusian-
Navigasi: