知识点
IR1S
这个作者很懒,什么都没留下…
展开
-
线性表基本操作
#include<iostream>#include<errno.h>using namespace std;//数组实现/*#define MAXLINES 1000typedef int elementtype;typedef int position;struct List{ elementtype elements[MAXLINES]; p...原创 2018-03-08 10:44:05 · 199 阅读 · 0 评论 -
线性表求解多项式
#include<iostream>using namespace std;//以下所有参数使用const较为好struct node{ double coef = 0; int exp = 0; node* next = NULL;};node* Attach(node* position, double x, int y){ node* temp = ne...原创 2018-03-08 11:29:11 · 264 阅读 · 0 评论 -
伟大的中国剩余定理
实现代码long long ex_gcd(long long a, long long b,long long& x,long long &y){ long long m; if (b == 0) { x = 1; y = 0; return a; } else { m = ex_gcd(b, a%b, x, y); long long t = x...原创 2018-02-28 17:12:56 · 172 阅读 · 0 评论 -
求解ax+by=c的通解以及x的最小非负整数解
#include<iostream>using namespace std;long long x0, y0;long long ex_gcd(long long a, long long b, long long& x0, long long& y0){ long long m; if (b == 0) { x0 = 1; y0 = 0; ...原创 2018-02-28 17:31:53 · 3572 阅读 · 0 评论 -
用费马小定理判断素数
#include<iostream>#include<cstdlib>#include<ctime>using namespace std;long long modular_power(long long a, long long n, long long p)//a^m%p{ if (n == 0) return 1; if (n == ...原创 2018-02-25 13:31:03 · 1022 阅读 · 0 评论 -
欧拉筛
#include<iostream>using namespace std;#define MAX 10000int flag[MAX];int prime[MAX];int primesize = 0;int min_prime[MAX];void getprime(int n)//n以内的素数{ for (int i = 2; i <= n; ++i...原创 2018-02-25 13:44:04 · 127 阅读 · 0 评论 -
并查集
/*Farmer John and Betsy are playing a game with N (1 <= N <= 30,000)identical cubes labeled 1 through N. They start with N stacks, each containing a single cube. Farmer John asks Betsy to perfo...原创 2018-03-24 15:48:09 · 111 阅读 · 0 评论