current position:Home>Why can this code run but can't output anything?
Why can this code run but can't output anything?
2022-01-27 02:35:10 【CSDN Q & A】
The title is “ Find one 5 That's ok 4 Of a two-dimensional array of columns “ saddle point ”, That is, the element in this position is the smallest on this line , Maximum on this column . Output the value and row and column number of this element , If there is no saddle point , The output “ No saddle point found ”.”
Problem related code
#include<iostream>using namespace std;int main(){ int a[5][4],i,j; void andian(int array[5][4]); for(i=0;i<=4;i++) for(j=0;j<=3;j++) cin>>a[i][j]; andian(a); return 0;}void andian(int array[5][4]){ int i,j; int min(int,int,int,int); int max(int,int,int,int,int); for(i=0;i<=4;i++) for(j=0;j<=3;j++) if(array[i][j]==min(array[i][0],array[i][1],array[i][2],array[i][3])&&array[i][j]==max(array[0][j],array[1][j],array[2][j],array[3][j],array[4][j])) cout<<i<<" "<<j<<endl;}int min(int a,int b,int c,int d){ int y=0; if(a<y)y=a; if(b<y)y=b; if(c<y)y=c; if(d<y)y=d; return(y);}int max(int a,int b,int c,int d,int e){ int x=0; if(a>x)x=a; if(b>x)x=b; if(c>x)x=c; if(d>x)x=d; if(e>x)x=d; return(x);}
Input of operation results and error reports
No matter what you input, there is no output .
My solution ideas and tried methods
What I want to achieve
Refer to the answer 1:
int x=0;
if(a<x)x=a;
Change it to x=a;
First, let x The value of is the first number , Otherwise, all numbers must be natural numbers , Can't judge negative numbers .
-=-=-=
min The problem with functions is bigger , You just let y=0, If the data you enter is greater than 0, No matter how you calculate , The minimum value will be 0, Of course that can't be equal .
Refer to the answer 2:
copyright notice
author[CSDN Q & A],Please bring the original link to reprint, thank you.
https://en.cdmana.com/2022/01/202201270235072017.html
The sidebar is recommended
- Spring IOC container loading process
- [thinking] the difference between singleton mode and static method - object-oriented programming
- Hadoop environment setup (MySQL environment configuration)
- 10 minutes, using node JS creates a real-time early warning system for bad weather!
- Git tool
- Force deduction algorithm - 92 Reverse linked list II
- What is the sub problem of dynamic programming?
- C / C + +: static keyword summary
- Idea does not have the artifacts option when configuring Tomcat
- Anaconda can't open it
guess what you like
-
I don't know how to start this
-
Matlab simulation of transportation optimization algorithm based on PSO
-
MySQL slow log optimization
-
[Vue] as the window is stretched (larger, smaller, wider and higher), the text will not be displayed
-
Popular Linux distributions for embedded computing
-
Suzhou computer research
-
After installing SSL Certificate in Windows + tomcat, the domain name request is not successful. Please answer!!
-
Implementation time output and greetings of jQuery instance
-
The 72 year old uncle became popular. Wu Jing and Guo fan made his story into a film, which made countless dreamers blush
-
How to save computer research
Random recommended
- Springboot implements excel import and export, which is easy to use, and poi can be thrown away
- The final examination subjects of a class are mathematical programming, and the scores are sorted and output from high to low
- Two pronged approach, Tsinghua Professor Pro code JDK and hotspot source code notes, one-time learning to understand
- C + + recursive knapsack problem
- The use of GIT and GitHub and the latest git tutorial are easy to understand -- Video notes of crazy God speaking
- PostgreSQL statement query
- Ignition database test
- Context didn't understand why he got a high salary?, Nginxfair principle
- Bootstrap switch switch control user's guide, springcloud actual combat video
- A list that contains only strings. What other search methods can be used except sequential search
- [matlab path planning] multi ant colony algorithm grid map path planning [including GUI source code 650]
- [matlab path planning] improved genetic algorithm grid map path planning [including source code phase 525]
- Iinternet network path management system
- Appium settings app is not running after 5000ms
- Reactnative foundation - 07 (background image, status bar, statusbar)
- Reactnative foundation - 04 (custom rpx)
- If you want an embedded database (H2, hsql or Derby), please put it on the classpath
- When using stm32g070 Hal library, if you want to write to flash, you must perform an erase. If you don't let it, you can't write continuously.
- Linux checks where the software is installed and what files are installed
- SQL statement fuzzy query and time interval filtering
- 69. Sqrt (x) (c + + problem solving version with vs runnable source program)
- Fresh students are about to graduate. Do you choose Java development or big data?
- Java project: OA management system (java + SSM + bootstrap + MySQL + JSP)
- Titanic passenger survival prediction
- Vectorization of deep learning formula
- Configuration and use of private image warehouse of microservice architect docker
- Relearn JavaScript events
- For someone, delete return 1 and return 0
- How does Java dynamically obtain what type of data is passed? It is used to judge whether the data is the same, dynamic data type
- How does the database cow optimize SQL?
- [data structure] chain structure of binary tree (pre order traversal) (middle order traversal) (post order traversal) (sequence traversal)
- Webpack packaging optimization solution
- 5. Operation element
- Detailed explanation of red and black trees
- redhat7. 9 install database 19C
- Blue Bridge Cup notes: (the given elements are not repeated) complete arrangement (arrangement cannot be repeated, arrangement can be repeated)
- Detailed explanation of springboot default package scanning mechanism and @ componentscan specified scanning path
- How to solve the run-time exception of test times
- Detailed explanation of k8s management tool kubectl
- Android system view memory command