alex/likemath.ru
1
0
Fork 0
mirror of https://github.com/AlekseyLobanov/AlekseyLobanov.github.io.git synced 2026-01-11 20:52:01 +03:00
Code Issues Projects Releases Wiki Activity
Files
079c53cc2a3d19520049e218a88b78eb8f586095
likemath.ru/feeds/project-euler.atom.xml

2 lines
1.2 KiB
XML
Raw Blame History

This file contains invisible Unicode characters
This file contains invisible Unicode characters that are indistinguishable to humans but may be processed differently by a computer. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.
This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.
<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom"><title>Ещё один матблог</title><link href="http://likemath.ru/" rel="alternate"></link><link href="http://likemath.ru/feeds/project-euler.atom.xml" rel="self"></link><id>http://likemath.ru/</id><updated>2015-07-17T17:40:00+03:00</updated><entry><title>Моё решение задачи 60</title><link href="http://likemath.ru/posts/moio-reshenie-zadachi-60/" rel="alternate"></link><updated>2015-07-17T17:40:00+03:00</updated><author><name>Алексей Лобанов</name></author><id>tag:likemath.ru,2015-07-17:posts/moio-reshenie-zadachi-60/</id><summary type="html">&lt;p&gt;Краткое условие: необходимо найти множество из пяти простых чисел с минимальной суммой такое, что после &amp;#8220;склеивания&amp;#8221; в любом порядке любых двух чисел из него тоже будет простое&amp;nbsp;число.&lt;/p&gt;</summary><category term="Project Euler"></category><category term="c++"></category><category term="BGL"></category></entry></feed>
Reference in New Issue View Git Blame Copy Permalink