Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int arr[10][10];
- void cek(int b,int k, int i, int j)
- {
- if(b<0 || b>=i || k<0 || k>=j || arr[b][k]!=1) return;
- arr[b][k]=2;
- cek(b+1,k,i,j);
- cek(b,k+1,i,j);
- cek(b-1,k,i,j);
- cek(b,k-1,i,j);
- }
- void total(int i,int j)
- {
- if(i ==0) return ;
- int jumlah =0;
- int b,k;
- for(b=0;b<i;b++){
- for(k=0;k<j;k++)
- {
- if(arr[b][k] == 1)
- {
- cek(b,k,i,j);
- jumlah++;
- }
- }
- }
- cout << jumlah << endl;
- }
- int main()
- {
- ios::sync_with_stdio(false);
- cin.tie(NULL);
- int k,l,i=0,j=0,kiri;
- char num;
- memset(arr,0,sizeof(arr[0][0])*10*10);
- while(1)
- {
- num = getchar();
- if(num == '1')
- {arr[i][j++] = 1;
- } else if (num == '0') j++;
- if(num == '\n'){
- i++; kiri = j;
- j=0;
- // cout << endl << i <<"--"<< kiri<< endl;
- }
- if( num == EOF)
- {
- i++;
- break;
- }
- }
- j=kiri;
- total(i,j);
- /*
- cout <<"\n\n" ;
- for(k=0;k<i;k++)
- {
- for(l=0;l<j;l++)
- {
- cout << arr[k][l]<< ' ';
- }
- cout << "\n";
- }
- */
- return 0;
- }
- /*
- 1 1 0
- 1 0 1
- 0 0 1
- */
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement