hanyanwei123的博客

原创 数论

1.1，整除、 1.2，同余 1.3，最大公约数 1.3.1 辗转相除法 1.3.2 二进制算法 1.3.3 最小公倍数 1.3.4扩展欧几里得算法 1.3.5求解线性同余方程 1.4，逆元 1.5，中国剩余定理 1.6，斐波那契数列 1.7，卡特兰数 1.8，素数 1.9，欧拉函数的线性筛法 补充素因子分解。。。。。1.1整...

原创 论文笔记：CycleMorph: Cycle Consistent UnsupervisedDeformable Image Registration

论文笔记

原创 论文笔记 BIRNet: Brain image registration using dual-supervised fully convolutional networks

医学图像配准

原创 Python3安装NumPy错误记录

我的python版本是3.6 没有查看我的python支持的wheel导致.whl is not a supported wheel on this platform. python3 使用pip安装（命令行中）失败或 “not a supported wheel” 解决方案！ 原因1： 安装的不是对应python版本的库，下载的库名中cp36代表python3.6,其它同理。原因2：...

转载 Anaconda完全入门指南（转载）

转自：https://www.jianshu.com/p/eaee1fadc1e9 Anaconda 使用指南参考文章:致Python初学者：Anaconda入门使用指南Anaconda使用总结概述很多学习python的初学者甚至学了有一段时间的人接触到anaconda或者其他虚拟环境工具时觉得无从下手, 其主要原因就是不明白这些工具究...

原创 一机器学习之朴素贝叶斯（naive bayes）

从Udacity所学： 监督类学习 特征features 标签labels 特征可视化 良性线性决策面 naive bayes sklearn（scikit-learn）的使用 网址：http://scikit-learn.org/stable/documentation.html sklearn.naive_learn http://scikit-learn.org...

转载 numpy矩阵处理(转)

转自:http://blog.sina.com.cn/s/blog_9470b2b00101rt8a.html python的矩阵处理Python使用NumPy包完成了对N-维数组的快速便捷操作。使用这个包，需要导入numpy。SciPy包以NumPy包为基础，大大的扩展了numpy的能力。为了使用的方便，scipy包在最外层名字空间中包括了所有的numpy内容，因...

原创 POJ1927 Area in Triangle （计算几何）

Language:DefaultArea in TriangleTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 1694Accepted: 832DescriptionGiven a triangle field and a rope of a certain length (Figure-1), you are requi...

原创 HDU1239Calling Extraterrestrial Intelligence Again(打表)

Calling Extraterrestrial Intelligence AgainTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6162    Accep...

转载 卡特兰数1~100（转）

1到100的卡特兰数，便于以后可能用到。  1251442132429143048621679658786208012742900267444096948453535767012964...

原创 Modular Inverse ZOJ - 3609 (扩展欧几里得算法)

The modular modular multiplicative inverse of an integer a modulo m is an integer x such that a-1≡x (mod m). This is equivalent to ax≡1 (mod m). InputThere are multiple test cases. The first lin...

原创 HDU 5685 Problem A（逆元）

Problem ATime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2241    Accepted Submission(s): 989Problem Desc...

转载 （转）codeforces 429B B. Working out 详解(dp)

转自：https://blog.csdn.net/qq_34374664/article/details/54577940class=”title-article”>codeforces 429B B. Working out 详解(dp) 2017年0...

原创 POJ - 2236 Wireless Network（并查集）

An earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershoc...

原创 Jungle Roads POJ - 1251 （最小生成树）&& Networking POJ - 1287

Language:DefaultJungle RoadsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 31303Accepted: 14670Description The Head Elder of the tropical island of Lagrishan has a problem. A burst of...

原创 POJ 3250 Bad Hair Day （单调栈）

Bad Hair Day Some of Farmer John’s N cows (1 ≤ N ≤ 80,000) are having a bad hair day! Since each cow is self-conscious about her messy hairstyle, FJ wants to count ...

原创 POJ-2823 Sliding Window（单调队列）

Sliding Window An array of size n ≤ 10 6 is given to you. There is a sliding window of size k which is moving from the very left of the array ...

原创 基础数论 Beijing 2008 HDU - 1852 （快速幂）

Beijing 2008 As we all know, the next Olympic Games will be held in Beijing in 2008. So the year 2008 seems a little special somehow. You are looking forward to it, too, aren’...

