- 博客(34)
- 收藏
- 关注
RSS订阅原创 bugkuCTF 程序员本地网站
bp抓包，添加X-Forwarded-For:127.0.0.1伪造本地访问即可。打开一下，提示我们从本地访问。
2023-09-09 09:57:24
481
原创 bugkuCTF 各种绕过哟
uname和passwd不能相等，但是sha1后要求相等，这里用到了php sha1绕过漏洞，技巧就是当传入数组时会报错，返回null，如果两个参数都传入数组时会直接相等.可以采用数组绕过的还有md5(),strpos(),strcmp()。另外如果采用==比较，可以利用php弱类型性质。这些数据经过md5加密后均为0e开头，会被视为科学计数法，值为0，所以相等。
2023-09-09 09:40:59
396
原创 bugkuCTF 字符？正则？
观察一下题目，发现是通过接受一个get型的参数来匹配正则表达式拿到flag，下面分析一下该正则表达式。我给出的是id=keyakeyaaaakey:/a/akeya!(.*key)：表示一个整体，匹配任何以key结尾的字符串。preg_match 函数用于执行一个正则表达式匹配。[a-z]：匹配任何包含小写字母a-z的字符串。.{4,7}：匹配任意字符4到7次。[:punct:]：匹配标点符号。.*：匹配任意数量的任意字符。key：匹配字符串key。/i：表示不区分大小写。
2023-09-09 09:06:04
323
原创 PAT甲级 1127 ZigZagging on a Tree (30 分)
Suppose that all the keys in a binary tree are distinct positive integers. A unique binary tree can be determined by a given pair of postorder and inorder traversal sequences. And it is a simple standard routine to print the numbers in level-order. However
2021-09-08 21:14:04
175
原创 PAT甲级 1045 Favorite Color Stripe (30 分)
Eva is trying to make her own color stripe out of a given one. She would like to keep only her favorite colors in her favorite order by cutting off those unwanted pieces and sewing the remaining parts together to form her favorite color stripe.It is said
2021-09-04 20:29:04
150
原创 PAT甲级 1007 Maximum Subsequence Sum (25 分)
Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1≤i≤j≤K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For example, given seq
2021-09-04 20:10:01
86
原创 PAT甲级 1087 All Roads Lead to Rome (30 分)
Indeed there are many different tourist routes from our city to Rome. You are supposed to find your clients the route with the least cost while gaining the most happiness.Input Specification:Each input file contains one test case. For each case, the fi
2021-09-04 19:26:39
441
原创 PAT甲级 1072 Gas Station (30 分)
A gas station has to be built at such a location that the minimum distance between the station and any of the residential housing is as far away as possible. However it must guarantee that all the houses are in its service range.Now given the map of the
2021-09-03 20:51:34
165
原创 PAT甲级 1018 Public Bike Management (30 分)
There is a public bike service in Hangzhou City which provides great convenience to the tourists from all over the world. One may rent a bike at any station and return it to any other stations in the city.The Public Bike Management Center (PBMC) keeps mo
2021-09-02 21:14:23
142
原创 PAT甲级 1076 Forwards on Weibo (30 分)
Weibo is known as the Chinese version of Twitter. One user on Weibo may have many followers, and may follow many other users as well. Hence a social network is formed with followers relations. When a user makes a post on Weibo, all his/her followers can vi
2021-09-01 21:16:58
93
原创 PAT甲级 1013 Battle Over Cities (25 分)
It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know immediately if we need to repair any other highways to keep the rest of the c
2021-09-01 19:39:21
95
原创 PAT甲级 1107 Social Clusters (30 分)
When register on a social network, you are always asked to specify your hobbies in order to find some potential friends with the same hobbies. A social cluster is a set of people who have some of their hobbies in common. You are supposed to find all the cl
2021-08-31 21:15:33
89
原创 PAT甲级 1099 Build A Binary Search Tree (30 分)
A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:The left subtree of a node contains only nodes with keys less than the node's key. The right subtree of a node contains only nodes with keys greater th
2021-08-31 20:43:52
81
原创 PAT甲级 1004 Counting Leaves (30 分)
A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.Input Specification:Each input file contains one test case. Each case starts with a line containing 0<N<100, the number of nod
2021-08-31 20:07:04
102
原创 PAT甲级 1079 Total Sales of Supply Chain (25 分)
A supply chain is a network of retailers（零售商）, distributors（经销商）, and suppliers（供应商）-- everyone involved in moving a product from supplier to customer.Starting from one root supplier, everyone on the chain buys products from one's supplier in a price P a
2021-08-30 19:52:18
95
原创 PAT甲级 1086 Tree Traversals Again (25 分)
An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that when a 6-node binary tree (with the keys numbered from 1 to 6) is traversed, the stack operations are: push(1); push(2); push(3); pop(); pop(
2021-08-30 19:14:25
81
原创 PAT甲级 1091 Acute Stroke (30 分)
One important factor to identify acute stroke (急性脑卒中) is the volume of the stroke core. Given the results of image analysis in which the core regions are identified in each MRI slice, your job is to calculate the volume of the stroke core.Input Specifica
2021-08-30 18:42:13
76
原创 PAT甲级 1052 Linked List Sorting (25 分)
A linked list consists of a series of structures, which are not necessarily adjacent in memory. We assume that each structure contains an integer key and a Next pointer to the next structure. Now given a linked list, you are supposed to sort the structures
2021-08-29 18:30:21
86
原创 PAT甲级 1051 Pop Sequence (25 分)
Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, ..., N and pop randomly. You are supposed to tell if a given sequence of numbers is a possible pop sequence of the stack. For example, if M is 5 and N is 7, we can obta
2021-08-29 17:55:18
92
原创 PAT甲级 1071 Speech Patterns (25 分)
People often have a preference among synonyms of the same word. For example, some may prefer "the police", while others may prefer "the cops". Analyzing such patterns can help to narrow down a speaker's identity, which is useful when validating, for exampl
2021-08-29 16:43:05
143
原创 PAT 1060 Are They Equal (25 分)
If a machine can save only 3 significant digits, the float numbers 12300 and 12358.9 are considered equal since they are both saved as 0.123×105 with simple chopping. Now given the number of significant digits on a machine and two float numbers, you are su
2021-08-28 22:50:58
96
原创 PAT甲级1063 Set Similarity (25 分)
Given two sets of integers, the similarity of the sets is defined to be Nc/Nt×100%, where Nc is the number of distinct common numbers shared by the two sets, and Nt is the total number of distinct numbers in the two sets. Your job is to calculate the s
2021-08-28 19:20:10
58
原创 PAT甲级1047 Student List for Course (25 分)
Zhejiang University has 40,000 students and provides 2,500 courses. Now given the registered course list of each student, you are supposed to output the student name lists of all the courses.Input Specification:Each input file contains one test case. F
2021-08-27 21:12:16
110
原创 PAT甲级1059 Prime Factors (25 分)
Given any positive integer N, you are supposed to find all of its prime factors, and write them in the format N = p1k1×p2k2×⋯×pmkm.Input Specification:Each input file contains one test case which gives a positive integer N in the range of long in
2021-08-27 20:31:26
92
原创 PAT甲级1085 Perfect Sequence (25 分)
Given a sequence of positive integers and another positive integer p. The sequence is said to be a perfect sequence if M≤m×p where M and m are the maximum and minimum numbers in the sequence, respectively.Now given a sequence and a parameter p, you are s
2021-08-26 19:46:55
109
原创 PAT甲级1038 Recover the Smallest Number (30 分)
Given a collection of number segments, you are supposed to recover the smallest number from them. For example, given { 32, 321, 3214, 0229, 87 }, we can recover many numbers such like 32-321-3214-0229-87 or 0229-32-87-321-3214 with respect to different ord
2021-08-26 19:28:45
80
原创 PAT 1033 To Fill or Not to Fill (25 分)
With highways available, driving a car from Hangzhou to any other city is easy. But since the tank capacity of a car is limited, we have to find gas stations on the way from time to time. Different gas station may give different price. You are asked to car
2021-08-24 22:54:35
45
原创 PAT Find Coins (25 分)
Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coins as payments. However, there was a special requirement of the payment: for eac
2021-08-24 18:59:35
84
原创 PAT甲级1095 Cars on Campus (30 分)
Zhejiang University has 8 campuses and a lot of gates. From each gate we can collect the in/out times and the plate numbers of the cars crossing the gate. Now with all the information available, you are supposed to tell, at any specific time point, the num
2021-08-23 21:19:48
172
原创 PAT甲级1080 Graduate Admission (30 分)
#include <bits/stdc++.h>using namespace std;struct student{ int id,ge,gi,finalscore,rank; int wants[5]; bool admit=false;};bool cmp1(student a,student b) { if(a.finalscore!=b.finalscore) return a.finalscore>b.finalscore; .
2021-08-22 18:04:49
109
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人