ℹ️ Skipped - page is already crawled
| Filter | Status | Condition | Details |
|---|---|---|---|
| HTTP status | PASS | download_http_code = 200 | HTTP 200 |
| Age cutoff | PASS | download_stamp > now() - 6 MONTH | 0.4 months ago |
| History drop | PASS | isNull(history_drop_reason) | No drop reason |
| Spam/ban | PASS | fh_dont_index != 1 AND ml_spam_score = 0 | ml_spam_score=0 |
| Canonical | PASS | meta_canonical IS NULL OR = '' OR = src_unparsed | Not set |
| Property | Value |
|---|---|
| URL | https://www.daixiaomao.com/bkw/429.html |
| Last Crawled | 2026-05-22 12:33:03 (11 days ago) |
| First Indexed | 2025-01-18 15:46:37 (1 year ago) |
| HTTP Status Code | 200 |
| Content | |
| Meta Title | 植树问题(数学问题)-呆小帽百科 |
| Meta Description | ▌简介 为使其更直观,可以用图示法来说明。树用点来表示,植树的沿线用线来表示,这样就把植树问题转化为一条非封闭或封闭的线上的“点数”与相邻两点间的线的段数之间的关系问题。 中文名植树问题循环植树公式距离÷间隔数=棵数外文名Problem to plant trees应用数学、物理 ▌植树问题公式 两端都植距离÷间隔长+1=棵数全长间隔长×(棵数-1)=全长只植一端距 |
| Meta Canonical | null |
| Boilerpipe Text | heavy column, fetched on demand |
| Markdown | heavy column, fetched on demand |
| Readable Markdown | heavy column, fetched on demand |
| ML Classification | |
| ML Categories | null |
| ML Page Types | null |
| ML Intent Types | null |
| Content Metadata | |
| Language | null |
| Author | null |
| Publish Time | not set |
| Original Publish Time | 2025-01-18 15:46:37 (1 year ago) |
| Republished | No |
| Word Count (Total) | 102 |
| Word Count (Content) | 57 |
| Links | |
| External Links | 1 |
| Internal Links | 23 |
| Technical SEO | |
| Meta Nofollow | No |
| Meta Noarchive | No |
| JS Rendered | No |
| Redirect Target | null |
| Performance | |
| Download Time (ms) | 3,936 |
| TTFB (ms) | 3,936 |
| Download Size (bytes) | 7,045 |
| Location | |
| Host ID | 26 (laksa026) |
| Partition ID | 60 |
| Root Hash | 7199174125123092026 |
| Unparsed URL | com,daixiaomao!www,/bkw/429.html s443 |