Mathematician

伽罗瓦:如何在20岁前成为数学家mathematician

mathematician这节要说的密码学重要人物，是伽罗瓦如果你有印象，我曾经说过，RSA加密法里用到的数学工具是群论，而伽罗瓦可以说是创造群论最重要的数学家。
夕等会_·2023-04-09 02:25

gym102452J Junior Mathematician（数位dp）

题意：其中x是一个数，k是x的数字位数，d(x,i)表示从左到右x的第i个数字是多少。给定L，R，m，要求计算[L,R]中有多少个x，满足f(x)=x(modm)。答案对1e9+7取模。数据范围：L,R不超过5000位解法：数位dp,关于状态,一开始的想法是:1.长度len2.当前部分x%mod3.当前部分f(x)%mod4.当前部分左边的数位和sum%mod,因为题目式子可以看作是每个digit
这有点难啊·2020-09-14 21:39

POJ 3130 || How I Mathematician Wonder What You Are!

Themathematicaldefinitionofastarshapeisasfollows:AplanarshapeFisstar-shapedifandonlyifthereisapointC∈Fsuchthat,foranypointP∈F,thelinesegmentCPiscontainedinF.SuchapointCiscalledacenterofF.Togetaccustom
巧奇·2020-08-20 22:29

POJ 3130 How I Mathematician Wonder What You Are!

题目大意：按顺序给出一些点。可以构成一个多边形，问多边形是否有核。解题思路：半平面交。模版题。用的是ZZY的O（Nlogn）的算法。算法大体思路是这样的：step1.将所有半平面按极角排序，对于极角相同的，选择性的保留一个。O(nlogn)step2.使用一个双端队列(deque)，加入最开始2个半平面。step3.每次考虑一个新的半平面：a.whiledeque顶端的两个半平面的交点在当前半平面
dhn37379·2020-08-17 00:05

hdoj 5895 Mathematician QSC 【数论----矩阵快速幂求解类斐波那契数列】

MathematicianQSCTimeLimit:2000/1000MS(Java/Others)MemoryLimit:131072/131072K(Java/Others)TotalSubmission(s):342AcceptedSubmission(s):184ProblemDescriptionQSCdreamofbecomingamathematician,hebelievestha
leibniz_zhang·2020-08-05 19:01

Ultra-Fast Mathematician

A.Ultra-FastMathematiciantimelimitpertest2secondsmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputShapurwasanextremelygiftedstudent.HewasgreatateverythingincludingCombinatorics,Alge
小兔叽的甜甜圈·2020-07-16 06:12

Ultra-Fast Mathematician

timelimitpertest2secondsmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputShapurwasanextremelygiftedstudent.HewasgreatateverythingincludingCombinatorics,Algebra,NumberTheory,Geometry
Felven·2020-07-16 01:15

万维钢的经营日课-收听笔记

牛逼的跨学科学习高手工程师OneofthemostfamousandmostversatileNASAastronauts.Heisnotonlyamedicaldoctor,butalsoachemist,mathematician
白头山大将军·2020-04-08 19:23

与横扫华尔街数学家的珍贵对话

23分钟，讲的是在TED上与詹姆斯·西蒙斯的对话，其实不看也不会错过什么：https://www.ted.com/talks/jim_simons_a_rare_interview_with_the_mathematician_who_cracked_wall_street
止一之路·2020-04-08 12:36

Mathematician

Aftershootingdownthebirdwithastone,Kerwinfeltagreatsenseofachievement.“Thisiswhatamathematiciancoulddo,”Kerwinpickedupthedeadbirdandsaid,“lookatyou!Whatabeautifulcreature!Youwouldbringmeabigfortune!”T
邵伯远_终身学习者·2020-03-16 02:44

《新科学家》/数学的起源

［大螺丝］得到打卡DAY24/90《马徐骏.世界名刊连读》图片发自Appmathematics:数学mathematician:数学家magic:魔术magician:魔术家it'soureffectivetoolforunderstandingtheuniverse
江尺澜依·2019-11-07 07:16

Diffie-Hellman Key Exchange – A Non-Mathematician’s Explanation

The Complete Diffie-Hellman Key Exchange Diagram The process begins when each side of the communication generates a private key. Each side then generates a public key (letter B), which is a de
·2015-11-13 19:14

题目1038：Sum of Factorials 九度

Feb. 8, 1957, was a Hungarian-American mathematician who made important c
·2015-11-13 18:18

poj 3130 How I Mathematician Wonder What You Are! 半平面交判断核存在问题

