@kii.no.kurashi: すべてセリアで整うよ🪴🤍 ﹏﹏﹏﹏﹏﹏﹏﹏﹏﹏ ずっと”ぶち込み収納”してました… 使いかけの食品も、とりあえずポイ!ポイ!(笑) だから使いたい時は毎回、 冷凍庫を掘り起こして探すスタイル😂 「あれどこ!?」って探す時間もムダだし、 同じもの買っちゃうことも🥹💦 でもセリアだけで 立てる収納に変えたらこんなに整った✨ 気になるアイテムがあったら 保存してセリアで探してみてね〜🌷 わからないことあれば、 気軽DMで聞いてくださいね🫶 🛒アイテム詳細🛒 ①使いかけ冷凍食品の収納 └ コンテナBOX・Lサイズ /110円(税込) └袋止めクリップ3本入り・18cm ② ぐにゃっとするお肉の収納 └立てて収納 大 ③ゴロゴロした食材の収納(エビ・フライドポテト) └ 立てて置ける保存容器(大1.2ℓ) ④冷凍フルーツ🫐やアイスの収納🍦 └ ロックパック スリムM(1.2ℓ) ⑤薬味ネギ&ピザ用チーズ └フタ付角型容器(ステンレス)深さ3.5cm ﹏﹏﹏﹏﹏﹏﹏﹏﹏﹏ ここまで読んでくれてありがとうございます🫶💕 フォロー🤝、いいね🫶、コメント💌とても嬉しいです🌈 #セリア #100均収納 #冷凍庫収納 #冷凍庫整理 #収納アイデア

きい⌇生活感を整える収納アイデア
きい⌇生活感を整える収納アイデア
Open In TikTok:
Region: JP
Saturday 25 July 2026 05:34:54 GMT
519541
20579
150
751

Music

Download

Comments

s.haya8
s.hay :
アイテムを 分かりやすく 記載して下さってるので セリアで探しやすいです🍀*゜ とても助かります✨ 参考にさせて頂きます🥰
2026-07-25 15:07:02
15
mipo0417
Mipo :
容器洗うの面倒いのよ
2026-07-25 11:46:25
43
kazumi4649
minami :
ステンレス容器は、どこで買えますか? まさか、セリアじゃないですよね?
2026-07-25 23:24:32
2
piyof5
piyof5 :
わあ~❇ お片付けが大のニガテな私からみたらまるで魔法みたいです~(o^_^o)❇ 100均大好きで、ガーデニング用品や手芸用品、インテリア雑貨売り場にはよく行くんだけど、収納用品は商品を見てもこんなに素晴らしい使い方が私には浮かばない…(T_T)💧 凄いなあ~💕 ひたすら尊敬しちゃいます(^^)v❇
2026-08-02 00:43:00
1
user4437425309598
みかんのしっぽ🍊 :
この収納いいなぁと思い買いに行くけど100均のお店に入った途端買うもの忘れるし、買えてもサイズが合わなかったり🤣
2026-08-04 09:46:44
5
kapppqc
salt :
ぱっと見きれいなんだけど ケースが多い分庫内が狭くなるのがなぁ…
2026-07-29 07:04:51
25
or774315
あちち🫠🖤 :
すごいです、羨ましいです🥺自分でこんなに綺麗にしても家族が適当に置くから結局ゴチャゴチャになっちゃう😭
2026-07-30 00:31:03
1
user8373277494456
ともみ :
コンテナボックスとクリップのやつ、真似しよーっと😋
2026-07-31 06:21:15
1
userww17emgvh6
∞りえこ🐾 :
すごぉ😳😳😳めっちゃ参考になります!!真似させてもらいまーす❣️
2026-07-25 09:09:03
8
93ku_chan93
くう🐶💉🧡 :
うち、おんなじ冷蔵庫使ってるのに こんなにキレーに収納出来るのか マネします🥺💕
2026-07-31 05:35:13
1
user6756637993569
コブタ :
めちゃくちゃ綺麗な冷凍室ですね😳
2026-07-27 07:22:59
1
misaz049
らいらい :
この容器とこの容器と‥ サイズ入るか?となるとめんどくさくなって帰ってくるのを何回繰り返したか‥
2026-07-27 02:37:35
5
kh552555tl9
こと :
天才だ、、
2026-07-29 04:56:25
2
ocona5
ocona5 :
冷凍庫の中ぐちゃぐちゃなので、
2026-07-27 23:50:26
1
user42782063209608
良子 :
一度同じように綺麗にしてみたけど、結局買い物直後に上にボンボン置いてって一瞬で元に戻っちゃった😂
2026-07-28 06:33:45
32
mmmarin84
まりん :
んー。決まった物しか入らなくなるね。残り少なくなっても場所を取ってるからスペースがない。
2026-08-02 01:39:40
1
user8450510377046
MR :
素晴らしい👍賢いね😊
2026-07-28 00:34:35
1
user6513565999515
ゆぅ :
コンテナBOX今日買いに行こ〜
2026-07-26 21:06:58
1
ocona5
ocona5 :
やってみようと思いました!😁
2026-07-27 23:50:53
1
jajamaru905
ぼーるちゃん :
動画見て満足しちゃうwww
2026-07-30 04:01:05
1
user2048469019598
ちぬえ :
美しい〜👏🏻👏🏻👏🏻
2026-07-26 00:09:22
2
dyrpjcvpmhsw
みーちこ :
早すぎて目が追いつかない😂
2026-07-26 07:21:32
2
kiki815430
kiki81543 :
素晴らしい😳冷蔵庫の中ぐちゃぐちゃで困ってた😆頑張って真似しよっ🥰
2026-07-26 10:30:18
2
kurumi8269
みぃ :
ネッククーラーは中身が偏るので立てておかないほうがいいと聞きました
2026-07-28 15:36:33
1
user6621100738155
vicky :
ご紹介通り購入すれば良いので、とても簡潔にまとめてくださり助かります!
2026-07-28 12:00:47
1
To see more videos from user @kii.no.kurashi, please go to the Tikwm homepage.

