<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" xmlns:xhtml="http://www.w3.org/1999/xhtml">
    <url>
        <loc>https://nefut.com/</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/" />
        <changefreq>daily</changefreq>
        <priority>1.0</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/" />
        <changefreq>daily</changefreq>
        <priority>1.0</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/661-ai-frontier-apples-steady-ai-strategy-shows-promising-potential</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/661-ai-frontier-apples-steady-ai-strategy-shows-promising-potential" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/661-ai-frontier-apples-steady-ai-strategy-shows-promising-potential" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/661-ai-frontier-apples-steady-ai-strategy-shows-promising-potential</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/661-ai-frontier-apples-steady-ai-strategy-shows-promising-potential" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/661-ai-frontier-apples-steady-ai-strategy-shows-promising-potential" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/662-ai-frontier-mercors-founder-exposes-sequoias-dual-pricing-scheme</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/662-ai-frontier-mercors-founder-exposes-sequoias-dual-pricing-scheme" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/662-ai-frontier-mercors-founder-exposes-sequoias-dual-pricing-scheme" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/662-ai-frontier-mercors-founder-exposes-sequoias-dual-pricing-scheme</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/662-ai-frontier-mercors-founder-exposes-sequoias-dual-pricing-scheme" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/662-ai-frontier-mercors-founder-exposes-sequoias-dual-pricing-scheme" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/663-ai-frontier-openai-files-for-ipo-amid-layoffs-at-sam-altmans-eye-scanning-firm</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/663-ai-frontier-openai-files-for-ipo-amid-layoffs-at-sam-altmans-eye-scanning-firm" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/663-ai-frontier-openai-files-for-ipo-amid-layoffs-at-sam-altmans-eye-scanning-firm" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/663-ai-frontier-openai-files-for-ipo-amid-layoffs-at-sam-altmans-eye-scanning-firm</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/663-ai-frontier-openai-files-for-ipo-amid-layoffs-at-sam-altmans-eye-scanning-firm" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/663-ai-frontier-openai-files-for-ipo-amid-layoffs-at-sam-altmans-eye-scanning-firm" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/664-ai-frontier-apple-wwdc-2026-ai-demos-restore-trust-after-250m-false-ad-settlement</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/664-ai-frontier-apple-wwdc-2026-ai-demos-restore-trust-after-250m-false-ad-settlement" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/664-ai-frontier-apple-wwdc-2026-ai-demos-restore-trust-after-250m-false-ad-settlement" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/664-ai-frontier-apple-wwdc-2026-ai-demos-restore-trust-after-250m-false-ad-settlement</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/664-ai-frontier-apple-wwdc-2026-ai-demos-restore-trust-after-250m-false-ad-settlement" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/664-ai-frontier-apple-wwdc-2026-ai-demos-restore-trust-after-250m-false-ad-settlement" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/665-ai-frontier-openai-files-confidential-ipo-amid-ai-rivalry</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/665-ai-frontier-openai-files-confidential-ipo-amid-ai-rivalry" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/665-ai-frontier-openai-files-confidential-ipo-amid-ai-rivalry" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/665-ai-frontier-openai-files-confidential-ipo-amid-ai-rivalry</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/665-ai-frontier-openai-files-confidential-ipo-amid-ai-rivalry" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/665-ai-frontier-openai-files-confidential-ipo-amid-ai-rivalry" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/666-ai-frontier-apple-catches-up-at-wwdc-prioritizing-fixes-over-features</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/666-ai-frontier-apple-catches-up-at-wwdc-prioritizing-fixes-over-features" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/666-ai-frontier-apple-catches-up-at-wwdc-prioritizing-fixes-over-features" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/666-ai-frontier-apple-catches-up-at-wwdc-prioritizing-fixes-over-features</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/666-ai-frontier-apple-catches-up-at-wwdc-prioritizing-fixes-over-features" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/666-ai-frontier-apple-catches-up-at-wwdc-prioritizing-fixes-over-features" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/667-ai-frontier-apple-targets-small-developers-with-affordable-ai-infrastructure</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/667-ai-frontier-apple-targets-small-developers-with-affordable-ai-infrastructure" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/667-ai-frontier-apple-targets-small-developers-with-affordable-ai-infrastructure" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/667-ai-frontier-apple-targets-small-developers-with-affordable-ai-infrastructure</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/667-ai-frontier-apple-targets-small-developers-with-affordable-ai-infrastructure" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/667-ai-frontier-apple-targets-small-developers-with-affordable-ai-infrastructure" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/668-ai-frontier-apple-wwdc-2026-major-announcements-on-siri-ai-ios-27-and-apple-intelligence</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/668-ai-frontier-apple-wwdc-2026-major-announcements-on-siri-ai-ios-27-and-apple-intelligence" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/668-ai-frontier-apple-wwdc-2026-major-announcements-on-siri-ai-ios-27-and-apple-intelligence" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/668-ai-frontier-apple-wwdc-2026-major-announcements-on-siri-ai-ios-27-and-apple-intelligence</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/668-ai-frontier-apple-wwdc-2026-major-announcements-on-siri-ai-ios-27-and-apple-intelligence" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/668-ai-frontier-apple-wwdc-2026-major-announcements-on-siri-ai-ios-27-and-apple-intelligence" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/669-ai-frontier-apple-unveils-revolutionary-ai-features-at-wwdc-2026</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/669-ai-frontier-apple-unveils-revolutionary-ai-features-at-wwdc-2026" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/669-ai-frontier-apple-unveils-revolutionary-ai-features-at-wwdc-2026" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/669-ai-frontier-apple-unveils-revolutionary-ai-features-at-wwdc-2026</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/669-ai-frontier-apple-unveils-revolutionary-ai-features-at-wwdc-2026" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/669-ai-frontier-apple-unveils-revolutionary-ai-features-at-wwdc-2026" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/670-ai-frontier-apple-integrates-ai-into-shortcuts-for-simplified-workflow-creation</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/670-ai-frontier-apple-integrates-ai-into-shortcuts-for-simplified-workflow-creation" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/670-ai-frontier-apple-integrates-ai-into-shortcuts-for-simplified-workflow-creation" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/670-ai-frontier-apple-integrates-ai-into-shortcuts-for-simplified-workflow-creation</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/670-ai-frontier-apple-integrates-ai-into-shortcuts-for-simplified-workflow-creation" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/670-ai-frontier-apple-integrates-ai-into-shortcuts-for-simplified-workflow-creation" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/671-ai-frontier-apples-image-playground-revamped-ai-image-generation-tool</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/671-ai-frontier-apples-image-playground-revamped-ai-image-generation-tool" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/671-ai-frontier-apples-image-playground-revamped-ai-image-generation-tool" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/671-ai-frontier-apples-image-playground-revamped-ai-image-generation-tool</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/671-ai-frontier-apples-image-playground-revamped-ai-image-generation-tool" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/671-ai-frontier-apples-image-playground-revamped-ai-image-generation-tool" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/672-ai-frontier-apple-photos-unveils-new-ai-editing-features</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/672-ai-frontier-apple-photos-unveils-new-ai-editing-features" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/672-ai-frontier-apple-photos-unveils-new-ai-editing-features" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/672-ai-frontier-apple-photos-unveils-new-ai-editing-features</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/672-ai-frontier-apple-photos-unveils-new-ai-editing-features" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/672-ai-frontier-apple-photos-unveils-new-ai-editing-features" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/673-ai-frontier-apples-siri-gets-a-major-overhaul-with-standalone-app-launch</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/673-ai-frontier-apples-siri-gets-a-major-overhaul-with-standalone-app-launch" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/673-ai-frontier-apples-siri-gets-a-major-overhaul-with-standalone-app-launch" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/673-ai-frontier-apples-siri-gets-a-major-overhaul-with-standalone-app-launch</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/673-ai-frontier-apples-siri-gets-a-major-overhaul-with-standalone-app-launch" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/673-ai-frontier-apples-siri-gets-a-major-overhaul-with-standalone-app-launch" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/674-ai-frontier-apples-new-siri-camera-feature-eases-bill-splitting-headaches</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/674-ai-frontier-apples-new-siri-camera-feature-eases-bill-splitting-headaches" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/674-ai-frontier-apples-new-siri-camera-feature-eases-bill-splitting-headaches" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/674-ai-frontier-apples-new-siri-camera-feature-eases-bill-splitting-headaches</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/674-ai-frontier-apples-new-siri-camera-feature-eases-bill-splitting-headaches" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/674-ai-frontier-apples-new-siri-camera-feature-eases-bill-splitting-headaches" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/675-ai-frontier-apples-revamped-ai-siri-is-here</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/675-ai-frontier-apples-revamped-ai-siri-is-here" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/675-ai-frontier-apples-revamped-ai-siri-is-here" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/675-ai-frontier-apples-revamped-ai-siri-is-here</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/675-ai-frontier-apples-revamped-ai-siri-is-here" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/675-ai-frontier-apples-revamped-ai-siri-is-here" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/676-ai-frontier-amazon-launches-ai-custom-merchandise-design-feature</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/676-ai-frontier-amazon-launches-ai-custom-merchandise-design-feature" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/676-ai-frontier-amazon-launches-ai-custom-merchandise-design-feature" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/676-ai-frontier-amazon-launches-ai-custom-merchandise-design-feature</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/676-ai-frontier-amazon-launches-ai-custom-merchandise-design-feature" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/676-ai-frontier-amazon-launches-ai-custom-merchandise-design-feature" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/677-ai-frontier-wwdc-2026-siri-revamp-and-new-apple-intelligence-era</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/677-ai-frontier-wwdc-2026-siri-revamp-and-new-apple-intelligence-era" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/677-ai-frontier-wwdc-2026-siri-revamp-and-new-apple-intelligence-era" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/677-ai-frontier-wwdc-2026-siri-revamp-and-new-apple-intelligence-era</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/677-ai-frontier-wwdc-2026-siri-revamp-and-new-apple-intelligence-era" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/677-ai-frontier-wwdc-2026-siri-revamp-and-new-apple-intelligence-era" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/678-core-tech-3d-printing-revolutionizes-drug-delivery-microparticle-production</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/678-core-tech-3d-printing-revolutionizes-drug-delivery-microparticle-production" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/678-core-tech-3d-printing-revolutionizes-drug-delivery-microparticle-production" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/678-core-tech-3d-printing-revolutionizes-drug-delivery-microparticle-production</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/678-core-tech-3d-printing-revolutionizes-drug-delivery-microparticle-production" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/678-core-tech-3d-printing-revolutionizes-drug-delivery-microparticle-production" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/679-core-tech-mits-innovative-projects-address-extreme-heat</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/679-core-tech-mits-innovative-projects-address-extreme-heat" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/679-core-tech-mits-innovative-projects-address-extreme-heat" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/679-core-tech-mits-innovative-projects-address-extreme-heat</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/679-core-tech-mits-innovative-projects-address-extreme-heat" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/679-core-tech-mits-innovative-projects-address-extreme-heat" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/680-core-tech-mit-researchers-win-2026-breakthrough-and-new-horizons-prizes</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/680-core-tech-mit-researchers-win-2026-breakthrough-and-new-horizons-prizes" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/680-core-tech-mit-researchers-win-2026-breakthrough-and-new-horizons-prizes" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/680-core-tech-mit-researchers-win-2026-breakthrough-and-new-horizons-prizes</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/680-core-tech-mit-researchers-win-2026-breakthrough-and-new-horizons-prizes" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/680-core-tech-mit-researchers-win-2026-breakthrough-and-new-horizons-prizes" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/681-c-magic-c26-compiler-the-fastest-jvm</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/681-c-magic-c26-compiler-the-fastest-jvm" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/681-c-magic-c26-compiler-the-fastest-jvm" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/681-c-magic-c26-compiler-the-fastest-jvm</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/681-c-magic-c26-compiler-the-fastest-jvm" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/681-c-magic-c26-compiler-the-fastest-jvm" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/682-c-magic-c-conference-highlights-challenges-and-innovations</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/682-c-magic-c-conference-highlights-challenges-and-innovations" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/682-c-magic-c-conference-highlights-challenges-and-innovations" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/682-c-magic-c-conference-highlights-challenges-and-innovations</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/682-c-magic-c-conference-highlights-challenges-and-innovations" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/682-c-magic-c-conference-highlights-challenges-and-innovations" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/683-cf-hardcore-current-programming-challenges-im-tackling</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/683-cf-hardcore-current-programming-challenges-im-tackling" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/683-cf-hardcore-current-programming-challenges-im-tackling" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/683-cf-hardcore-current-programming-challenges-im-tackling</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/683-cf-hardcore-current-programming-challenges-im-tackling" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/683-cf-hardcore-current-programming-challenges-im-tackling" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/684-cf-hardcore-the-ultimate-coding-camp</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/684-cf-hardcore-the-ultimate-coding-camp" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/684-cf-hardcore-the-ultimate-coding-camp" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/684-cf-hardcore-the-ultimate-coding-camp</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/684-cf-hardcore-the-ultimate-coding-camp" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/684-cf-hardcore-the-ultimate-coding-camp" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/685-cf-hardcore-suspected-cheater-exposed-in-codeforces-global-round-31</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/685-cf-hardcore-suspected-cheater-exposed-in-codeforces-global-round-31" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/685-cf-hardcore-suspected-cheater-exposed-in-codeforces-global-round-31" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/685-cf-hardcore-suspected-cheater-exposed-in-codeforces-global-round-31</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/685-cf-hardcore-suspected-cheater-exposed-in-codeforces-global-round-31" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/685-cf-hardcore-suspected-cheater-exposed-in-codeforces-global-round-31" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/686-cf-hardcore-addressing-accusations-and-live-verification-plan</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/686-cf-hardcore-addressing-accusations-and-live-verification-plan" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/686-cf-hardcore-addressing-accusations-and-live-verification-plan" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/686-cf-hardcore-addressing-accusations-and-live-verification-plan</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/686-cf-hardcore-addressing-accusations-and-live-verification-plan" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/686-cf-hardcore-addressing-accusations-and-live-verification-plan" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/687-cf-hardcore-effective-strategies-for-competitive-programming</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/687-cf-hardcore-effective-strategies-for-competitive-programming" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/687-cf-hardcore-effective-strategies-for-competitive-programming" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/687-cf-hardcore-effective-strategies-for-competitive-programming</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/687-cf-hardcore-effective-strategies-for-competitive-programming" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/687-cf-hardcore-effective-strategies-for-competitive-programming" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/688-cf-hardcore-should-ubsan-be-an-optional-compiler-option-in-contests</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/688-cf-hardcore-should-ubsan-be-an-optional-compiler-option-in-contests" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/688-cf-hardcore-should-ubsan-be-an-optional-compiler-option-in-contests" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/688-cf-hardcore-should-ubsan-be-an-optional-compiler-option-in-contests</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/688-cf-hardcore-should-ubsan-be-an-optional-compiler-option-in-contests" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/688-cf-hardcore-should-ubsan-be-an-optional-compiler-option-in-contests" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/689-cf-hardcore-revolutionary-desktop-app-for-managing-cp-problems-on-codeforces-via-api</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/689-cf-hardcore-revolutionary-desktop-app-for-managing-cp-problems-on-codeforces-via-api" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/689-cf-hardcore-revolutionary-desktop-app-for-managing-cp-problems-on-codeforces-via-api" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/689-cf-hardcore-revolutionary-desktop-app-for-managing-cp-problems-on-codeforces-via-api</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/689-cf-hardcore-revolutionary-desktop-app-for-managing-cp-problems-on-codeforces-via-api" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/689-cf-hardcore-revolutionary-desktop-app-for-managing-cp-problems-on-codeforces-via-api" />
        <lastmod>2026-06-09T09:00:01+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/653-core-tech-mit-astronomers-discover-earliest-flickering-quasar</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/653-core-tech-mit-astronomers-discover-earliest-flickering-quasar" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/653-core-tech-mit-astronomers-discover-earliest-flickering-quasar" />
        <lastmod>2026-06-09T00:40:17+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/653-core-tech-mit-astronomers-discover-earliest-flickering-quasar</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/653-core-tech-mit-astronomers-discover-earliest-flickering-quasar" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/653-core-tech-mit-astronomers-discover-earliest-flickering-quasar" />
        <lastmod>2026-06-09T00:40:17+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/654-c-magic-building-an-ecs-framework-with-c26-static-reflection</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/654-c-magic-building-an-ecs-framework-with-c26-static-reflection" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/654-c-magic-building-an-ecs-framework-with-c26-static-reflection" />
        <lastmod>2026-06-09T00:40:17+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/654-c-magic-building-an-ecs-framework-with-c26-static-reflection</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/654-c-magic-building-an-ecs-framework-with-c26-static-reflection" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/654-c-magic-building-an-ecs-framework-with-c26-static-reflection" />
        <lastmod>2026-06-09T00:40:17+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/655-cf-hardcore-ux-improvement-suggestion-for-submission-page</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/655-cf-hardcore-ux-improvement-suggestion-for-submission-page" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/655-cf-hardcore-ux-improvement-suggestion-for-submission-page" />
        <lastmod>2026-06-09T00:40:17+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/655-cf-hardcore-ux-improvement-suggestion-for-submission-page</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/655-cf-hardcore-ux-improvement-suggestion-for-submission-page" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/655-cf-hardcore-ux-improvement-suggestion-for-submission-page" />
        <lastmod>2026-06-09T00:40:17+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/656-cf-hardcore-finding-api-endpoints-for-codechef-and-leetcode</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/656-cf-hardcore-finding-api-endpoints-for-codechef-and-leetcode" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/656-cf-hardcore-finding-api-endpoints-for-codechef-and-leetcode" />
        <lastmod>2026-06-09T00:40:17+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/656-cf-hardcore-finding-api-endpoints-for-codechef-and-leetcode</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/656-cf-hardcore-finding-api-endpoints-for-codechef-and-leetcode" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/656-cf-hardcore-finding-api-endpoints-for-codechef-and-leetcode" />
        <lastmod>2026-06-09T00:40:17+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/658-cf-hardcore-ejoi-2026-teams-preliminary-list-released</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/658-cf-hardcore-ejoi-2026-teams-preliminary-list-released" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/658-cf-hardcore-ejoi-2026-teams-preliminary-list-released" />
        <lastmod>2026-06-09T00:40:17+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/658-cf-hardcore-ejoi-2026-teams-preliminary-list-released</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/658-cf-hardcore-ejoi-2026-teams-preliminary-list-released" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/658-cf-hardcore-ejoi-2026-teams-preliminary-list-released" />
        <lastmod>2026-06-09T00:40:17+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/659-cf-hardcore-csai-fully-funded-bsc-scholarship-for-top-coders</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/659-cf-hardcore-csai-fully-funded-bsc-scholarship-for-top-coders" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/659-cf-hardcore-csai-fully-funded-bsc-scholarship-for-top-coders" />
        <lastmod>2026-06-09T00:40:17+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/659-cf-hardcore-csai-fully-funded-bsc-scholarship-for-top-coders</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/659-cf-hardcore-csai-fully-funded-bsc-scholarship-for-top-coders" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/659-cf-hardcore-csai-fully-funded-bsc-scholarship-for-top-coders" />
        <lastmod>2026-06-09T00:40:17+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/606-unveiling-dfs-spfa-the-double-edged-sword-of-negative-cycle-detection</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/606-unveiling-dfs-spfa-the-double-edged-sword-of-negative-cycle-detection" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/606-unveiling-dfs-spfa-the-double-edged-sword-of-negative-cycle-detection" />
        <lastmod>2026-06-05T13:55:28+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/606-unveiling-dfs-spfa-the-double-edged-sword-of-negative-cycle-detection</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/606-unveiling-dfs-spfa-the-double-edged-sword-of-negative-cycle-detection" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/606-unveiling-dfs-spfa-the-double-edged-sword-of-negative-cycle-detection" />
        <lastmod>2026-06-05T13:55:28+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/607-contact-us</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/607-contact-us" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/607-contact-us" />
        <lastmod>2026-06-05T13:55:28+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/607-contact-us</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/607-contact-us" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/607-contact-us" />
        <lastmod>2026-06-05T13:55:28+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/608-about-us</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/608-about-us" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/608-about-us" />
        <lastmod>2026-06-05T13:55:28+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/608-about-us</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/608-about-us" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/608-about-us" />
        <lastmod>2026-06-05T13:55:28+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/609-privacy-policy</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/609-privacy-policy" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/609-privacy-policy" />
        <lastmod>2026-06-05T13:55:28+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/609-privacy-policy</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/609-privacy-policy" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/609-privacy-policy" />
        <lastmod>2026-06-05T13:55:28+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/592-reconstructing-physical-thinking-transitioning-from-formulas-to-models</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/592-reconstructing-physical-thinking-transitioning-from-formulas-to-models" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/592-reconstructing-physical-thinking-transitioning-from-formulas-to-models" />
        <lastmod>2026-06-05T07:46:48+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/592-reconstructing-physical-thinking-transitioning-from-formulas-to-models</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/592-reconstructing-physical-thinking-transitioning-from-formulas-to-models" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/592-reconstructing-physical-thinking-transitioning-from-formulas-to-models" />
        <lastmod>2026-06-05T07:46:48+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/593-unveiling-the-logic-behind-the-green-eyes-riddle</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/593-unveiling-the-logic-behind-the-green-eyes-riddle" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/593-unveiling-the-logic-behind-the-green-eyes-riddle" />
        <lastmod>2026-06-05T07:46:48+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/593-unveiling-the-logic-behind-the-green-eyes-riddle</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/593-unveiling-the-logic-behind-the-green-eyes-riddle" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/593-unveiling-the-logic-behind-the-green-eyes-riddle" />
        <lastmod>2026-06-05T07:46:48+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/594-overcoming-blind-spots-in-negative-cycle-detection-strategies-with-super-source</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/594-overcoming-blind-spots-in-negative-cycle-detection-strategies-with-super-source" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/594-overcoming-blind-spots-in-negative-cycle-detection-strategies-with-super-source" />
        <lastmod>2026-06-05T07:46:48+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/594-overcoming-blind-spots-in-negative-cycle-detection-strategies-with-super-source</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/594-overcoming-blind-spots-in-negative-cycle-detection-strategies-with-super-source" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/594-overcoming-blind-spots-in-negative-cycle-detection-strategies-with-super-source" />
        <lastmod>2026-06-05T07:46:48+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/595-concise-definitions-of-core-concepts-in-graph-theory</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/595-concise-definitions-of-core-concepts-in-graph-theory" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/595-concise-definitions-of-core-concepts-in-graph-theory" />
        <lastmod>2026-06-05T07:46:48+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/595-concise-definitions-of-core-concepts-in-graph-theory</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/595-concise-definitions-of-core-concepts-in-graph-theory" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/595-concise-definitions-of-core-concepts-in-graph-theory" />
        <lastmod>2026-06-05T07:46:48+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/596-the-truth-about-negative-cycle-detection-why-focus-on-edge-count-instead-of-queue-count</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/596-the-truth-about-negative-cycle-detection-why-focus-on-edge-count-instead-of-queue-count" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/596-the-truth-about-negative-cycle-detection-why-focus-on-edge-count-instead-of-queue-count" />
        <lastmod>2026-06-05T07:46:48+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/596-the-truth-about-negative-cycle-detection-why-focus-on-edge-count-instead-of-queue-count</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/596-the-truth-about-negative-cycle-detection-why-focus-on-edge-count-instead-of-queue-count" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/596-the-truth-about-negative-cycle-detection-why-focus-on-edge-count-instead-of-queue-count" />
        <lastmod>2026-06-05T07:46:48+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/597-advanced-applications-of-minimum-spanning-tree-from-bottleneck-paths-to-clustering-analysis</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/597-advanced-applications-of-minimum-spanning-tree-from-bottleneck-paths-to-clustering-analysis" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/597-advanced-applications-of-minimum-spanning-tree-from-bottleneck-paths-to-clustering-analysis" />
        <lastmod>2026-06-05T07:46:48+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/597-advanced-applications-of-minimum-spanning-tree-from-bottleneck-paths-to-clustering-analysis</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/597-advanced-applications-of-minimum-spanning-tree-from-bottleneck-paths-to-clustering-analysis" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/597-advanced-applications-of-minimum-spanning-tree-from-bottleneck-paths-to-clustering-analysis" />
        <lastmod>2026-06-05T07:46:48+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/598-mastering-four-core-concepts-to-reshape-competitive-programming-mindset</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/598-mastering-four-core-concepts-to-reshape-competitive-programming-mindset" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/598-mastering-four-core-concepts-to-reshape-competitive-programming-mindset" />
        <lastmod>2026-06-05T07:46:48+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/598-mastering-four-core-concepts-to-reshape-competitive-programming-mindset</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/598-mastering-four-core-concepts-to-reshape-competitive-programming-mindset" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/598-mastering-four-core-concepts-to-reshape-competitive-programming-mindset" />
        <lastmod>2026-06-05T07:46:48+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/599-the-efficiency-trap-of-spfa-in-grid-graphs-and-optimization-challenges</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/599-the-efficiency-trap-of-spfa-in-grid-graphs-and-optimization-challenges" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/599-the-efficiency-trap-of-spfa-in-grid-graphs-and-optimization-challenges" />
        <lastmod>2026-06-05T07:46:48+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/599-the-efficiency-trap-of-spfa-in-grid-graphs-and-optimization-challenges</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/599-the-efficiency-trap-of-spfa-in-grid-graphs-and-optimization-challenges" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/599-the-efficiency-trap-of-spfa-in-grid-graphs-and-optimization-challenges" />
        <lastmod>2026-06-05T07:46:48+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/523-ai-frontier-anthropics-ipo-push-amidst-ai-skepticism</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/523-ai-frontier-anthropics-ipo-push-amidst-ai-skepticism" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/523-ai-frontier-anthropics-ipo-push-amidst-ai-skepticism" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/523-ai-frontier-anthropics-ipo-push-amidst-ai-skepticism</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/523-ai-frontier-anthropics-ipo-push-amidst-ai-skepticism" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/523-ai-frontier-anthropics-ipo-push-amidst-ai-skepticism" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/524-ai-frontier-brian-chesky-to-launch-new-ai-lab-at-airbnb</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/524-ai-frontier-brian-chesky-to-launch-new-ai-lab-at-airbnb" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/524-ai-frontier-brian-chesky-to-launch-new-ai-lab-at-airbnb" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/524-ai-frontier-brian-chesky-to-launch-new-ai-lab-at-airbnb</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/524-ai-frontier-brian-chesky-to-launch-new-ai-lab-at-airbnb" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/524-ai-frontier-brian-chesky-to-launch-new-ai-lab-at-airbnb" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/525-ai-frontier-future-of-ai-and-defense-tech-strictlyvc-los-angeles-approaches</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/525-ai-frontier-future-of-ai-and-defense-tech-strictlyvc-los-angeles-approaches" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/525-ai-frontier-future-of-ai-and-defense-tech-strictlyvc-los-angeles-approaches" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/525-ai-frontier-future-of-ai-and-defense-tech-strictlyvc-los-angeles-approaches</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/525-ai-frontier-future-of-ai-and-defense-tech-strictlyvc-los-angeles-approaches" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/525-ai-frontier-future-of-ai-and-defense-tech-strictlyvc-los-angeles-approaches" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/526-ai-frontier-metas-tent-data-centers-a-bold-move-in-ai-infrastructure</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/526-ai-frontier-metas-tent-data-centers-a-bold-move-in-ai-infrastructure" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/526-ai-frontier-metas-tent-data-centers-a-bold-move-in-ai-infrastructure" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/526-ai-frontier-metas-tent-data-centers-a-bold-move-in-ai-infrastructure</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/526-ai-frontier-metas-tent-data-centers-a-bold-move-in-ai-infrastructure" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/526-ai-frontier-metas-tent-data-centers-a-bold-move-in-ai-infrastructure" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/527-ai-frontier-apple-approves-poke-as-first-ai-agent-on-messages-for-business</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/527-ai-frontier-apple-approves-poke-as-first-ai-agent-on-messages-for-business" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/527-ai-frontier-apple-approves-poke-as-first-ai-agent-on-messages-for-business" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/527-ai-frontier-apple-approves-poke-as-first-ai-agent-on-messages-for-business</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/527-ai-frontier-apple-approves-poke-as-first-ai-agent-on-messages-for-business" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/527-ai-frontier-apple-approves-poke-as-first-ai-agent-on-messages-for-business" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/528-ai-frontier-meta-unveils-new-ai-creator-assistant-to-enhance-engagement</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/528-ai-frontier-meta-unveils-new-ai-creator-assistant-to-enhance-engagement" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/528-ai-frontier-meta-unveils-new-ai-creator-assistant-to-enhance-engagement" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/528-ai-frontier-meta-unveils-new-ai-creator-assistant-to-enhance-engagement</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/528-ai-frontier-meta-unveils-new-ai-creator-assistant-to-enhance-engagement" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/528-ai-frontier-meta-unveils-new-ai-creator-assistant-to-enhance-engagement" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/529-ai-frontier-wwdc-2026-major-siri-revamp-and-apple-intelligence-updates</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/529-ai-frontier-wwdc-2026-major-siri-revamp-and-apple-intelligence-updates" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/529-ai-frontier-wwdc-2026-major-siri-revamp-and-apple-intelligence-updates" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/529-ai-frontier-wwdc-2026-major-siri-revamp-and-apple-intelligence-updates</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/529-ai-frontier-wwdc-2026-major-siri-revamp-and-apple-intelligence-updates" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/529-ai-frontier-wwdc-2026-major-siri-revamp-and-apple-intelligence-updates" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/530-ai-frontier-is-silicon-valley-ready-for-home-robots-hello-robot-leads-the-way</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/530-ai-frontier-is-silicon-valley-ready-for-home-robots-hello-robot-leads-the-way" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/530-ai-frontier-is-silicon-valley-ready-for-home-robots-hello-robot-leads-the-way" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/530-ai-frontier-is-silicon-valley-ready-for-home-robots-hello-robot-leads-the-way</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/530-ai-frontier-is-silicon-valley-ready-for-home-robots-hello-robot-leads-the-way" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/530-ai-frontier-is-silicon-valley-ready-for-home-robots-hello-robot-leads-the-way" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/531-ai-frontier-apple-app-store-annual-update-14-trillion-sales-90-commission-free</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/531-ai-frontier-apple-app-store-annual-update-14-trillion-sales-90-commission-free" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/531-ai-frontier-apple-app-store-annual-update-14-trillion-sales-90-commission-free" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/531-ai-frontier-apple-app-store-annual-update-14-trillion-sales-90-commission-free</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/531-ai-frontier-apple-app-store-annual-update-14-trillion-sales-90-commission-free" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/531-ai-frontier-apple-app-store-annual-update-14-trillion-sales-90-commission-free" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/532-ai-frontier-lovable-expands-multi-year-collaboration-with-google-cloud</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/532-ai-frontier-lovable-expands-multi-year-collaboration-with-google-cloud" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/532-ai-frontier-lovable-expands-multi-year-collaboration-with-google-cloud" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/532-ai-frontier-lovable-expands-multi-year-collaboration-with-google-cloud</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/532-ai-frontier-lovable-expands-multi-year-collaboration-with-google-cloud" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/532-ai-frontier-lovable-expands-multi-year-collaboration-with-google-cloud" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/533-ai-frontier-googles-record-85b-ai-fundraising-signals-investor-enthusiasm</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/533-ai-frontier-googles-record-85b-ai-fundraising-signals-investor-enthusiasm" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/533-ai-frontier-googles-record-85b-ai-fundraising-signals-investor-enthusiasm" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/533-ai-frontier-googles-record-85b-ai-fundraising-signals-investor-enthusiasm</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/533-ai-frontier-googles-record-85b-ai-fundraising-signals-investor-enthusiasm" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/533-ai-frontier-googles-record-85b-ai-fundraising-signals-investor-enthusiasm" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/534-ai-frontier-google-launches-dreambeans-a-cartoonify-your-life-ai-tool</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/534-ai-frontier-google-launches-dreambeans-a-cartoonify-your-life-ai-tool" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/534-ai-frontier-google-launches-dreambeans-a-cartoonify-your-life-ai-tool" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/534-ai-frontier-google-launches-dreambeans-a-cartoonify-your-life-ai-tool</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/534-ai-frontier-google-launches-dreambeans-a-cartoonify-your-life-ai-tool" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/534-ai-frontier-google-launches-dreambeans-a-cartoonify-your-life-ai-tool" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/535-ai-frontier-amazon-introduces-ai-generated-product-images-a-controversial-shift</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/535-ai-frontier-amazon-introduces-ai-generated-product-images-a-controversial-shift" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/535-ai-frontier-amazon-introduces-ai-generated-product-images-a-controversial-shift" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/535-ai-frontier-amazon-introduces-ai-generated-product-images-a-controversial-shift</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/535-ai-frontier-amazon-introduces-ai-generated-product-images-a-controversial-shift" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/535-ai-frontier-amazon-introduces-ai-generated-product-images-a-controversial-shift" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/537-ai-frontier-uk-regulation-allows-publishers-to-opt-out-of-ai-search</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/537-ai-frontier-uk-regulation-allows-publishers-to-opt-out-of-ai-search" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/537-ai-frontier-uk-regulation-allows-publishers-to-opt-out-of-ai-search" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/537-ai-frontier-uk-regulation-allows-publishers-to-opt-out-of-ai-search</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/537-ai-frontier-uk-regulation-allows-publishers-to-opt-out-of-ai-search" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/537-ai-frontier-uk-regulation-allows-publishers-to-opt-out-of-ai-search" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/538-ai-frontier-meta-launches-global-ai-agent-for-whatsapp-business</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/538-ai-frontier-meta-launches-global-ai-agent-for-whatsapp-business" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/538-ai-frontier-meta-launches-global-ai-agent-for-whatsapp-business" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/538-ai-frontier-meta-launches-global-ai-agent-for-whatsapp-business</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/538-ai-frontier-meta-launches-global-ai-agent-for-whatsapp-business" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/538-ai-frontier-meta-launches-global-ai-agent-for-whatsapp-business" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/539-ai-frontier-coralogix-raises-200m-to-bet-on-ai-agent-monitoring-tools</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/539-ai-frontier-coralogix-raises-200m-to-bet-on-ai-agent-monitoring-tools" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/539-ai-frontier-coralogix-raises-200m-to-bet-on-ai-agent-monitoring-tools" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/539-ai-frontier-coralogix-raises-200m-to-bet-on-ai-agent-monitoring-tools</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/539-ai-frontier-coralogix-raises-200m-to-bet-on-ai-agent-monitoring-tools" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/539-ai-frontier-coralogix-raises-200m-to-bet-on-ai-agent-monitoring-tools" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/540-ai-frontier-cyera-secures-300m-funding-at-12b-valuation-despite-losses</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/540-ai-frontier-cyera-secures-300m-funding-at-12b-valuation-despite-losses" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/540-ai-frontier-cyera-secures-300m-funding-at-12b-valuation-despite-losses" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/540-ai-frontier-cyera-secures-300m-funding-at-12b-valuation-despite-losses</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/540-ai-frontier-cyera-secures-300m-funding-at-12b-valuation-despite-losses" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/540-ai-frontier-cyera-secures-300m-funding-at-12b-valuation-despite-losses" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/541-ai-frontier-uber-limits-employee-ai-spending-after-budget-exhaustion</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/541-ai-frontier-uber-limits-employee-ai-spending-after-budget-exhaustion" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/541-ai-frontier-uber-limits-employee-ai-spending-after-budget-exhaustion" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/541-ai-frontier-uber-limits-employee-ai-spending-after-budget-exhaustion</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/541-ai-frontier-uber-limits-employee-ai-spending-after-budget-exhaustion" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/541-ai-frontier-uber-limits-employee-ai-spending-after-budget-exhaustion" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/542-ai-frontier-microsoft-unveils-tool-for-ai-behavior-testing</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/542-ai-frontier-microsoft-unveils-tool-for-ai-behavior-testing" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/542-ai-frontier-microsoft-unveils-tool-for-ai-behavior-testing" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/542-ai-frontier-microsoft-unveils-tool-for-ai-behavior-testing</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/542-ai-frontier-microsoft-unveils-tool-for-ai-behavior-testing" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/542-ai-frontier-microsoft-unveils-tool-for-ai-behavior-testing" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/543-core-tech-innovative-alternatives-to-traditional-carbon-capture</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/543-core-tech-innovative-alternatives-to-traditional-carbon-capture" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/543-core-tech-innovative-alternatives-to-traditional-carbon-capture" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/543-core-tech-innovative-alternatives-to-traditional-carbon-capture</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/543-core-tech-innovative-alternatives-to-traditional-carbon-capture" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/543-core-tech-innovative-alternatives-to-traditional-carbon-capture" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/546-core-tech-ai-agents-learn-to-ask-better-questions-through-battleship-game</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/546-core-tech-ai-agents-learn-to-ask-better-questions-through-battleship-game" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/546-core-tech-ai-agents-learn-to-ask-better-questions-through-battleship-game" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/546-core-tech-ai-agents-learn-to-ask-better-questions-through-battleship-game</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/546-core-tech-ai-agents-learn-to-ask-better-questions-through-battleship-game" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/546-core-tech-ai-agents-learn-to-ask-better-questions-through-battleship-game" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/556-c-magic-c-show-and-tell-june-2026</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/556-c-magic-c-show-and-tell-june-2026" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/556-c-magic-c-show-and-tell-june-2026" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/556-c-magic-c-show-and-tell-june-2026</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/556-c-magic-c-show-and-tell-june-2026" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/556-c-magic-c-show-and-tell-june-2026" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/559-c-magic-optimizing-my-epoll-http-server-from-15k-to-125k-reqsec</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/559-c-magic-optimizing-my-epoll-http-server-from-15k-to-125k-reqsec" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/559-c-magic-optimizing-my-epoll-http-server-from-15k-to-125k-reqsec" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/559-c-magic-optimizing-my-epoll-http-server-from-15k-to-125k-reqsec</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/559-c-magic-optimizing-my-epoll-http-server-from-15k-to-125k-reqsec" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/559-c-magic-optimizing-my-epoll-http-server-from-15k-to-125k-reqsec" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/560-c-magic-compile-time-math-limits-consteig-integrates-linear-algebra-into-c</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/560-c-magic-compile-time-math-limits-consteig-integrates-linear-algebra-into-c" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/560-c-magic-compile-time-math-limits-consteig-integrates-linear-algebra-into-c" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/560-c-magic-compile-time-math-limits-consteig-integrates-linear-algebra-into-c</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/560-c-magic-compile-time-math-limits-consteig-integrates-linear-algebra-into-c" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/560-c-magic-compile-time-math-limits-consteig-integrates-linear-algebra-into-c" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/561-c-magic-c26-contracts-not-universally-applicable</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/561-c-magic-c26-contracts-not-universally-applicable" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/561-c-magic-c26-contracts-not-universally-applicable" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/561-c-magic-c26-contracts-not-universally-applicable</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/561-c-magic-c26-contracts-not-universally-applicable" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/561-c-magic-c26-contracts-not-universally-applicable" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/564-c-magic-building-a-zero-std-header-only-graphics-ecosystem</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/564-c-magic-building-a-zero-std-header-only-graphics-ecosystem" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/564-c-magic-building-a-zero-std-header-only-graphics-ecosystem" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/564-c-magic-building-a-zero-std-header-only-graphics-ecosystem</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/564-c-magic-building-a-zero-std-header-only-graphics-ecosystem" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/564-c-magic-building-a-zero-std-header-only-graphics-ecosystem" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/565-c-magic-where-to-watch-the-c-documentary</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/565-c-magic-where-to-watch-the-c-documentary" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/565-c-magic-where-to-watch-the-c-documentary" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/565-c-magic-where-to-watch-the-c-documentary</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/565-c-magic-where-to-watch-the-c-documentary" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/565-c-magic-where-to-watch-the-c-documentary" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/567-c-magic-countdown-to-c-documentary-premiere</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/567-c-magic-countdown-to-c-documentary-premiere" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/567-c-magic-countdown-to-c-documentary-premiere" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/567-c-magic-countdown-to-c-documentary-premiere</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/567-c-magic-countdown-to-c-documentary-premiere" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/567-c-magic-countdown-to-c-documentary-premiere" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/569-c-magic-designing-the-interface-layer-of-a-chat-server</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/569-c-magic-designing-the-interface-layer-of-a-chat-server" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/569-c-magic-designing-the-interface-layer-of-a-chat-server" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/569-c-magic-designing-the-interface-layer-of-a-chat-server</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/569-c-magic-designing-the-interface-layer-of-a-chat-server" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/569-c-magic-designing-the-interface-layer-of-a-chat-server" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/570-c-magic-latest-updates-on-c-conferences-2026-tickets-and-speaker-calls</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/570-c-magic-latest-updates-on-c-conferences-2026-tickets-and-speaker-calls" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/570-c-magic-latest-updates-on-c-conferences-2026-tickets-and-speaker-calls" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/570-c-magic-latest-updates-on-c-conferences-2026-tickets-and-speaker-calls</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/570-c-magic-latest-updates-on-c-conferences-2026-tickets-and-speaker-calls" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/570-c-magic-latest-updates-on-c-conferences-2026-tickets-and-speaker-calls" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/572-c-magic-latest-c-conference-videos-cutting-edge-insights</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/572-c-magic-latest-c-conference-videos-cutting-edge-insights" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/572-c-magic-latest-c-conference-videos-cutting-edge-insights" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/572-c-magic-latest-c-conference-videos-cutting-edge-insights</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/572-c-magic-latest-c-conference-videos-cutting-edge-insights" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/572-c-magic-latest-c-conference-videos-cutting-edge-insights" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/574-c-magic-innovative-callable-parameter-validation-with-c20-and-c26-static-reflection</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/574-c-magic-innovative-callable-parameter-validation-with-c20-and-c26-static-reflection" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/574-c-magic-innovative-callable-parameter-validation-with-c20-and-c26-static-reflection" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/574-c-magic-innovative-callable-parameter-validation-with-c20-and-c26-static-reflection</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/574-c-magic-innovative-callable-parameter-validation-with-c20-and-c26-static-reflection" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/574-c-magic-innovative-callable-parameter-validation-with-c20-and-c26-static-reflection" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/575-algorithms-season-five-of-the-joy-of-why-deeper-conversations-and-complex-questions</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/575-algorithms-season-five-of-the-joy-of-why-deeper-conversations-and-complex-questions" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/575-algorithms-season-five-of-the-joy-of-why-deeper-conversations-and-complex-questions" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/575-algorithms-season-five-of-the-joy-of-why-deeper-conversations-and-complex-questions</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/575-algorithms-season-five-of-the-joy-of-why-deeper-conversations-and-complex-questions" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/575-algorithms-season-five-of-the-joy-of-why-deeper-conversations-and-complex-questions" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/576-algorithms-quantum-gravity-unveiled-entanglement-and-magic-shape-space-time</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/576-algorithms-quantum-gravity-unveiled-entanglement-and-magic-shape-space-time" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/576-algorithms-quantum-gravity-unveiled-entanglement-and-magic-shape-space-time" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/576-algorithms-quantum-gravity-unveiled-entanglement-and-magic-shape-space-time</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/576-algorithms-quantum-gravity-unveiled-entanglement-and-magic-shape-space-time" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/576-algorithms-quantum-gravity-unveiled-entanglement-and-magic-shape-space-time" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/577-algorithms-the-mysterious-soil-revealing-lifes-origins</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/577-algorithms-the-mysterious-soil-revealing-lifes-origins" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/577-algorithms-the-mysterious-soil-revealing-lifes-origins" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/577-algorithms-the-mysterious-soil-revealing-lifes-origins</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/577-algorithms-the-mysterious-soil-revealing-lifes-origins" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/577-algorithms-the-mysterious-soil-revealing-lifes-origins" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/578-cf-hardcore-upcoming-codeforces-round-1102-div-2</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/578-cf-hardcore-upcoming-codeforces-round-1102-div-2" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/578-cf-hardcore-upcoming-codeforces-round-1102-div-2" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/578-cf-hardcore-upcoming-codeforces-round-1102-div-2</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/578-cf-hardcore-upcoming-codeforces-round-1102-div-2" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/578-cf-hardcore-upcoming-codeforces-round-1102-div-2" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/579-cf-hardcore-i-absolutely-hate-people-who-reply-with-what</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/579-cf-hardcore-i-absolutely-hate-people-who-reply-with-what" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/579-cf-hardcore-i-absolutely-hate-people-who-reply-with-what" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/579-cf-hardcore-i-absolutely-hate-people-who-reply-with-what</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/579-cf-hardcore-i-absolutely-hate-people-who-reply-with-what" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/579-cf-hardcore-i-absolutely-hate-people-who-reply-with-what" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/580-cf-hardcore-exploring-the-essence-difference-between-int-main-and-signed-main</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/580-cf-hardcore-exploring-the-essence-difference-between-int-main-and-signed-main" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/580-cf-hardcore-exploring-the-essence-difference-between-int-main-and-signed-main" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/580-cf-hardcore-exploring-the-essence-difference-between-int-main-and-signed-main</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/580-cf-hardcore-exploring-the-essence-difference-between-int-main-and-signed-main" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/580-cf-hardcore-exploring-the-essence-difference-between-int-main-and-signed-main" />
        <lastmod>2026-06-05T07:20:50+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/419-ai-frontier-developers-refuse-to-work-without-ai-a-potential-pitfall-ahead</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/419-ai-frontier-developers-refuse-to-work-without-ai-a-potential-pitfall-ahead" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/419-ai-frontier-developers-refuse-to-work-without-ai-a-potential-pitfall-ahead" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/419-ai-frontier-developers-refuse-to-work-without-ai-a-potential-pitfall-ahead</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/419-ai-frontier-developers-refuse-to-work-without-ai-a-potential-pitfall-ahead" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/419-ai-frontier-developers-refuse-to-work-without-ai-a-potential-pitfall-ahead" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/420-ai-frontier-decoding-ai-terminology-a-glimpse-into-the-future</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/420-ai-frontier-decoding-ai-terminology-a-glimpse-into-the-future" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/420-ai-frontier-decoding-ai-terminology-a-glimpse-into-the-future" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/420-ai-frontier-decoding-ai-terminology-a-glimpse-into-the-future</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/420-ai-frontier-decoding-ai-terminology-a-glimpse-into-the-future" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/420-ai-frontier-decoding-ai-terminology-a-glimpse-into-the-future" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/421-ai-frontier-the-cost-of-companies-being-too-ai-pilled</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/421-ai-frontier-the-cost-of-companies-being-too-ai-pilled" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/421-ai-frontier-the-cost-of-companies-being-too-ai-pilled" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/421-ai-frontier-the-cost-of-companies-being-too-ai-pilled</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/421-ai-frontier-the-cost-of-companies-being-too-ai-pilled" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/421-ai-frontier-the-cost-of-companies-being-too-ai-pilled" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/422-ai-frontier-groq-seeks-650m-funding-to-dominate-ai-inference-market</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/422-ai-frontier-groq-seeks-650m-funding-to-dominate-ai-inference-market" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/422-ai-frontier-groq-seeks-650m-funding-to-dominate-ai-inference-market" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/422-ai-frontier-groq-seeks-650m-funding-to-dominate-ai-inference-market</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/422-ai-frontier-groq-seeks-650m-funding-to-dominate-ai-inference-market" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/422-ai-frontier-groq-seeks-650m-funding-to-dominate-ai-inference-market" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/423-ai-frontier-cognitions-scott-wu-ai-coding-agents-should-not-replace-humans</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/423-ai-frontier-cognitions-scott-wu-ai-coding-agents-should-not-replace-humans" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/423-ai-frontier-cognitions-scott-wu-ai-coding-agents-should-not-replace-humans" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/423-ai-frontier-cognitions-scott-wu-ai-coding-agents-should-not-replace-humans</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/423-ai-frontier-cognitions-scott-wu-ai-coding-agents-should-not-replace-humans" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/423-ai-frontier-cognitions-scott-wu-ai-coding-agents-should-not-replace-humans" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/426-ai-frontier-ai-psychosis-a-crisis-of-blind-decision-making-among-ceos</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/426-ai-frontier-ai-psychosis-a-crisis-of-blind-decision-making-among-ceos" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/426-ai-frontier-ai-psychosis-a-crisis-of-blind-decision-making-among-ceos" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/426-ai-frontier-ai-psychosis-a-crisis-of-blind-decision-making-among-ceos</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/426-ai-frontier-ai-psychosis-a-crisis-of-blind-decision-making-among-ceos" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/426-ai-frontier-ai-psychosis-a-crisis-of-blind-decision-making-among-ceos" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/427-ai-frontier-kiwibit-ai-bird-feeder-my-new-backyard-buddy</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/427-ai-frontier-kiwibit-ai-bird-feeder-my-new-backyard-buddy" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/427-ai-frontier-kiwibit-ai-bird-feeder-my-new-backyard-buddy" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/427-ai-frontier-kiwibit-ai-bird-feeder-my-new-backyard-buddy</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/427-ai-frontier-kiwibit-ai-bird-feeder-my-new-backyard-buddy" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/427-ai-frontier-kiwibit-ai-bird-feeder-my-new-backyard-buddy" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/428-ai-frontier-xcena-raises-135m-to-tackle-ais-memory-bottleneck</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/428-ai-frontier-xcena-raises-135m-to-tackle-ais-memory-bottleneck" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/428-ai-frontier-xcena-raises-135m-to-tackle-ais-memory-bottleneck" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/428-ai-frontier-xcena-raises-135m-to-tackle-ais-memory-bottleneck</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/428-ai-frontier-xcena-raises-135m-to-tackle-ais-memory-bottleneck" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/428-ai-frontier-xcena-raises-135m-to-tackle-ais-memory-bottleneck" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/429-ai-frontier-glean-surpasses-300m-in-revenue-ai-budget-cuts-as-key-selling-point</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/429-ai-frontier-glean-surpasses-300m-in-revenue-ai-budget-cuts-as-key-selling-point" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/429-ai-frontier-glean-surpasses-300m-in-revenue-ai-budget-cuts-as-key-selling-point" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/429-ai-frontier-glean-surpasses-300m-in-revenue-ai-budget-cuts-as-key-selling-point</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/429-ai-frontier-glean-surpasses-300m-in-revenue-ai-budget-cuts-as-key-selling-point" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/429-ai-frontier-glean-surpasses-300m-in-revenue-ai-budget-cuts-as-key-selling-point" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/430-ai-frontier-rebuilding-the-internet-for-machines-aws-launches-new-serverless-search-database</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/430-ai-frontier-rebuilding-the-internet-for-machines-aws-launches-new-serverless-search-database" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/430-ai-frontier-rebuilding-the-internet-for-machines-aws-launches-new-serverless-search-database" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/430-ai-frontier-rebuilding-the-internet-for-machines-aws-launches-new-serverless-search-database</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/430-ai-frontier-rebuilding-the-internet-for-machines-aws-launches-new-serverless-search-database" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/430-ai-frontier-rebuilding-the-internet-for-machines-aws-launches-new-serverless-search-database" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/439-core-tech-mit-class-of-2026-commencement-a-celebration-of-achievement</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/439-core-tech-mit-class-of-2026-commencement-a-celebration-of-achievement" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/439-core-tech-mit-class-of-2026-commencement-a-celebration-of-achievement" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/439-core-tech-mit-class-of-2026-commencement-a-celebration-of-achievement</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/439-core-tech-mit-class-of-2026-commencement-a-celebration-of-achievement" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/439-core-tech-mit-class-of-2026-commencement-a-celebration-of-achievement" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/440-core-tech-alejandro-aravena-inspires-architecture-graduates-to-lead-with-kindness</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/440-core-tech-alejandro-aravena-inspires-architecture-graduates-to-lead-with-kindness" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/440-core-tech-alejandro-aravena-inspires-architecture-graduates-to-lead-with-kindness" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/440-core-tech-alejandro-aravena-inspires-architecture-graduates-to-lead-with-kindness</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/440-core-tech-alejandro-aravena-inspires-architecture-graduates-to-lead-with-kindness" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/440-core-tech-alejandro-aravena-inspires-architecture-graduates-to-lead-with-kindness" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/441-core-tech-mit-graduate-celebrates-with-her-beloved-dog</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/441-core-tech-mit-graduate-celebrates-with-her-beloved-dog" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/441-core-tech-mit-graduate-celebrates-with-her-beloved-dog" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/441-core-tech-mit-graduate-celebrates-with-her-beloved-dog</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/441-core-tech-mit-graduate-celebrates-with-her-beloved-dog" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/441-core-tech-mit-graduate-celebrates-with-her-beloved-dog" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/442-core-tech-mit-class-of-2026-embrace-the-hardest-challenges</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/442-core-tech-mit-class-of-2026-embrace-the-hardest-challenges" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/442-core-tech-mit-class-of-2026-embrace-the-hardest-challenges" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/442-core-tech-mit-class-of-2026-embrace-the-hardest-challenges</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/442-core-tech-mit-class-of-2026-embrace-the-hardest-challenges" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/442-core-tech-mit-class-of-2026-embrace-the-hardest-challenges" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/443-core-tech-embrace-challenges-lisa-sus-address-to-the-class-of-2026</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/443-core-tech-embrace-challenges-lisa-sus-address-to-the-class-of-2026" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/443-core-tech-embrace-challenges-lisa-sus-address-to-the-class-of-2026" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/443-core-tech-embrace-challenges-lisa-sus-address-to-the-class-of-2026</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/443-core-tech-embrace-challenges-lisa-sus-address-to-the-class-of-2026" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/443-core-tech-embrace-challenges-lisa-sus-address-to-the-class-of-2026" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/444-core-tech-mits-new-laboratory-to-propel-quantum-technology-innovation</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/444-core-tech-mits-new-laboratory-to-propel-quantum-technology-innovation" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/444-core-tech-mits-new-laboratory-to-propel-quantum-technology-innovation" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/444-core-tech-mits-new-laboratory-to-propel-quantum-technology-innovation</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/444-core-tech-mits-new-laboratory-to-propel-quantum-technology-innovation" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/444-core-tech-mits-new-laboratory-to-propel-quantum-technology-innovation" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/446-core-tech-mit-develops-low-cost-lithium-extraction-technique</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/446-core-tech-mit-develops-low-cost-lithium-extraction-technique" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/446-core-tech-mit-develops-low-cost-lithium-extraction-technique" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/446-core-tech-mit-develops-low-cost-lithium-extraction-technique</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/446-core-tech-mit-develops-low-cost-lithium-extraction-technique" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/446-core-tech-mit-develops-low-cost-lithium-extraction-technique" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/448-core-tech-mit-to-establish-regional-quantum-hub-for-technological-revolution</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/448-core-tech-mit-to-establish-regional-quantum-hub-for-technological-revolution" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/448-core-tech-mit-to-establish-regional-quantum-hub-for-technological-revolution" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/448-core-tech-mit-to-establish-regional-quantum-hub-for-technological-revolution</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/448-core-tech-mit-to-establish-regional-quantum-hub-for-technological-revolution" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/448-core-tech-mit-to-establish-regional-quantum-hub-for-technological-revolution" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/449-core-tech-mit-corporation-elects-new-members-for-2026</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/449-core-tech-mit-corporation-elects-new-members-for-2026" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/449-core-tech-mit-corporation-elects-new-members-for-2026" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/449-core-tech-mit-corporation-elects-new-members-for-2026</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/449-core-tech-mit-corporation-elects-new-members-for-2026" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/449-core-tech-mit-corporation-elects-new-members-for-2026" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/450-core-tech-revolutionary-mri-signal-enhancement-technology-precise-capture-of-molecular-activity-in-the-brain</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/450-core-tech-revolutionary-mri-signal-enhancement-technology-precise-capture-of-molecular-activity-in-the-brain" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/450-core-tech-revolutionary-mri-signal-enhancement-technology-precise-capture-of-molecular-activity-in-the-brain" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/450-core-tech-revolutionary-mri-signal-enhancement-technology-precise-capture-of-molecular-activity-in-the-brain</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/450-core-tech-revolutionary-mri-signal-enhancement-technology-precise-capture-of-molecular-activity-in-the-brain" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/450-core-tech-revolutionary-mri-signal-enhancement-technology-precise-capture-of-molecular-activity-in-the-brain" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/451-core-tech-place-based-pathways-to-a-sustainable-future</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/451-core-tech-place-based-pathways-to-a-sustainable-future" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/451-core-tech-place-based-pathways-to-a-sustainable-future" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/451-core-tech-place-based-pathways-to-a-sustainable-future</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/451-core-tech-place-based-pathways-to-a-sustainable-future" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/451-core-tech-place-based-pathways-to-a-sustainable-future" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/452-core-tech-balancing-track-and-career-krystal-montgomerys-journey-at-mit</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/452-core-tech-balancing-track-and-career-krystal-montgomerys-journey-at-mit" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/452-core-tech-balancing-track-and-career-krystal-montgomerys-journey-at-mit" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/452-core-tech-balancing-track-and-career-krystal-montgomerys-journey-at-mit</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/452-core-tech-balancing-track-and-career-krystal-montgomerys-journey-at-mit" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/452-core-tech-balancing-track-and-career-krystal-montgomerys-journey-at-mit" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/453-core-tech-ten-mit-scholars-awarded-2026-fulbright-grants-for-global-research</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/453-core-tech-ten-mit-scholars-awarded-2026-fulbright-grants-for-global-research" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/453-core-tech-ten-mit-scholars-awarded-2026-fulbright-grants-for-global-research" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/453-core-tech-ten-mit-scholars-awarded-2026-fulbright-grants-for-global-research</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/453-core-tech-ten-mit-scholars-awarded-2026-fulbright-grants-for-global-research" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/453-core-tech-ten-mit-scholars-awarded-2026-fulbright-grants-for-global-research" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/454-core-tech-bridging-human-movement-with-digital-technology</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/454-core-tech-bridging-human-movement-with-digital-technology" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/454-core-tech-bridging-human-movement-with-digital-technology" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/454-core-tech-bridging-human-movement-with-digital-technology</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/454-core-tech-bridging-human-movement-with-digital-technology" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/454-core-tech-bridging-human-movement-with-digital-technology" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/455-core-tech-a-day-in-the-life-of-mit-sloan-fellow-alecia-asiamigbe</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/455-core-tech-a-day-in-the-life-of-mit-sloan-fellow-alecia-asiamigbe" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/455-core-tech-a-day-in-the-life-of-mit-sloan-fellow-alecia-asiamigbe" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/455-core-tech-a-day-in-the-life-of-mit-sloan-fellow-alecia-asiamigbe</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/455-core-tech-a-day-in-the-life-of-mit-sloan-fellow-alecia-asiamigbe" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/455-core-tech-a-day-in-the-life-of-mit-sloan-fellow-alecia-asiamigbe" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/456-core-tech-the-art-and-design-behind-the-stage-sara-browns-creative-journey</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/456-core-tech-the-art-and-design-behind-the-stage-sara-browns-creative-journey" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/456-core-tech-the-art-and-design-behind-the-stage-sara-browns-creative-journey" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/456-core-tech-the-art-and-design-behind-the-stage-sara-browns-creative-journey</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/456-core-tech-the-art-and-design-behind-the-stage-sara-browns-creative-journey" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/456-core-tech-the-art-and-design-behind-the-stage-sara-browns-creative-journey" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/466-core-tech-ai-and-chemistry-a-revolution-in-drug-discovery</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/466-core-tech-ai-and-chemistry-a-revolution-in-drug-discovery" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/466-core-tech-ai-and-chemistry-a-revolution-in-drug-discovery" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/466-core-tech-ai-and-chemistry-a-revolution-in-drug-discovery</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/466-core-tech-ai-and-chemistry-a-revolution-in-drug-discovery" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/466-core-tech-ai-and-chemistry-a-revolution-in-drug-discovery" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/467-core-tech-justin-solomon-appointed-associate-dean-for-engineering-education-at-mit</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/467-core-tech-justin-solomon-appointed-associate-dean-for-engineering-education-at-mit" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/467-core-tech-justin-solomon-appointed-associate-dean-for-engineering-education-at-mit" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/467-core-tech-justin-solomon-appointed-associate-dean-for-engineering-education-at-mit</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/467-core-tech-justin-solomon-appointed-associate-dean-for-engineering-education-at-mit" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/467-core-tech-justin-solomon-appointed-associate-dean-for-engineering-education-at-mit" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/468-core-tech-a-day-in-the-life-of-an-mit-mba-student-exploring-sustainability</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/468-core-tech-a-day-in-the-life-of-an-mit-mba-student-exploring-sustainability" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/468-core-tech-a-day-in-the-life-of-an-mit-mba-student-exploring-sustainability" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/468-core-tech-a-day-in-the-life-of-an-mit-mba-student-exploring-sustainability</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/468-core-tech-a-day-in-the-life-of-an-mit-mba-student-exploring-sustainability" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/468-core-tech-a-day-in-the-life-of-an-mit-mba-student-exploring-sustainability" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/469-core-tech-haystack-37m-telescope-a-new-era-in-astrophysics</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/469-core-tech-haystack-37m-telescope-a-new-era-in-astrophysics" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/469-core-tech-haystack-37m-telescope-a-new-era-in-astrophysics" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/469-core-tech-haystack-37m-telescope-a-new-era-in-astrophysics</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/469-core-tech-haystack-37m-telescope-a-new-era-in-astrophysics" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/469-core-tech-haystack-37m-telescope-a-new-era-in-astrophysics" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/470-core-tech-single-molecule-tracking-reveals-dynamics-of-cancer-related-proteins</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/470-core-tech-single-molecule-tracking-reveals-dynamics-of-cancer-related-proteins" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/470-core-tech-single-molecule-tracking-reveals-dynamics-of-cancer-related-proteins" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/470-core-tech-single-molecule-tracking-reveals-dynamics-of-cancer-related-proteins</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/470-core-tech-single-molecule-tracking-reveals-dynamics-of-cancer-related-proteins" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/470-core-tech-single-molecule-tracking-reveals-dynamics-of-cancer-related-proteins" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/471-core-tech-mit-and-upenn-introduce-mighty-a-new-era-in-open-source-trajectory-planning</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/471-core-tech-mit-and-upenn-introduce-mighty-a-new-era-in-open-source-trajectory-planning" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/471-core-tech-mit-and-upenn-introduce-mighty-a-new-era-in-open-source-trajectory-planning" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/471-core-tech-mit-and-upenn-introduce-mighty-a-new-era-in-open-source-trajectory-planning</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/471-core-tech-mit-and-upenn-introduce-mighty-a-new-era-in-open-source-trajectory-planning" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/471-core-tech-mit-and-upenn-introduce-mighty-a-new-era-in-open-source-trajectory-planning" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/473-core-tech-mit-students-awarded-2026-knight-hennessy-scholarship</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/473-core-tech-mit-students-awarded-2026-knight-hennessy-scholarship" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/473-core-tech-mit-students-awarded-2026-knight-hennessy-scholarship" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/473-core-tech-mit-students-awarded-2026-knight-hennessy-scholarship</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/473-core-tech-mit-students-awarded-2026-knight-hennessy-scholarship" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/473-core-tech-mit-students-awarded-2026-knight-hennessy-scholarship" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/474-core-tech-curiosity-driven-innovation-the-mission-of-science</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/474-core-tech-curiosity-driven-innovation-the-mission-of-science" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/474-core-tech-curiosity-driven-innovation-the-mission-of-science" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/474-core-tech-curiosity-driven-innovation-the-mission-of-science</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/474-core-tech-curiosity-driven-innovation-the-mission-of-science" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/474-core-tech-curiosity-driven-innovation-the-mission-of-science" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/475-core-tech-elazer-edelman-receives-2026-2027-killian-award</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/475-core-tech-elazer-edelman-receives-2026-2027-killian-award" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/475-core-tech-elazer-edelman-receives-2026-2027-killian-award" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/475-core-tech-elazer-edelman-receives-2026-2027-killian-award</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/475-core-tech-elazer-edelman-receives-2026-2027-killian-award" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/475-core-tech-elazer-edelman-receives-2026-2027-killian-award" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/476-core-tech-revolutionary-technique-mit-team-achieves-rapid-atomic-rearrangement-in-materials</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/476-core-tech-revolutionary-technique-mit-team-achieves-rapid-atomic-rearrangement-in-materials" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/476-core-tech-revolutionary-technique-mit-team-achieves-rapid-atomic-rearrangement-in-materials" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/476-core-tech-revolutionary-technique-mit-team-achieves-rapid-atomic-rearrangement-in-materials</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/476-core-tech-revolutionary-technique-mit-team-achieves-rapid-atomic-rearrangement-in-materials" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/476-core-tech-revolutionary-technique-mit-team-achieves-rapid-atomic-rearrangement-in-materials" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/477-core-tech-revolutionary-cancer-vaccine-approach-amplifies-t-cell-response</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/477-core-tech-revolutionary-cancer-vaccine-approach-amplifies-t-cell-response" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/477-core-tech-revolutionary-cancer-vaccine-approach-amplifies-t-cell-response" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/477-core-tech-revolutionary-cancer-vaccine-approach-amplifies-t-cell-response</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/477-core-tech-revolutionary-cancer-vaccine-approach-amplifies-t-cell-response" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/477-core-tech-revolutionary-cancer-vaccine-approach-amplifies-t-cell-response" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/478-core-tech-new-method-to-detect-dark-matter-via-gravitational-waves</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/478-core-tech-new-method-to-detect-dark-matter-via-gravitational-waves" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/478-core-tech-new-method-to-detect-dark-matter-via-gravitational-waves" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/478-core-tech-new-method-to-detect-dark-matter-via-gravitational-waves</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/478-core-tech-new-method-to-detect-dark-matter-via-gravitational-waves" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/478-core-tech-new-method-to-detect-dark-matter-via-gravitational-waves" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/479-core-tech-revolutionary-shrinking-technique-for-optical-computing-devices</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/479-core-tech-revolutionary-shrinking-technique-for-optical-computing-devices" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/479-core-tech-revolutionary-shrinking-technique-for-optical-computing-devices" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/479-core-tech-revolutionary-shrinking-technique-for-optical-computing-devices</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/479-core-tech-revolutionary-shrinking-technique-for-optical-computing-devices" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/479-core-tech-revolutionary-shrinking-technique-for-optical-computing-devices" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/480-core-tech-breakthrough-in-quantum-circuit-reliability-enhancement</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/480-core-tech-breakthrough-in-quantum-circuit-reliability-enhancement" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/480-core-tech-breakthrough-in-quantum-circuit-reliability-enhancement" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/480-core-tech-breakthrough-in-quantum-circuit-reliability-enhancement</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/480-core-tech-breakthrough-in-quantum-circuit-reliability-enhancement" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/480-core-tech-breakthrough-in-quantum-circuit-reliability-enhancement" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/481-core-tech-evs-environmental-and-economic-benefits-unveiled-by-mit-study</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/481-core-tech-evs-environmental-and-economic-benefits-unveiled-by-mit-study" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/481-core-tech-evs-environmental-and-economic-benefits-unveiled-by-mit-study" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/481-core-tech-evs-environmental-and-economic-benefits-unveiled-by-mit-study</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/481-core-tech-evs-environmental-and-economic-benefits-unveiled-by-mit-study" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/481-core-tech-evs-environmental-and-economic-benefits-unveiled-by-mit-study" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/483-core-tech-mit-student-jack-carson-named-2026-udall-scholar</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/483-core-tech-mit-student-jack-carson-named-2026-udall-scholar" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/483-core-tech-mit-student-jack-carson-named-2026-udall-scholar" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/483-core-tech-mit-student-jack-carson-named-2026-udall-scholar</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/483-core-tech-mit-student-jack-carson-named-2026-udall-scholar" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/483-core-tech-mit-student-jack-carson-named-2026-udall-scholar" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/484-core-tech-revolutionary-photonics-technology-for-compact-high-performance-lidar-sensors</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/484-core-tech-revolutionary-photonics-technology-for-compact-high-performance-lidar-sensors" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/484-core-tech-revolutionary-photonics-technology-for-compact-high-performance-lidar-sensors" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/484-core-tech-revolutionary-photonics-technology-for-compact-high-performance-lidar-sensors</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/484-core-tech-revolutionary-photonics-technology-for-compact-high-performance-lidar-sensors" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/484-core-tech-revolutionary-photonics-technology-for-compact-high-performance-lidar-sensors" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/485-core-tech-automations-impact-on-wage-control-a-hidden-strategy-by-us-firms</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/485-core-tech-automations-impact-on-wage-control-a-hidden-strategy-by-us-firms" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/485-core-tech-automations-impact-on-wage-control-a-hidden-strategy-by-us-firms" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/485-core-tech-automations-impact-on-wage-control-a-hidden-strategy-by-us-firms</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/485-core-tech-automations-impact-on-wage-control-a-hidden-strategy-by-us-firms" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/485-core-tech-automations-impact-on-wage-control-a-hidden-strategy-by-us-firms" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/493-c-magic-is-the-c-ecosystem-ready-to-abandon-c17</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/493-c-magic-is-the-c-ecosystem-ready-to-abandon-c17" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/493-c-magic-is-the-c-ecosystem-ready-to-abandon-c17" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/493-c-magic-is-the-c-ecosystem-ready-to-abandon-c17</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/493-c-magic-is-the-c-ecosystem-ready-to-abandon-c17" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/493-c-magic-is-the-c-ecosystem-ready-to-abandon-c17" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/494-c-magic-ycetl-a-compile-time-stl-like-template-library-for-runtime-data-structures</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/494-c-magic-ycetl-a-compile-time-stl-like-template-library-for-runtime-data-structures" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/494-c-magic-ycetl-a-compile-time-stl-like-template-library-for-runtime-data-structures" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/494-c-magic-ycetl-a-compile-time-stl-like-template-library-for-runtime-data-structures</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/494-c-magic-ycetl-a-compile-time-stl-like-template-library-for-runtime-data-structures" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/494-c-magic-ycetl-a-compile-time-stl-like-template-library-for-runtime-data-structures" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/495-c-magic-let-the-compiler-validate-your-units</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/495-c-magic-let-the-compiler-validate-your-units" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/495-c-magic-let-the-compiler-validate-your-units" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/495-c-magic-let-the-compiler-validate-your-units</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/495-c-magic-let-the-compiler-validate-your-units" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/495-c-magic-let-the-compiler-validate-your-units" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/496-c-magic-c-20-modules-are-you-ready-for-a-new-era-of-programming</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/496-c-magic-c-20-modules-are-you-ready-for-a-new-era-of-programming" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/496-c-magic-c-20-modules-are-you-ready-for-a-new-era-of-programming" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/496-c-magic-c-20-modules-are-you-ready-for-a-new-era-of-programming</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/496-c-magic-c-20-modules-are-you-ready-for-a-new-era-of-programming" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/496-c-magic-c-20-modules-are-you-ready-for-a-new-era-of-programming" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/497-c-magic-the-true-reason-c-always-prevails</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/497-c-magic-the-true-reason-c-always-prevails" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/497-c-magic-the-true-reason-c-always-prevails" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/497-c-magic-the-true-reason-c-always-prevails</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/497-c-magic-the-true-reason-c-always-prevails" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/497-c-magic-the-true-reason-c-always-prevails" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/498-c-magic-c26-deep-dive-into-constraint-ordering-in-fold-expressions</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/498-c-magic-c26-deep-dive-into-constraint-ordering-in-fold-expressions" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/498-c-magic-c26-deep-dive-into-constraint-ordering-in-fold-expressions" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/498-c-magic-c26-deep-dive-into-constraint-ordering-in-fold-expressions</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/498-c-magic-c26-deep-dive-into-constraint-ordering-in-fold-expressions" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/498-c-magic-c26-deep-dive-into-constraint-ordering-in-fold-expressions" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/499-c-magic-from-ms-dos-picklist-problem-to-stdbitset</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/499-c-magic-from-ms-dos-picklist-problem-to-stdbitset" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/499-c-magic-from-ms-dos-picklist-problem-to-stdbitset" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/499-c-magic-from-ms-dos-picklist-problem-to-stdbitset</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/499-c-magic-from-ms-dos-picklist-problem-to-stdbitset" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/499-c-magic-from-ms-dos-picklist-problem-to-stdbitset" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/500-c-magic-chat-server-on-one-thread-deep-dive-into-performance-and-limitations</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/500-c-magic-chat-server-on-one-thread-deep-dive-into-performance-and-limitations" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/500-c-magic-chat-server-on-one-thread-deep-dive-into-performance-and-limitations" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/500-c-magic-chat-server-on-one-thread-deep-dive-into-performance-and-limitations</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/500-c-magic-chat-server-on-one-thread-deep-dive-into-performance-and-limitations" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/500-c-magic-chat-server-on-one-thread-deep-dive-into-performance-and-limitations" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/501-c-magic-benchmarking-standard-library-as-a-module</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/501-c-magic-benchmarking-standard-library-as-a-module" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/501-c-magic-benchmarking-standard-library-as-a-module" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/501-c-magic-benchmarking-standard-library-as-a-module</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/501-c-magic-benchmarking-standard-library-as-a-module" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/501-c-magic-benchmarking-standard-library-as-a-module" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/502-c-magic-leadwerks-51-beta-new-deferred-renderer-and-potato-support</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/502-c-magic-leadwerks-51-beta-new-deferred-renderer-and-potato-support" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/502-c-magic-leadwerks-51-beta-new-deferred-renderer-and-potato-support" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/502-c-magic-leadwerks-51-beta-new-deferred-renderer-and-potato-support</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/502-c-magic-leadwerks-51-beta-new-deferred-renderer-and-potato-support" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/502-c-magic-leadwerks-51-beta-new-deferred-renderer-and-potato-support" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/503-c-magic-revolutionizing-efficiency-undercurrent-library-optimizes-c-ranges</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/503-c-magic-revolutionizing-efficiency-undercurrent-library-optimizes-c-ranges" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/503-c-magic-revolutionizing-efficiency-undercurrent-library-optimizes-c-ranges" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/503-c-magic-revolutionizing-efficiency-undercurrent-library-optimizes-c-ranges</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/503-c-magic-revolutionizing-efficiency-undercurrent-library-optimizes-c-ranges" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/503-c-magic-revolutionizing-efficiency-undercurrent-library-optimizes-c-ranges" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/504-c-magic-c-conference-highlights-may-2026-video-releases</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/504-c-magic-c-conference-highlights-may-2026-video-releases" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/504-c-magic-c-conference-highlights-may-2026-video-releases" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/504-c-magic-c-conference-highlights-may-2026-video-releases</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/504-c-magic-c-conference-highlights-may-2026-video-releases" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/504-c-magic-c-conference-highlights-may-2026-video-releases" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/505-c-magic-performance-comparison-and-use-cases-of-boosthub-vs-plfhive</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/505-c-magic-performance-comparison-and-use-cases-of-boosthub-vs-plfhive" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/505-c-magic-performance-comparison-and-use-cases-of-boosthub-vs-plfhive" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/505-c-magic-performance-comparison-and-use-cases-of-boosthub-vs-plfhive</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/505-c-magic-performance-comparison-and-use-cases-of-boosthub-vs-plfhive" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/505-c-magic-performance-comparison-and-use-cases-of-boosthub-vs-plfhive" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/506-algorithms-classical-computers-unlock-secrets-of-nitrogenase</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/506-algorithms-classical-computers-unlock-secrets-of-nitrogenase" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/506-algorithms-classical-computers-unlock-secrets-of-nitrogenase" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/506-algorithms-classical-computers-unlock-secrets-of-nitrogenase</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/506-algorithms-classical-computers-unlock-secrets-of-nitrogenase" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/506-algorithms-classical-computers-unlock-secrets-of-nitrogenase" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/508-algorithms-the-mystery-and-disruption-of-undersea-volcanoes-the-icelandic-saga</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/508-algorithms-the-mystery-and-disruption-of-undersea-volcanoes-the-icelandic-saga" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/508-algorithms-the-mystery-and-disruption-of-undersea-volcanoes-the-icelandic-saga" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/508-algorithms-the-mystery-and-disruption-of-undersea-volcanoes-the-icelandic-saga</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/508-algorithms-the-mystery-and-disruption-of-undersea-volcanoes-the-icelandic-saga" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/508-algorithms-the-mystery-and-disruption-of-undersea-volcanoes-the-icelandic-saga" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/509-algorithms-ecotypes-the-genetic-memory-of-species</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/509-algorithms-ecotypes-the-genetic-memory-of-species" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/509-algorithms-ecotypes-the-genetic-memory-of-species" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/509-algorithms-ecotypes-the-genetic-memory-of-species</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/509-algorithms-ecotypes-the-genetic-memory-of-species" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/509-algorithms-ecotypes-the-genetic-memory-of-species" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/511-cf-hardcore-optimize-your-vs-code-deep-dive-into-settingsjson</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/511-cf-hardcore-optimize-your-vs-code-deep-dive-into-settingsjson" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/511-cf-hardcore-optimize-your-vs-code-deep-dive-into-settingsjson" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/511-cf-hardcore-optimize-your-vs-code-deep-dive-into-settingsjson</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/511-cf-hardcore-optimize-your-vs-code-deep-dive-into-settingsjson" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/511-cf-hardcore-optimize-your-vs-code-deep-dive-into-settingsjson" />
        <lastmod>2026-05-30T07:51:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/418-in-depth-analysis-of-value-segment-trees-dynamic-ranking-and-efficient-queries</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/418-in-depth-analysis-of-value-segment-trees-dynamic-ranking-and-efficient-queries" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/418-in-depth-analysis-of-value-segment-trees-dynamic-ranking-and-efficient-queries" />
        <lastmod>2026-05-29T01:52:32+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/418-in-depth-analysis-of-value-segment-trees-dynamic-ranking-and-efficient-queries</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/418-in-depth-analysis-of-value-segment-trees-dynamic-ranking-and-efficient-queries" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/418-in-depth-analysis-of-value-segment-trees-dynamic-ranking-and-efficient-queries" />
        <lastmod>2026-05-29T01:52:32+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/417-kruskal-reconstruction-tree-an-elegant-transformation-from-minimum-spanning-tree-to-bottleneck-path-problem</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/417-kruskal-reconstruction-tree-an-elegant-transformation-from-minimum-spanning-tree-to-bottleneck-path-problem" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/417-kruskal-reconstruction-tree-an-elegant-transformation-from-minimum-spanning-tree-to-bottleneck-path-problem" />
        <lastmod>2026-05-29T01:49:18+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/417-kruskal-reconstruction-tree-an-elegant-transformation-from-minimum-spanning-tree-to-bottleneck-path-problem</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/417-kruskal-reconstruction-tree-an-elegant-transformation-from-minimum-spanning-tree-to-bottleneck-path-problem" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/417-kruskal-reconstruction-tree-an-elegant-transformation-from-minimum-spanning-tree-to-bottleneck-path-problem" />
        <lastmod>2026-05-29T01:49:18+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/406-digit-dynamic-programming-and-path-feature-extraction-in-tree-topology</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/406-digit-dynamic-programming-and-path-feature-extraction-in-tree-topology" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/406-digit-dynamic-programming-and-path-feature-extraction-in-tree-topology" />
        <lastmod>2026-05-29T01:15:33+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/406-digit-dynamic-programming-and-path-feature-extraction-in-tree-topology</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/406-digit-dynamic-programming-and-path-feature-extraction-in-tree-topology" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/406-digit-dynamic-programming-and-path-feature-extraction-in-tree-topology" />
        <lastmod>2026-05-29T01:15:33+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/407-efficient-calculation-of-multiplicative-inverses-in-modular-arithmetic</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/407-efficient-calculation-of-multiplicative-inverses-in-modular-arithmetic" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/407-efficient-calculation-of-multiplicative-inverses-in-modular-arithmetic" />
        <lastmod>2026-05-29T01:15:33+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/407-efficient-calculation-of-multiplicative-inverses-in-modular-arithmetic</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/407-efficient-calculation-of-multiplicative-inverses-in-modular-arithmetic" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/407-efficient-calculation-of-multiplicative-inverses-in-modular-arithmetic" />
        <lastmod>2026-05-29T01:15:33+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/409-breaking-time-complexity-bottlenecks-discretization-and-hashing-strategies-for-competitive-programming</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/409-breaking-time-complexity-bottlenecks-discretization-and-hashing-strategies-for-competitive-programming" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/409-breaking-time-complexity-bottlenecks-discretization-and-hashing-strategies-for-competitive-programming" />
        <lastmod>2026-05-29T01:15:33+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/409-breaking-time-complexity-bottlenecks-discretization-and-hashing-strategies-for-competitive-programming</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/409-breaking-time-complexity-bottlenecks-discretization-and-hashing-strategies-for-competitive-programming" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/409-breaking-time-complexity-bottlenecks-discretization-and-hashing-strategies-for-competitive-programming" />
        <lastmod>2026-05-29T01:15:33+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/410-crossing-limits-the-deep-integration-of-base-free-dynamic-transition-and-matrix-multiplication</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/410-crossing-limits-the-deep-integration-of-base-free-dynamic-transition-and-matrix-multiplication" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/410-crossing-limits-the-deep-integration-of-base-free-dynamic-transition-and-matrix-multiplication" />
        <lastmod>2026-05-29T01:15:33+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/410-crossing-limits-the-deep-integration-of-base-free-dynamic-transition-and-matrix-multiplication</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/410-crossing-limits-the-deep-integration-of-base-free-dynamic-transition-and-matrix-multiplication" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/410-crossing-limits-the-deep-integration-of-base-free-dynamic-transition-and-matrix-multiplication" />
        <lastmod>2026-05-29T01:15:33+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/411-deep-understanding-of-second-shortest-path-algorithm-extensions-and-optimizations-of-dijkstra</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/411-deep-understanding-of-second-shortest-path-algorithm-extensions-and-optimizations-of-dijkstra" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/411-deep-understanding-of-second-shortest-path-algorithm-extensions-and-optimizations-of-dijkstra" />
        <lastmod>2026-05-29T01:15:33+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/411-deep-understanding-of-second-shortest-path-algorithm-extensions-and-optimizations-of-dijkstra</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/411-deep-understanding-of-second-shortest-path-algorithm-extensions-and-optimizations-of-dijkstra" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/411-deep-understanding-of-second-shortest-path-algorithm-extensions-and-optimizations-of-dijkstra" />
        <lastmod>2026-05-29T01:15:33+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/413-hardware-level-optimization-and-compilation-techniques-secrets-to-boosting-algorithm-efficiency-in-noip</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/413-hardware-level-optimization-and-compilation-techniques-secrets-to-boosting-algorithm-efficiency-in-noip" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/413-hardware-level-optimization-and-compilation-techniques-secrets-to-boosting-algorithm-efficiency-in-noip" />
        <lastmod>2026-05-29T01:15:33+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/413-hardware-level-optimization-and-compilation-techniques-secrets-to-boosting-algorithm-efficiency-in-noip</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/413-hardware-level-optimization-and-compilation-techniques-secrets-to-boosting-algorithm-efficiency-in-noip" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/413-hardware-level-optimization-and-compilation-techniques-secrets-to-boosting-algorithm-efficiency-in-noip" />
        <lastmod>2026-05-29T01:15:33+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/414-core-algorithms-for-tree-diameter-and-centroid</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/414-core-algorithms-for-tree-diameter-and-centroid" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/414-core-algorithms-for-tree-diameter-and-centroid" />
        <lastmod>2026-05-29T01:15:33+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/414-core-algorithms-for-tree-diameter-and-centroid</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/414-core-algorithms-for-tree-diameter-and-centroid" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/414-core-algorithms-for-tree-diameter-and-centroid" />
        <lastmod>2026-05-29T01:15:33+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/415-kruskal-reconstruction-tree-an-advanced-data-structure-for-minimum-spanning-trees-and-its-applications</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/415-kruskal-reconstruction-tree-an-advanced-data-structure-for-minimum-spanning-trees-and-its-applications" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/415-kruskal-reconstruction-tree-an-advanced-data-structure-for-minimum-spanning-trees-and-its-applications" />
        <lastmod>2026-05-29T01:15:33+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/415-kruskal-reconstruction-tree-an-advanced-data-structure-for-minimum-spanning-trees-and-its-applications</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/415-kruskal-reconstruction-tree-an-advanced-data-structure-for-minimum-spanning-trees-and-its-applications" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/415-kruskal-reconstruction-tree-an-advanced-data-structure-for-minimum-spanning-trees-and-its-applications" />
        <lastmod>2026-05-29T01:15:33+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/400-efficient-algorithms-solving-inversion-pairs-and-modular-arithmetic-with-merge-sort-and-fast-exponentiation</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/400-efficient-algorithms-solving-inversion-pairs-and-modular-arithmetic-with-merge-sort-and-fast-exponentiation" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/400-efficient-algorithms-solving-inversion-pairs-and-modular-arithmetic-with-merge-sort-and-fast-exponentiation" />
        <lastmod>2026-05-29T00:44:19+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/400-efficient-algorithms-solving-inversion-pairs-and-modular-arithmetic-with-merge-sort-and-fast-exponentiation</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/400-efficient-algorithms-solving-inversion-pairs-and-modular-arithmetic-with-merge-sort-and-fast-exponentiation" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/400-efficient-algorithms-solving-inversion-pairs-and-modular-arithmetic-with-merge-sort-and-fast-exponentiation" />
        <lastmod>2026-05-29T00:44:19+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/401-deep-integration-of-digit-dp-and-algebraic-number-theory-dynamic-programming-analysis-of-divisibility-problems</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/401-deep-integration-of-digit-dp-and-algebraic-number-theory-dynamic-programming-analysis-of-divisibility-problems" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/401-deep-integration-of-digit-dp-and-algebraic-number-theory-dynamic-programming-analysis-of-divisibility-problems" />
        <lastmod>2026-05-29T00:44:19+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/401-deep-integration-of-digit-dp-and-algebraic-number-theory-dynamic-programming-analysis-of-divisibility-problems</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/401-deep-integration-of-digit-dp-and-algebraic-number-theory-dynamic-programming-analysis-of-divisibility-problems" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/401-deep-integration-of-digit-dp-and-algebraic-number-theory-dynamic-programming-analysis-of-divisibility-problems" />
        <lastmod>2026-05-29T00:44:19+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/402-interval-dynamic-programming-in-depth-analysis-and-implementation-of-the-stone-merging-problem</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/402-interval-dynamic-programming-in-depth-analysis-and-implementation-of-the-stone-merging-problem" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/402-interval-dynamic-programming-in-depth-analysis-and-implementation-of-the-stone-merging-problem" />
        <lastmod>2026-05-29T00:44:19+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/402-interval-dynamic-programming-in-depth-analysis-and-implementation-of-the-stone-merging-problem</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/402-interval-dynamic-programming-in-depth-analysis-and-implementation-of-the-stone-merging-problem" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/402-interval-dynamic-programming-in-depth-analysis-and-implementation-of-the-stone-merging-problem" />
        <lastmod>2026-05-29T00:44:19+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/403-in-depth-understanding-of-segment-trees-principles-implementation-and-common-pitfalls</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/403-in-depth-understanding-of-segment-trees-principles-implementation-and-common-pitfalls" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/403-in-depth-understanding-of-segment-trees-principles-implementation-and-common-pitfalls" />
        <lastmod>2026-05-29T00:44:19+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/403-in-depth-understanding-of-segment-trees-principles-implementation-and-common-pitfalls</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/403-in-depth-understanding-of-segment-trees-principles-implementation-and-common-pitfalls" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/403-in-depth-understanding-of-segment-trees-principles-implementation-and-common-pitfalls" />
        <lastmod>2026-05-29T00:44:19+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/404-in-depth-exploration-of-gdb-debugging-and-memory-monitoring-techniques</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/404-in-depth-exploration-of-gdb-debugging-and-memory-monitoring-techniques" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/404-in-depth-exploration-of-gdb-debugging-and-memory-monitoring-techniques" />
        <lastmod>2026-05-29T00:44:19+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/404-in-depth-exploration-of-gdb-debugging-and-memory-monitoring-techniques</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/404-in-depth-exploration-of-gdb-debugging-and-memory-monitoring-techniques" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/404-in-depth-exploration-of-gdb-debugging-and-memory-monitoring-techniques" />
        <lastmod>2026-05-29T00:44:19+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/405-efficient-state-space-search-and-pruning-strategies</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/405-efficient-state-space-search-and-pruning-strategies" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/405-efficient-state-space-search-and-pruning-strategies" />
        <lastmod>2026-05-29T00:44:19+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/405-efficient-state-space-search-and-pruning-strategies</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/405-efficient-state-space-search-and-pruning-strategies" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/405-efficient-state-space-search-and-pruning-strategies" />
        <lastmod>2026-05-29T00:44:19+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/393-efficient-calculation-of-combinatorial-numbers-linear-derivation-and-implementation-of-factorial-inverses</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/393-efficient-calculation-of-combinatorial-numbers-linear-derivation-and-implementation-of-factorial-inverses" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/393-efficient-calculation-of-combinatorial-numbers-linear-derivation-and-implementation-of-factorial-inverses" />
        <lastmod>2026-05-27T09:17:37+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/393-efficient-calculation-of-combinatorial-numbers-linear-derivation-and-implementation-of-factorial-inverses</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/393-efficient-calculation-of-combinatorial-numbers-linear-derivation-and-implementation-of-factorial-inverses" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/393-efficient-calculation-of-combinatorial-numbers-linear-derivation-and-implementation-of-factorial-inverses" />
        <lastmod>2026-05-27T09:17:37+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/394-in-depth-exploration-of-strict-second-minimum-spanning-tree-algorithms-and-implementations</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/394-in-depth-exploration-of-strict-second-minimum-spanning-tree-algorithms-and-implementations" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/394-in-depth-exploration-of-strict-second-minimum-spanning-tree-algorithms-and-implementations" />
        <lastmod>2026-05-27T09:17:37+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/394-in-depth-exploration-of-strict-second-minimum-spanning-tree-algorithms-and-implementations</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/394-in-depth-exploration-of-strict-second-minimum-spanning-tree-algorithms-and-implementations" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/394-in-depth-exploration-of-strict-second-minimum-spanning-tree-algorithms-and-implementations" />
        <lastmod>2026-05-27T09:17:37+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/395-in-depth-analysis-of-multi-sequence-dynamic-programming-longest-common-subsequence-and-edit-distance</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/395-in-depth-analysis-of-multi-sequence-dynamic-programming-longest-common-subsequence-and-edit-distance" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/395-in-depth-analysis-of-multi-sequence-dynamic-programming-longest-common-subsequence-and-edit-distance" />
        <lastmod>2026-05-27T09:17:37+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/395-in-depth-analysis-of-multi-sequence-dynamic-programming-longest-common-subsequence-and-edit-distance</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/395-in-depth-analysis-of-multi-sequence-dynamic-programming-longest-common-subsequence-and-edit-distance" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/395-in-depth-analysis-of-multi-sequence-dynamic-programming-longest-common-subsequence-and-edit-distance" />
        <lastmod>2026-05-27T09:17:37+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/396-in-depth-analysis-of-topological-sorting-kahns-algorithm-and-its-optimization</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/396-in-depth-analysis-of-topological-sorting-kahns-algorithm-and-its-optimization" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/396-in-depth-analysis-of-topological-sorting-kahns-algorithm-and-its-optimization" />
        <lastmod>2026-05-27T09:17:37+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/396-in-depth-analysis-of-topological-sorting-kahns-algorithm-and-its-optimization</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/396-in-depth-analysis-of-topological-sorting-kahns-algorithm-and-its-optimization" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/396-in-depth-analysis-of-topological-sorting-kahns-algorithm-and-its-optimization" />
        <lastmod>2026-05-27T09:17:37+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/300-in-depth-analysis-of-the-nim-game-mathematical-principles-and-algorithm-implementation</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/300-in-depth-analysis-of-the-nim-game-mathematical-principles-and-algorithm-implementation" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/300-in-depth-analysis-of-the-nim-game-mathematical-principles-and-algorithm-implementation" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/300-in-depth-analysis-of-the-nim-game-mathematical-principles-and-algorithm-implementation</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/300-in-depth-analysis-of-the-nim-game-mathematical-principles-and-algorithm-implementation" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/300-in-depth-analysis-of-the-nim-game-mathematical-principles-and-algorithm-implementation" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/301-in-depth-analysis-of-prims-algorithm-constructing-minimum-spanning-trees-in-dense-graphs</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/301-in-depth-analysis-of-prims-algorithm-constructing-minimum-spanning-trees-in-dense-graphs" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/301-in-depth-analysis-of-prims-algorithm-constructing-minimum-spanning-trees-in-dense-graphs" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/301-in-depth-analysis-of-prims-algorithm-constructing-minimum-spanning-trees-in-dense-graphs</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/301-in-depth-analysis-of-prims-algorithm-constructing-minimum-spanning-trees-in-dense-graphs" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/301-in-depth-analysis-of-prims-algorithm-constructing-minimum-spanning-trees-in-dense-graphs" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/302-tree-dependent-knapsack-problem-the-perfect-integration-of-topological-dependencies-and-dynamic-programming</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/302-tree-dependent-knapsack-problem-the-perfect-integration-of-topological-dependencies-and-dynamic-programming" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/302-tree-dependent-knapsack-problem-the-perfect-integration-of-topological-dependencies-and-dynamic-programming" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/302-tree-dependent-knapsack-problem-the-perfect-integration-of-topological-dependencies-and-dynamic-programming</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/302-tree-dependent-knapsack-problem-the-perfect-integration-of-topological-dependencies-and-dynamic-programming" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/302-tree-dependent-knapsack-problem-the-perfect-integration-of-topological-dependencies-and-dynamic-programming" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/303-digit-dynamic-programming-efficiently-counting-integers-with-specific-digit-features-in-a-range</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/303-digit-dynamic-programming-efficiently-counting-integers-with-specific-digit-features-in-a-range" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/303-digit-dynamic-programming-efficiently-counting-integers-with-specific-digit-features-in-a-range" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/303-digit-dynamic-programming-efficiently-counting-integers-with-specific-digit-features-in-a-range</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/303-digit-dynamic-programming-efficiently-counting-integers-with-specific-digit-features-in-a-range" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/303-digit-dynamic-programming-efficiently-counting-integers-with-specific-digit-features-in-a-range" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/304-efficient-string-matching-a-comprehensive-guide-to-the-kmp-algorithm</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/304-efficient-string-matching-a-comprehensive-guide-to-the-kmp-algorithm" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/304-efficient-string-matching-a-comprehensive-guide-to-the-kmp-algorithm" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/304-efficient-string-matching-a-comprehensive-guide-to-the-kmp-algorithm</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/304-efficient-string-matching-a-comprehensive-guide-to-the-kmp-algorithm" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/304-efficient-string-matching-a-comprehensive-guide-to-the-kmp-algorithm" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/305-in-depth-exploration-of-catalan-and-stirling-numbers-dynamic-programming-implementation</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/305-in-depth-exploration-of-catalan-and-stirling-numbers-dynamic-programming-implementation" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/305-in-depth-exploration-of-catalan-and-stirling-numbers-dynamic-programming-implementation" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/305-in-depth-exploration-of-catalan-and-stirling-numbers-dynamic-programming-implementation</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/305-in-depth-exploration-of-catalan-and-stirling-numbers-dynamic-programming-implementation" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/305-in-depth-exploration-of-catalan-and-stirling-numbers-dynamic-programming-implementation" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/306-mastering-probability-theory-and-dynamic-programming-state-transition-and-bayesian-inference-in-graph-theory</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/306-mastering-probability-theory-and-dynamic-programming-state-transition-and-bayesian-inference-in-graph-theory" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/306-mastering-probability-theory-and-dynamic-programming-state-transition-and-bayesian-inference-in-graph-theory" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/306-mastering-probability-theory-and-dynamic-programming-state-transition-and-bayesian-inference-in-graph-theory</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/306-mastering-probability-theory-and-dynamic-programming-state-transition-and-bayesian-inference-in-graph-theory" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/306-mastering-probability-theory-and-dynamic-programming-state-transition-and-bayesian-inference-in-graph-theory" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/307-state-space-design-and-geometric-mapping-in-dynamic-programming</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/307-state-space-design-and-geometric-mapping-in-dynamic-programming" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/307-state-space-design-and-geometric-mapping-in-dynamic-programming" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/307-state-space-design-and-geometric-mapping-in-dynamic-programming</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/307-state-space-design-and-geometric-mapping-in-dynamic-programming" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/307-state-space-design-and-geometric-mapping-in-dynamic-programming" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/309-efficient-static-range-maximum-query-an-in-depth-analysis-of-dynamic-programming-and-doubling-algorithm</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/309-efficient-static-range-maximum-query-an-in-depth-analysis-of-dynamic-programming-and-doubling-algorithm" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/309-efficient-static-range-maximum-query-an-in-depth-analysis-of-dynamic-programming-and-doubling-algorithm" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/309-efficient-static-range-maximum-query-an-in-depth-analysis-of-dynamic-programming-and-doubling-algorithm</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/309-efficient-static-range-maximum-query-an-in-depth-analysis-of-dynamic-programming-and-doubling-algorithm" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/309-efficient-static-range-maximum-query-an-in-depth-analysis-of-dynamic-programming-and-doubling-algorithm" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/310-efficient-interval-updates-and-queries-implementation-and-application-of-lazy-segment-trees</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/310-efficient-interval-updates-and-queries-implementation-and-application-of-lazy-segment-trees" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/310-efficient-interval-updates-and-queries-implementation-and-application-of-lazy-segment-trees" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/310-efficient-interval-updates-and-queries-implementation-and-application-of-lazy-segment-trees</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/310-efficient-interval-updates-and-queries-implementation-and-application-of-lazy-segment-trees" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/310-efficient-interval-updates-and-queries-implementation-and-application-of-lazy-segment-trees" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/311-efficient-algorithms-binary-search-on-answer-and-divide-and-conquer-structures</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/311-efficient-algorithms-binary-search-on-answer-and-divide-and-conquer-structures" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/311-efficient-algorithms-binary-search-on-answer-and-divide-and-conquer-structures" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/311-efficient-algorithms-binary-search-on-answer-and-divide-and-conquer-structures</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/311-efficient-algorithms-binary-search-on-answer-and-divide-and-conquer-structures" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/311-efficient-algorithms-binary-search-on-answer-and-divide-and-conquer-structures" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/312-efficient-debugging-a-practical-guide-to-optimizing-code-debugging-strategies-in-noip</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/312-efficient-debugging-a-practical-guide-to-optimizing-code-debugging-strategies-in-noip" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/312-efficient-debugging-a-practical-guide-to-optimizing-code-debugging-strategies-in-noip" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/312-efficient-debugging-a-practical-guide-to-optimizing-code-debugging-strategies-in-noip</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/312-efficient-debugging-a-practical-guide-to-optimizing-code-debugging-strategies-in-noip" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/312-efficient-debugging-a-practical-guide-to-optimizing-code-debugging-strategies-in-noip" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/313-exploring-pull-and-push-mechanisms-in-dynamic-programming</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/313-exploring-pull-and-push-mechanisms-in-dynamic-programming" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/313-exploring-pull-and-push-mechanisms-in-dynamic-programming" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/313-exploring-pull-and-push-mechanisms-in-dynamic-programming</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/313-exploring-pull-and-push-mechanisms-in-dynamic-programming" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/313-exploring-pull-and-push-mechanisms-in-dynamic-programming" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/314-dynamic-programming-in-depth-analysis-and-practical-applications</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/314-dynamic-programming-in-depth-analysis-and-practical-applications" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/314-dynamic-programming-in-depth-analysis-and-practical-applications" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/314-dynamic-programming-in-depth-analysis-and-practical-applications</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/314-dynamic-programming-in-depth-analysis-and-practical-applications" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/314-dynamic-programming-in-depth-analysis-and-practical-applications" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/315-in-depth-exploration-of-persistent-segment-trees-efficient-implementation-and-optimization-for-interval-k-th-largest-queries</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/315-in-depth-exploration-of-persistent-segment-trees-efficient-implementation-and-optimization-for-interval-k-th-largest-queries" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/315-in-depth-exploration-of-persistent-segment-trees-efficient-implementation-and-optimization-for-interval-k-th-largest-queries" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/315-in-depth-exploration-of-persistent-segment-trees-efficient-implementation-and-optimization-for-interval-k-th-largest-queries</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/315-in-depth-exploration-of-persistent-segment-trees-efficient-implementation-and-optimization-for-interval-k-th-largest-queries" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/315-in-depth-exploration-of-persistent-segment-trees-efficient-implementation-and-optimization-for-interval-k-th-largest-queries" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/316-tree-dynamic-programming-analyzing-the-bossless-ball-and-the-maximum-independent-set-problem</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/316-tree-dynamic-programming-analyzing-the-bossless-ball-and-the-maximum-independent-set-problem" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/316-tree-dynamic-programming-analyzing-the-bossless-ball-and-the-maximum-independent-set-problem" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/316-tree-dynamic-programming-analyzing-the-bossless-ball-and-the-maximum-independent-set-problem</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/316-tree-dynamic-programming-analyzing-the-bossless-ball-and-the-maximum-independent-set-problem" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/316-tree-dynamic-programming-analyzing-the-bossless-ball-and-the-maximum-independent-set-problem" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/318-in-depth-analysis-of-linear-congruences-and-extended-chinese-remainder-theorem</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/318-in-depth-analysis-of-linear-congruences-and-extended-chinese-remainder-theorem" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/318-in-depth-analysis-of-linear-congruences-and-extended-chinese-remainder-theorem" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/318-in-depth-analysis-of-linear-congruences-and-extended-chinese-remainder-theorem</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/318-in-depth-analysis-of-linear-congruences-and-extended-chinese-remainder-theorem" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/318-in-depth-analysis-of-linear-congruences-and-extended-chinese-remainder-theorem" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/319-deep-dive-into-tree-structures-and-efficient-traversal-algorithms</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/319-deep-dive-into-tree-structures-and-efficient-traversal-algorithms" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/319-deep-dive-into-tree-structures-and-efficient-traversal-algorithms" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/319-deep-dive-into-tree-structures-and-efficient-traversal-algorithms</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/319-deep-dive-into-tree-structures-and-efficient-traversal-algorithms" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/319-deep-dive-into-tree-structures-and-efficient-traversal-algorithms" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/320-efficient-interval-extremum-maintenance-core-principles-and-implementation-guide-of-monotonic-queue</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/320-efficient-interval-extremum-maintenance-core-principles-and-implementation-guide-of-monotonic-queue" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/320-efficient-interval-extremum-maintenance-core-principles-and-implementation-guide-of-monotonic-queue" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/320-efficient-interval-extremum-maintenance-core-principles-and-implementation-guide-of-monotonic-queue</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/320-efficient-interval-extremum-maintenance-core-principles-and-implementation-guide-of-monotonic-queue" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/320-efficient-interval-extremum-maintenance-core-principles-and-implementation-guide-of-monotonic-queue" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/321-in-depth-analysis-of-two-pointers-technique-and-sliding-window-applications</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/321-in-depth-analysis-of-two-pointers-technique-and-sliding-window-applications" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/321-in-depth-analysis-of-two-pointers-technique-and-sliding-window-applications" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/321-in-depth-analysis-of-two-pointers-technique-and-sliding-window-applications</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/321-in-depth-analysis-of-two-pointers-technique-and-sliding-window-applications" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/321-in-depth-analysis-of-two-pointers-technique-and-sliding-window-applications" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/322-efficient-algorithm-analysis-optimization-and-implementation-of-the-knapsack-problem</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/322-efficient-algorithm-analysis-optimization-and-implementation-of-the-knapsack-problem" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/322-efficient-algorithm-analysis-optimization-and-implementation-of-the-knapsack-problem" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/322-efficient-algorithm-analysis-optimization-and-implementation-of-the-knapsack-problem</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/322-efficient-algorithm-analysis-optimization-and-implementation-of-the-knapsack-problem" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/322-efficient-algorithm-analysis-optimization-and-implementation-of-the-knapsack-problem" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/323-digit-dynamic-programming-in-depth-analysis-of-efficient-counting-and-state-management</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/323-digit-dynamic-programming-in-depth-analysis-of-efficient-counting-and-state-management" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/323-digit-dynamic-programming-in-depth-analysis-of-efficient-counting-and-state-management" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/323-digit-dynamic-programming-in-depth-analysis-of-efficient-counting-and-state-management</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/323-digit-dynamic-programming-in-depth-analysis-of-efficient-counting-and-state-management" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/323-digit-dynamic-programming-in-depth-analysis-of-efficient-counting-and-state-management" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/324-efficient-state-space-search-in-depth-analysis-of-iterative-deepening-and-bidirectional-bfs-algorithms</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/324-efficient-state-space-search-in-depth-analysis-of-iterative-deepening-and-bidirectional-bfs-algorithms" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/324-efficient-state-space-search-in-depth-analysis-of-iterative-deepening-and-bidirectional-bfs-algorithms" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/324-efficient-state-space-search-in-depth-analysis-of-iterative-deepening-and-bidirectional-bfs-algorithms</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/324-efficient-state-space-search-in-depth-analysis-of-iterative-deepening-and-bidirectional-bfs-algorithms" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/324-efficient-state-space-search-in-depth-analysis-of-iterative-deepening-and-bidirectional-bfs-algorithms" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/325-in-depth-analysis-of-binary-heap-structure-and-operations</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/325-in-depth-analysis-of-binary-heap-structure-and-operations" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/325-in-depth-analysis-of-binary-heap-structure-and-operations" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/325-in-depth-analysis-of-binary-heap-structure-and-operations</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/325-in-depth-analysis-of-binary-heap-structure-and-operations" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/325-in-depth-analysis-of-binary-heap-structure-and-operations" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/327-efficient-applications-of-string-hashing-and-kmp-periodicity-theorem</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/327-efficient-applications-of-string-hashing-and-kmp-periodicity-theorem" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/327-efficient-applications-of-string-hashing-and-kmp-periodicity-theorem" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/327-efficient-applications-of-string-hashing-and-kmp-periodicity-theorem</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/327-efficient-applications-of-string-hashing-and-kmp-periodicity-theorem" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/327-efficient-applications-of-string-hashing-and-kmp-periodicity-theorem" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/328-efficient-interval-updates-and-recovery-a-deep-dive-into-difference-arrays</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/328-efficient-interval-updates-and-recovery-a-deep-dive-into-difference-arrays" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/328-efficient-interval-updates-and-recovery-a-deep-dive-into-difference-arrays" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/328-efficient-interval-updates-and-recovery-a-deep-dive-into-difference-arrays</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/328-efficient-interval-updates-and-recovery-a-deep-dive-into-difference-arrays" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/328-efficient-interval-updates-and-recovery-a-deep-dive-into-difference-arrays" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/330-grid-based-state-compression-dp-a-deep-dive-into-no-retreat-properties-and-bitwise-operations</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/330-grid-based-state-compression-dp-a-deep-dive-into-no-retreat-properties-and-bitwise-operations" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/330-grid-based-state-compression-dp-a-deep-dive-into-no-retreat-properties-and-bitwise-operations" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/330-grid-based-state-compression-dp-a-deep-dive-into-no-retreat-properties-and-bitwise-operations</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/330-grid-based-state-compression-dp-a-deep-dive-into-no-retreat-properties-and-bitwise-operations" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/330-grid-based-state-compression-dp-a-deep-dive-into-no-retreat-properties-and-bitwise-operations" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/331-inversion-pair-counting-and-dynamic-frequency-statistics-using-fenwick-tree</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/331-inversion-pair-counting-and-dynamic-frequency-statistics-using-fenwick-tree" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/331-inversion-pair-counting-and-dynamic-frequency-statistics-using-fenwick-tree" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/331-inversion-pair-counting-and-dynamic-frequency-statistics-using-fenwick-tree</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/331-inversion-pair-counting-and-dynamic-frequency-statistics-using-fenwick-tree" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/331-inversion-pair-counting-and-dynamic-frequency-statistics-using-fenwick-tree" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/332-binary-lifting-mathematical-principles-and-implementation-for-efficient-interval-queries-and-dynamic-coverage</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/332-binary-lifting-mathematical-principles-and-implementation-for-efficient-interval-queries-and-dynamic-coverage" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/332-binary-lifting-mathematical-principles-and-implementation-for-efficient-interval-queries-and-dynamic-coverage" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/332-binary-lifting-mathematical-principles-and-implementation-for-efficient-interval-queries-and-dynamic-coverage</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/332-binary-lifting-mathematical-principles-and-implementation-for-efficient-interval-queries-and-dynamic-coverage" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/332-binary-lifting-mathematical-principles-and-implementation-for-efficient-interval-queries-and-dynamic-coverage" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/334-in-depth-understanding-of-the-inclusion-exclusion-principle-and-its-application-in-algorithms</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/334-in-depth-understanding-of-the-inclusion-exclusion-principle-and-its-application-in-algorithms" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/334-in-depth-understanding-of-the-inclusion-exclusion-principle-and-its-application-in-algorithms" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/334-in-depth-understanding-of-the-inclusion-exclusion-principle-and-its-application-in-algorithms</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/334-in-depth-understanding-of-the-inclusion-exclusion-principle-and-its-application-in-algorithms" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/334-in-depth-understanding-of-the-inclusion-exclusion-principle-and-its-application-in-algorithms" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/335-advanced-tactics-of-shortest-path-theory-in-complex-industrial-scenarios-spfa-and-differential-constraints</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/335-advanced-tactics-of-shortest-path-theory-in-complex-industrial-scenarios-spfa-and-differential-constraints" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/335-advanced-tactics-of-shortest-path-theory-in-complex-industrial-scenarios-spfa-and-differential-constraints" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/335-advanced-tactics-of-shortest-path-theory-in-complex-industrial-scenarios-spfa-and-differential-constraints</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/335-advanced-tactics-of-shortest-path-theory-in-complex-industrial-scenarios-spfa-and-differential-constraints" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/335-advanced-tactics-of-shortest-path-theory-in-complex-industrial-scenarios-spfa-and-differential-constraints" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/336-heuristic-search-and-a-algorithm-in-depth-analysis-and-implementation</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/336-heuristic-search-and-a-algorithm-in-depth-analysis-and-implementation" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/336-heuristic-search-and-a-algorithm-in-depth-analysis-and-implementation" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/336-heuristic-search-and-a-algorithm-in-depth-analysis-and-implementation</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/336-heuristic-search-and-a-algorithm-in-depth-analysis-and-implementation" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/336-heuristic-search-and-a-algorithm-in-depth-analysis-and-implementation" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/337-deep-dive-into-the-perfect-combination-of-memoization-and-topological-sorting</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/337-deep-dive-into-the-perfect-combination-of-memoization-and-topological-sorting" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/337-deep-dive-into-the-perfect-combination-of-memoization-and-topological-sorting" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/337-deep-dive-into-the-perfect-combination-of-memoization-and-topological-sorting</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/337-deep-dive-into-the-perfect-combination-of-memoization-and-topological-sorting" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/337-deep-dive-into-the-perfect-combination-of-memoization-and-topological-sorting" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/338-state-compression-dynamic-programming-efficient-solution-to-the-traveling-salesman-problem</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/338-state-compression-dynamic-programming-efficient-solution-to-the-traveling-salesman-problem" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/338-state-compression-dynamic-programming-efficient-solution-to-the-traveling-salesman-problem" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/338-state-compression-dynamic-programming-efficient-solution-to-the-traveling-salesman-problem</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/338-state-compression-dynamic-programming-efficient-solution-to-the-traveling-salesman-problem" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/338-state-compression-dynamic-programming-efficient-solution-to-the-traveling-salesman-problem" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/339-plug-dynamic-programming-the-ultimate-algorithm-for-solving-connectivity-path-loops-on-grids</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/339-plug-dynamic-programming-the-ultimate-algorithm-for-solving-connectivity-path-loops-on-grids" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/339-plug-dynamic-programming-the-ultimate-algorithm-for-solving-connectivity-path-loops-on-grids" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/339-plug-dynamic-programming-the-ultimate-algorithm-for-solving-connectivity-path-loops-on-grids</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/339-plug-dynamic-programming-the-ultimate-algorithm-for-solving-connectivity-path-loops-on-grids" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/339-plug-dynamic-programming-the-ultimate-algorithm-for-solving-connectivity-path-loops-on-grids" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/340-deep-dive-into-the-extended-eulers-theorem-and-its-application-in-large-exponent-modulo-reduction</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/340-deep-dive-into-the-extended-eulers-theorem-and-its-application-in-large-exponent-modulo-reduction" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/340-deep-dive-into-the-extended-eulers-theorem-and-its-application-in-large-exponent-modulo-reduction" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/340-deep-dive-into-the-extended-eulers-theorem-and-its-application-in-large-exponent-modulo-reduction</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/340-deep-dive-into-the-extended-eulers-theorem-and-its-application-in-large-exponent-modulo-reduction" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/340-deep-dive-into-the-extended-eulers-theorem-and-its-application-in-large-exponent-modulo-reduction" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/342-in-depth-analysis-of-complex-knapsack-problems-state-design-and-algorithm-derivation-for-grouped-and-mixed-knapsacks</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/342-in-depth-analysis-of-complex-knapsack-problems-state-design-and-algorithm-derivation-for-grouped-and-mixed-knapsacks" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/342-in-depth-analysis-of-complex-knapsack-problems-state-design-and-algorithm-derivation-for-grouped-and-mixed-knapsacks" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/342-in-depth-analysis-of-complex-knapsack-problems-state-design-and-algorithm-derivation-for-grouped-and-mixed-knapsacks</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/342-in-depth-analysis-of-complex-knapsack-problems-state-design-and-algorithm-derivation-for-grouped-and-mixed-knapsacks" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/342-in-depth-analysis-of-complex-knapsack-problems-state-design-and-algorithm-derivation-for-grouped-and-mixed-knapsacks" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/343-decoding-impartial-combinatorial-games-analysis-of-p-and-n-states-in-game-theory</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/343-decoding-impartial-combinatorial-games-analysis-of-p-and-n-states-in-game-theory" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/343-decoding-impartial-combinatorial-games-analysis-of-p-and-n-states-in-game-theory" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/343-decoding-impartial-combinatorial-games-analysis-of-p-and-n-states-in-game-theory</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/343-decoding-impartial-combinatorial-games-analysis-of-p-and-n-states-in-game-theory" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/343-decoding-impartial-combinatorial-games-analysis-of-p-and-n-states-in-game-theory" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/344-efficient-approach-to-large-scale-matrix-coverage-problem-using-2d-difference-and-discretization</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/344-efficient-approach-to-large-scale-matrix-coverage-problem-using-2d-difference-and-discretization" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/344-efficient-approach-to-large-scale-matrix-coverage-problem-using-2d-difference-and-discretization" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/344-efficient-approach-to-large-scale-matrix-coverage-problem-using-2d-difference-and-discretization</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/344-efficient-approach-to-large-scale-matrix-coverage-problem-using-2d-difference-and-discretization" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/344-efficient-approach-to-large-scale-matrix-coverage-problem-using-2d-difference-and-discretization" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/345-re-rooting-technique-and-global-path-optimization-in-tree-dynamic-programming</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/345-re-rooting-technique-and-global-path-optimization-in-tree-dynamic-programming" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/345-re-rooting-technique-and-global-path-optimization-in-tree-dynamic-programming" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/345-re-rooting-technique-and-global-path-optimization-in-tree-dynamic-programming</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/345-re-rooting-technique-and-global-path-optimization-in-tree-dynamic-programming" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/345-re-rooting-technique-and-global-path-optimization-in-tree-dynamic-programming" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/346-in-depth-analysis-of-longest-increasing-subsequence-algorithms-and-optimization-strategies</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/346-in-depth-analysis-of-longest-increasing-subsequence-algorithms-and-optimization-strategies" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/346-in-depth-analysis-of-longest-increasing-subsequence-algorithms-and-optimization-strategies" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/346-in-depth-analysis-of-longest-increasing-subsequence-algorithms-and-optimization-strategies</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/346-in-depth-analysis-of-longest-increasing-subsequence-algorithms-and-optimization-strategies" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/346-in-depth-analysis-of-longest-increasing-subsequence-algorithms-and-optimization-strategies" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/347-exploring-circular-dynamic-programming-techniques-breaking-chains-and-boundary-fixing</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/347-exploring-circular-dynamic-programming-techniques-breaking-chains-and-boundary-fixing" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/347-exploring-circular-dynamic-programming-techniques-breaking-chains-and-boundary-fixing" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/347-exploring-circular-dynamic-programming-techniques-breaking-chains-and-boundary-fixing</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/347-exploring-circular-dynamic-programming-techniques-breaking-chains-and-boundary-fixing" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/347-exploring-circular-dynamic-programming-techniques-breaking-chains-and-boundary-fixing" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/348-graph-theory-analysis-and-algorithm-implementation-of-difference-constraints-system</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/348-graph-theory-analysis-and-algorithm-implementation-of-difference-constraints-system" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/348-graph-theory-analysis-and-algorithm-implementation-of-difference-constraints-system" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/348-graph-theory-analysis-and-algorithm-implementation-of-difference-constraints-system</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/348-graph-theory-analysis-and-algorithm-implementation-of-difference-constraints-system" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/348-graph-theory-analysis-and-algorithm-implementation-of-difference-constraints-system" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/350-in-depth-analysis-of-combinatorial-counting-and-algorithm-optimization</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/350-in-depth-analysis-of-combinatorial-counting-and-algorithm-optimization" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/350-in-depth-analysis-of-combinatorial-counting-and-algorithm-optimization" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/350-in-depth-analysis-of-combinatorial-counting-and-algorithm-optimization</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/350-in-depth-analysis-of-combinatorial-counting-and-algorithm-optimization" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/350-in-depth-analysis-of-combinatorial-counting-and-algorithm-optimization" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/351-efficient-solving-of-the-n-puzzle-problem-with-ida-algorithm-analysis-and-implementation</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/351-efficient-solving-of-the-n-puzzle-problem-with-ida-algorithm-analysis-and-implementation" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/351-efficient-solving-of-the-n-puzzle-problem-with-ida-algorithm-analysis-and-implementation" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/351-efficient-solving-of-the-n-puzzle-problem-with-ida-algorithm-analysis-and-implementation</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/351-efficient-solving-of-the-n-puzzle-problem-with-ida-algorithm-analysis-and-implementation" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/351-efficient-solving-of-the-n-puzzle-problem-with-ida-algorithm-analysis-and-implementation" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/352-efficient-automated-differential-testing-a-new-architecture-and-implementation-based-on-monte-carlo-methods</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/352-efficient-automated-differential-testing-a-new-architecture-and-implementation-based-on-monte-carlo-methods" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/352-efficient-automated-differential-testing-a-new-architecture-and-implementation-based-on-monte-carlo-methods" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/352-efficient-automated-differential-testing-a-new-architecture-and-implementation-based-on-monte-carlo-methods</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/352-efficient-automated-differential-testing-a-new-architecture-and-implementation-based-on-monte-carlo-methods" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/352-efficient-automated-differential-testing-a-new-architecture-and-implementation-based-on-monte-carlo-methods" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/353-breaking-the-limits-of-state-compression-the-application-of-ternary-and-minimal-representation</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/353-breaking-the-limits-of-state-compression-the-application-of-ternary-and-minimal-representation" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/353-breaking-the-limits-of-state-compression-the-application-of-ternary-and-minimal-representation" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/353-breaking-the-limits-of-state-compression-the-application-of-ternary-and-minimal-representation</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/353-breaking-the-limits-of-state-compression-the-application-of-ternary-and-minimal-representation" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/353-breaking-the-limits-of-state-compression-the-application-of-ternary-and-minimal-representation" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/354-maximizing-c-io-performance-with-advanced-fast-read-and-write-techniques</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/354-maximizing-c-io-performance-with-advanced-fast-read-and-write-techniques" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/354-maximizing-c-io-performance-with-advanced-fast-read-and-write-techniques" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/354-maximizing-c-io-performance-with-advanced-fast-read-and-write-techniques</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/354-maximizing-c-io-performance-with-advanced-fast-read-and-write-techniques" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/354-maximizing-c-io-performance-with-advanced-fast-read-and-write-techniques" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/355-optimizing-debugging-best-practices-for-conditional-compilation-and-macro-isolation-in-c</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/355-optimizing-debugging-best-practices-for-conditional-compilation-and-macro-isolation-in-c" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/355-optimizing-debugging-best-practices-for-conditional-compilation-and-macro-isolation-in-c" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/355-optimizing-debugging-best-practices-for-conditional-compilation-and-macro-isolation-in-c</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/355-optimizing-debugging-best-practices-for-conditional-compilation-and-macro-isolation-in-c" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/355-optimizing-debugging-best-practices-for-conditional-compilation-and-macro-isolation-in-c" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/356-efficient-solution-to-dynamic-range-k-th-largest-problem-combining-fenwick-tree-and-segment-tree</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/356-efficient-solution-to-dynamic-range-k-th-largest-problem-combining-fenwick-tree-and-segment-tree" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/356-efficient-solution-to-dynamic-range-k-th-largest-problem-combining-fenwick-tree-and-segment-tree" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/356-efficient-solution-to-dynamic-range-k-th-largest-problem-combining-fenwick-tree-and-segment-tree</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/356-efficient-solution-to-dynamic-range-k-th-largest-problem-combining-fenwick-tree-and-segment-tree" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/356-efficient-solution-to-dynamic-range-k-th-largest-problem-combining-fenwick-tree-and-segment-tree" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/358-heavy-path-decomposition-efficient-algorithm-and-implementation-for-optimizing-tree-structures</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/358-heavy-path-decomposition-efficient-algorithm-and-implementation-for-optimizing-tree-structures" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/358-heavy-path-decomposition-efficient-algorithm-and-implementation-for-optimizing-tree-structures" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/358-heavy-path-decomposition-efficient-algorithm-and-implementation-for-optimizing-tree-structures</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/358-heavy-path-decomposition-efficient-algorithm-and-implementation-for-optimizing-tree-structures" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/358-heavy-path-decomposition-efficient-algorithm-and-implementation-for-optimizing-tree-structures" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/359-efficient-algorithms-for-finding-lowest-common-ancestors-in-trees</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/359-efficient-algorithms-for-finding-lowest-common-ancestors-in-trees" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/359-efficient-algorithms-for-finding-lowest-common-ancestors-in-trees" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/359-efficient-algorithms-for-finding-lowest-common-ancestors-in-trees</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/359-efficient-algorithms-for-finding-lowest-common-ancestors-in-trees" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/359-efficient-algorithms-for-finding-lowest-common-ancestors-in-trees" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/360-efficient-scanning-line-algorithm-for-area-and-perimeter-calculation-of-2d-rectangles</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/360-efficient-scanning-line-algorithm-for-area-and-perimeter-calculation-of-2d-rectangles" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/360-efficient-scanning-line-algorithm-for-area-and-perimeter-calculation-of-2d-rectangles" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/360-efficient-scanning-line-algorithm-for-area-and-perimeter-calculation-of-2d-rectangles</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/360-efficient-scanning-line-algorithm-for-area-and-perimeter-calculation-of-2d-rectangles" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/360-efficient-scanning-line-algorithm-for-area-and-perimeter-calculation-of-2d-rectangles" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/361-in-depth-analysis-of-2-sat-problem-efficient-solutions-based-on-topological-sorting-and-strongly-connected-components</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/361-in-depth-analysis-of-2-sat-problem-efficient-solutions-based-on-topological-sorting-and-strongly-connected-components" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/361-in-depth-analysis-of-2-sat-problem-efficient-solutions-based-on-topological-sorting-and-strongly-connected-components" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/361-in-depth-analysis-of-2-sat-problem-efficient-solutions-based-on-topological-sorting-and-strongly-connected-components</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/361-in-depth-analysis-of-2-sat-problem-efficient-solutions-based-on-topological-sorting-and-strongly-connected-components" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/361-in-depth-analysis-of-2-sat-problem-efficient-solutions-based-on-topological-sorting-and-strongly-connected-components" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/362-high-dimensional-mapping-techniques-in-tree-dynamic-programming</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/362-high-dimensional-mapping-techniques-in-tree-dynamic-programming" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/362-high-dimensional-mapping-techniques-in-tree-dynamic-programming" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/362-high-dimensional-mapping-techniques-in-tree-dynamic-programming</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/362-high-dimensional-mapping-techniques-in-tree-dynamic-programming" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/362-high-dimensional-mapping-techniques-in-tree-dynamic-programming" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/363-in-depth-analysis-of-minimum-spanning-tree-algorithms-comparison-and-implementation-of-kruskal-and-prim</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/363-in-depth-analysis-of-minimum-spanning-tree-algorithms-comparison-and-implementation-of-kruskal-and-prim" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/363-in-depth-analysis-of-minimum-spanning-tree-algorithms-comparison-and-implementation-of-kruskal-and-prim" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/363-in-depth-analysis-of-minimum-spanning-tree-algorithms-comparison-and-implementation-of-kruskal-and-prim</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/363-in-depth-analysis-of-minimum-spanning-tree-algorithms-comparison-and-implementation-of-kruskal-and-prim" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/363-in-depth-analysis-of-minimum-spanning-tree-algorithms-comparison-and-implementation-of-kruskal-and-prim" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/364-application-and-implementation-of-gaussian-elimination-in-complex-dynamic-programming</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/364-application-and-implementation-of-gaussian-elimination-in-complex-dynamic-programming" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/364-application-and-implementation-of-gaussian-elimination-in-complex-dynamic-programming" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/364-application-and-implementation-of-gaussian-elimination-in-complex-dynamic-programming</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/364-application-and-implementation-of-gaussian-elimination-in-complex-dynamic-programming" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/364-application-and-implementation-of-gaussian-elimination-in-complex-dynamic-programming" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/366-efficient-area-and-perimeter-calculation-of-rectangles-using-the-scanning-line-algorithm</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/366-efficient-area-and-perimeter-calculation-of-rectangles-using-the-scanning-line-algorithm" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/366-efficient-area-and-perimeter-calculation-of-rectangles-using-the-scanning-line-algorithm" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/366-efficient-area-and-perimeter-calculation-of-rectangles-using-the-scanning-line-algorithm</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/366-efficient-area-and-perimeter-calculation-of-rectangles-using-the-scanning-line-algorithm" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/366-efficient-area-and-perimeter-calculation-of-rectangles-using-the-scanning-line-algorithm" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/367-deep-dive-into-expectation-dynamic-programming-algorithm-principles-and-implementation</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/367-deep-dive-into-expectation-dynamic-programming-algorithm-principles-and-implementation" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/367-deep-dive-into-expectation-dynamic-programming-algorithm-principles-and-implementation" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/367-deep-dive-into-expectation-dynamic-programming-algorithm-principles-and-implementation</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/367-deep-dive-into-expectation-dynamic-programming-algorithm-principles-and-implementation" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/367-deep-dive-into-expectation-dynamic-programming-algorithm-principles-and-implementation" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/368-efficient-prefix-sum-algorithm-and-its-application-in-2d-matrices</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/368-efficient-prefix-sum-algorithm-and-its-application-in-2d-matrices" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/368-efficient-prefix-sum-algorithm-and-its-application-in-2d-matrices" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/368-efficient-prefix-sum-algorithm-and-its-application-in-2d-matrices</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/368-efficient-prefix-sum-algorithm-and-its-application-in-2d-matrices" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/368-efficient-prefix-sum-algorithm-and-its-application-in-2d-matrices" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/369-deep-dive-into-modular-arithmetic-and-extended-euclidean-algorithm</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/369-deep-dive-into-modular-arithmetic-and-extended-euclidean-algorithm" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/369-deep-dive-into-modular-arithmetic-and-extended-euclidean-algorithm" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/369-deep-dive-into-modular-arithmetic-and-extended-euclidean-algorithm</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/369-deep-dive-into-modular-arithmetic-and-extended-euclidean-algorithm" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/369-deep-dive-into-modular-arithmetic-and-extended-euclidean-algorithm" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/370-efficient-algorithms-for-generating-random-trees-and-graphs</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/370-efficient-algorithms-for-generating-random-trees-and-graphs" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/370-efficient-algorithms-for-generating-random-trees-and-graphs" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/370-efficient-algorithms-for-generating-random-trees-and-graphs</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/370-efficient-algorithms-for-generating-random-trees-and-graphs" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/370-efficient-algorithms-for-generating-random-trees-and-graphs" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/371-wythoffs-game-singular-positions-and-algorithm-analysis</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/371-wythoffs-game-singular-positions-and-algorithm-analysis" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/371-wythoffs-game-singular-positions-and-algorithm-analysis" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/371-wythoffs-game-singular-positions-and-algorithm-analysis</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/371-wythoffs-game-singular-positions-and-algorithm-analysis" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/371-wythoffs-game-singular-positions-and-algorithm-analysis" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/372-discretization-techniques-core-algorithms-and-applications-for-efficient-sparse-data-handling</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/372-discretization-techniques-core-algorithms-and-applications-for-efficient-sparse-data-handling" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/372-discretization-techniques-core-algorithms-and-applications-for-efficient-sparse-data-handling" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/372-discretization-techniques-core-algorithms-and-applications-for-efficient-sparse-data-handling</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/372-discretization-techniques-core-algorithms-and-applications-for-efficient-sparse-data-handling" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/372-discretization-techniques-core-algorithms-and-applications-for-efficient-sparse-data-handling" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/374-aho-corasick-automaton-core-principles-and-implementation-for-efficient-multi-pattern-matching</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/374-aho-corasick-automaton-core-principles-and-implementation-for-efficient-multi-pattern-matching" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/374-aho-corasick-automaton-core-principles-and-implementation-for-efficient-multi-pattern-matching" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/374-aho-corasick-automaton-core-principles-and-implementation-for-efficient-multi-pattern-matching</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/374-aho-corasick-automaton-core-principles-and-implementation-for-efficient-multi-pattern-matching" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/374-aho-corasick-automaton-core-principles-and-implementation-for-efficient-multi-pattern-matching" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/375-topological-sorting-and-dynamic-programming-for-basal-trees-efficient-maximum-independent-set-solution</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/375-topological-sorting-and-dynamic-programming-for-basal-trees-efficient-maximum-independent-set-solution" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/375-topological-sorting-and-dynamic-programming-for-basal-trees-efficient-maximum-independent-set-solution" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/375-topological-sorting-and-dynamic-programming-for-basal-trees-efficient-maximum-independent-set-solution</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/375-topological-sorting-and-dynamic-programming-for-basal-trees-efficient-maximum-independent-set-solution" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/375-topological-sorting-and-dynamic-programming-for-basal-trees-efficient-maximum-independent-set-solution" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/376-in-depth-analysis-of-binary-indexed-tree-core-logic-and-efficient-algorithms</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/376-in-depth-analysis-of-binary-indexed-tree-core-logic-and-efficient-algorithms" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/376-in-depth-analysis-of-binary-indexed-tree-core-logic-and-efficient-algorithms" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/376-in-depth-analysis-of-binary-indexed-tree-core-logic-and-efficient-algorithms</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/376-in-depth-analysis-of-binary-indexed-tree-core-logic-and-efficient-algorithms" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/376-in-depth-analysis-of-binary-indexed-tree-core-logic-and-efficient-algorithms" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/377-in-depth-analysis-of-topological-sorting-and-critical-path-algorithms</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/377-in-depth-analysis-of-topological-sorting-and-critical-path-algorithms" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/377-in-depth-analysis-of-topological-sorting-and-critical-path-algorithms" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/377-in-depth-analysis-of-topological-sorting-and-critical-path-algorithms</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/377-in-depth-analysis-of-topological-sorting-and-critical-path-algorithms" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/377-in-depth-analysis-of-topological-sorting-and-critical-path-algorithms" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/378-monotonic-stack-efficient-algorithm-for-finding-next-greater-element</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/378-monotonic-stack-efficient-algorithm-for-finding-next-greater-element" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/378-monotonic-stack-efficient-algorithm-for-finding-next-greater-element" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/378-monotonic-stack-efficient-algorithm-for-finding-next-greater-element</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/378-monotonic-stack-efficient-algorithm-for-finding-next-greater-element" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/378-monotonic-stack-efficient-algorithm-for-finding-next-greater-element" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/379-comprehensive-analysis-of-all-pairs-shortest-path-algorithms-and-bitset-state-compression-optimization</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/379-comprehensive-analysis-of-all-pairs-shortest-path-algorithms-and-bitset-state-compression-optimization" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/379-comprehensive-analysis-of-all-pairs-shortest-path-algorithms-and-bitset-state-compression-optimization" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/379-comprehensive-analysis-of-all-pairs-shortest-path-algorithms-and-bitset-state-compression-optimization</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/379-comprehensive-analysis-of-all-pairs-shortest-path-algorithms-and-bitset-state-compression-optimization" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/379-comprehensive-analysis-of-all-pairs-shortest-path-algorithms-and-bitset-state-compression-optimization" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/380-efficient-trie-tree-and-xor-maximum-path-algorithm-analysis</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/380-efficient-trie-tree-and-xor-maximum-path-algorithm-analysis" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/380-efficient-trie-tree-and-xor-maximum-path-algorithm-analysis" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/380-efficient-trie-tree-and-xor-maximum-path-algorithm-analysis</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/380-efficient-trie-tree-and-xor-maximum-path-algorithm-analysis" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/380-efficient-trie-tree-and-xor-maximum-path-algorithm-analysis" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/382-deep-dive-into-dynamic-programming-and-directed-acyclic-graphs-algorithm-design-driven-by-topological-sequences</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/382-deep-dive-into-dynamic-programming-and-directed-acyclic-graphs-algorithm-design-driven-by-topological-sequences" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/382-deep-dive-into-dynamic-programming-and-directed-acyclic-graphs-algorithm-design-driven-by-topological-sequences" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/382-deep-dive-into-dynamic-programming-and-directed-acyclic-graphs-algorithm-design-driven-by-topological-sequences</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/382-deep-dive-into-dynamic-programming-and-directed-acyclic-graphs-algorithm-design-driven-by-topological-sequences" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/382-deep-dive-into-dynamic-programming-and-directed-acyclic-graphs-algorithm-design-driven-by-topological-sequences" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/383-efficient-principles-and-applications-of-monotonic-stack-and-queue</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/383-efficient-principles-and-applications-of-monotonic-stack-and-queue" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/383-efficient-principles-and-applications-of-monotonic-stack-and-queue" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/383-efficient-principles-and-applications-of-monotonic-stack-and-queue</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/383-efficient-principles-and-applications-of-monotonic-stack-and-queue" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/383-efficient-principles-and-applications-of-monotonic-stack-and-queue" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/384-in-depth-analysis-of-the-binomial-theorem-and-high-precision-computation-of-pascals-triangle</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/384-in-depth-analysis-of-the-binomial-theorem-and-high-precision-computation-of-pascals-triangle" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/384-in-depth-analysis-of-the-binomial-theorem-and-high-precision-computation-of-pascals-triangle" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/384-in-depth-analysis-of-the-binomial-theorem-and-high-precision-computation-of-pascals-triangle</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/384-in-depth-analysis-of-the-binomial-theorem-and-high-precision-computation-of-pascals-triangle" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/384-in-depth-analysis-of-the-binomial-theorem-and-high-precision-computation-of-pascals-triangle" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/385-algebraic-maintenance-and-square-sum-update-strategies-for-lazy-segment-trees</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/385-algebraic-maintenance-and-square-sum-update-strategies-for-lazy-segment-trees" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/385-algebraic-maintenance-and-square-sum-update-strategies-for-lazy-segment-trees" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/385-algebraic-maintenance-and-square-sum-update-strategies-for-lazy-segment-trees</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/385-algebraic-maintenance-and-square-sum-update-strategies-for-lazy-segment-trees" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/385-algebraic-maintenance-and-square-sum-update-strategies-for-lazy-segment-trees" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/386-in-depth-understanding-of-c-priority-queues-and-comparator-design</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/386-in-depth-understanding-of-c-priority-queues-and-comparator-design" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/386-in-depth-understanding-of-c-priority-queues-and-comparator-design" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/386-in-depth-understanding-of-c-priority-queues-and-comparator-design</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/386-in-depth-understanding-of-c-priority-queues-and-comparator-design" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/386-in-depth-understanding-of-c-priority-queues-and-comparator-design" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/387-understanding-leading-zeros-and-edge-constraints-in-digit-dynamic-programming</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/387-understanding-leading-zeros-and-edge-constraints-in-digit-dynamic-programming" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/387-understanding-leading-zeros-and-edge-constraints-in-digit-dynamic-programming" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/387-understanding-leading-zeros-and-edge-constraints-in-digit-dynamic-programming</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/387-understanding-leading-zeros-and-edge-constraints-in-digit-dynamic-programming" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/387-understanding-leading-zeros-and-edge-constraints-in-digit-dynamic-programming" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/388-efficient-calculation-of-multiplicative-functions-using-linear-sieve-algorithm</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/388-efficient-calculation-of-multiplicative-functions-using-linear-sieve-algorithm" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/388-efficient-calculation-of-multiplicative-functions-using-linear-sieve-algorithm" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/388-efficient-calculation-of-multiplicative-functions-using-linear-sieve-algorithm</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/388-efficient-calculation-of-multiplicative-functions-using-linear-sieve-algorithm" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/388-efficient-calculation-of-multiplicative-functions-using-linear-sieve-algorithm" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/390-in-depth-analysis-of-sg-function-and-mex-operations-in-combinatorial-game-theory</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/390-in-depth-analysis-of-sg-function-and-mex-operations-in-combinatorial-game-theory" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/390-in-depth-analysis-of-sg-function-and-mex-operations-in-combinatorial-game-theory" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/390-in-depth-analysis-of-sg-function-and-mex-operations-in-combinatorial-game-theory</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/390-in-depth-analysis-of-sg-function-and-mex-operations-in-combinatorial-game-theory" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/390-in-depth-analysis-of-sg-function-and-mex-operations-in-combinatorial-game-theory" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/391-in-depth-understanding-of-single-source-shortest-path-algorithms-a-comprehensive-comparison-of-dijkstra-and-spfa</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/391-in-depth-understanding-of-single-source-shortest-path-algorithms-a-comprehensive-comparison-of-dijkstra-and-spfa" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/391-in-depth-understanding-of-single-source-shortest-path-algorithms-a-comprehensive-comparison-of-dijkstra-and-spfa" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/391-in-depth-understanding-of-single-source-shortest-path-algorithms-a-comprehensive-comparison-of-dijkstra-and-spfa</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/391-in-depth-understanding-of-single-source-shortest-path-algorithms-a-comprehensive-comparison-of-dijkstra-and-spfa" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/391-in-depth-understanding-of-single-source-shortest-path-algorithms-a-comprehensive-comparison-of-dijkstra-and-spfa" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/392-efficient-path-operations-and-subtree-maintenance-using-heavy-chain-decomposition-and-segment-trees</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/392-efficient-path-operations-and-subtree-maintenance-using-heavy-chain-decomposition-and-segment-trees" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/392-efficient-path-operations-and-subtree-maintenance-using-heavy-chain-decomposition-and-segment-trees" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/392-efficient-path-operations-and-subtree-maintenance-using-heavy-chain-decomposition-and-segment-trees</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/392-efficient-path-operations-and-subtree-maintenance-using-heavy-chain-decomposition-and-segment-trees" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/392-efficient-path-operations-and-subtree-maintenance-using-heavy-chain-decomposition-and-segment-trees" />
        <lastmod>2026-05-27T09:17:36+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/294-understanding-cpu-cache-mechanisms-and-c-array-access-optimization</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/294-understanding-cpu-cache-mechanisms-and-c-array-access-optimization" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/294-understanding-cpu-cache-mechanisms-and-c-array-access-optimization" />
        <lastmod>2026-05-26T02:45:49+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/294-understanding-cpu-cache-mechanisms-and-c-array-access-optimization</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/294-understanding-cpu-cache-mechanisms-and-c-array-access-optimization" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/294-understanding-cpu-cache-mechanisms-and-c-array-access-optimization" />
        <lastmod>2026-05-26T02:45:49+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/295-the-perfect-combination-of-high-dimensional-string-pattern-matching-and-digit-dynamic-programming</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/295-the-perfect-combination-of-high-dimensional-string-pattern-matching-and-digit-dynamic-programming" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/295-the-perfect-combination-of-high-dimensional-string-pattern-matching-and-digit-dynamic-programming" />
        <lastmod>2026-05-26T02:45:49+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/295-the-perfect-combination-of-high-dimensional-string-pattern-matching-and-digit-dynamic-programming</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/295-the-perfect-combination-of-high-dimensional-string-pattern-matching-and-digit-dynamic-programming" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/295-the-perfect-combination-of-high-dimensional-string-pattern-matching-and-digit-dynamic-programming" />
        <lastmod>2026-05-26T02:45:49+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/296-constant-optimization-and-memory-management-strategies-in-efficient-algorithms</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/296-constant-optimization-and-memory-management-strategies-in-efficient-algorithms" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/296-constant-optimization-and-memory-management-strategies-in-efficient-algorithms" />
        <lastmod>2026-05-26T02:45:49+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/296-constant-optimization-and-memory-management-strategies-in-efficient-algorithms</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/296-constant-optimization-and-memory-management-strategies-in-efficient-algorithms" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/296-constant-optimization-and-memory-management-strategies-in-efficient-algorithms" />
        <lastmod>2026-05-26T02:45:49+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/article/297-optimizing-random-walk-problems-using-the-linearity-of-expectation</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/297-optimizing-random-walk-problems-using-the-linearity-of-expectation" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/297-optimizing-random-walk-problems-using-the-linearity-of-expectation" />
        <lastmod>2026-05-26T02:45:49+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
    <url>
        <loc>https://nefut.com/zh/article/297-optimizing-random-walk-problems-using-the-linearity-of-expectation</loc>
        <xhtml:link rel="alternate" hreflang="en" href="https://nefut.com/article/297-optimizing-random-walk-problems-using-the-linearity-of-expectation" />
        <xhtml:link rel="alternate" hreflang="zh" href="https://nefut.com/zh/article/297-optimizing-random-walk-problems-using-the-linearity-of-expectation" />
        <lastmod>2026-05-26T02:45:49+00:00</lastmod>
        <changefreq>weekly</changefreq>
        <priority>0.8</priority>
    </url>
</urlset>