http://poj.org/problem?id=3130 和poj3335差不多的题目，都是判断多边形核是否存在问题，只不过这里的点是逆时针给出的，所以模板直接用。 1 #include<cmath> 2 #include<algorithm> 3 using namespace std; 4 5 const double MAX =100
·2015-11-13 16:17

Codeforces Round #199 (Div. 2)

memory limit per test 256 megabytes input standard input output standard output Xenia the mathematician
·2015-11-13 14:08

poj 3130 How I Mathematician Wonder What You Are!

http://poj.org/problem?id=3130 1 #include <cstdio> 2 #include <cstring> 3 #include <algorithm> 4 #include <cmath> 5 #define maxn 1000000 6 using namespace std;
·2015-11-13 01:40

[POJ]_1775_Sum of Factorials

Feb. 8, 1957, was a Hungarian-American mathematician who made important contributions to the foundations
·2015-11-12 23:01

The Priest Mathematician

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=31329#problem/F f[0] = 1 , f[ i ] = f[ i - 1 ] + 2 ^( n - k - 2 )   import java.util.Scanner; import java.math.BigInteger ; public class
·2015-11-12 23:19

poj1316

Limit: 10000K Total Submissions: 20864   Accepted: 11709 Description In 1949 the Indian mathematician
·2015-11-12 20:51

-V.I.Arnold, beyond a mathematician

     转自-http://blog.renren.com/blog/248100754/471276636      在AMS的首页上找到了三条讣告，依次是V.I.Arnold（1937-2010）,W.Rudin(1921-2010)和M.Gardner(1914-2010)。Arnold是最年轻的，尽管他早已不再年轻，照片上的他
·2015-11-12 12:14

Visual Studio成就列表

LINQ代码The Sword Fighter – 在一字未改的情况下，连续构建5次解决方案 Shotgun Debugging – 在每次只改一个字符的情况下，连续构建5次解决方案 The Mathematician
·2015-11-12 11:06

UVA 10254 - The Priest Mathematician (dp | 汉诺塔 | 找规律 | 大数)

本文出自   http://blog.csdn.net/shuangde800 题目点击打开链接 题意： 汉诺塔游戏请看 百度百科 正常的汉诺塔游戏是只有3个柱子，并且如果有n个圆盘，至少需要2^n-1步才能达到目标。 但是在这题中，有4根柱子，并且按照下面规则来玩： 1. 先把圆盘顶部前k个盘子全部搬到第四根柱子上， 2. 然后把剩下的n-k个盘子
·2015-11-11 18:35

POJ2262-Goldbach's Conjecture

Description In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler
·2015-11-11 15:53

Father of fractal geometry, Benoit Mandelbrot has passed away

Mathematician Benoit Mandelbrot died Thursday, October 14, peacefully in his sleep, his beloved wife
·2015-11-11 11:01

POJ 3130 How I Mathematician Wonder What You Are!（半平面交求多边形的核）

题目链接 题意 ： 给你一个多边形，问你该多边形中是否存在一个点使得该点与该多边形任意一点的连线都在多边形之内。 思路 ： 与3335一样，不过要注意方向变化一下。 1 #include <stdio.h> 2 #include <string.h> 3 #include <iostream> 4 #include <math.
·2015-11-11 04:27

nyoj 269——VF——————【dp】

nbsp;ms  |  内存限制：65535 KB 难度： 2   描述 Vasya is the beginning mathematician
·2015-11-11 02:48

joj1196: Goldbach

Times AC Times JUDGE 3s 8192K 2275 745 Standard In 1742, Christian Goldbach, a German amateur mathematician
·2015-11-09 11:53

uva 10254 - The Priest Mathematician

