SDUT 3348 数据结构实验之数组二：稀疏矩阵

点击打开题目链接

#include <bits/stdc++.h>
#define Max 100
#define OK 1
using namespace std;

typedef int Elemtype;
typedef int Status;

typedef struct
{
    int i, j;
    Elemtype e;
}Triple;

typedef struct
{
    Triple data[Max+1];
    int mu, nu, tu;
}TSmatrix;

int main()
{
    int mu, nu, tu;
    while(~scanf("%d %d %d", &mu, &nu, &tu))
    {
        TSmatrix T, M;
        M.mu = mu, M.nu = nu, M.tu = tu;
        for(int p = 1; p <= tu; p ++)
        {
            int i, j, e;
            scanf("%d %d %d", &i, &j, &e);
            M.data[p].i = i;
            M.data[p].j = j;
            M.data[p].e = e;
        }
        int key;
        int flag = 0;
        scanf("%d", &key);
        for(int p = 1; p <= M.tu; p ++)
        {
            if(M.data[p].e == key)
            {
                printf("OK\n");
                flag = 1;
            }
        }
        if(!flag)
        {
            printf("ERROR\n");
        }
    }
    return 0;
}