Main

processing priority

4

site type

0 (generic, awaiting analysis)

review version

11

html import

27 (unknown)

Events

first seen date

2024-01-07 18:01:18

expired found date

-

created at

2024-06-25 17:34:51

updated at

2026-03-01 04:02:37

Domain name statistics

length

13

crc

40080

tld

2211

nm parts

0

nm random digits

0

nm rare letters

0

Connections

is subdomain of id

-

previous id

0

replaced with id

0

related id

-

dns primary id

264439665

dns alternative id

0

lifecycle status

0 (unclassified, or currently active)

Subdomains and pages

deleted subdomains

0

page imported products

0

page imported random

0

page imported parking

0

Error counters

count skipped due to recent timeouts on the same server IP

0

count content received but rejected due to 11-799

0

count dns errors

0

count cert errors

4

count timeouts

0

count http 429

0

count http 404

0

count http 403

0

count http 5xx

0

next operation date

2024-12-07 09:32:32

Server

server bits

server ip

-

Mainpage statistics

mp import status

27

mp rejected date

-

mp saved date

-

mp size orig

43603

mp size raw text

2872

mp inner links count

13

mp inner links status

10 (links queued, awaiting import)

Open Graph

title

Messy

description

Creativity is Messy

image

site name

Messy

author

updated

2026-02-21 16:31:58

raw text

Messy Messy 首页 归档 标签 博弈论二日游 发表于 2017-07-07 | 这是2017-07-05到2017-07-06的做题记录。 涵盖威佐夫博弈、Nim博弈、SG函数及其各种应用。 阅读全文 » 莫比乌斯反演 发表于 2017-06-23 | Möbius 反演 (读这篇文章前,建议先使用容斥原理解决POJ3904) 现在假设我们要得到一种函数$\mu(d)$,这种函数具有以下性质: $$ \begin{equation}f(n)= \sum_{d|n} \mu(d) = \begin{cases} 1, & n = 1 \\ 0, & n > 1 \end{cases} \end{equation} $$ 例如 $$ \begin{align*} f(1)&=\mu(1)=1\\ f(2)&=\mu(1)+\mu(2)=0\\ f(3)&=\mu(1)+\mu(3)=0\\ f(6)&=\mu(1)+\mu(2)+\mu(3)+\mu(6) =0\\ \end{align*} $$ 我们可以得到这个函数的前12个值: m 1 2 3 4 5 6 7 8 9 10 11 12 \mu(m) 1 -1 -1 0 -1 1 -1 0 0 1 -1 0 Richard Dedekind 和 Joseph Liouville 发现了一个反演定理: $$ F(n)=\sum _{d|n}f(d)\Longleftrightarrow f(n)=\sum _{d|n}\mu(d)F(\frac{n}{d}) $$ 莫比乌斯函数: $$ \mu(n) = \begin{cases} 1, &n=1 \\ (-1)^k, & {n=p_1p_2...p_k, p_i互不相同} \\ 0, & \text{其它情况} \end{cases} $$ ...

Text analysis

redirect type

0 (-)

block type

0 (no issues)

detected language

126 (language undetectable (empty document, too short, or engines disagree))

category id

Pozostałe (16)

index version

1

spam phrases

0

Text statistics

text nonlatin

703

text cyrillic

0

text characters

1479

text words

357

text unique words

196

text lines

168

text sentences

1

text paragraphs

3

text words per sentence

255

text matched phrases

0

text matched dictionaries

0

RSS

rss path

rss status

1 (priority 1 already searched, no matches found)

rss found date

-

rss size orig

0

rss items

0

rss spam phrases

0

rss detected language

0 (awaiting analysis)

inbefore feed id

-

inbefore status

0 (new)

Sitemap

sitemap path

sitemap status

0 (new)

sitemap review version

2

sitemap urls count

0

sitemap urls adult

0

sitemap filtered products

0

sitemap filtered videos

0

sitemap found date

-

sitemap process date

-

sitemap first import date

-

sitemap last import date

-