Tizzi的博客

import java.util.Scanner;public class gcd_lcm { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int a = sc.nextInt(); int b = sc.nextInt(); System.out.println(...

import java.util.Scanner;public class 欧拉函数 { static int n; public static void main(String[] args) { Scanner sc = new Scanner(System.in); n = sc.nextInt(); System.out.println(euler_one()); }...

import java.util.Scanner;public class 矩阵快速幂 { static int[][] a; public static void main(String[] args) { Scanner sc = new Scanner(System.in); a = new int[sc.nextInt()][sc.nextInt()]; for (in...

import java.util.Scanner;public class 质数筛法 { static boolean[] is_prime = new boolean[10000]; static int n; public static void main(String[] args) { Scanner sc = new Scanner(System.in); n = sc...

static int head[] = new int[1005]; // 存放链头static edge[] e = new edge[1005];static int len; // 边的个数//添加有向边static void add(int u, int v, int w) { //添加 u指向v 这条边，权值为w e[len] = new edge(v, w, he...

基于邻接表（链表形式）实现。import java.util.*;public class Dijkstra模板 { static int dis[] = new int[1005]; static boolean vis[] = new boolean[1005]; static int head[] = new int[1005]; // 存放链头 static edge[] e...

基于邻接表（链表形式）实现。import java.util.*;public class SPFA模板 { static int N = 1005; static int len; //有向边个数 static int[] head = new int[N]; static edge[] e = new edge[N]; static int[] dis = new int[N]...

import java.util.*;//Floyd基于邻接矩阵public class Floyd模板 { static int N = 1005; static int[][] G = new int[N][N]; static int n, m; static void init() { for (int i = 1; i < N; i++) { for ...

import java.util.Scanner;public class LICS{ static int N = 1000; static int n, m, ans, max; static int[] s1 = new int[N + 5], s2 = new int[N + 5]; static int[][] dp = new int[N + 5][N + 5]; pu...