- 博客(32)
- 收藏
- 关注
RSS订阅原创 P2078 朋友 LUOGU JAVA
因为两个公司都是同性，所以能看成两边单独的并查集，只要0移位到1e5的位置，就解决负数的情况。然后只要看一下1e5(±)1相同的根就可以判断有多少个人和他们认识。
2023-10-05 19:43:45
61
原创 2021-07-06
CTFhub 目录遍历先点进去看了下目录，有两层，所以直接暴力循环import requestsdef nb(): url = "http://challenge-cd17494c9655b07d.sandbox.ctfhub.com:10800/flag_in_here/" for i in range(1, 5): for j in range(1, 5): gg=url + str(i) + "/" + str(j)
2021-07-06 09:16:10
91
原创 POJ 3104 java
POJ 3104 java公式来自import java.util.Arrays;import java.util.Scanner;public class Main{ public static void main(String args[]) { Scanner sc = new Scanner(System.in); while (sc.hasNext()) { int a = sc.nextInt(); int x[] = new int[a]; for
2020-12-29 21:28:15
158
原创 poj1015 java ((看了题解好久!!!!
import java.util.LinkedList;import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner sc=new Scanner(System.in); int ok=1; while(sc.hasNext()) { int a=sc.nextInt(),b=sc.nextInt(); if(a==b && b=
2020-11-25 04:12:19
113
1
原创 hdu1160
import java.util.Arrays;import java.util.Collections;import java.util.LinkedList;import java.util.Scanner;import java.util.Stack;import javax.jws.soap.SOAPBinding.Use;public class Main{ public static void main(String[] args) { Scanner sc = new
2020-11-25 04:11:19
83
原创 hdu1260
import java.util.Scanner;public class Main{ public static void main(String[] args) { Scanner sc = new Scanner(System.in); while (sc.hasNext()) { int x=sc.nextInt(); while(x-->0) { int g=sc.nextInt(); int max=Integer.MAX_VALUE;
2020-11-25 04:07:47
48
原创 hdu1114
import java.util.ArrayList;import java.util.Arrays;import java.util.Scanner;public class Main{ public static void main(String args[]) { Scanner sc = new Scanner(System.in); int max = 0x3f3f3f3f; while (sc.hasNext()) { int cnm = sc.nextI
2020-11-25 04:06:31
60
原创 hdu1087
import java.util.Scanner;public class Main{ public static void main(String args[]) { Scanner sc=new Scanner(System.in); while(sc.hasNext()) { int a=sc.nextInt(); if (a==0) { return; }else { int arr[]=new int[a]; for (int i =
2020-11-25 04:05:40
71
原创 hdu1074
import java.util.Scanner;import java.util.Stack;import javax.jws.soap.SOAPBinding.Use;public class Main{ public static void main(String[] args) { Scanner sc = new Scanner(System.in); while (sc.hasNext()) { int cnm = sc.nextInt(); while
2020-11-25 04:05:10
101
原创 hdu1069
import java.util.ArrayList;import java.util.Collections;import java.util.Scanner;import java.util.Stack;public class Main{ public static void main(String[] args) { Scanner sc = new Scanner(System.in); int g=0; while (sc.hasNext()) { g++;
2020-11-25 04:04:33
76
原创 HDU1029
import java.util.Map.Entry;import java.util.Arrays;import java.util.Collections;import java.util.HashMap;import java.util.Iterator;import java.util.LinkedList;import java.util.Scanner;public class Main{ public static void main(String args[]) {
2020-11-25 04:03:47
65
原创 A - Max Sum Plus Plus HDU - 1024 JAVA
hdoj1024 JAVAimport java.util.Scanner;public class Main{ public static void main(String[] args) { Scanner sc = new Scanner(System.in); while (sc.hasNext()) { int a, b; a = sc.nextInt(); b = sc.nextInt(); long ok[] = new long[b+1];
2020-09-23 01:26:49
136
原创 平面切割 JAVA
import java.util.Scanner;public class Main{public static int find[]=new int[100001];public static void main(String[] args){ Scanner sc = new Scanner(System.in); while (sc.hasNext()) { int x=sc.nextInt(); while(x-->0) { int a=sc.nextInt();
2020-08-27 21:54:41
537
原创 hdu2602 01背包 java
import java.io.BufferedReader;import java.io.IOException;import java.io.InputStream;import java.io.InputStreamReader;import java.io.OutputStream;import java.io.PrintWriter;import java.util.Arrays;import java.util.Scanner;import java.util.StringToke
2020-08-26 16:53:54
145
原创 N - Find a way HDU - 2612 java
import java.math.BigInteger;import java.util.ArrayDeque;import java.util.Arrays;import java.util.LinkedList;import java.util.Queue;import java.util.Scanner;import java.util.Stack;public class Main{ public static int move[][]= {{0,1},{0,-1},{1,0},
2020-08-18 18:16:15
113
原创 M - 非常可乐 HDU - 1495 java
import java.util.ArrayList;import java.util.LinkedList;import java.util.Queue;import java.util.Scanner;public class Main{ public static void main(String args[]) { Scanner sc = new Scanner(System.in); while (sc.hasNext()) { int a, b, c;
2020-08-18 18:15:28
154
原创 L - Oil Deposits HDU - 1241 JAVA
import java.util.ArrayList;import java.util.LinkedList;import java.util.Queue;import java.util.Scanner;public class Main{ public static int dfs[][]; public static char arr[][]; public static int a, b; public static int all = 0; public static int
2020-08-18 18:14:58
150
原创 K - 迷宫问题 POJ - 3984 JAVA
import java.util.ArrayList;import java.util.LinkedList;import java.util.Queue;import java.util.Scanner;public class Main{ public static int move[][]= {{0,1},{0,-1},{1,0},{-1,0}}; public static void main(String args[]) { Scanner sc=new Scanner(Sys
2020-08-17 09:42:58
271
原创 J - Fire! UVA - 11624 JAVA
import java.io.BufferedReader;import java.io.IOException;import java.io.InputStream;import java.io.InputStreamReader;import java.io.OutputStream;import java.io.PrintWriter;import java.util.LinkedList;import java.util.Queue;import java.util.Scanner;
2020-08-17 09:42:25
116
原创 I - Pots POJ - 3414
import java.util.ArrayDeque;import java.util.LinkedList;import java.util.Queue;import java.util.Scanner;public class Main{ public static void main(String args[]) { Scanner sc = new Scanner(System.in); int a = sc.nextInt(); int b = sc.nex
2020-08-17 09:41:45
139
原创 H - Shuffle‘m Up POJ - 3087
这题能模拟过import java.util.Scanner;public class Main{public static int step = 1; public static void main(String args[]) { Scanner sc = new Scanner(System.in); while (sc.hasNext()) { int x = sc.nextInt(); for (int i = 1; i <= x; i++)
2020-08-17 09:40:39
115
原创 F - Prime Path POJ - 3126 JAVA
import java.math.BigInteger;import java.util.ArrayDeque;import java.util.Arrays;import java.util.HashSet;import java.util.LinkedList;import java.util.Queue;import java.util.Scanner;import java.util.Set;import javax.swing.text.GapContent;public c
2020-08-17 09:39:55
221
原创 E - Find The Multiple POJ - 1426 JAVA
import java.math.BigInteger;import java.util.ArrayDeque;import java.util.Arrays;import java.util.LinkedList;import java.util.Queue;import java.util.Scanner;public class Main{ public static long sb = 0; public static void main(String args[]) {
2020-08-17 09:39:18
102
原创 D - Fliptile POJ - 3279 JAVA
import java.math.BigInteger;import java.util.ArrayDeque;import java.util.Arrays;import java.util.LinkedList;import java.util.Queue;import java.util.Scanner;public class Main{ public static int dir[][] = { { 0, 1 }, { 0, -1 }, { 1, 0 },
2020-08-17 09:38:34
143
原创 C - Catch That Cow POJ - 3278 JAVA
import java.util.ArrayList;import java.util.LinkedList;import java.util.Queue;import java.util.Scanner;public class Main{ public static int x = 0; public static void main(String args[]) { Scanner sc = new Scanner(System.in); while (sc.hasNext
2020-08-17 09:37:54
145
原创 POJ 2251 JAVA
import java.util.ArrayList;import java.util.LinkedList;import java.util.Queue;import java.util.Scanner;public class Main{ public static void main(String args[]) { Scanner sc = new Scanner(System.in); while (sc.hasNext()) { int dir[][] = {
2020-08-17 09:37:18
256
原创 POJ1321棋盘问题 java
import java.util.Arrays;import java.util.Scanner;public class Main { public static char xy[][]; public static boolean h[]; public static int step; public static void main(String[] args) { Scanner sc=new Scanner(System.in);
2020-08-17 09:36:21
136
原创 智算之道第三題
并查集import java.math.BigInteger;import java.time.Year;import java.util.Arrays;import java.util.Scanner;public class Main{ public static int x[], y[], z[]; public static void main(String args[]) { Scanner sc = new Scanner(System.in); while (sc
2020-07-21 20:56:39
169
原创 智算之道C 字符串 JAVA
哈希import java.math.BigDecimal;import java.math.BigInteger;import java.util.ArrayDeque;import java.util.Arrays;import java.util.Collections;import java.util.HashSet;import java.util.LinkedList;import java.util.Queue;import java.util.Scanner;import
2020-07-20 00:55:34
97
原创 HDOJ 1010 JAVA 暴力 + 奇偶剪枝
我写的究极垃圾的DFS hdoj 1010 java【 奇偶剪枝】【细节】【千万不能bfs】```javaimport java.util.ArrayList;import java.util.LinkedList;import java.util.Queue;import java.util.Scanner;public class Main{ public static int move[][] = { { 0, 1 }, { 0, -1 }, { 1,
2020-06-27 23:08:28
194
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人