weixin_43856210的博客

原创 x-ctf新手区-crypto

easy_RSAp = 473398607161q = 4511491e = 17def ex_gcd(a, b): if b == 0: return 1, 0, a else: x, y, gcd = ex_gcd(b, a % b) #递归直至余数等于0(需多递归一层用来判断) x, y = y, (x - (a // b) * y) #辗转相除法反向推导每层a、b的因子使得gcd(a,b)=ax+by成立 retu

原创 spark 笔记

安装pip install spacy python -m spacy download en

原创 RoBERTa摘要

RoBERTa是BERT的完成品数据BOOKCORPUS加上WIKIPEDIA，16GB左右5种语料，160GB左右。包括BOOKCORPUS，CC-NEWS，OPENWEBTEXT，STORIES，STORIES（论文中只介绍了这四个）训练方法去除NSP任务动态掩码

原创 BERT摘要

论文链接词向量Transformer预训练阶段mask language model15%的选定词汇80%mask10%用随机词汇替代10%保持原样next sentence prediction50%下一句为真实跟随句，50%不是

原创 机器学习思维导图

原创 树形DP--求树节点的最大半径--Computer--HDU2196

Description实验室里原先有一台电脑(编号为1)，最近绿名DD为又为实验室py了赞助，购置了N-1台电脑，编号为2到N。每台电脑都用网线连接到一台先前安装的电脑上。但是队内大佬担心网速太慢，问他第i台电脑到其他电脑的最大网线长度，但是贪玩的绿名DD沉迷城市天际线忘了计算，请你帮帮他。提示: 样例输入对应这个图，从这个图中你可以看出，距离1号电脑最远的电脑是4号电脑，他们之间的距离是3。 4号电脑与5号电脑都是距离2号电脑最远的点，故其答案是2。5号电脑距离3号电脑最远，故对于3号电脑来说它的答

原创 树形DP--Anniversary party