Other Videos

Graham's number is an immense number that arose as an upper bound on the answer of a problem in the mathematical field of Ramsey theory. It is much larger than many other large numbers introduced as effective bounds in mathematics, such as Skewes's bound, which in turn is much larger than a googolplex. Graham's number is so large that the observable universe is far too small to contain its ordinary digital representation, assuming that each digit occupies one Planck volume. But even the number of digits in this digital representation of Graham's number would itself be a number so large that its digital representation cannot be represented in the observable universe. Nor even can the number of digits of that number—and so forth, for a number of times far exceeding the total number of Planck volumes in the observable universe. Thus, Graham's number cannot be expressed even by physical universe-scale power towers of the form  a b c ⋅ ⋅ ⋅ {\displaystyle a^{b^{c^{\cdot ^{\cdot ^{\cdot }}}}}}, even though Graham's number is indeed a power of three. However, Graham's number can be explicitly given by computable recursive formulas using Knuth's up-arrow notation or equivalent, as was done by Ronald Graham, the number's namesake. As there is a recursive formula to define it, it is much smaller than typical busy beaver numbers, the sequence of which grows faster than any computable sequence. Though too large to ever be computed in full, the sequence of digits of Graham's number can be computed explicitly via simple algorithms; the last 10 digits of Graham's number are ...2464195387.[1] Using Knuth's up-arrow notation, Graham's number is  g 64 {\displaystyle g_{64}},[2] where g n = { 3 ↑↑↑↑ 3 , if  n = 1  and 3 ↑ g n − 1 3 , if  n ≥ 2. {\displaystyle g_{n}={\begin{cases}3\uparrow \uparrow \uparrow \uparrow 3,&{\text{if }}n=1{\text{ and}}\\3\uparrow ^{g_{n-1}}3,&{\text{if }}n\geq 2.\end{cases}}} Graham's number was used by Graham in conversations with popular science writer Martin Gardner as a simplified explanation of the upper bounds of the problem he was working on. In 1977, Gardner described the number in Scientific American, introducing it to the general public. At the time of its introduction, it was the largest specific positive integer ever to have been used in a published mathematical proof. The number was described in the 1980 Guinness Book of World Records, adding to its popular interest. Other specific integers (such as TREE(3)) known to be far larger than Graham's number have since appeared in many serious mathematical proofs, for example in connection with Harvey Friedman's various finite forms of Kruskal's theorem. Additionally, smaller upper bounds on the Ramsey theory problem from which Graham's number was derived have since been proven to be valid.#tcc #tcd #kurdistan #fyp #iqmaxx
Graham's number is an immense number that arose as an upper bound on the answer of a problem in the mathematical field of Ramsey theory. It is much larger than many other large numbers introduced as effective bounds in mathematics, such as Skewes's bound, which in turn is much larger than a googolplex. Graham's number is so large that the observable universe is far too small to contain its ordinary digital representation, assuming that each digit occupies one Planck volume. But even the number of digits in this digital representation of Graham's number would itself be a number so large that its digital representation cannot be represented in the observable universe. Nor even can the number of digits of that number—and so forth, for a number of times far exceeding the total number of Planck volumes in the observable universe. Thus, Graham's number cannot be expressed even by physical universe-scale power towers of the form a b c ⋅ ⋅ ⋅ {\displaystyle a^{b^{c^{\cdot ^{\cdot ^{\cdot }}}}}}, even though Graham's number is indeed a power of three. However, Graham's number can be explicitly given by computable recursive formulas using Knuth's up-arrow notation or equivalent, as was done by Ronald Graham, the number's namesake. As there is a recursive formula to define it, it is much smaller than typical busy beaver numbers, the sequence of which grows faster than any computable sequence. Though too large to ever be computed in full, the sequence of digits of Graham's number can be computed explicitly via simple algorithms; the last 10 digits of Graham's number are ...2464195387.[1] Using Knuth's up-arrow notation, Graham's number is g 64 {\displaystyle g_{64}},[2] where g n = { 3 ↑↑↑↑ 3 , if n = 1 and 3 ↑ g n − 1 3 , if n ≥ 2. {\displaystyle g_{n}={\begin{cases}3\uparrow \uparrow \uparrow \uparrow 3,&{\text{if }}n=1{\text{ and}}\\3\uparrow ^{g_{n-1}}3,&{\text{if }}n\geq 2.\end{cases}}} Graham's number was used by Graham in conversations with popular science writer Martin Gardner as a simplified explanation of the upper bounds of the problem he was working on. In 1977, Gardner described the number in Scientific American, introducing it to the general public. At the time of its introduction, it was the largest specific positive integer ever to have been used in a published mathematical proof. The number was described in the 1980 Guinness Book of World Records, adding to its popular interest. Other specific integers (such as TREE(3)) known to be far larger than Graham's number have since appeared in many serious mathematical proofs, for example in connection with Harvey Friedman's various finite forms of Kruskal's theorem. Additionally, smaller upper bounds on the Ramsey theory problem from which Graham's number was derived have since been proven to be valid.#tcc #tcd #kurdistan #fyp #iqmaxx

About