2 solutions
-
1
#include<bits/stdc++.h> using namespace std; int k,n,a[20][30],x,cnt; bool f; int main() { cin>>k>>n; for(int i=1;i<=k;i++) { for(int j=1;j<=n;j++) { cin>>x; a[i][x]=j; } } for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { if(i==j) { continue; } f=true; for(int t=1;t<=k;t++) { if(a[t][i]>a[t][j]) { f=false; break; } } if(f) { cnt++; } } } cout<<cnt; return 0; }
Information
- ID
- 786
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 3
- Tags
- # Submissions
- 4
- Accepted
- 4
- Uploaded By