Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // NgJaBach: Forever Meadow <3
- #include<bits/stdc++.h>
- using namespace std;
- typedef long long int ll;
- typedef unsigned long long ull;
- #define pb push_back
- #define pob pop_back
- #define mp make_pair
- #define upb upper_bound
- #define lwb lower_bound
- #define bend(a) a.begin(),a.end()
- #define rev(x) reverse(bend(x))
- #define mset(a) memset(a, 0, sizeof(a))
- #define fi first
- #define se second
- #define gcd __gcd
- #define getl(s) getline(cin, s);
- #define setpre(x) fixed << setprecision(x)
- #define endl '\n'
- const int N=200050,M=1000000007;
- const ll INF=1e18+7;
- int main(){
- ios_base::sync_with_stdio(NULL); cin.tie(nullptr); cout.tie(nullptr);
- freopen("gymnastics.in","r",stdin);
- freopen("gymnastics.out","w",stdout);
- int n,m,cows[25][25],a,ans=0;
- bool ok;
- cin>>n>>m;
- for(int i=0;i<n;++i){
- for(int j=0;j<m;++j){
- cin>>a;
- cows[i][a]=j;
- }
- }
- for(int i=1;i<=m;++i){
- for(int j=1;j<=m;++j){
- if(i==j) continue;
- ok=true;
- for(int k=0;k<n;++k){
- if(cows[k][i]<=cows[k][j]){
- ok=false;
- break;
- }
- }
- if(ok) ++ans;
- }
- }
- cout<<ans;
- return 0;
- }
- /*
- ==================================+
- INPUT: |
- ------------------------------ |
- ------------------------------ |
- ==================================+
- OUTPUT: |
- ------------------------------ |
- ------------------------------ |
- ==================================+
- */
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement