Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- int main() {
- int n, m;
- scanf("%d%d", &n, &m);
- if(n != m) {
- printf("Matricata ne e kvadratna\n");
- return 0;
- }
- int A[n][n];
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n; j++) {
- scanf("%d", &A[i][j]);
- }
- }
- int W = 0;
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n; j++) {
- if(j < i) { // pod glavna dijagonala
- W += A[i][j];
- }
- if(j > i) { // nad glavna dijagonala
- }
- }
- }
- int Q = 1;
- for(int i = 0; i < n; i++) {
- Q *= A[i][n - 1 - i];
- }
- int B[n][n];
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < m; j++) {
- if(i == j) {
- B[i][j] = W;
- }
- else {
- B[i][j] = Q - A[i][j];
- }
- }
- }
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < n; j++) {
- printf("%d ", B[i][j]);
- }
- printf("\n");
- }
- printf("Q=%d\n", Q);
- printf("W=%d\n", W);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment