Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int arr[15][25];
- int check[25];
- void solve(){
- int k,n;
- scanf("%d %d",&k,&n);
- for(int i=1;i<=k;i++){
- for(int j=1;j<=n;j++){
- scanf("%d",&arr[i][j]);
- }
- }
- int ans=0;
- for(int x=1;x<=n;x++){
- memset(check,0,sizeof(check));
- for(int i=1;i<=k;i++){
- bool flag=0;
- for(int j=1;j<=n;j++){
- if(flag==1){
- check[arr[i][j]]++;
- }
- if(arr[i][j]==x) flag=1;
- }
- }
- for(int i=1;i<=n;i++){
- if(i==x) continue;
- if(check[i]==k)ans++;
- }
- }
- printf("%d\n",ans);
- }
- int main()
- {
- freopen("gymnastics.in", "r", stdin);
- freopen("gymnastics.out", "w", stdout);
- int tc=1;
- //scanf("%d",&tc);
- while(tc--){
- solve();
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement