1 solutions
-
0
C++ :
#include<bits/stdc++.h> using namespace std; int k,n,a[20][30],ans; int main(){ cin>>k>>n; for(int i=1;i<=k;i++) for(int j=1;j<=n;j++) cin>>a[i][j]; for(int i=1;i<=n;i++) { int tmp1=a[1][i]; for(int j=i+1;j<=n;j++) { int tmp2=a[1][j]; int sum=1; for(int p=2;p<=k;p++) { for(int q=1;q<=n;q++) { if(a[p][q]==tmp1) { for(int r=q+1;r<=n;r++) if(a[p][r]==tmp2) {sum++;break;} } } } if(sum==k) ans++; } } cout<<ans; }
- 1
Information
- ID
- 959
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 10
- Tags
- # Submissions
- 1
- Accepted
- 1
- Uploaded By