-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathexperiment.cpp
50 lines (44 loc) · 850 Bytes
/
experiment.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include <iostream>
using namespace std;
int main() {
int num, mat[5][5];
int n=5;
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
int x;
cin >> x;
mat[i][j] = x;
}
}
int rank;
cin >> num;
if(num < mat[0][0]){
cout << n*n+1 << endl;
return 0;
}
if(num == mat[0][0]){
cout << n*n << endl;
return 0;
}
if(num >= mat[n-1][n-1]){
cout << 1 << endl;
return 0;
}
int i=0, j=n-1, count=0;
while(i<n and j>=0){
if(mat[i][j]>num){
j--;
continue;
}
if(mat[i][j]<=num){
count += (n-j-1);
i++;
}
}
if(i!=n){
int ext = (n-i)*n;
count += ext;
}
cout << count+1 << endl;
return 0;
}