- 博客(15)
- 收藏
- 关注
原创 idea上传提交项目和更新项目到GitHub
idea上传项目和更新项目到GitHub看到网上有不少教程,但都不太全,大部分都没有更新项目的操作,所以干脆自己弄个。1.首先是git的安装这个大家随便网上搜个教程就有了,我这边给个查找本机有没有Git和git目录的思路用cmd进命令提示符,输入where git,就知道位置了。2.在idea里面操作上传项目快捷键ctrl+alt+s打开设置点左侧的git,看图里第一个圈是选自己的git位置,第二个是进行测试。正常测试结果是下面出现一个版本号然后点左侧的GitHub,点右边的“+”
2021-05-02 20:00:27 318
原创 oval-and-rectangle HDU - 6362
概率论题目:Patrick Star find an oval.The half of longer axes is on the x-axis with length aa.The half of shorter axes is on the y-axis with length bb.Patrick Star plan to choose a real number cc rando...
2020-02-16 18:33:15 158
原创 OSU! HYSBZ - 4318
概率论题目:osu 是一款群众喜闻乐见的休闲软件。我们可以把osu的规则简化与改编成以下的样子:一共有n次操作,每次操作只有成功与失败之分,成功对应1,失败对应0,n次操作对应为1个长度为n的01串。在这个串中连续的 X个1可以贡献X^3 的分数,这x个1不能被其他连续的1所包含(也就是极长的一串1,具体见样例解释)现在给出n,以及每个操作的成功率,请你输出期望分数,输出四舍五入后保留1...
2020-02-16 18:32:50 165
原创 Randomized Fibonacci
概率论题目:Consider the following way to generate a new “randomized” fibonacci sequence.a0 = 1, ai = aj + ak, i > 0, j and k are picked randomly from all integers in the interval [0, i-1] (j and k are...
2020-02-16 18:32:28 154
原创 Bloodsucker ZOJ - 3551
概率论题目:In 0th day, there are n-1 people and 1 bloodsucker. Every day, two and only two of them meet. Nothing will happen if they are of the same species, that is, a people meets a people or a bloodsuc...
2020-02-16 18:32:04 213
原创 Kids and Prizes SGU - 495
概率论题目:ICPC (International Cardboard Producing Company) is in the business of producing cardboard boxes. Recently the company organized a contest for kids for the best design of a cardboard box and se...
2020-02-16 18:31:43 206
原创 Crossing Rivers UVA - 12230
概率论题目:You live in a village but work in another village. You decided to follow the straight path between yourhouse (A) and the working place (B), but there are several rivers you need to cross. Assu...
2020-02-16 18:31:22 140
原创 Favorite Dice SPOJ - FAVDICE
概率论题目:BuggyD loves to carry his favorite die around. Perhaps you wonder why it’s his favorite? Well, his die is magical and can be transformed into an N-sided unbiased die with the push of a button. ...
2020-02-16 18:30:54 137
原创 Educational Codeforces Round 81 (Rated for Div. 2)C. Obtain The String
原题:C. Obtain The StringYou are given two strings s and t consisting of lowercase Latin letters. Also you have a string z which is initially empty. You want string z to be equal to string t. You can p...
2020-02-01 18:05:53 241
原创 Educational Codeforces Round 81 (Rated for Div. 2) A. Display The Number
原题:You have a large electronic screen which can display up to 998244353998244353 decimal digits. The digits are displayed in the same way as on different electronic alarm clocks: each place for a digi...
2020-01-30 12:16:30 1523
原创 Codeforces Round #615 (Div. 3)
仅A,B,C,D四题A. Collecting CoinsPolycarp has three sisters: Alice, Barbara, and Cerene. They’re collecting coins. Currently, Alice has aa coins, Barbara has bb coins and Cerene has cc coins. Recently P...
2020-01-23 12:27:00 667
原创 Codeforces Round #615 (Div. 3) D. MEX maximizing
原题:Recall that MEX of an array is a minimum non-negative integer that does not belong to the array. Examples:for the array [0,0,1,0,2][0,0,1,0,2] MEX equals to 33 because numbers 0,10,1 and 22 are p...
2020-01-23 12:13:22 613 1
原创 Codeforces Round #614 (Div. 2) C. NEKO's Maze Game
原题:NEKO#ΦωΦ has just got a new maze game on her PC!The game’s main puzzle is a maze, in the forms of a 2×n2×n rectangle grid. NEKO’s task is to lead a Nekomimi girl from cell (1,1)(1,1) to the gate ...
2020-01-20 16:35:30 438
原创 Codeforces Round #614 (Div. 2) B. JOE is on TV!
原题:Our dear Cafe’s owner, JOE Miller, will soon take part in a new game TV-show “1 vs. nn”!The game goes in rounds, where in each round the host asks JOE and his opponents a common question. All par...
2020-01-20 13:07:35 468
原创 Codeforces Round #614 (Div. 2) A题ConneR and the A.R.C. Markland-N
原题:A.R.C. Markland-N is a tall building with nn floors numbered from 11 to nn. Between each two adjacent floors in the building, there is a staircase connecting them.It’s lunchtime for our sensei Co...
2020-01-20 12:58:23 634
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人