Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<limits.h>
- int main(){
- int i,j,red,kol,pom;
- scanf("%d%d",&red,&kol);
- int matrica[red][kol];
- for(i=0;i<red;i++){
- // i=0 j=0,1,2 -> 00 01 02
- // i=1 j=0,1,2 -> 10 11 12
- for(j=0;j<kol;j++){
- scanf("%d",&matrica[i][j]);
- }
- }
- int max=matrica[0][0];
- int pamtiRed,pamtiKolona;
- for(i=0;i<red;i++){
- for(j=0;j<kol;j++){
- if(matrica[i][j]>=max){
- max=matrica[i][j];
- pamtiRed=i;
- pamtiKolona=j;
- }
- }
- }
- k
- for(i=0;i<red;i++){
- for(j=0;j<kol;j++){
- if(i==pamtiRed || j==pamtiKolona){
- matrica[i][j]=max;
- }
- }
- }
- for(i=0;i<red;i++){
- for(j=0;j<kol;j++){
- printf("%d ",matrica[i][j]);
- }
- printf("\n");
- }
- /*
- 1 2 3 = 6
- 4 5 6 = 15
- 7 8 9 = 24
- pamtiMin0 pamtiMin1 pamtiMin2
- 10 11 12
- pamtiMax0 pamtiMax1 pamtiMax2
- */
- /*
- int sumaRed,pamtiMin,pamtiMax;
- int maxRed=INT_MIN;
- int minRed=INT_MAX;
- for(i=0;i<red;i++){
- sumaRed=0;
- for(j=0;j<kol;j++){
- sumaRed+=matrica[i][j];
- }
- if(sumaRed>maxRed){
- maxRed=sumaRed;
- pamtiMax=i;
- }
- if(sumaRed<minRed){
- minRed=sumaRed;
- pamtiMin=i;
- }
- }
- for(j=0;j<kol;j++){
- pom=matrica[pamtiMin][j];
- matrica[pamtiMin][j]=matrica[pamtiMax][j];
- matrica[pamtiMax][j]=pom;
- }
- for(i=0;i<red;i++){
- for(j=0;j<kol;j++){
- printf("%d ",matrica[i][j]);
- }
- printf("\n");
- }
- */
- /*
- int niza[red];
- for(i=0;i<red;i++){
- niza[i]=0;
- for(j=0;j<kol;j++){
- niza[i]+=matrica[i][j];
- }
- }
- for(i=0;i<red;i++){
- printf("%d ",niza[i]);
- }
- printf("\n");
- */
- /*
- int maxRamka=matrica[0][0];
- int minRamka=matrica[1][1];
- for(i=0;i<red;i++){
- for(j=0;j<kol;j++){
- // proverka dali sme vo ramka
- if(i==0 || i==red-1 || j==0 || j==kol-1){
- if(matrica[i][j]>maxRamka){
- maxRamka=matrica[i][j];
- }
- }else{
- if(matrica[i][j]<minRamka){
- minRamka=matrica[i][j];
- }
- }
- }
- }
- for(i=0;i<red;i++){
- for(j=0;j<kol;j++){
- if(i==0 || i==red-1 || j==0 || j==kol-1){
- matrica[i][j]=minRamka;
- }else{
- matrica[i][j]=maxRamka;
- }
- printf("%d ",matrica[i][j]);
- }
- printf("\n");
- }
- */
- /*
- int sumaRed=0;
- int sumaKol=0;
- for(i=0;i<red;i++){
- for(j=0;j<kol;j++){
- if(i%2==1 && matrica[i][j]%2==0){
- sumaRed+=matrica[i][j];
- }
- if(j%2==0 && matrica[i][j]%2==1){
- sumaKol+=matrica[i][j];
- }
- }
- }
- printf("Redici %d:%d Koloni\n",sumaRed,sumaKol);
- */
- /*
- int sumaRed=0;
- int maxSumaRed=0;
- int pamtiRed;
- for(i=0;i<red;i++){
- sumaRed=0;
- for(j=0;j<kol;j++){
- sumaRed+=matrica[i][j];
- }
- if(sumaRed>maxSumaRed){
- maxSumaRed=sumaRed;
- pamtiRed=i;
- }
- }
- printf("Red so najgolema suma e %d\n",pamtiRed);
- */
- /*
- int brojParni=0;
- int maxbrojParni=0;
- int pamtiKolona;
- for(j=0;j<kol;j++){
- brojParni=0;
- for(i=0;i<red;i++){
- if(matrica[i][j]%2==0){
- brojParni++;
- }
- }
- if(brojParni>maxbrojParni){
- maxbrojParni=brojParni;
- pamtiKolona=j;
- }
- printf("\n");
- }
- printf("Kolona so najvekje parni e %d\n",pamtiKolona);
- */
- /*
- int flag=1;
- for(i=0;i<kol;i++){
- for(j=0;j<red;j++){
- if(matrica[i][j]!=matrica[j][i]){
- flag=0;
- break;
- }
- }
- }
- if(flag){
- printf("Simetrichna e\n");
- }else{
- printf("Ne e\n");
- }
- */
- // transponirana
- /*
- for(i=0;i<kol;i++){
- for(j=0;j<red;j++){
- printf("%d ", matrica[j][i]);
- }
- printf("\n");
- }
- */
- /*
- int suma=0;
- int brojac=0;
- for(i=0;i<red;i++){
- for(j=0;j<kol;j++){
- suma+=matrica[i][j];
- brojac++;
- }
- }
- printf("Sredna vrednost na matricata e %.2f\n",(float)suma/brojac);
- */
- /*
- int flag=1;
- for(i=0;i<red;i++){
- for(j=0;j<kol;j++){
- if(matrica[i][j]!=0 && matrica[i][j]!=1){
- printf("%d%d\n",i,j);
- flag=0;
- }
- }
- }
- if(flag){
- printf("Da\n");
- }else{
- printf("Ne\n");
- }
- */
- /*
- int max=matrica[0][0];
- int pamtiRed,pamtiKolona;
- for(i=0;i<red;i++){
- for(j=0;j<kol;j++){
- if(matrica[i][j]>=max){
- max=matrica[i][j];
- pamtiRed=i;
- pamtiKolona=j;
- }
- }
- }
- printf("Max e %d, se naogja na pozicija %d%d\n",max,pamtiRed,pamtiKolona);
- */
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment