From 4c719e2c6e8e251a5c42d68a421192ee8f1fa626 Mon Sep 17 00:00:00 2001 From: github-actions <41898282+github-actions[bot]@users.noreply.github.com> Date: Mon, 26 Feb 2024 20:10:03 +0000 Subject: [PATCH] [U] Update channel content --- exports/hykilp/atom.xml | 2 +- exports/hykilp/index.html | 2 +- exports/hykilp/posts.json | 2 +- exports/hykilp/rss.xml | 2 +- 4 files changed, 4 insertions(+), 4 deletions(-) diff --git a/exports/hykilp/atom.xml b/exports/hykilp/atom.xml index e19c61e38..ba11ab1d7 100644 --- a/exports/hykilp/atom.xml +++ b/exports/hykilp/atom.xml @@ -2,7 +2,7 @@ https://aza.moe/life 小桂桂的回忆录 📒 - 2024-02-26T18:07:24.085363+00:00 + 2024-02-26T20:10:00.647539+00:00 python-feedgen https://aza.moe/meru_256px.png diff --git a/exports/hykilp/index.html b/exports/hykilp/index.html index 0d0e2b644..aa11c1d47 100644 --- a/exports/hykilp/index.html +++ b/exports/hykilp/index.html @@ -27,7 +27,7 @@ diff --git a/exports/hykilp/posts.json b/exports/hykilp/posts.json index c4579c99c..8d39b9838 100644 --- a/exports/hykilp/posts.json +++ b/exports/hykilp/posts.json @@ -46262,7 +46262,7 @@ "id": 3402, "date": "2024-02-25T07:25:21", "text": "哈哈哈哈哈我真是天才\n\n算法课作业里有一道附加题是魔改版的背包问题,给你了一个 W=3500000 但是总价值 V 特别低的数据集让你算最优解。而且交作业只需要交运行结果不需要交代码(因为每个人的数据集都是用不同种子随机生成的所以每个人的运行结果都不一样\n\n课上教了 O(nW) 的动态规划算法实现,这道题是想让我们魔改让它变成 O(nV),因为教授觉得 W 这么大这个算法一定永远都跑不完吧...\n\n好,我直接让 GPT4 给我把这个算法原封不动用 rust 重写了一遍,用 -r 加上编译时优化,把数据传进去 0.68 秒就解出来了 🌚 甚至比编译的时间还要短", - "views": 58, + "views": 59, "forwards": 1, "media_group_id": 13670767375530629, "images": [ diff --git a/exports/hykilp/rss.xml b/exports/hykilp/rss.xml index 4fc6ebeac..2e7c572ea 100644 --- a/exports/hykilp/rss.xml +++ b/exports/hykilp/rss.xml @@ -12,7 +12,7 @@ https://aza.moe/life zh-cn - Mon, 26 Feb 2024 18:07:24 +0000 + Mon, 26 Feb 2024 20:10:00 +0000 小桂桂的回忆录 📒 #3407 https://aza.moe/life?post=3407