1、初步计算，知道是大数 2、根据f[n]=min{2*(f[k]+2^(n-1-k)-1)+3};写了一个c++程序，打印出前面的解 3、在纸上比划找出规律 4、学习用java写大数 终于ac java程序： /* * To change this template, choose Tools | Templates * and open the template in t
·2015-11-08 15:44

（Problem 33）Digit canceling fractions

The fraction 49/98 is a curious fraction, as an inexperienced mathematician in attempting to simplify
·2015-11-08 09:35

URAL1353——DP——Milliard Vasya's Function

Description Vasya is the beginning mathematician.
·2015-11-02 16:54

NYOJ 269 VF

： 1000 ms  |  内存限制： 65535 KB 难度： 2   描述 Vasya is the beginning mathematician
·2015-11-02 10:34

POJ 3130 How I Mathematician Wonder What You Are!

POJ_3130     对于半平面交的一些简明扼要的介绍可以参考这篇博客：http://blog.csdn.net/accry/article/details/6070621。此外，这篇博客上介绍的还有我敲出的程序都只是比较好理解的O(n^2)的求半平面交的算法，对于O(nlogn)的算法可以参考朱泽园的论文。     由于这个题目
·2015-10-31 19:26

UVA 10254 The Priest Mathematician

UVA_10254     如果我们设f[i]为4个柱子时把i个东东从一个柱子移到另一个柱子所用的最少步骤，设g[i]为3个柱子时对应的值，我们可以得到f[n]=min{2*f[k]+g[n-k]}，其中g[i]是已知的为2^i-1。     然后接着就搞不下去了，看了别人报告说要找规律，o(╯□╰)o。有了上面的式子之后，我们打印前
·2015-10-31 11:45

POJ 3130 How I Mathematician Wonder What You Are! /POJ 3335 Rotating Scoreboard 初涉半平面交

题意：逆时针给出N个点，求这个多边形是否有核。 思路：半平面交求多边形是否有核。模板题。 定义： 多边形核：多边形的核可以只是一个点，一条直线，但大多数情况下是一个区域(如果是一个区域则必为 )。核内的点与多边形所有顶点的连线均在多边形内部。 半平面交：对于平面，任何直线都能将平面划分成两部分，即两个半平面。半平面交既是多个半平面的交集。定义如其名。 半平面交求多边形的核。 设多边形点
·2015-10-31 10:17

（Problem 33）Digit canceling fractions

The fraction 49/98 is a curious fraction, as an inexperienced mathematician in attempting to
·2015-10-31 10:58

转：一个数学家的辩白--哈代

A Mathematician’s Apology G. H.
·2015-10-31 10:45

Bonferroni correction

It was developed and introduced by Italian mathematician Carlo Emilio Bonf
·2015-10-31 09:41

[FOJ][2042][The Mad Mathematician][数位dp]

/*题目：The Mad Mathematician题目来源：FOJ 2042题目难度：难题目内容或思路： 数位dp + xor 已知A，B，C，D，E五个数(long long型) 求下面程序所得sum
·2015-10-31 09:20

Codeforces Helpful Maths

Xenia the beginner mathematician is a third year student at elementary school.
·2015-10-31 09:21

Python之列表推导式List comprehensions例解

It can be used to construct lists in a very natural, easy way, like a mathematician is used to do.
·2015-10-30 14:02

sgu108. Self-numbers 2 滚动数组 打表 难度:1

 memory limit per test: 4096 KB   In 1949 the Indian mathematician D.R.
·2015-10-30 13:14

1028. Hanoi Tower Sequence

secs, Memory Limit: 32 MB Description   Hanoi Tower is a famous game invented by the French mathematician
·2015-10-29 08:49

poj 3130 How I Mathematician Wonder What You Are! - 求多边形有没有核 - 模版

  /* poj 3130 How I Mathematician Wonder What You Are!
·2015-10-27 16:23

ZOJ3673:1729

It is also known as the Hardy-Ramanujan number after a famous anecdote of the British mathematician
·2015-10-21 12:02

Alexander Grothendieck去世了

nbsp;French: [ɡʁɔtɛndik]; 28 March 1928 – 13 November 2014[1]) was a French[2][3][4] mathematician
·2015-10-21 11:17

POJ 3130 How I Mathematician Wonder What You Are! （半平面交+多边形内核判断）

【题目链接】：clickhere~~【题目大意】：按顺序给出一些点。可以构成一个多边形，问多边形是否有核。【思路】：跟前一道题目是一样的。代码:/* *半平面交+多边形内核判断 *Problem:POJNo.3130 *Runningtime:16MS *Complier:G++ *Author:herongwei *CreateTime:15:342015/10/1星期四 */ #include
u013050857·2015-10-01 20:00

VF(动态规划)

VF 时间限制： 1000 ms  |  内存限制：65535 KB 难度： 2 描述 Vasya is the beginning mathematician
·2015-05-25 23:00

纳什前两天刚去世

 (June 13, 1928 – May 23, 2015) was an American mathematician whose works in 
·2015-05-25 16:00

UVA10254 - The Priest Mathematician（找规律）

UVA10254-ThePriestMathematician（找规律）题目链接题目大意：4根柱子的汉诺塔。解题思路：题目里面有提示，先借助四个柱子移走k个，然后在借助三个柱子移走剩余的n-k个，再把n个移动到n-k个所在柱子。那么F[n]=min(2*F[k]+H[n-k]);H[n-k]=2^(n-k)-1;把前面的60项打出来，再打印出F[n]-f[n-1],会发现规律：F[1]=1；F[2
u012997373·2014-11-18 21:00

VF

VF 描述 Vasya is the beginning mathematician.
·2014-11-02 17:00
上一页 1 2 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他