KT-Yeh

#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;

struct coordinate_type{
    int x;
    int y;
};
coordinate_type pos[1001];

KT-Yeh

#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
int main()
{
    int N, M, S;
    double V;
    double R[101][101] = {0};
    double C[101][101];

KT-Yeh

#include <cstdio>
using namespace std;
#define INF 99999999

int Dis[101][101];

int main()
{
    int N;
    while (scanf("%d", &N) && N) {

KT-Yeh

#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
#define INF 99999999

struct Point_type {
    vector<int> D;    // next point index
    vector<int> L;    // length
    vector<int> T;    // toll

KT-Yeh

#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
#define INF 999999999
struct Weight_type{
    int P;
    int W;
};
int main()

KT-Yeh

#include <iostream>
#include <sstream>
#include <queue>
using namespace std;
#define Inf 99999999

int main()
{
    ios::sync_with_stdio(false);
    int n, k;

KT-Yeh

#include <cstdio>
#include <queue>
using namespace std;

int Energy[101];
int toNxt[101][101];

bool SPFA(const int N);

int main()

KT-Yeh

#include <iostream>
#include <sstream>
#include <algorithm>
using namespace std;
#define Inf 9999999

int F_pos[101];
int Dis[501][501];

void Dis_Initial(const int &N);

KT-Yeh

#include <cstdio>
#include <algorithm>
using namespace std;
#define Inf 99999999
int dis[101][101];
int C, S, Q, Case = 1;

void Initial();
void Floyd();

KT-Yeh

#include <cstdio>
using namespace std;
#define Inf 9999999

struct Edge{
    int P;
    int Q;
}E[10005];
int nOfE;
int Dis[101];