![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Algorithm Design
Endemann
这个作者很懒,什么都没留下…
展开
-
A+B
import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws IOException { Scanner scan = new Scanner(System.in); int a = scan.nextInt...原创 2019-04-05 09:05:43 · 137 阅读 · 0 评论 -
Stable Matching
Description There areNSAs andNstudents. Each SA has to help a student one-to-one. However, each SA has a rank of preference for different students, and each student has a rank of preference for d...原创 2019-04-05 09:07:22 · 232 阅读 · 0 评论 -
Maze Problem with weight 1 and 2
Description Hongwaskidnappedbyabadwoman.Shewasputinaprison.ShetransmitteddistresssignalstoSstudentstosaveherassoonaspossible. TheprisoncanbeconsideredasaN\times MN×M...原创 2019-04-05 09:09:14 · 142 阅读 · 0 评论 -
UVA1616 with inclusion interval
Description LanranhasNfriends. Every Sunday, Lanran has to play with his friends. The i-th friend can play with Lanran from timea_iaito timeb_ibi. However, Lanran has to play with each of his ...原创 2019-04-05 09:13:08 · 201 阅读 · 0 评论 -
String Match
#include <stdio.h> #include <math.h> #define pln printf("\n"); #define p(a) printf("%f ", a); int N, M, K; int t; int n; char S[1000000]; char tT[1000000]; char T[1000000...原创 2019-05-16 10:13:47 · 129 阅读 · 0 评论 -
Primitive root + FFT + String Match
#include <stdio.h> #include <math.h> int root[100002]={...<Calculate 1e6 primitive root and put them here to get the root in O(1) ops>...}; long long A; long long N,m,num[10...原创 2019-05-16 10:17:17 · 110 阅读 · 0 评论