代码搜索结果
找到约 33,766 项符合
Algorithm 的代码
test.java
import java.util.*;
public class Test
{
public static void main(String[] args)
{
ARS graph = new ARS("File.txt");
//Step One: Check whether the Dijkstra's algorithm works or not.
concretestrategy.java
package com.javapatterns.strategy;
public class ConcreteStrategy extends Strategy
{
public void strategyInterface()
{
//write you algorithm code here
}
}
1500.cpp
/* This Code is Submitted by wywcgs for Problem 1500 on 2006-01-29 at 02:12:40 */
#include
#include
using namespace std;
int main()
{
int i, j, hanoi[13] = { 0, 1 };
1171.cpp
/* This Code is Submitted by wywcgs for Problem 1171 on 2006-11-13 at 21:45:36 */
#include
#include
using namespace std;
const int N = 32;
int main()
{
int n, m, g[N
2416.cpp
/* This Code is Submitted by wywcgs for Problem 2416 on 2006-11-18 at 13:34:16 */
#include
#include
using namespace std;
const int N = 1024;
int main()
{
int phi[N],
2054.cpp
/* This Code is Submitted by wywcgs for Problem 2054 on 2006-01-07 at 21:19:40 */
#include
#include
#include
using namespace std;
const int MAX = 16;
const doubl
1994.cpp
/* This Code is Submitted by wywcgs for Problem 1994 on 2006-02-21 at 12:18:58 */
#include
#include
using namespace std;
const int MAX = 1024;
int main()
{
int t, T,
2195.cpp
/* This Code is Submitted by wywcgs for Problem 2195 on 2006-04-02 at 22:44:39 */
#include
#include
using namespace std;
typedef long long int64;
const int MAX = 36;
i
2264.cpp
/* This Code is Submitted by wywcgs for Problem 2264 on 2006-06-03 at 17:19:25 */
#include
#include
using namespace std;
typedef long long int64;
const int CN = 102400;
1781.cpp
/* This Code is Submitted by wywcgs for Problem 1781 on 2007-05-06 at 15:14:19 */
#include
#include
using namespace std;
const int N = 10240;
int main()
{
int rs[N], T