原创 POJ-2492 A Bug's Life （种类并查集）

A Bug’s Life Background Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and...

原创 （回顾最小生成树）HDU 1863 畅通工程

畅通工程Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 37911    Accepted Submission(s): 16881Problem Descri...

原创 CodeForces 566D（并查集&合并区间）

D. Restructuring Companytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputEven the most successful company can go through a crisis period w...

原创 HDU 1506 Largest Rectangle in a Histogram（单调栈）

Largest Rectangle in a HistogramTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22184    Accepted Submis...

原创 HduJunk-Mail Filter(并查集)

Junk-Mail FilterTime Limit: 15000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11052    Accepted Submission(s): 3451Pr...

原创 HDU1166 敌兵布阵（树状数组）

敌兵布阵Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 119748    Accepted Submission(s): 50083Problem Descr...

原创 Codeforces853A Planing （优先队列+贪心）

A. Planningtime limit per test1 secondmemory limit per test512 megabytesinputstandard inputoutputstandard outputHelen works in Metropolis airport. She is responsible for creating a departure ...

原创 HDU1213 how many tables (并查集)

How Many TablesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 43761    Accepted Submission(s): 21889Pro...

转载 树状数组

转自：https://blog.csdn.net/yhf_2015/article/details/53844284 前言： 可能是因为学习了很多高级数据结构的缘故，突然感觉好像明白了树状数组，重新总结一下。 本文通过从根源深处挖掘树状数组所解决的问题，深刻的理解树状数组的操作本质，若要系统的研究树状数组，建议学习一...

原创 HDU6301 Distinct Value set+贪心

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=6301 Distinct Values Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others...

原创 HUD6318 Swaps and Inversions

Problem DescriptionLong long ago, there was an integer sequence a.Tonyfang think this sequence is messy, so he will count the number of inversions in this sequence. Because he is angry, you will hav...

原创 HDU6308 TIme zone

Time Zone Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2632 Accepted Submission(s): 831Problem Description Chiaki often participates...

原创 HDU 2018 母牛的故事 入门dp

母牛的故事 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 104973 Accepted Submission(s): 51502Problem Description 有一头母牛，它每年年初生一头小母牛。每头小母牛从第...

原创 UVA674 Coin Change

Suppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cent. We want to makechanges with these coins for a given amount of money. For example, if we have 11 cents, then we can...

原创 背包九讲问题记录

参考背包九讲 一01背包 有N件物品和一个容量为V的背包。第i件物品的费用是c[i]，价值是w[i]。求解将哪些物品装入背包可使价值总和最大。 状态转移方程便是：f[i][v]=max{f[i-1][v],f[i-1][v-c[i]+w[i]} 最重要的地方：V的顺序（刚刚弄懂） 基本思路实现，有一个主循环i=1..N，每次算出来二维数组f[i][0..V...

原创 Git 入门

原创 3252 Lowest Unique Price

Lowest Unique Price Time Limit: 1000 ms Memory Limit: 65536 KiB Problem DescriptionRecently my buddies and I came across an idea! We want to build a website to sell things in a new way.For each ...

原创 Fibonacci Numbers 取模的规律

F[0] = 0,F[1] = 1; n =0,1; F[i] = F[i-1]+F[i-2] i>=2; 斐波那契数列的每个数都取模后会出现循环，循环节的大小由MOD决定；#include<iostream>#include<stdio.h>#include<string.h>using namespa...

原创 3566 Triple Nim

Triple Nim Time Limit: 2000 ms Memory Limit: 65536 KiB Submit Statistic Discuss Problem Description Alice and Bob are always playing all kinds of Nim games and Alice always goes first. Here is t...

原创 Codeforces A. Aramic script

题目链接：http://codeforces.com/contest/975/problem/A 第一题就错了，C++STL该好好补补了 题目大意：给多个字符串，对于每个字符串，找出它的“Root”，即不考虑重复的字母，所有的字符串共有几个不同的“根”；题解：STL中map关联字符串和数字，用vis数组标记 代码#include<iostream>#include&...

原创 HDU1231 最大连续子序列DP

最大连续子序列Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 37574 Accepted Submission(s): 16939Problem Description 给定K个整数的序列{ ...

原创 HDU 1576 A+B（逆元）

A/B Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7660 Accepted Submission(s): 6097Problem Description 要求(A/B)%9973，但由于A很大，我们只给出n(n=A...