Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- int main()
- {
- int ant[10][20];
- int i, j, k;
- int count=1;
- int num;
- for(i=0; i<10; i++)
- {
- for(j=0; j<20; j++)
- {
- ant[i][j] = 0;
- }
- }
- ant[0][0] = 1;
- for(i=0; i<9; i++)
- {
- for(j=0; j<20; j++)
- {
- if(ant[i][j]==0)
- {
- }
- else if(ant[i][j]!=ant[i][j+1])
- {
- num = ant[i][j];
- for(k=0; k<20; k++)
- {
- if(ant[i+1][k]==0)
- {
- ant[i+1][k]=num;
- ant[i+1][k+1]=count;
- count=1;
- break;
- }
- }
- }
- else
- {
- count++;
- }
- }
- }
- for(i=0; i<10; i++)
- {
- for(j=0; j<20; j++)
- {
- if(ant[i][j]!=0) printf("%d", ant[i][j]);
- }
- printf("\n");
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement