hiho week 24 register

Ended

Participants:807

Verdict:Accepted
Score:100 / 100
Submitted:2014-12-17 03:08:58

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
using namespace std;
#define max 1000000000
int d[1000][1000];
int main()
{
    int i,j,k,m,n;
    int x,y,z;
    while(~scanf("%d%d",&n,&m))
    {
        for(i=1; i<=n; i++)
            for(j=1; j<=n; j++)
            {
                if(i==j)
                {
                    d[i][i] = 0;
                }
                else
                    d[i][j]=max;
            }
        for(i=1; i<=m; i++)
        {
            scanf("%d%d%d",&x,&y,&z);
            if(d[x][y]>z)
            {
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX