搜索内容

最新文章
  • 日记

    JSOI 2019 Diary Round 2 Day 1

    JSOI 2019 Diary Day 4 又是一场噩梦…… Problem A 一道毒瘤题的样子?读了2遍才把题目读懂……然后发现就不会做了。先去做T2了。 Problem B 我一看,和我出给300iq的神秘题目一样吗?不过要计数,难度瞬间上去了……10分的状压DP还是蛮好写的,然后写了20分的排列组合WA掉……
    XGN 2019-04-28
  • 日记

    JSOI 2019 Diary Round 2 Day 0

    JSOI 2019 Diary Day 3 第一轮烤考炸掉了我又厚颜无耻充满希望的回来啦!这次比赛是2019/4/28日在熟悉的南航举行。今天是试机日……本来不打算来的,但是试机可以不上HBHB说晚上不上课来试机,于是我就来了。 preInit(); 来得太早,人家还在上课……只能在教室外面等。看……
    XGN 2019-04-27
  • 日记

    谷歌搜索和谷歌学术镜像

    UPD: 以下链接均已废 谷歌搜索教程 谷歌搜索镜像(自建) 谷歌学术教程 谷歌学术镜像(自建) 宝塔的反代真方便
    carott 2019-04-22
  • 题&解

    Red boy can you solve it?

    Rong Kong is a filial boy. There are N pears on the table. Both he and his brother can eat them. They both want to eat as much as they can. Each of them weighs a[i]. It costs a[i] time for a boy to eat a pear weighing a[i] and it gives him a[i] sat……
    MonkeyKing 2019-04-22
  • 题&解

    [赵宇气物理]经典“气”题

    考虑空气阻力的竖直上抛问题 由于这篇blog语言儒雅随和通俗易懂,所以一般通过观众也可以放心观看 阻力 f=mkv^2, 其中m为物体质量,k为常数 阻力始终与运动方向相反 重力加速度为g 以初速度 v_0 将该物体上抛,试描述其运动速度与时间的关系 Answer: 首先因为阻力的方……
    Zzzyt 2019-04-21
  • 题&解

    [小题狂做]欧拉公式与暴力展开(1)

    由于这篇blog语言儒雅随和通俗易懂,所以一般通过观众也可以放心观看 例题(著名题): $\int^{\infty}{0}{\frac{{e^{cosx}}{sin(sinx)}}{x}}dx这道题乍一看很复杂,当时我也想了十万甚至九万分钟,但其实在回顾过3B1B的傅里叶变换后,才发现这是一道可以用傅里叶级……
    HDD 2019-04-21
  • DevLog

    HHSOJ Dev Log 4/21

    期中考试不更新 🙂
    XGN 2019-04-21
  • OBCYSIO

    Orange Boy Can You Solve It Out? EP.3

    思考题 for everyone Man on Graph Given a graph of N nodes and M edges. On node i there are A_i men. Then each person moves along 1 edge randomly connected to the node he stands. But if two men walked along the same edge, they'll fight and both die.……
    XGN 2019-04-21
  • 新闻

    Hell Hole Legend 2 Episode 1 - The Hamburger Turnabout Release

    What's the story behind the hamburgers? Welcome to Hell Hole Legend 2 Episode 1! Installing Download the game zip and run the PyWright.exe Click "Games" and click on the episode title to play:) Follow ingame instructions. Download For HHS Members,……
    XGN 2019-04-20
  • OBCYSIO

    Orange Boy Can You Solve It Out? Ep.2

    思考题 for everyone Man on Graph You are given M chains each of N+1 nodes. We call the i-th node on the j-th chain (j,i-1). We define a bridge edge connecting (a,b) and (c,d) as follows: - a≠c - b=d - b and d don't equal to N or 0 We made sure that……
    XGN 2019-04-16