12 number of members (in) a jury
#include<iostream> #include<stdio.h> #include<conio.h> using namespace std; int main() { int a[20][20],b[20][20],c[20][20],i,j,k,m,n,f; cout << "Input row and column of A matrix \n\n"; cin >> n >> m; cout << "\n\nInput A - matrix \n\n"; for(i=0;i<n;++i) for(j=0;j<m;++j) cin >> a[i][j]; cout << "\n\nMatrix A : \n\n"; for(i=0;i<n;++i) { for(j=0;j<m;++j) cout << a[i][j] << " "; cout << "\n\n"; } for(i=0;i<m;++i) for(j=0;j<n;++j) b[i][j]=a[j][i]; cout << "\n\nTranspose of matrix A is : \n\n"; for(i=0;i<m;++i) { for(j=0;j<n;++j) cout << b[i][j] << " "; cout << "\n\n"; } for(i=0;i<m;i++) { for(j=0;j<m;j++){ c[i][j]=0; for(k=0;k<=m;k++) c[i][j]+=a[i][k]*b[k][j]; } } for(i=0;i<m;i++) { for(j=0;j<m;j++) { if((int)c[i][i]==1&&(int)c[i][j]==0) f=1; } } cout<<"\n\n Matrix A * transpose of A \n\n"; for(i=0;i<m;i++) { for(j=0;j<m;j++) cout << c[i][j]; cout << "\n\n"; } if(f==1) cout << "\n\nMatrix A is Orthogonal !!!"; else cout << "\n\nMatrix A is NOT Orthogonal !!!"; getch(); return 0; } -ALOK
jm + jn + km + kn = j(m + n) + k(m + n) = (m + n)(j + k)
#include<stdio.h> void transpose(int a[50][50]); void main() { int a[50][50],b[50][50],m,n,i,j; scanf("%d",&m,&n); for(i=0;i<m;i++) { for(j=0;j<n;j++) { scanf("%d",&a[i][j]); } } for(i=0;i<n;i++) { for(j=0;j<m;j++) { scanf("%d",&b[i][j]); } } transpose(a,b,m,n) void transpose(int a[50][50],int b[50][50],int m,int n) { int i; for(i=0;i<m;i++) { for(j=0;j<n;j++) { b[i][j]=a[i][j]; } } }
#include<stdio.h> #include<conio.h> { int i,j, m,n; for(i=1;i<=n;i++) { for(j=1;j<=i;j++) { printf("*"); } for(m=0;m<=n-1;m--) { printf(" "); } printf("\n"); } getch(); }
/* Ramana Reddy -IIIT */ #include main() { int a[10][10],i,j,m,n,sum=0; printf("Size of Matrix M*N:\n "); scanf("%d%d",&m,&n); if(m==n) { printf("\nEnter %d elements: \n",m*n); for(i=0;i
#include<stdio.h> #include<conio.h> void main() { int a[10][10],i,j,k,m,n; printf("enter the order"); scanf("%d",&m,&n); for(i=0;i<m;i++) { for(j=0;j<n;j++) { scanf("%d",&a[i][j]); } } for(k=0;k<m;k++) { for(i=0;i<=m-1;i++) { for(j=0;j<n-i-1;j++) { if(a[k][j]>a[k][j+1]) temp=a[k][j]; a[k][j]=a[k][j+1]; a[k][j+1]=temp; } } } for(i=0;i<m;i++) { for(j=0;j<n;j++) { printf("sorted matrix=%d",a[i][j]); } } getch(); }
#include#include#define MAXROWS 10#define MAXCOLS 10void main(){int A[MAXROWS][MAXCOLS], B[MAXROWS][MAXCOLS], C[MAXROWS][MAXCOLS];int M, N;/*Function declarations*/void readMatrix(int arr[][MAXCOLS], int M, int N);void printMatrix(int arr[][MAXCOLS], int M, int N);void productMatrix(int A[][MAXCOLS], int B[][MAXCOLS], int C[][MAXCOLS],int M, int N);clrscr();printf("Enter the value of M and N\n");scanf("%d %d",&M, &N);printf ("Enter matrix A\n");readMatrix(A,M,N);printf("Matrix A\n");printMatrix(A,M,N);printf ("Enter matrix B\n");readMatrix(B,M,N);printf("Matrix B\n");printMatrix(B,M,N);productMatrix(A,B,C, M,N);printf ("The product matrix is\n");printMatrix(C,M,N);}/*Input matrix A*/void readMatrix(int arr[][MAXCOLS], int M, int N){int i, j;for(i=0; i< M ; i++){for ( j=0; j < N; j++){scanf("%d",&arr[i][j]);}}}void printMatrix(int arr[][MAXCOLS], int M, int N){int i, j;for(i=0; i< M ; i++){for ( j=0; j < N; j++){printf("%3d",arr[i][j]);}printf("\n");}}/* Multiplication of matrices */void productMatrix(int A[][MAXCOLS], int B[][MAXCOLS], int C[][MAXCOLS],int M, int N){int i, j, k;for(i=0; i< M ; i++){for ( j=0; j < N; j++){C[i][j] = 0 ;for (k=0; k < N; k++){C[i][j] = C[i][j] + A[i][k] * B[k][j];}}}}
Not My Job
J. N. M. SMITH has written: 'POPULATION PERSISTENCE IN FRAGMENTED LANDSCAPES'
N. J. M. Kwakman has written: 'Terrorismebestrijding' -- subject(s): Terrorism
#include<stdio.h> int *a,*b,*c,i,j,k,m,n; void Read(int *,int,int); void mul(int *,int *,int *,int,int); main() { clrscr(); printf("\n enter no.of rows and colomums"); scanf("%d',&m,&n); a=(int *)malloc(sizeof(int)*m*n); printf("\n enter the elements into a matrix"); Read(a,m,n); b=(int *)malloc(sizeof(int)*m*n); printf("\n enter the elments into b matrix"); Read(b,m,n); printf("\n multiplication is"); c=(int *)malloc(sizeof(int)*m*n); getch(); } void Read(int *x,int m,int n) { for(i=0;i<m;i++) { for(j=0;j<n;j++) { scanf("%d",(x+i*n+j)); } } void mul(int *x,*y,*z,int m ,int n) { for(i=0;i<m;i++) { for(j=0;j<n;j++) { c[i][j]=0; for(k=0;k<n;k++) { c[i][j]+=a[i][k]*b[k][j]; printf("%d",c[i][j]); } } } }
s o n