题目
解法
int main()
{
int n = 0, m = 0;
scanf(" %d %d", &n, &m);
int* num = (int*)malloc(sizeof(int)*n*m);
//存入数据
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%d", &num[i*m + j]);
}
getchar();
}
//判断重复
int count = 0;
for (int i = 0; i < m; i++) {
int count1 = 1;
for (int j = m; j < n*m; j++) {
if (num[i] == num[j])
count1++;
}
if (count1 == n)
count++;
}
printf("%d", count);
return 0;
}
此处用到了动态内存,如下是一篇个人觉得写的很好的博客
http://t.csdn.cn/5zxhu