代码搜索：PATH
找到约 10,000 项符合「PATH」的源代码
代码结果 10,000
www.eeworm.com/read/373369/9460811
py outputgenerator.py
#!/usr/bin/python
"""
Runs a Java program, appends output if it's not there
-force as first argument when doing batch files forces overwrite
"""
import os, re, sys
argTag = '// {Args: '
o
www.eeworm.com/read/373153/9471955
java zipentryfileproxy.java
import java.util.*;
import java.util.zip.*;
import java.io.*;
import java.net.*;
public class ZipEntryFileProxy extends DebugFile {
ZipFileProxy zip;
ZipFile zipfile;
String name, path;
www.eeworm.com/read/373012/9479570
c eigenpar.c
#define RCSID "$Id: EigenPar.c,v 1.4 2006/02/26 00:42:54 geuzaine Exp $"
/*
* Copyright (C) 1997-2006 P. Dular, C. Geuzaine
*
* This program is free software; you can redistribute it and/or modify
www.eeworm.com/read/176556/9493557
txt zn.txt
#include "stdio.h"
#include "conio.h"
#define n 6 /*图的顶点数*/
#define k 4 /*图的段数*/
#define MAX 1000
typedef int NodeNumber; /*节点编号*/
typedef int CostType; /*成本值类型*/
CostType cost[n][n];
www.eeworm.com/read/372750/9494720
bas mduglobal.bas
Attribute VB_Name = "mduGlobal"
Option Explicit
Public Function GetAppPath() As String
If Right(App.Path, 1) = "\" Then
GetAppPath = App.Path
Else
GetAppPath = App.Path
www.eeworm.com/read/372709/9496737
cpp 09.cpp
#include
#include
#define MAXPOINT 3
#define limit 32767
struct record{
int number;
int flag;
int allpath;
}path[MAXPOINT+1];
int cost[MAXPOINT+1][MAXPOINT+1];
v
www.eeworm.com/read/176483/9496911
bas mduglobal.bas
Attribute VB_Name = "mduGlobal"
Option Explicit
Public Function GetAppPath() As String
If Right(App.Path, 1) = "\" Then
GetAppPath = App.Path
Else
GetAppPath = App.Path
www.eeworm.com/read/371950/9529237
cpp main.cpp
/****************************************************************************
21. 请设计一个程序，由计算机把１..￣.８的八个自然数填入图中，使得横、
竖、对角任何两个相邻的小方格中的两个数是不连续的。(下图右侧的 4 个图
为禁止的情形).
┌─┐ ┌─┐
www.eeworm.com/read/371950/9529246
cpp main.cpp
/*****************************************************************************
22. 在一个４＊４的小方格（如图所示）中放置８个＊号，使得每行每列放且
仅放两个＊号。
┌─┬─┬─┬─┐
│＊│＊│ │ │
├─┼─┼─┼─┤
www.eeworm.com/read/371950/9529334
cpp main.cpp
/******************************************************************************
71. (最长连线) 设有一个 N×N 的方格图形，且 N 为 3 的倍数。要求在图形中
存放 0 或 1，相邻的 1 可以连成一条连线，连接的方法可以是行，也可以是列；
同时约定一条连线只能有一个起点和一个终点，图形上的点最