靶机说明: VM Name: JIS-CTF : VulnUpload Difficulty: Beginner Description: There are five flags on this machine. Try to find them. It takes 1.5 hour on average to find all flags. Only working with VirtualBox 需要找到5个flag,并且靶机只能导入到VirtualBox中,才能被探测到 目标探测: 本次
[leetcode]1. Two Sum两数之和 Two Pointers, HashMap Easy [leetcode]2. Add Two Numbers两数相加 Math, LinkedList Medium [leetcode]3. Longest Substring Without Repeating Characters无重复字母的最长子串 Sliding Window Medium [leetcode]4. Median of Two Sorted Arrays俩有序数组的中位数
PTA-算法设计与分析 - c++(g++) #include<bits/stdc++.h> using namespace std; long max3(long a,long b,long c) { if(a<b) a=b; if(a>c) return a; else return c; } long maxSubSum(int a[],int left,int right) { int i,j; long maxLeftSum,maxRightSum; long maxLe
Flow Problem Time Limit: 5000/5000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 28193 Accepted Submission(s): 12476 Problem Description Network flow is a well-known difficult problem for ACMers. Given a graph,