Description某大学有N个职员，编号为1~N。他们之间有从属关系，也就是说他们的关系就像一棵以校长为根的树，父结点就是子结点的直接上司。现在有个周年庆宴会，宴会每邀请来一个职员都会增加一定的快乐指数Ri，但是呢，如果某个职员的上司来参加舞会了，那么这个职员就无论如何也不肯来参加舞会了。所以，请你编程计算，邀请哪些职员可以使快乐指数最大，求最大的快乐指数。Input第一行一个整数N。(1<=N<=6000)接下来N行，第i+1行表示i号职员的快乐指数Ri。(-128<=Ri&

原创 八数码--IDA*--HDU1043

Problem DescriptionThe 15-puzzle has been around for over 100 years; even if you don’t know it by that name, you’ve seen it. It is constructed with 15 sliding tiles, each with a number from 1 to 15 on it, and all packed into a 4 by 4 frame with one tile m

原创 manacher算法--Palindrome--POJ3974

DescriptionAndy the smart computer science student was attending an algorithms class when the professor asked the students a simple question, “Can you propose an efficient algorithm to find the length of the largest palindrome in a string?”A string is sa

原创 概率DP--Aeroplane chess--HDU4405

Problem DescriptionHzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For each step he throws a dice(a dice have six faces with equal probability to face up and the numbers on the faces are 1,2

原创 机器学习与NLP整理--集百家之长短--极致丝滑的阅读体验

机器学习如何解决样本不平衡问题?支持向量机决策树逻辑回归深度学习深度学习优化器Batch Normalization自然语言处理LSTMword2vectransformerBERTXLNet预训练模型总结与对比分布式机器学习Parameter ServerSpark MLlibHDFSMap Reduce...

原创 记忆化搜索--图DP--FatMouse and Cheese--HDU1078

DescriptionFatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 <= p < n and 0 <= q < n. At each grid location Fatmouse has hid between 0 and 100 bl

原创 动态规划--尺取法--HihoCoder - 1502

Description给定一个NxM的矩阵A和一个整数K，小Hi希望你能求出其中最大（元素数目最多）的子矩阵，并且该子矩阵中所有元素的和不超过K。Input第一行包含三个整数N、M和K。以下N行每行包含M个整数，表示A。对于40%的数据，1 <= N, M <= 10对于100%的数据，1 <= N, M <= 250 1 <= K <= 2147483647 1 <= Aij <= 10000Output满足条件最大的子矩阵所包含的元素数目。

原创 DP--Ignatius and the Princess IV--HDU1029

Description“OK, you are not too bad, em… But you can never pass the next test.” feng5166 says.“I will tell you an odd number N, and then N integers. There will be a special integer among them, you have to tell me which integer is the special one after I

原创 DP--Max Sum Plus Plus--HDU1024

DescriptionNow I think you have got an AC in Ignatius.L’s “Max Sum” problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more difficult problem.Given a consecutive number sequence S1, S2, S3, S4

原创 树链剖分--Aragorn‘s Story--HDU3966

DescriptionOur protagonist is the handsome human prince Aragorn comes from The Lord of the Rings. One day Aragorn finds a lot of enemies who want to invade his kingdom. As Aragorn knows, the enemy has N camps out of his kingdom and M edges connect them. I

原创 贪心--Doing Homework again--HDU1789

DescriptionIgnatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the homework after the deadline, the teacher will reduce his scor

原创 贪心--今年暑假不AC--HDU2037

题目描述“今年暑假不AC？”“是的。”“那你干什么呢？”“看世界杯呀，笨蛋！”“@#$%^&*%…”确实如此，世界杯来了，球迷的节日也来了，估计很多ACMer也会抛开电脑，奔向电视了。作为球迷，一定想看尽量多的完整的比赛，当然，作为新时代的好青年，你一定还会看一些其它的节目，比如新闻联播（永远不要忘记关心国家大事）、非常6+7、超级女生，以及王小丫的《开心辞典》等等，假设你已经知道了所有你喜欢看的电视节目的转播时间表，你会合理安排吗？（目标是能看尽量多的完整节目）Input输入数据

原创 贪心--Crossing River--POJ1700

DescriptionA group of N people wishes to go across a river with only one boat, which can at most carry two persons. Therefore some sort of shuttle arrangement must be arranged in order to row the boat back and forth so that all people may cross. Each pers

原创 贪心--Packets--POJ1017

DescriptionA factory produces products packed in square packets of the same height h and of the sizes 11, 22, 33, 44, 55, 66. These products are always delivered to customers in the square parcels of the same height h as the products have and of the size

原创 贪心--Moving Tables--HDU1050

DescriptionThe famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure.The floor has 200 rooms each on the north side and south side along the corridor. Recently the Company made a plan to ref

原创 贪心--FatMouse‘ Trade--HDU1009

DescriptionFatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.The warehouse has N rooms. The i-th room contains J[i] pounds of JavaBeans and requires F[i] pounds of cat food.

原创 squad数据集处理代码阅读

源代码地址核心函数是将原始样本转换为model可输入形式Args:max_seq_length: The maximum sequence length of the inputs.doc_stride: The stride used when the context is too large and is split across several features.max_query_length: The maximum length of the query.is_training: w

原创 HotpotQA数据集探索与使用

单个样本组成结构

原创 POJ-1003签到题

DescriptionHow far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (We’re assuming that the cards must be perpendicular to the table.) With two cards you can make the top card

原创 从零开始的POJ----1002（CE）

DescriptionBusinesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or phrase. For example, you can call the University of Waterloo by dialing the memorable TUT-GLOP. Sometimes

原创 从零开始的POJ----1001-高精度幂

DescriptionProblems involving the computation of exact values of very large magnitude and precision are common. For example, the computation of the national debt is a taxing experience for many computer systems.This problem requires that you write a prog

原创 从零开始的POJ----1000

DescriptionCalculate a+bInputTwo integer a,b (0<=a,b<=10)Outputoutput*a+bSample Input1 2Sample Output3不特意把这题发出来我心里就是过意不去#include <iostream>using namespace std;int main(){ int a,b; cin >> a >> b; cout <

原创 LCA-倍增算法模板-Nearest Common Ancestors

DescriptionA rooted tree is a well-known data structure in computer science and engineering. An example is shown below:In the figure, each node is labeled with an integer from {1, 2,…,16}. Node 8 is the root of the tree. Node x is an ancestor of node y

原创 精确覆盖问题-舞蹈链-Easy Finding(WA)

DescriptionGiven a M×N matrix A. Aij ∈ {0, 1} (0 ≤ i < M, 0 ≤ j < N), could you find some rows that let every cloumn contains and only contains one 1.InputThere are multiple cases ended by EOF. Test case up to 500.The first line of input is M, N (

原创 二分匹配-匈牙利算法模板-过山车

DescriptionRPG girls今天和大家一起去游乐场玩，终于可以坐上梦寐以求的过山车了。可是，过山车的每一排只有两个座位，而且还有条不成文的规矩，就是每个女生必须找个个男生做partner和她同坐。但是，每个女孩都有各自的想法，举个例子把，Rabbit只愿意和XHD或PQK做partner，Grass只愿意和linle或LL做partner，PrincessSnow愿意和水域浪子或伪酷儿做partner。考虑到经费问题，boss刘决定只让找到partner的人去坐过山车，其他的人，嘿嘿，就站在下

原创 网络流-增广路径模板-Drainage Ditches

DescriptionEvery time it rains on Farmer John’s fields, a pond forms over Bessie’s favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. Thus, Farmer John has built a set of drainage ditche

原创 线段树-区间修改-Color the ball

DescriptionN个气球排成一排，从左到右依次编号为1,2,3…N.每次给定2个整数a b(a <= b),lele便为骑上他的“小飞鸽"牌电动车从气球a开始到气球b依次给每个气球涂一次颜色。但是N次以后lele已经忘记了第I个气球已经涂过几次颜色了，你能帮他算出每个气球被涂过几次颜色吗？Input每个测试实例第一行为一个整数N,(N <= 100000).接下来的N行，每行包括2个整数a b(1 <= a <= b <= N)。当N = 0，输入结束。Outp

原创 最短路-floyd-Frogger

Description加粗样式Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of tourists’ sunscreen, he wants to avoid swimming and

原创 最短路-dijkstra-Til the Cows Come Home

DescriptionBessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to get back as quickly as possible.Farmer John’s fi

原创 简单搜索-Red and Black

DescriptionThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can’t move on red tiles, he can move only on bla

原创 KMP-Period

DescriptionFor each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for each i (2 <= i <= N) we want to know the largest

原创 KMP-Theme Section

DescriptionIt’s time for music! A lot of popular musicians are invited to join us in the music festival. Each of them will play one of their representative songs. To make the programs more interesting and challenging, the hosts are going to add some const

原创 KMP-Simpsons’ Hidden Talents

DescriptionHomer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had.Marge: Yeah, what is it?Homer: Take me for example. I want to find out if I have a talent in politics, OK?Marge: OK.Homer: So I take some politic

原创 KMP-最短循环节-Cyclic Nacklace

DescriptionCC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are only 99.9 yuan left. he is too distressed and thinking about how to tide over the last days. Being inspired by