Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include <stdlib.h>
- int main(void) {
- int n;
- scanf("%d", &n);
- int a[n][n];
- for (int i = 0; i < n; i++)
- for (int j = 0; j < n; j++)
- {
- //scanf("%d", &a[i][j]);
- a[i][j] = rand() % 10;
- }
- for (int i = 0; i < n; i++){
- for (int j = 0; j < n; j++)
- {
- //scanf("%d", &a[i][j]);
- printf("%d \t", a[i][j] );
- }
- printf("\n");
- }
- int odd[n*n];
- int inx = 0;
- for (int i = 0; i < n; i++)
- for (int j = 0; j < n; j++)
- if(i % 2 == 0 && j % 2 == 0)
- odd[inx++] = a[i][j];
- int tmp;
- int noSwap;
- for (int i = inx - 1; i >= 0; i--)
- {
- noSwap = 1;
- for (int j = 0; j < i; j++)
- {
- if (odd[j] > odd[j + 1])
- {
- tmp = odd[j];
- odd[j] = odd[j + 1];
- odd[j + 1] = tmp;
- noSwap = 0;
- }
- }
- if (noSwap == 1)
- break;
- }
- inx = 0;
- printf("\n");
- for (int i = 0; i < n; i++){
- for (int j = 0; j < n; j++)
- {
- if(i % 2 == 0 && j % 2 == 0) {
- a[i][j] = odd[inx++];
- printf("!%d!\t", a[i][j] );
- }
- else{
- printf("%d \t", a[i][j] );
- }
- }
- printf("\n");
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement