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

Added solution of problem 146

Browse Source
This commit is contained in:
Aleksey Lobanov
2016-10-21 01:23:35 +03:00
parent bd25a94d32
commit d9e02b4380
47 changed files with 5371 additions and 61 deletions
Download Patch File Download Diff File Expand all files Collapse all files

BIN
.gitignore.gz Normal file
View File

Binary file not shown.

2
archives.html
View File

@@ -1,7 +1,7 @@
<!DOCTYPE html> <!DOCTYPE html>
<!--[if lt IE 7]> <html class="no-js lt-ie9 lt-ie8 lt-ie7"> <![endif]--><!--[if IE 7]> <html class="no-js lt-ie9 lt-ie8"> <![endif]--><!--[if IE 8]> <html class="no-js lt-ie9"> <![endif]--><!--[if gt IE 8]><!--><html class="no-js"> <head><meta charset="utf-8"><meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"><title>Блог 529</title><meta name="description" content><meta name="viewport" content="width=device-width"><link rel="stylesheet" href="./theme/css/normalize.css"><link href="http://fonts.googleapis.com/css?family=Philosopher&subset=latin,cyrillic" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Forum&subset=cyrillic" rel="stylesheet" type="text/css"><link href="//fonts.googleapis.com/css?family=Oswald" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Ubuntu+Mono" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=PT+Sans" rel="stylesheet" type="text/css"><link rel="stylesheet" href="./theme/css/font-awesome.min.css"><link rel="stylesheet" href="./theme/css/main.css"><link href="http://likemath.ru/feeds/all.atom.xml" type="application/atom+xml" rel="alternate" title="Блог 529 Atom Feed"><link href="http://likemath.ru/feeds/all.rss.xml" type="application/rss+xml" rel="alternate" title="Блог 529 RSS Feed"><script src="./theme/js/vendor/modernizr-2.6.2.min.js"></script></head><body><!--[if lt IE 7]> <!--[if lt IE 7]> <html class="no-js lt-ie9 lt-ie8 lt-ie7"> <![endif]--><!--[if IE 7]> <html class="no-js lt-ie9 lt-ie8"> <![endif]--><!--[if IE 8]> <html class="no-js lt-ie9"> <![endif]--><!--[if gt IE 8]><!--><html class="no-js"> <head><meta charset="utf-8"><meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"><title>Блог 529</title><meta name="description" content><meta name="viewport" content="width=device-width"><link rel="stylesheet" href="./theme/css/normalize.css"><link href="http://fonts.googleapis.com/css?family=Philosopher&subset=latin,cyrillic" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Forum&subset=cyrillic" rel="stylesheet" type="text/css"><link href="//fonts.googleapis.com/css?family=Oswald" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Ubuntu+Mono" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=PT+Sans" rel="stylesheet" type="text/css"><link rel="stylesheet" href="./theme/css/font-awesome.min.css"><link rel="stylesheet" href="./theme/css/main.css"><link href="http://likemath.ru/feeds/all.atom.xml" type="application/atom+xml" rel="alternate" title="Блог 529 Atom Feed"><link href="http://likemath.ru/feeds/all.rss.xml" type="application/rss+xml" rel="alternate" title="Блог 529 RSS Feed"><script src="./theme/js/vendor/modernizr-2.6.2.min.js"></script></head><body><!--[if lt IE 7]>
<p class="chromeframe">You are using an <strong>outdated</strong> browser. Please <a href="http://browsehappy.com/">upgrade your browser</a> or <a href="http://www.google.com/chromeframe/?redirect=true">activate Google Chrome Frame</a> to improve your experience.</p> <p class="chromeframe">You are using an <strong>outdated</strong> browser. Please <a href="http://browsehappy.com/">upgrade your browser</a> or <a href="http://www.google.com/chromeframe/?redirect=true">activate Google Chrome Frame</a> to improve your experience.</p>
<![endif]--><div id="wrapper"><h1>Archives for Блог 529</h1><dl><dt>Пт 22 Июль 2016</dt><dd><a href="./posts/nakhozhdenie-summy-k-ykh-stepenei/">Нахождение суммы k-ых&nbsp;степеней</a></dd><dt>Чт 17 Март 2016</dt><dd><a href="./posts/wallabag-i-realnaia-zhizn/">Wallabag и реальная&nbsp;жизнь</a></dd><dt>Вс 10 Январь 2016</dt><dd><a href="./posts/kak-ia-shakhmatnogo-bota-pisal/">Как я шахматного бота&nbsp;писал</a></dd><dt>Вс 02 Август 2015</dt><dd><a href="./posts/crossgen-v10/">CrossGen&nbsp;v1.0</a></dd><dt>Пт 17 Июль 2015</dt><dd><a href="./posts/moio-reshenie-zadachi-60/">Моё решение задачи&nbsp;60</a></dd><dt>Пт 03 Июль 2015</dt><dd><a href="./posts/eshchio-odno-vychislenie-vyrazhenii/">Ещё одно вычисление&nbsp;выражений</a></dd><dt>Пт 17 Апрель 2015</dt><dd><a href="./posts/moi-pervyi-post/">Мой первый&nbsp;пост</a></dd></dl></div><script> <![endif]--><div id="wrapper"><h1>Archives for Блог 529</h1><dl><dt>Пт 21 Октябрь 2016</dt><dd><a href="./posts/moio-reshenie-zadachi-146/">Моё решение задачи&nbsp;146</a></dd><dt>Пт 22 Июль 2016</dt><dd><a href="./posts/nakhozhdenie-summy-k-ykh-stepenei/">Нахождение суммы k-ых&nbsp;степеней</a></dd><dt>Чт 17 Март 2016</dt><dd><a href="./posts/wallabag-i-realnaia-zhizn/">Wallabag и реальная&nbsp;жизнь</a></dd><dt>Вс 10 Январь 2016</dt><dd><a href="./posts/kak-ia-shakhmatnogo-bota-pisal/">Как я шахматного бота&nbsp;писал</a></dd><dt>Вс 02 Август 2015</dt><dd><a href="./posts/crossgen-v10/">CrossGen&nbsp;v1.0</a></dd><dt>Пт 17 Июль 2015</dt><dd><a href="./posts/moio-reshenie-zadachi-60/">Моё решение задачи&nbsp;60</a></dd><dt>Пт 03 Июль 2015</dt><dd><a href="./posts/eshchio-odno-vychislenie-vyrazhenii/">Ещё одно вычисление&nbsp;выражений</a></dd><dt>Пт 17 Апрель 2015</dt><dd><a href="./posts/moi-pervyi-post/">Мой первый&nbsp;пост</a></dd></dl></div><script>
var _gaq=[['_setAccount','UA-62001537-1'],['_trackPageview']]; var _gaq=[['_setAccount','UA-62001537-1'],['_trackPageview']];
(function(d,t){var g=d.createElement(t),s=d.getElementsByTagName(t)[0]; (function(d,t){var g=d.createElement(t),s=d.getElementsByTagName(t)[0];
g.src=('https:'==location.protocol?'//ssl':'//www')+'.google-analytics.com/ga.js'; g.src=('https:'==location.protocol?'//ssl':'//www')+'.google-analytics.com/ga.js';

BIN
archives.html.gz
View File

Binary file not shown.

28
author/aleksei-lobanov.html
View File

@@ -1,7 +1,33 @@
<!DOCTYPE html> <!DOCTYPE html>
<!--[if lt IE 7]> <html class="no-js lt-ie9 lt-ie8 lt-ie7"> <![endif]--><!--[if IE 7]> <html class="no-js lt-ie9 lt-ie8"> <![endif]--><!--[if IE 8]> <html class="no-js lt-ie9"> <![endif]--><!--[if gt IE 8]><!--><html class="no-js"> <head><meta charset="utf-8"><meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"><title>Блог 529 - Алексей Лобанов</title><meta name="description" content><meta name="viewport" content="width=device-width"><link rel="stylesheet" href="../theme/css/normalize.css"><link href="http://fonts.googleapis.com/css?family=Philosopher&subset=latin,cyrillic" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Forum&subset=cyrillic" rel="stylesheet" type="text/css"><link href="//fonts.googleapis.com/css?family=Oswald" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Ubuntu+Mono" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=PT+Sans" rel="stylesheet" type="text/css"><link rel="stylesheet" href="../theme/css/font-awesome.min.css"><link rel="stylesheet" href="../theme/css/main.css"><link rel="stylesheet" href="../theme/css/blog.css"><link rel="stylesheet" href="../theme/css/github.css"><link href="http://likemath.ru/feeds/all.atom.xml" type="application/atom+xml" rel="alternate" title="Блог 529 Atom Feed"><link href="http://likemath.ru/feeds/all.rss.xml" type="application/rss+xml" rel="alternate" title="Блог 529 RSS Feed"><script src="../theme/js/vendor/modernizr-2.6.2.min.js"></script></head><body><!--[if lt IE 7]> <!--[if lt IE 7]> <html class="no-js lt-ie9 lt-ie8 lt-ie7"> <![endif]--><!--[if IE 7]> <html class="no-js lt-ie9 lt-ie8"> <![endif]--><!--[if IE 8]> <html class="no-js lt-ie9"> <![endif]--><!--[if gt IE 8]><!--><html class="no-js"> <head><meta charset="utf-8"><meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"><title>Блог 529 - Алексей Лобанов</title><meta name="description" content><meta name="viewport" content="width=device-width"><link rel="stylesheet" href="../theme/css/normalize.css"><link href="http://fonts.googleapis.com/css?family=Philosopher&subset=latin,cyrillic" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Forum&subset=cyrillic" rel="stylesheet" type="text/css"><link href="//fonts.googleapis.com/css?family=Oswald" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Ubuntu+Mono" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=PT+Sans" rel="stylesheet" type="text/css"><link rel="stylesheet" href="../theme/css/font-awesome.min.css"><link rel="stylesheet" href="../theme/css/main.css"><link rel="stylesheet" href="../theme/css/blog.css"><link rel="stylesheet" href="../theme/css/github.css"><link href="http://likemath.ru/feeds/all.atom.xml" type="application/atom+xml" rel="alternate" title="Блог 529 Atom Feed"><link href="http://likemath.ru/feeds/all.rss.xml" type="application/rss+xml" rel="alternate" title="Блог 529 RSS Feed"><script src="../theme/js/vendor/modernizr-2.6.2.min.js"></script></head><body><!--[if lt IE 7]>
<p class="chromeframe">You are using an <strong>outdated</strong> browser. Please <a href="http://browsehappy.com/">upgrade your browser</a> or <a href="http://www.google.com/chromeframe/?redirect=true">activate Google Chrome Frame</a> to improve your experience.</p> <p class="chromeframe">You are using an <strong>outdated</strong> browser. Please <a href="http://browsehappy.com/">upgrade your browser</a> or <a href="http://www.google.com/chromeframe/?redirect=true">activate Google Chrome Frame</a> to improve your experience.</p>
<![endif]--><div id="wrapper"><header id="sidebar" class="side-shadow"><hgroup id="site-header"><a id="site-title" href=".."><h2><i class="icon-coffee"></i> Блог 529</h2></a><p id="site-desc"> Project Euler и остальное </p></hgroup><nav><ul id="nav-links"><li><a href="../">Главная</a></li><li><a href="../pages/projects.html">Мои проекты</a></li><li><a href="../pages/about.html">Об авторе</a></li><li><a href="../feeds/feed.atom.xml">Atom feed</a></li></ul></nav><footer id="site-info"><p> Powered by Pelican. </p></footer></header><div id="post-container"><ol id="post-list"><li><article class="post-entry"><header class="entry-header"><time class="post-time" datetime="2016-07-22T13:35:00+03:00" pubdate> Пт 22 Июль 2016 </time><a href="../posts/nakhozhdenie-summy-k-ykh-stepenei/" rel="bookmark"><h1>Нахождение суммы k-ых&nbsp;степеней</h1></a></header><section class="post-content"><p>Как придумать формулу для суммы <span class="math">\(1^5 + 2^5 + 3^5 + \ldots + n^5\)</span> и есть ли она&nbsp;вообще?</p><script type="text/javascript">if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) { <![endif]--><div id="wrapper"><header id="sidebar" class="side-shadow"><hgroup id="site-header"><a id="site-title" href=".."><h2><i class="icon-coffee"></i> Блог 529</h2></a><p id="site-desc"> Project Euler и остальное </p></hgroup><nav><ul id="nav-links"><li><a href="../">Главная</a></li><li><a href="../pages/projects.html">Мои проекты</a></li><li><a href="../pages/about.html">Об авторе</a></li><li><a href="../feeds/feed.atom.xml">Atom feed</a></li></ul></nav><footer id="site-info"><p> Powered by Pelican. </p></footer></header><div id="post-container"><ol id="post-list"><li><article class="post-entry"><header class="entry-header"><time class="post-time" datetime="2016-10-21T17:40:00+03:00" pubdate> Пт 21 Октябрь 2016 </time><a href="../posts/moio-reshenie-zadachi-146/" rel="bookmark"><h1>Моё решение задачи&nbsp;146</h1></a></header><section class="post-content"><p>Краткое условие: необходимо найти сумму всех натуральных <span class="math">\(n\)</span>, что <span class="math">\(n^2+1\)</span>, <span class="math">\(n^2+3\)</span>, <span class="math">\(n^2+7\)</span>, <span class="math">\(n^2+9\)</span>, <span class="math">\(n^2+13\)</span>, и <span class="math">\(n^2+27\)</span> будут последовательными простыми&nbsp;числами.</p><script type="text/javascript">if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) {
var mathjaxscript = document.createElement('script');
mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#';
mathjaxscript.type = 'text/javascript';
mathjaxscript.src = '//cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML';
mathjaxscript[(window.opera ? "innerHTML" : "text")] =
"MathJax.Hub.Config({" +
" config: ['MMLorHTML.js']," +
" TeX: { extensions: ['AMSmath.js','AMSsymbols.js','noErrors.js','noUndefined.js'], equationNumbers: { autoNumber: 'AMS' } }," +
" jax: ['input/TeX','input/MathML','output/HTML-CSS']," +
" extensions: ['tex2jax.js','mml2jax.js','MathMenu.js','MathZoom.js']," +
" displayAlign: 'center'," +
" displayIndent: '0em'," +
" showMathMenu: true," +
" tex2jax: { " +
" inlineMath: [ ['\\\\(','\\\\)'] ], " +
" displayMath: [ ['$$','$$'] ]," +
" processEscapes: true," +
" preview: 'TeX'," +
" }, " +
" 'HTML-CSS': { " +
" styles: { '.MathJax_Display, .MathJax .mo, .MathJax .mi, .MathJax .mn': {color: 'black ! important'} }" +
" } " +
"}); ";
(document.body || document.getElementsByTagName('head')[0]).appendChild(mathjaxscript);
}
</script></section></article></li><hr><li><article class="post-entry"><header class="entry-header"><time class="post-time" datetime="2016-07-22T13:35:00+03:00" pubdate> Пт 22 Июль 2016 </time><a href="../posts/nakhozhdenie-summy-k-ykh-stepenei/" rel="bookmark"><h1>Нахождение суммы k-ых&nbsp;степеней</h1></a></header><section class="post-content"><p>Как придумать формулу для суммы <span class="math">\(1^5 + 2^5 + 3^5 + \ldots + n^5\)</span> и есть ли она&nbsp;вообще?</p><script type="text/javascript">if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) {
var mathjaxscript = document.createElement('script'); var mathjaxscript = document.createElement('script');
mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#'; mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#';
mathjaxscript.type = 'text/javascript'; mathjaxscript.type = 'text/javascript';

BIN
author/aleksei-lobanov.html.gz
View File

Binary file not shown.

2
authors.html
View File

@@ -1,7 +1,7 @@
<!DOCTYPE html> <!DOCTYPE html>
<!--[if lt IE 7]> <html class="no-js lt-ie9 lt-ie8 lt-ie7"> <![endif]--><!--[if IE 7]> <html class="no-js lt-ie9 lt-ie8"> <![endif]--><!--[if IE 8]> <html class="no-js lt-ie9"> <![endif]--><!--[if gt IE 8]><!--><html class="no-js"> <head><meta charset="utf-8"><meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"><title>Блог 529 - Authors</title><meta name="description" content><meta name="viewport" content="width=device-width"><link rel="stylesheet" href="./theme/css/normalize.css"><link href="http://fonts.googleapis.com/css?family=Philosopher&subset=latin,cyrillic" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Forum&subset=cyrillic" rel="stylesheet" type="text/css"><link href="//fonts.googleapis.com/css?family=Oswald" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Ubuntu+Mono" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=PT+Sans" rel="stylesheet" type="text/css"><link rel="stylesheet" href="./theme/css/font-awesome.min.css"><link rel="stylesheet" href="./theme/css/main.css"><link href="http://likemath.ru/feeds/all.atom.xml" type="application/atom+xml" rel="alternate" title="Блог 529 Atom Feed"><link href="http://likemath.ru/feeds/all.rss.xml" type="application/rss+xml" rel="alternate" title="Блог 529 RSS Feed"><script src="./theme/js/vendor/modernizr-2.6.2.min.js"></script></head><body><!--[if lt IE 7]> <!--[if lt IE 7]> <html class="no-js lt-ie9 lt-ie8 lt-ie7"> <![endif]--><!--[if IE 7]> <html class="no-js lt-ie9 lt-ie8"> <![endif]--><!--[if IE 8]> <html class="no-js lt-ie9"> <![endif]--><!--[if gt IE 8]><!--><html class="no-js"> <head><meta charset="utf-8"><meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"><title>Блог 529 - Authors</title><meta name="description" content><meta name="viewport" content="width=device-width"><link rel="stylesheet" href="./theme/css/normalize.css"><link href="http://fonts.googleapis.com/css?family=Philosopher&subset=latin,cyrillic" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Forum&subset=cyrillic" rel="stylesheet" type="text/css"><link href="//fonts.googleapis.com/css?family=Oswald" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Ubuntu+Mono" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=PT+Sans" rel="stylesheet" type="text/css"><link rel="stylesheet" href="./theme/css/font-awesome.min.css"><link rel="stylesheet" href="./theme/css/main.css"><link href="http://likemath.ru/feeds/all.atom.xml" type="application/atom+xml" rel="alternate" title="Блог 529 Atom Feed"><link href="http://likemath.ru/feeds/all.rss.xml" type="application/rss+xml" rel="alternate" title="Блог 529 RSS Feed"><script src="./theme/js/vendor/modernizr-2.6.2.min.js"></script></head><body><!--[if lt IE 7]>
<p class="chromeframe">You are using an <strong>outdated</strong> browser. Please <a href="http://browsehappy.com/">upgrade your browser</a> or <a href="http://www.google.com/chromeframe/?redirect=true">activate Google Chrome Frame</a> to improve your experience.</p> <p class="chromeframe">You are using an <strong>outdated</strong> browser. Please <a href="http://browsehappy.com/">upgrade your browser</a> or <a href="http://www.google.com/chromeframe/?redirect=true">activate Google Chrome Frame</a> to improve your experience.</p>
<![endif]--><div id="wrapper"><h1>Authors on Блог 529</h1><ul> <li><a href="./author/aleksei-lobanov.html">Алексей Лобанов</a> (7)</li></ul></div><script> <![endif]--><div id="wrapper"><h1>Authors on Блог 529</h1><ul> <li><a href="./author/aleksei-lobanov.html">Алексей Лобанов</a> (8)</li></ul></div><script>
var _gaq=[['_setAccount','UA-62001537-1'],['_trackPageview']]; var _gaq=[['_setAccount','UA-62001537-1'],['_trackPageview']];
(function(d,t){var g=d.createElement(t),s=d.getElementsByTagName(t)[0]; (function(d,t){var g=d.createElement(t),s=d.getElementsByTagName(t)[0];
g.src=('https:'==location.protocol?'//ssl':'//www')+'.google-analytics.com/ga.js'; g.src=('https:'==location.protocol?'//ssl':'//www')+'.google-analytics.com/ga.js';

BIN
authors.html.gz
View File

Binary file not shown.

28
category/project-euler.html
View File

@@ -1,7 +1,33 @@
<!DOCTYPE html> <!DOCTYPE html>
<!--[if lt IE 7]> <html class="no-js lt-ie9 lt-ie8 lt-ie7"> <![endif]--><!--[if IE 7]> <html class="no-js lt-ie9 lt-ie8"> <![endif]--><!--[if IE 8]> <html class="no-js lt-ie9"> <![endif]--><!--[if gt IE 8]><!--><html class="no-js"> <head><meta charset="utf-8"><meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"><title>Блог 529 - Project Euler</title><meta name="description" content><meta name="viewport" content="width=device-width"><link rel="stylesheet" href="../theme/css/normalize.css"><link href="http://fonts.googleapis.com/css?family=Philosopher&subset=latin,cyrillic" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Forum&subset=cyrillic" rel="stylesheet" type="text/css"><link href="//fonts.googleapis.com/css?family=Oswald" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Ubuntu+Mono" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=PT+Sans" rel="stylesheet" type="text/css"><link rel="stylesheet" href="../theme/css/font-awesome.min.css"><link rel="stylesheet" href="../theme/css/main.css"><link rel="stylesheet" href="../theme/css/blog.css"><link rel="stylesheet" href="../theme/css/github.css"><link href="http://likemath.ru/feeds/all.atom.xml" type="application/atom+xml" rel="alternate" title="Блог 529 Atom Feed"><link href="http://likemath.ru/feeds/all.rss.xml" type="application/rss+xml" rel="alternate" title="Блог 529 RSS Feed"><script src="../theme/js/vendor/modernizr-2.6.2.min.js"></script></head><body><!--[if lt IE 7]> <!--[if lt IE 7]> <html class="no-js lt-ie9 lt-ie8 lt-ie7"> <![endif]--><!--[if IE 7]> <html class="no-js lt-ie9 lt-ie8"> <![endif]--><!--[if IE 8]> <html class="no-js lt-ie9"> <![endif]--><!--[if gt IE 8]><!--><html class="no-js"> <head><meta charset="utf-8"><meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"><title>Блог 529 - Project Euler</title><meta name="description" content><meta name="viewport" content="width=device-width"><link rel="stylesheet" href="../theme/css/normalize.css"><link href="http://fonts.googleapis.com/css?family=Philosopher&subset=latin,cyrillic" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Forum&subset=cyrillic" rel="stylesheet" type="text/css"><link href="//fonts.googleapis.com/css?family=Oswald" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Ubuntu+Mono" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=PT+Sans" rel="stylesheet" type="text/css"><link rel="stylesheet" href="../theme/css/font-awesome.min.css"><link rel="stylesheet" href="../theme/css/main.css"><link rel="stylesheet" href="../theme/css/blog.css"><link rel="stylesheet" href="../theme/css/github.css"><link href="http://likemath.ru/feeds/all.atom.xml" type="application/atom+xml" rel="alternate" title="Блог 529 Atom Feed"><link href="http://likemath.ru/feeds/all.rss.xml" type="application/rss+xml" rel="alternate" title="Блог 529 RSS Feed"><script src="../theme/js/vendor/modernizr-2.6.2.min.js"></script></head><body><!--[if lt IE 7]>
<p class="chromeframe">You are using an <strong>outdated</strong> browser. Please <a href="http://browsehappy.com/">upgrade your browser</a> or <a href="http://www.google.com/chromeframe/?redirect=true">activate Google Chrome Frame</a> to improve your experience.</p> <p class="chromeframe">You are using an <strong>outdated</strong> browser. Please <a href="http://browsehappy.com/">upgrade your browser</a> or <a href="http://www.google.com/chromeframe/?redirect=true">activate Google Chrome Frame</a> to improve your experience.</p>
<![endif]--><div id="wrapper"><header id="sidebar" class="side-shadow"><hgroup id="site-header"><a id="site-title" href=".."><h2><i class="icon-coffee"></i> Блог 529</h2></a><p id="site-desc"> Project Euler и остальное </p></hgroup><nav><ul id="nav-links"><li><a href="../">Главная</a></li><li><a href="../pages/projects.html">Мои проекты</a></li><li><a href="../pages/about.html">Об авторе</a></li><li><a href="../feeds/feed.atom.xml">Atom feed</a></li></ul></nav><footer id="site-info"><p> Powered by Pelican. </p></footer></header><div id="post-container"><ol id="post-list"><li><article class="post-entry"><header class="entry-header"><time class="post-time" datetime="2015-07-17T17:40:00+03:00" pubdate> Пт 17 Июль 2015 </time><a href="../posts/moio-reshenie-zadachi-60/" rel="bookmark"><h1>Моё решение задачи&nbsp;60</h1></a></header><section class="post-content"><p>Краткое условие: необходимо найти множество из пяти простых чисел с минимальной суммой такое, что после &#8220;склеивания&#8221; в любом порядке любых двух чисел из него тоже будет простое&nbsp;число.</p></section></article></li><hr></ol><div class="paginator"> Page 1 / 1 </div></div></div><script> <![endif]--><div id="wrapper"><header id="sidebar" class="side-shadow"><hgroup id="site-header"><a id="site-title" href=".."><h2><i class="icon-coffee"></i> Блог 529</h2></a><p id="site-desc"> Project Euler и остальное </p></hgroup><nav><ul id="nav-links"><li><a href="../">Главная</a></li><li><a href="../pages/projects.html">Мои проекты</a></li><li><a href="../pages/about.html">Об авторе</a></li><li><a href="../feeds/feed.atom.xml">Atom feed</a></li></ul></nav><footer id="site-info"><p> Powered by Pelican. </p></footer></header><div id="post-container"><ol id="post-list"><li><article class="post-entry"><header class="entry-header"><time class="post-time" datetime="2016-10-21T17:40:00+03:00" pubdate> Пт 21 Октябрь 2016 </time><a href="../posts/moio-reshenie-zadachi-146/" rel="bookmark"><h1>Моё решение задачи&nbsp;146</h1></a></header><section class="post-content"><p>Краткое условие: необходимо найти сумму всех натуральных <span class="math">\(n\)</span>, что <span class="math">\(n^2+1\)</span>, <span class="math">\(n^2+3\)</span>, <span class="math">\(n^2+7\)</span>, <span class="math">\(n^2+9\)</span>, <span class="math">\(n^2+13\)</span>, и <span class="math">\(n^2+27\)</span> будут последовательными простыми&nbsp;числами.</p><script type="text/javascript">if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) {
var mathjaxscript = document.createElement('script');
mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#';
mathjaxscript.type = 'text/javascript';
mathjaxscript.src = '//cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML';
mathjaxscript[(window.opera ? "innerHTML" : "text")] =
"MathJax.Hub.Config({" +
" config: ['MMLorHTML.js']," +
" TeX: { extensions: ['AMSmath.js','AMSsymbols.js','noErrors.js','noUndefined.js'], equationNumbers: { autoNumber: 'AMS' } }," +
" jax: ['input/TeX','input/MathML','output/HTML-CSS']," +
" extensions: ['tex2jax.js','mml2jax.js','MathMenu.js','MathZoom.js']," +
" displayAlign: 'center'," +
" displayIndent: '0em'," +
" showMathMenu: true," +
" tex2jax: { " +
" inlineMath: [ ['\\\\(','\\\\)'] ], " +
" displayMath: [ ['$$','$$'] ]," +
" processEscapes: true," +
" preview: 'TeX'," +
" }, " +
" 'HTML-CSS': { " +
" styles: { '.MathJax_Display, .MathJax .mo, .MathJax .mi, .MathJax .mn': {color: 'black ! important'} }" +
" } " +
"}); ";
(document.body || document.getElementsByTagName('head')[0]).appendChild(mathjaxscript);
}
</script></section></article></li><hr><li><article class="post-entry"><header class="entry-header"><time class="post-time" datetime="2015-07-17T17:40:00+03:00" pubdate> Пт 17 Июль 2015 </time><a href="../posts/moio-reshenie-zadachi-60/" rel="bookmark"><h1>Моё решение задачи&nbsp;60</h1></a></header><section class="post-content"><p>Краткое условие: необходимо найти множество из пяти простых чисел с минимальной суммой такое, что после &#8220;склеивания&#8221; в любом порядке любых двух чисел из него тоже будет простое&nbsp;число.</p></section></article></li><hr></ol><div class="paginator"> Page 1 / 1 </div></div></div><script>
var _gaq=[['_setAccount','UA-62001537-1'],['_trackPageview']]; var _gaq=[['_setAccount','UA-62001537-1'],['_trackPageview']];
(function(d,t){var g=d.createElement(t),s=d.getElementsByTagName(t)[0]; (function(d,t){var g=d.createElement(t),s=d.getElementsByTagName(t)[0];
g.src=('https:'==location.protocol?'//ssl':'//www')+'.google-analytics.com/ga.js'; g.src=('https:'==location.protocol?'//ssl':'//www')+'.google-analytics.com/ga.js';

BIN
category/project-euler.html.gz
View File

Binary file not shown.

29
feeds/all.atom.xml
View File

@@ -1,5 +1,32 @@
<?xml version="1.0" encoding="utf-8"?> <?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom"><title>Блог 529</title><link href="http://likemath.ru/" rel="alternate"></link><link href="http://likemath.ru/feeds/all.atom.xml" rel="self"></link><id>http://likemath.ru/</id><updated>2016-07-22T13:35:00+03:00</updated><entry><title>Нахождение суммы k-ых степеней</title><link href="http://likemath.ru/posts/nakhozhdenie-summy-k-ykh-stepenei/" rel="alternate"></link><published>2016-07-22T13:35:00+03:00</published><author><name>Алексей Лобанов</name></author><id>tag:likemath.ru,2016-07-22:posts/nakhozhdenie-summy-k-ykh-stepenei/</id><summary type="html">&lt;p&gt;Как придумать формулу для суммы &lt;span class="math"&gt;\(1^5 + 2^5 + 3^5 + \ldots + n^5\)&lt;/span&gt; и есть ли она&amp;nbsp;вообще?&lt;/p&gt; <feed xmlns="http://www.w3.org/2005/Atom"><title>Блог 529</title><link href="http://likemath.ru/" rel="alternate"></link><link href="http://likemath.ru/feeds/all.atom.xml" rel="self"></link><id>http://likemath.ru/</id><updated>2016-10-21T17:40:00+03:00</updated><entry><title>Моё решение задачи 146</title><link href="http://likemath.ru/posts/moio-reshenie-zadachi-146/" rel="alternate"></link><published>2016-10-21T17:40:00+03:00</published><author><name>Алексей Лобанов</name></author><id>tag:likemath.ru,2016-10-21:posts/moio-reshenie-zadachi-146/</id><summary type="html">&lt;p&gt;Краткое условие: необходимо найти сумму всех натуральных &lt;span class="math"&gt;\(n\)&lt;/span&gt;, что &lt;span class="math"&gt;\(n^2+1\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+3\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+7\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+9\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+13\)&lt;/span&gt;, и &lt;span class="math"&gt;\(n^2+27\)&lt;/span&gt; будут последовательными простыми&amp;nbsp;числами.&lt;/p&gt;
&lt;script type="text/javascript"&gt;if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) {
var mathjaxscript = document.createElement('script');
mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#';
mathjaxscript.type = 'text/javascript';
mathjaxscript.src = '//cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML';
mathjaxscript[(window.opera ? "innerHTML" : "text")] =
"MathJax.Hub.Config({" +
" config: ['MMLorHTML.js']," +
" TeX: { extensions: ['AMSmath.js','AMSsymbols.js','noErrors.js','noUndefined.js'], equationNumbers: { autoNumber: 'AMS' } }," +
" jax: ['input/TeX','input/MathML','output/HTML-CSS']," +
" extensions: ['tex2jax.js','mml2jax.js','MathMenu.js','MathZoom.js']," +
" displayAlign: 'center'," +
" displayIndent: '0em'," +
" showMathMenu: true," +
" tex2jax: { " +
" inlineMath: [ ['\\\\(','\\\\)'] ], " +
" displayMath: [ ['$$','$$'] ]," +
" processEscapes: true," +
" preview: 'TeX'," +
" }, " +
" 'HTML-CSS': { " +
" styles: { '.MathJax_Display, .MathJax .mo, .MathJax .mi, .MathJax .mn': {color: 'black ! important'} }" +
" } " +
"}); ";
(document.body || document.getElementsByTagName('head')[0]).appendChild(mathjaxscript);
}
&lt;/script&gt;</summary><category term="Project Euler"></category><category term="c++"></category><category term="FLINT"></category></entry><entry><title>Нахождение суммы k-ых степеней</title><link href="http://likemath.ru/posts/nakhozhdenie-summy-k-ykh-stepenei/" rel="alternate"></link><published>2016-07-22T13:35:00+03:00</published><author><name>Алексей Лобанов</name></author><id>tag:likemath.ru,2016-07-22:posts/nakhozhdenie-summy-k-ykh-stepenei/</id><summary type="html">&lt;p&gt;Как придумать формулу для суммы &lt;span class="math"&gt;\(1^5 + 2^5 + 3^5 + \ldots + n^5\)&lt;/span&gt; и есть ли она&amp;nbsp;вообще?&lt;/p&gt;
&lt;script type="text/javascript"&gt;if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) { &lt;script type="text/javascript"&gt;if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) {
var mathjaxscript = document.createElement('script'); var mathjaxscript = document.createElement('script');
mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#'; mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#';

BIN
feeds/all.atom.xml.gz
View File

Binary file not shown.

29
feeds/all.rss.xml
View File

@@ -1,5 +1,32 @@
<?xml version="1.0" encoding="utf-8"?> <?xml version="1.0" encoding="utf-8"?>
<rss version="2.0"><channel><title>Блог 529</title><link>http://likemath.ru/</link><description>Project Euler и остальное</description><lastBuildDate>Fri, 22 Jul 2016 13:35:00 +0300</lastBuildDate><item><title>Нахождение суммы k-ых степеней</title><link>http://likemath.ru/posts/nakhozhdenie-summy-k-ykh-stepenei/</link><description>&lt;p&gt;Как придумать формулу для суммы &lt;span class="math"&gt;\(1^5 + 2^5 + 3^5 + \ldots + n^5\)&lt;/span&gt; и есть ли она&amp;nbsp;вообще?&lt;/p&gt; <rss version="2.0"><channel><title>Блог 529</title><link>http://likemath.ru/</link><description>Project Euler и остальное</description><lastBuildDate>Fri, 21 Oct 2016 17:40:00 +0300</lastBuildDate><item><title>Моё решение задачи 146</title><link>http://likemath.ru/posts/moio-reshenie-zadachi-146/</link><description>&lt;p&gt;Краткое условие: необходимо найти сумму всех натуральных &lt;span class="math"&gt;\(n\)&lt;/span&gt;, что &lt;span class="math"&gt;\(n^2+1\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+3\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+7\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+9\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+13\)&lt;/span&gt;, и &lt;span class="math"&gt;\(n^2+27\)&lt;/span&gt; будут последовательными простыми&amp;nbsp;числами.&lt;/p&gt;
&lt;script type="text/javascript"&gt;if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) {
var mathjaxscript = document.createElement('script');
mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#';
mathjaxscript.type = 'text/javascript';
mathjaxscript.src = '//cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML';
mathjaxscript[(window.opera ? "innerHTML" : "text")] =
"MathJax.Hub.Config({" +
" config: ['MMLorHTML.js']," +
" TeX: { extensions: ['AMSmath.js','AMSsymbols.js','noErrors.js','noUndefined.js'], equationNumbers: { autoNumber: 'AMS' } }," +
" jax: ['input/TeX','input/MathML','output/HTML-CSS']," +
" extensions: ['tex2jax.js','mml2jax.js','MathMenu.js','MathZoom.js']," +
" displayAlign: 'center'," +
" displayIndent: '0em'," +
" showMathMenu: true," +
" tex2jax: { " +
" inlineMath: [ ['\\\\(','\\\\)'] ], " +
" displayMath: [ ['$$','$$'] ]," +
" processEscapes: true," +
" preview: 'TeX'," +
" }, " +
" 'HTML-CSS': { " +
" styles: { '.MathJax_Display, .MathJax .mo, .MathJax .mi, .MathJax .mn': {color: 'black ! important'} }" +
" } " +
"}); ";
(document.body || document.getElementsByTagName('head')[0]).appendChild(mathjaxscript);
}
&lt;/script&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Алексей Лобанов</dc:creator><pubDate>Fri, 21 Oct 2016 17:40:00 +0300</pubDate><guid isPermaLink="false">tag:likemath.ru,2016-10-21:posts/moio-reshenie-zadachi-146/</guid><category>Project Euler</category><category>c++</category><category>FLINT</category></item><item><title>Нахождение суммы k-ых степеней</title><link>http://likemath.ru/posts/nakhozhdenie-summy-k-ykh-stepenei/</link><description>&lt;p&gt;Как придумать формулу для суммы &lt;span class="math"&gt;\(1^5 + 2^5 + 3^5 + \ldots + n^5\)&lt;/span&gt; и есть ли она&amp;nbsp;вообще?&lt;/p&gt;
&lt;script type="text/javascript"&gt;if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) { &lt;script type="text/javascript"&gt;if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) {
var mathjaxscript = document.createElement('script'); var mathjaxscript = document.createElement('script');
mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#'; mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#';

BIN
feeds/all.rss.xml.gz
View File

Binary file not shown.

29
feeds/feed.atom.xml
View File

@@ -1,5 +1,32 @@
<?xml version="1.0" encoding="utf-8"?> <?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom"><title>Блог 529</title><link href="http://likemath.ru/" rel="alternate"></link><link href="http://likemath.ru/feeds/feed.atom.xml" rel="self"></link><id>http://likemath.ru/</id><updated>2016-07-22T13:35:00+03:00</updated><entry><title>Нахождение суммы k-ых степеней</title><link href="http://likemath.ru/posts/nakhozhdenie-summy-k-ykh-stepenei/" rel="alternate"></link><published>2016-07-22T13:35:00+03:00</published><author><name>Алексей Лобанов</name></author><id>tag:likemath.ru,2016-07-22:posts/nakhozhdenie-summy-k-ykh-stepenei/</id><summary type="html">&lt;p&gt;Как придумать формулу для суммы &lt;span class="math"&gt;\(1^5 + 2^5 + 3^5 + \ldots + n^5\)&lt;/span&gt; и есть ли она&amp;nbsp;вообще?&lt;/p&gt; <feed xmlns="http://www.w3.org/2005/Atom"><title>Блог 529</title><link href="http://likemath.ru/" rel="alternate"></link><link href="http://likemath.ru/feeds/feed.atom.xml" rel="self"></link><id>http://likemath.ru/</id><updated>2016-10-21T17:40:00+03:00</updated><entry><title>Моё решение задачи 146</title><link href="http://likemath.ru/posts/moio-reshenie-zadachi-146/" rel="alternate"></link><published>2016-10-21T17:40:00+03:00</published><author><name>Алексей Лобанов</name></author><id>tag:likemath.ru,2016-10-21:posts/moio-reshenie-zadachi-146/</id><summary type="html">&lt;p&gt;Краткое условие: необходимо найти сумму всех натуральных &lt;span class="math"&gt;\(n\)&lt;/span&gt;, что &lt;span class="math"&gt;\(n^2+1\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+3\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+7\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+9\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+13\)&lt;/span&gt;, и &lt;span class="math"&gt;\(n^2+27\)&lt;/span&gt; будут последовательными простыми&amp;nbsp;числами.&lt;/p&gt;
&lt;script type="text/javascript"&gt;if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) {
var mathjaxscript = document.createElement('script');
mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#';
mathjaxscript.type = 'text/javascript';
mathjaxscript.src = '//cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML';
mathjaxscript[(window.opera ? "innerHTML" : "text")] =
"MathJax.Hub.Config({" +
" config: ['MMLorHTML.js']," +
" TeX: { extensions: ['AMSmath.js','AMSsymbols.js','noErrors.js','noUndefined.js'], equationNumbers: { autoNumber: 'AMS' } }," +
" jax: ['input/TeX','input/MathML','output/HTML-CSS']," +
" extensions: ['tex2jax.js','mml2jax.js','MathMenu.js','MathZoom.js']," +
" displayAlign: 'center'," +
" displayIndent: '0em'," +
" showMathMenu: true," +
" tex2jax: { " +
" inlineMath: [ ['\\\\(','\\\\)'] ], " +
" displayMath: [ ['$$','$$'] ]," +
" processEscapes: true," +
" preview: 'TeX'," +
" }, " +
" 'HTML-CSS': { " +
" styles: { '.MathJax_Display, .MathJax .mo, .MathJax .mi, .MathJax .mn': {color: 'black ! important'} }" +
" } " +
"}); ";
(document.body || document.getElementsByTagName('head')[0]).appendChild(mathjaxscript);
}
&lt;/script&gt;</summary><category term="Project Euler"></category><category term="c++"></category><category term="FLINT"></category></entry><entry><title>Нахождение суммы k-ых степеней</title><link href="http://likemath.ru/posts/nakhozhdenie-summy-k-ykh-stepenei/" rel="alternate"></link><published>2016-07-22T13:35:00+03:00</published><author><name>Алексей Лобанов</name></author><id>tag:likemath.ru,2016-07-22:posts/nakhozhdenie-summy-k-ykh-stepenei/</id><summary type="html">&lt;p&gt;Как придумать формулу для суммы &lt;span class="math"&gt;\(1^5 + 2^5 + 3^5 + \ldots + n^5\)&lt;/span&gt; и есть ли она&amp;nbsp;вообще?&lt;/p&gt;
&lt;script type="text/javascript"&gt;if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) { &lt;script type="text/javascript"&gt;if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) {
var mathjaxscript = document.createElement('script'); var mathjaxscript = document.createElement('script');
mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#'; mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#';

BIN
feeds/feed.atom.xml.gz
View File

Binary file not shown.

29
feeds/feed.rss.xml
View File

@@ -1,5 +1,32 @@
<?xml version="1.0" encoding="utf-8"?> <?xml version="1.0" encoding="utf-8"?>
<rss version="2.0"><channel><title>Блог 529</title><link>http://likemath.ru/</link><description>Project Euler и остальное</description><lastBuildDate>Fri, 22 Jul 2016 13:35:00 +0300</lastBuildDate><item><title>Нахождение суммы k-ых степеней</title><link>http://likemath.ru/posts/nakhozhdenie-summy-k-ykh-stepenei/</link><description>&lt;p&gt;Как придумать формулу для суммы &lt;span class="math"&gt;\(1^5 + 2^5 + 3^5 + \ldots + n^5\)&lt;/span&gt; и есть ли она&amp;nbsp;вообще?&lt;/p&gt; <rss version="2.0"><channel><title>Блог 529</title><link>http://likemath.ru/</link><description>Project Euler и остальное</description><lastBuildDate>Fri, 21 Oct 2016 17:40:00 +0300</lastBuildDate><item><title>Моё решение задачи 146</title><link>http://likemath.ru/posts/moio-reshenie-zadachi-146/</link><description>&lt;p&gt;Краткое условие: необходимо найти сумму всех натуральных &lt;span class="math"&gt;\(n\)&lt;/span&gt;, что &lt;span class="math"&gt;\(n^2+1\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+3\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+7\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+9\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+13\)&lt;/span&gt;, и &lt;span class="math"&gt;\(n^2+27\)&lt;/span&gt; будут последовательными простыми&amp;nbsp;числами.&lt;/p&gt;
&lt;script type="text/javascript"&gt;if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) {
var mathjaxscript = document.createElement('script');
mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#';
mathjaxscript.type = 'text/javascript';
mathjaxscript.src = '//cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML';
mathjaxscript[(window.opera ? "innerHTML" : "text")] =
"MathJax.Hub.Config({" +
" config: ['MMLorHTML.js']," +
" TeX: { extensions: ['AMSmath.js','AMSsymbols.js','noErrors.js','noUndefined.js'], equationNumbers: { autoNumber: 'AMS' } }," +
" jax: ['input/TeX','input/MathML','output/HTML-CSS']," +
" extensions: ['tex2jax.js','mml2jax.js','MathMenu.js','MathZoom.js']," +
" displayAlign: 'center'," +
" displayIndent: '0em'," +
" showMathMenu: true," +
" tex2jax: { " +
" inlineMath: [ ['\\\\(','\\\\)'] ], " +
" displayMath: [ ['$$','$$'] ]," +
" processEscapes: true," +
" preview: 'TeX'," +
" }, " +
" 'HTML-CSS': { " +
" styles: { '.MathJax_Display, .MathJax .mo, .MathJax .mi, .MathJax .mn': {color: 'black ! important'} }" +
" } " +
"}); ";
(document.body || document.getElementsByTagName('head')[0]).appendChild(mathjaxscript);
}
&lt;/script&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Алексей Лобанов</dc:creator><pubDate>Fri, 21 Oct 2016 17:40:00 +0300</pubDate><guid isPermaLink="false">tag:likemath.ru,2016-10-21:posts/moio-reshenie-zadachi-146/</guid><category>Project Euler</category><category>c++</category><category>FLINT</category></item><item><title>Нахождение суммы k-ых степеней</title><link>http://likemath.ru/posts/nakhozhdenie-summy-k-ykh-stepenei/</link><description>&lt;p&gt;Как придумать формулу для суммы &lt;span class="math"&gt;\(1^5 + 2^5 + 3^5 + \ldots + n^5\)&lt;/span&gt; и есть ли она&amp;nbsp;вообще?&lt;/p&gt;
&lt;script type="text/javascript"&gt;if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) { &lt;script type="text/javascript"&gt;if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) {
var mathjaxscript = document.createElement('script'); var mathjaxscript = document.createElement('script');
mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#'; mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#';

BIN
feeds/feed.rss.xml.gz
View File

Binary file not shown.

29
feeds/project-euler.atom.xml
View File

@@ -1,2 +1,29 @@
<?xml version="1.0" encoding="utf-8"?> <?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom"><title>Блог 529</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-11-22T23:41:00+03:00</updated><entry><title>Моё решение задачи 60</title><link href="http://likemath.ru/posts/moio-reshenie-zadachi-60/" rel="alternate"></link><published>2015-11-22T23:41:00+03:00</published><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> <feed xmlns="http://www.w3.org/2005/Atom"><title>Блог 529</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>2016-10-21T17:40:00+03:00</updated><entry><title>Моё решение задачи 146</title><link href="http://likemath.ru/posts/moio-reshenie-zadachi-146/" rel="alternate"></link><published>2016-10-21T17:40:00+03:00</published><author><name>Алексей Лобанов</name></author><id>tag:likemath.ru,2016-10-21:posts/moio-reshenie-zadachi-146/</id><summary type="html">&lt;p&gt;Краткое условие: необходимо найти сумму всех натуральных &lt;span class="math"&gt;\(n\)&lt;/span&gt;, что &lt;span class="math"&gt;\(n^2+1\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+3\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+7\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+9\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+13\)&lt;/span&gt;, и &lt;span class="math"&gt;\(n^2+27\)&lt;/span&gt; будут последовательными простыми&amp;nbsp;числами.&lt;/p&gt;
&lt;script type="text/javascript"&gt;if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) {
var mathjaxscript = document.createElement('script');
mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#';
mathjaxscript.type = 'text/javascript';
mathjaxscript.src = '//cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML';
mathjaxscript[(window.opera ? "innerHTML" : "text")] =
"MathJax.Hub.Config({" +
" config: ['MMLorHTML.js']," +
" TeX: { extensions: ['AMSmath.js','AMSsymbols.js','noErrors.js','noUndefined.js'], equationNumbers: { autoNumber: 'AMS' } }," +
" jax: ['input/TeX','input/MathML','output/HTML-CSS']," +
" extensions: ['tex2jax.js','mml2jax.js','MathMenu.js','MathZoom.js']," +
" displayAlign: 'center'," +
" displayIndent: '0em'," +
" showMathMenu: true," +
" tex2jax: { " +
" inlineMath: [ ['\\\\(','\\\\)'] ], " +
" displayMath: [ ['$$','$$'] ]," +
" processEscapes: true," +
" preview: 'TeX'," +
" }, " +
" 'HTML-CSS': { " +
" styles: { '.MathJax_Display, .MathJax .mo, .MathJax .mi, .MathJax .mn': {color: 'black ! important'} }" +
" } " +
"}); ";
(document.body || document.getElementsByTagName('head')[0]).appendChild(mathjaxscript);
}
&lt;/script&gt;</summary><category term="Project Euler"></category><category term="c++"></category><category term="FLINT"></category></entry><entry><title>Моё решение задачи 60</title><link href="http://likemath.ru/posts/moio-reshenie-zadachi-60/" rel="alternate"></link><published>2015-11-22T23:41:00+03:00</published><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>

BIN
feeds/project-euler.atom.xml.gz
View File

Binary file not shown.

29
feeds/tag-c.atom.xml
View File

@@ -1,2 +1,29 @@
<?xml version="1.0" encoding="utf-8"?> <?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom"><title>Блог 529</title><link href="http://likemath.ru/" rel="alternate"></link><link href="http://likemath.ru/feeds/tag-c.atom.xml" rel="self"></link><id>http://likemath.ru/</id><updated>2015-11-22T23:41:00+03:00</updated><entry><title>CrossGen v1.0</title><link href="http://likemath.ru/posts/crossgen-v10/" rel="alternate"></link><published>2015-08-04T17:40:00+03:00</published><author><name>Алексей Лобанов</name></author><id>tag:likemath.ru,2015-08-02:posts/crossgen-v10/</id><summary type="html">&lt;p&gt;Читая хабр, случайно натолкнулся на идею сделать программу, которая по заданной кроссвордной сетке находит способ её заполнить. В этом посте вкратце напишу про моё решение и первую версию&amp;nbsp;приложения.&lt;/p&gt;</summary><category term="проект"></category><category term="c++"></category><category term="wxWidgets"></category></entry><entry><title>Моё решение задачи 60</title><link href="http://likemath.ru/posts/moio-reshenie-zadachi-60/" rel="alternate"></link><published>2015-11-22T23:41:00+03:00</published><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> <feed xmlns="http://www.w3.org/2005/Atom"><title>Блог 529</title><link href="http://likemath.ru/" rel="alternate"></link><link href="http://likemath.ru/feeds/tag-c.atom.xml" rel="self"></link><id>http://likemath.ru/</id><updated>2016-10-21T17:40:00+03:00</updated><entry><title>Моё решение задачи 146</title><link href="http://likemath.ru/posts/moio-reshenie-zadachi-146/" rel="alternate"></link><published>2016-10-21T17:40:00+03:00</published><author><name>Алексей Лобанов</name></author><id>tag:likemath.ru,2016-10-21:posts/moio-reshenie-zadachi-146/</id><summary type="html">&lt;p&gt;Краткое условие: необходимо найти сумму всех натуральных &lt;span class="math"&gt;\(n\)&lt;/span&gt;, что &lt;span class="math"&gt;\(n^2+1\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+3\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+7\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+9\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+13\)&lt;/span&gt;, и &lt;span class="math"&gt;\(n^2+27\)&lt;/span&gt; будут последовательными простыми&amp;nbsp;числами.&lt;/p&gt;
&lt;script type="text/javascript"&gt;if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) {
var mathjaxscript = document.createElement('script');
mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#';
mathjaxscript.type = 'text/javascript';
mathjaxscript.src = '//cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML';
mathjaxscript[(window.opera ? "innerHTML" : "text")] =
"MathJax.Hub.Config({" +
" config: ['MMLorHTML.js']," +
" TeX: { extensions: ['AMSmath.js','AMSsymbols.js','noErrors.js','noUndefined.js'], equationNumbers: { autoNumber: 'AMS' } }," +
" jax: ['input/TeX','input/MathML','output/HTML-CSS']," +
" extensions: ['tex2jax.js','mml2jax.js','MathMenu.js','MathZoom.js']," +
" displayAlign: 'center'," +
" displayIndent: '0em'," +
" showMathMenu: true," +
" tex2jax: { " +
" inlineMath: [ ['\\\\(','\\\\)'] ], " +
" displayMath: [ ['$$','$$'] ]," +
" processEscapes: true," +
" preview: 'TeX'," +
" }, " +
" 'HTML-CSS': { " +
" styles: { '.MathJax_Display, .MathJax .mo, .MathJax .mi, .MathJax .mn': {color: 'black ! important'} }" +
" } " +
"}); ";
(document.body || document.getElementsByTagName('head')[0]).appendChild(mathjaxscript);
}
&lt;/script&gt;</summary><category term="Project Euler"></category><category term="c++"></category><category term="FLINT"></category></entry><entry><title>CrossGen v1.0</title><link href="http://likemath.ru/posts/crossgen-v10/" rel="alternate"></link><published>2015-08-04T17:40:00+03:00</published><author><name>Алексей Лобанов</name></author><id>tag:likemath.ru,2015-08-02:posts/crossgen-v10/</id><summary type="html">&lt;p&gt;Читая хабр, случайно натолкнулся на идею сделать программу, которая по заданной кроссвордной сетке находит способ её заполнить. В этом посте вкратце напишу про моё решение и первую версию&amp;nbsp;приложения.&lt;/p&gt;</summary><category term="проект"></category><category term="c++"></category><category term="wxWidgets"></category></entry><entry><title>Моё решение задачи 60</title><link href="http://likemath.ru/posts/moio-reshenie-zadachi-60/" rel="alternate"></link><published>2015-11-22T23:41:00+03:00</published><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>

BIN
feeds/tag-c.atom.xml.gz
View File

Binary file not shown.

29
feeds/tag-flint.atom.xml Normal file
View File

@@ -0,0 +1,29 @@
<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom"><title>Блог 529</title><link href="http://likemath.ru/" rel="alternate"></link><link href="http://likemath.ru/feeds/tag-flint.atom.xml" rel="self"></link><id>http://likemath.ru/</id><updated>2016-10-21T17:40:00+03:00</updated><entry><title>Моё решение задачи 146</title><link href="http://likemath.ru/posts/moio-reshenie-zadachi-146/" rel="alternate"></link><published>2016-10-21T17:40:00+03:00</published><author><name>Алексей Лобанов</name></author><id>tag:likemath.ru,2016-10-21:posts/moio-reshenie-zadachi-146/</id><summary type="html">&lt;p&gt;Краткое условие: необходимо найти сумму всех натуральных &lt;span class="math"&gt;\(n\)&lt;/span&gt;, что &lt;span class="math"&gt;\(n^2+1\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+3\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+7\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+9\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+13\)&lt;/span&gt;, и &lt;span class="math"&gt;\(n^2+27\)&lt;/span&gt; будут последовательными простыми&amp;nbsp;числами.&lt;/p&gt;
&lt;script type="text/javascript"&gt;if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) {
var mathjaxscript = document.createElement('script');
mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#';
mathjaxscript.type = 'text/javascript';
mathjaxscript.src = '//cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML';
mathjaxscript[(window.opera ? "innerHTML" : "text")] =
"MathJax.Hub.Config({" +
" config: ['MMLorHTML.js']," +
" TeX: { extensions: ['AMSmath.js','AMSsymbols.js','noErrors.js','noUndefined.js'], equationNumbers: { autoNumber: 'AMS' } }," +
" jax: ['input/TeX','input/MathML','output/HTML-CSS']," +
" extensions: ['tex2jax.js','mml2jax.js','MathMenu.js','MathZoom.js']," +
" displayAlign: 'center'," +
" displayIndent: '0em'," +
" showMathMenu: true," +
" tex2jax: { " +
" inlineMath: [ ['\\\\(','\\\\)'] ], " +
" displayMath: [ ['$$','$$'] ]," +
" processEscapes: true," +
" preview: 'TeX'," +
" }, " +
" 'HTML-CSS': { " +
" styles: { '.MathJax_Display, .MathJax .mo, .MathJax .mi, .MathJax .mn': {color: 'black ! important'} }" +
" } " +
"}); ";
(document.body || document.getElementsByTagName('head')[0]).appendChild(mathjaxscript);
}
&lt;/script&gt;</summary><category term="Project Euler"></category><category term="c++"></category><category term="FLINT"></category></entry></feed>

BIN
feeds/tag-flint.atom.xml.gz Normal file
View File

Binary file not shown.

29
feeds/tag-project-euler.atom.xml
View File

@@ -1,2 +1,29 @@
<?xml version="1.0" encoding="utf-8"?> <?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom"><title>Блог 529</title><link href="http://likemath.ru/" rel="alternate"></link><link href="http://likemath.ru/feeds/tag-project-euler.atom.xml" rel="self"></link><id>http://likemath.ru/</id><updated>2015-11-22T23:41:00+03:00</updated><entry><title>Моё решение задачи 60</title><link href="http://likemath.ru/posts/moio-reshenie-zadachi-60/" rel="alternate"></link><published>2015-11-22T23:41:00+03:00</published><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> <feed xmlns="http://www.w3.org/2005/Atom"><title>Блог 529</title><link href="http://likemath.ru/" rel="alternate"></link><link href="http://likemath.ru/feeds/tag-project-euler.atom.xml" rel="self"></link><id>http://likemath.ru/</id><updated>2016-10-21T17:40:00+03:00</updated><entry><title>Моё решение задачи 146</title><link href="http://likemath.ru/posts/moio-reshenie-zadachi-146/" rel="alternate"></link><published>2016-10-21T17:40:00+03:00</published><author><name>Алексей Лобанов</name></author><id>tag:likemath.ru,2016-10-21:posts/moio-reshenie-zadachi-146/</id><summary type="html">&lt;p&gt;Краткое условие: необходимо найти сумму всех натуральных &lt;span class="math"&gt;\(n\)&lt;/span&gt;, что &lt;span class="math"&gt;\(n^2+1\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+3\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+7\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+9\)&lt;/span&gt;, &lt;span class="math"&gt;\(n^2+13\)&lt;/span&gt;, и &lt;span class="math"&gt;\(n^2+27\)&lt;/span&gt; будут последовательными простыми&amp;nbsp;числами.&lt;/p&gt;
&lt;script type="text/javascript"&gt;if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) {
var mathjaxscript = document.createElement('script');
mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#';
mathjaxscript.type = 'text/javascript';
mathjaxscript.src = '//cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML';
mathjaxscript[(window.opera ? "innerHTML" : "text")] =
"MathJax.Hub.Config({" +
" config: ['MMLorHTML.js']," +
" TeX: { extensions: ['AMSmath.js','AMSsymbols.js','noErrors.js','noUndefined.js'], equationNumbers: { autoNumber: 'AMS' } }," +
" jax: ['input/TeX','input/MathML','output/HTML-CSS']," +
" extensions: ['tex2jax.js','mml2jax.js','MathMenu.js','MathZoom.js']," +
" displayAlign: 'center'," +
" displayIndent: '0em'," +
" showMathMenu: true," +
" tex2jax: { " +
" inlineMath: [ ['\\\\(','\\\\)'] ], " +
" displayMath: [ ['$$','$$'] ]," +
" processEscapes: true," +
" preview: 'TeX'," +
" }, " +
" 'HTML-CSS': { " +
" styles: { '.MathJax_Display, .MathJax .mo, .MathJax .mi, .MathJax .mn': {color: 'black ! important'} }" +
" } " +
"}); ";
(document.body || document.getElementsByTagName('head')[0]).appendChild(mathjaxscript);
}
&lt;/script&gt;</summary><category term="Project Euler"></category><category term="c++"></category><category term="FLINT"></category></entry><entry><title>Моё решение задачи 60</title><link href="http://likemath.ru/posts/moio-reshenie-zadachi-60/" rel="alternate"></link><published>2015-11-22T23:41:00+03:00</published><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>

BIN
feeds/tag-project-euler.atom.xml.gz
View File

Binary file not shown.

BIN
images/gif_neural.gif Normal file
View File

Binary file not shown.
Side by Side

After

Width:  |  Height:  |  Size: 68 KiB

BIN
images/gif_real.gif Normal file
View File

Binary file not shown.
Side by Side

After

Width:  |  Height:  |  Size: 68 KiB

2415
images/graphics.svg Normal file
View File

File diff suppressed because it is too large Load Diff
Side by Side

After

Width:  |  Height:  |  Size: 84 KiB

BIN
images/graphics.svg.gz Normal file
View File

Binary file not shown.

BIN
images/graphics_mini.png Normal file
View File

Binary file not shown.
Side by Side

After

Width:  |  Height:  |  Size: 31 KiB

2350
images/graphicsboard.svg Normal file
View File

File diff suppressed because it is too large Load Diff
Side by Side

After

Width:  |  Height:  |  Size: 84 KiB

BIN
images/graphicsboard.svg.gz Normal file
View File

Binary file not shown.

BIN
images/graphicsboard_mini.png Normal file
View File

Binary file not shown.
Side by Side

After

Width:  |  Height:  |  Size: 43 KiB

28
index.html
View File

@@ -1,7 +1,33 @@
<!DOCTYPE html> <!DOCTYPE html>
<!--[if lt IE 7]> <html class="no-js lt-ie9 lt-ie8 lt-ie7"> <![endif]--><!--[if IE 7]> <html class="no-js lt-ie9 lt-ie8"> <![endif]--><!--[if IE 8]> <html class="no-js lt-ie9"> <![endif]--><!--[if gt IE 8]><!--><html class="no-js"> <head><meta charset="utf-8"><meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"><title>Блог 529</title><meta name="description" content><meta name="viewport" content="width=device-width"><link rel="stylesheet" href="./theme/css/normalize.css"><link href="http://fonts.googleapis.com/css?family=Philosopher&subset=latin,cyrillic" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Forum&subset=cyrillic" rel="stylesheet" type="text/css"><link href="//fonts.googleapis.com/css?family=Oswald" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Ubuntu+Mono" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=PT+Sans" rel="stylesheet" type="text/css"><link rel="stylesheet" href="./theme/css/font-awesome.min.css"><link rel="stylesheet" href="./theme/css/main.css"><link rel="stylesheet" href="./theme/css/blog.css"><link rel="stylesheet" href="./theme/css/github.css"><link href="http://likemath.ru/feeds/all.atom.xml" type="application/atom+xml" rel="alternate" title="Блог 529 Atom Feed"><link href="http://likemath.ru/feeds/all.rss.xml" type="application/rss+xml" rel="alternate" title="Блог 529 RSS Feed"><script src="./theme/js/vendor/modernizr-2.6.2.min.js"></script></head><body><!--[if lt IE 7]> <!--[if lt IE 7]> <html class="no-js lt-ie9 lt-ie8 lt-ie7"> <![endif]--><!--[if IE 7]> <html class="no-js lt-ie9 lt-ie8"> <![endif]--><!--[if IE 8]> <html class="no-js lt-ie9"> <![endif]--><!--[if gt IE 8]><!--><html class="no-js"> <head><meta charset="utf-8"><meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"><title>Блог 529</title><meta name="description" content><meta name="viewport" content="width=device-width"><link rel="stylesheet" href="./theme/css/normalize.css"><link href="http://fonts.googleapis.com/css?family=Philosopher&subset=latin,cyrillic" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Forum&subset=cyrillic" rel="stylesheet" type="text/css"><link href="//fonts.googleapis.com/css?family=Oswald" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Ubuntu+Mono" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=PT+Sans" rel="stylesheet" type="text/css"><link rel="stylesheet" href="./theme/css/font-awesome.min.css"><link rel="stylesheet" href="./theme/css/main.css"><link rel="stylesheet" href="./theme/css/blog.css"><link rel="stylesheet" href="./theme/css/github.css"><link href="http://likemath.ru/feeds/all.atom.xml" type="application/atom+xml" rel="alternate" title="Блог 529 Atom Feed"><link href="http://likemath.ru/feeds/all.rss.xml" type="application/rss+xml" rel="alternate" title="Блог 529 RSS Feed"><script src="./theme/js/vendor/modernizr-2.6.2.min.js"></script></head><body><!--[if lt IE 7]>
<p class="chromeframe">You are using an <strong>outdated</strong> browser. Please <a href="http://browsehappy.com/">upgrade your browser</a> or <a href="http://www.google.com/chromeframe/?redirect=true">activate Google Chrome Frame</a> to improve your experience.</p> <p class="chromeframe">You are using an <strong>outdated</strong> browser. Please <a href="http://browsehappy.com/">upgrade your browser</a> or <a href="http://www.google.com/chromeframe/?redirect=true">activate Google Chrome Frame</a> to improve your experience.</p>
<![endif]--><div id="wrapper"><header id="sidebar" class="side-shadow"><hgroup id="site-header"><a id="site-title" href="."><h2><i class="icon-coffee"></i> Блог 529</h2></a><p id="site-desc"> Project Euler и остальное </p></hgroup><nav><ul id="nav-links"><li><a href="./">Главная</a></li><li><a href="./pages/projects.html">Мои проекты</a></li><li><a href="./pages/about.html">Об авторе</a></li><li><a href="./feeds/feed.atom.xml">Atom feed</a></li></ul></nav><footer id="site-info"><p> Powered by Pelican. </p></footer></header><div id="post-container"><ol id="post-list"><li><article class="post-entry"><header class="entry-header"><time class="post-time" datetime="2016-07-22T13:35:00+03:00" pubdate> Пт 22 Июль 2016 </time><a href="./posts/nakhozhdenie-summy-k-ykh-stepenei/" rel="bookmark"><h1>Нахождение суммы k-ых&nbsp;степеней</h1></a></header><section class="post-content"><p>Как придумать формулу для суммы <span class="math">\(1^5 + 2^5 + 3^5 + \ldots + n^5\)</span> и есть ли она&nbsp;вообще?</p><script type="text/javascript">if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) { <![endif]--><div id="wrapper"><header id="sidebar" class="side-shadow"><hgroup id="site-header"><a id="site-title" href="."><h2><i class="icon-coffee"></i> Блог 529</h2></a><p id="site-desc"> Project Euler и остальное </p></hgroup><nav><ul id="nav-links"><li><a href="./">Главная</a></li><li><a href="./pages/projects.html">Мои проекты</a></li><li><a href="./pages/about.html">Об авторе</a></li><li><a href="./feeds/feed.atom.xml">Atom feed</a></li></ul></nav><footer id="site-info"><p> Powered by Pelican. </p></footer></header><div id="post-container"><ol id="post-list"><li><article class="post-entry"><header class="entry-header"><time class="post-time" datetime="2016-10-21T17:40:00+03:00" pubdate> Пт 21 Октябрь 2016 </time><a href="./posts/moio-reshenie-zadachi-146/" rel="bookmark"><h1>Моё решение задачи&nbsp;146</h1></a></header><section class="post-content"><p>Краткое условие: необходимо найти сумму всех натуральных <span class="math">\(n\)</span>, что <span class="math">\(n^2+1\)</span>, <span class="math">\(n^2+3\)</span>, <span class="math">\(n^2+7\)</span>, <span class="math">\(n^2+9\)</span>, <span class="math">\(n^2+13\)</span>, и <span class="math">\(n^2+27\)</span> будут последовательными простыми&nbsp;числами.</p><script type="text/javascript">if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) {
var mathjaxscript = document.createElement('script');
mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#';
mathjaxscript.type = 'text/javascript';
mathjaxscript.src = '//cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML';
mathjaxscript[(window.opera ? "innerHTML" : "text")] =
"MathJax.Hub.Config({" +
" config: ['MMLorHTML.js']," +
" TeX: { extensions: ['AMSmath.js','AMSsymbols.js','noErrors.js','noUndefined.js'], equationNumbers: { autoNumber: 'AMS' } }," +
" jax: ['input/TeX','input/MathML','output/HTML-CSS']," +
" extensions: ['tex2jax.js','mml2jax.js','MathMenu.js','MathZoom.js']," +
" displayAlign: 'center'," +
" displayIndent: '0em'," +
" showMathMenu: true," +
" tex2jax: { " +
" inlineMath: [ ['\\\\(','\\\\)'] ], " +
" displayMath: [ ['$$','$$'] ]," +
" processEscapes: true," +
" preview: 'TeX'," +
" }, " +
" 'HTML-CSS': { " +
" styles: { '.MathJax_Display, .MathJax .mo, .MathJax .mi, .MathJax .mn': {color: 'black ! important'} }" +
" } " +
"}); ";
(document.body || document.getElementsByTagName('head')[0]).appendChild(mathjaxscript);
}
</script></section></article></li><hr><li><article class="post-entry"><header class="entry-header"><time class="post-time" datetime="2016-07-22T13:35:00+03:00" pubdate> Пт 22 Июль 2016 </time><a href="./posts/nakhozhdenie-summy-k-ykh-stepenei/" rel="bookmark"><h1>Нахождение суммы k-ых&nbsp;степеней</h1></a></header><section class="post-content"><p>Как придумать формулу для суммы <span class="math">\(1^5 + 2^5 + 3^5 + \ldots + n^5\)</span> и есть ли она&nbsp;вообще?</p><script type="text/javascript">if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) {
var mathjaxscript = document.createElement('script'); var mathjaxscript = document.createElement('script');
mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#'; mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#';
mathjaxscript.type = 'text/javascript'; mathjaxscript.type = 'text/javascript';

BIN
index.html.gz
View File

Binary file not shown.

148
posts/moio-reshenie-zadachi-146/index.html Normal file
View File

@@ -0,0 +1,148 @@
<!DOCTYPE html>
<!--[if lt IE 7]> <html class="no-js lt-ie9 lt-ie8 lt-ie7"> <![endif]--><!--[if IE 7]> <html class="no-js lt-ie9 lt-ie8"> <![endif]--><!--[if IE 8]> <html class="no-js lt-ie9"> <![endif]--><!--[if gt IE 8]><!--><html class="no-js"> <head><meta charset="utf-8"><meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"><title>Моё решение задачи 146</title><meta name="description" content><meta name="viewport" content="width=device-width"><link rel="stylesheet" href="../../theme/css/normalize.css"><link href="http://fonts.googleapis.com/css?family=Philosopher&subset=latin,cyrillic" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Forum&subset=cyrillic" rel="stylesheet" type="text/css"><link href="//fonts.googleapis.com/css?family=Oswald" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Ubuntu+Mono" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=PT+Sans" rel="stylesheet" type="text/css"><link rel="stylesheet" href="../../theme/css/font-awesome.min.css"><link rel="stylesheet" href="../../theme/css/main.css"><link rel="stylesheet" href="../../theme/css/blog.css"><link rel="stylesheet" href="../../theme/css/github.css"><link href="http://likemath.ru/feeds/all.atom.xml" type="application/atom+xml" rel="alternate" title="Блог 529 Atom Feed"><link href="http://likemath.ru/feeds/all.rss.xml" type="application/rss+xml" rel="alternate" title="Блог 529 RSS Feed"><script src="../../theme/js/vendor/modernizr-2.6.2.min.js"></script></head><body><!--[if lt IE 7]>
<p class="chromeframe">You are using an <strong>outdated</strong> browser. Please <a href="http://browsehappy.com/">upgrade your browser</a> or <a href="http://www.google.com/chromeframe/?redirect=true">activate Google Chrome Frame</a> to improve your experience.</p>
<![endif]--><div id="wrapper"><header id="sidebar" class="side-shadow"><hgroup id="site-header"><a id="site-title" href="../.."><h2><i class="icon-coffee"></i> Блог 529</h2></a><p id="site-desc"> Project Euler и остальное </p></hgroup><nav><ul id="nav-links"><li><a href="../../">Главная</a></li><li><a href="../../pages/projects.html">Мои проекты</a></li><li><a href="../../pages/about.html">Об авторе</a></li><li><a href="../../feeds/feed.atom.xml">Atom feed</a></li></ul></nav><footer id="site-info"><p> Powered by Pelican. </p></footer></header><div id="post-container"><ol id="post-list"><li><article class="post-entry"><header class="entry-header"><time class="post-time" datetime="2016-10-21T17:40:00+03:00" pubdate> Пт 21 Октябрь 2016 </time><a href="../../posts/moio-reshenie-zadachi-146/" rel="bookmark"><h1>Моё решение задачи&nbsp;146</h1></a></header><section class="post-content"><p>Необходимо найти сумму всех натуральных <span class="math">\(n\)</span>, что <span class="math">\(n^2+1\)</span>, <span class="math">\(n^2+3\)</span>, <span class="math">\(n^2+7\)</span>, <span class="math">\(n^2+9\)</span>, <span class="math">\(n^2+13\)</span>, и <span class="math">\(n^2+27\)</span> будут <em>последовательными</em> простыми&nbsp;числами.</p><p>Полное условие можно найти <a href="https://projecteuler.net/problem=146">тут</a></p><p>Хочется отметить, что сложность у задачи 50%, а на текущий момент её решило меньше 4000 человек. Тем не менее, мне она показалось простой. Простейшее решение отработало очень&nbsp;быстро.</p><p>Для начала, можно отметить, что в лоб проверять условие очень долго. Проверять на простоту числа порядка <span class="math">\(10^{15}\)</span> достаточно сложно, поэтому их нужно как-то&nbsp;отсеять.</p><p>Самое простое &#8212; не рассматривать те <span class="math">\(n\)</span>, что хотя бы одно из <span class="math">\(n^2+1\)</span>, <span class="math">\(n^2+3\)</span>, <span class="math">\(n^2+7\)</span>, <span class="math">\(n^2+9\)</span>, <span class="math">\(n^2+13\)</span>, и <span class="math">\(n^2+27\)</span> будет заведомо делиться на какое-то маленькое простое число. Это даёт достаточно хорошие результаты: из 150 миллионов чисел, после отсеивания по простым числам <span class="math">\(&lt; 3000\)</span> (этот параметр я подбирал уже после решения задач: если он слишком маленький, то будет слишком много проверок на простоту, если же слишком большой, то мы делаем слишком много работы, чтобы отсеять несколько чисел), останется меньше <span class="math">\(2000\)</span> чисел. Их уже можно проверить&nbsp;непосредственно. </p><p>Тогда алгоритм может быть&nbsp;таким:</p><ol><li>Находим простые числа меньше <span class="math">\(3000\)</span>.</li><li>Для каждого из них находим допустимые&nbsp;остатки.</li><li>Для каждого из чисел от <span class="math">\(1\)</span> до <span class="math">\(n\)</span> проверяем, что остатки по всем простым&nbsp;хорошие.</li><li>Непосредственно проверяем условие. Важно не забыть проверить <strong>не</strong>простоту оставшихся нечётных чисел из диапазона <span class="math">\(n^2 + 1 \ldots n^2 + 27\)</span> там могут быть (и будут!) другие простые&nbsp;числа.</li></ol><p>Непосредственно сам поиск такой клики можно реализовать тривиально. Ниже мой код на C++11 с использованием библиотек Flint и primesieve. Распараллеливание хоть и просится, но смысла не имеет, т.к. я получил ответ менее, чем за 5&nbsp;секунд.</p><div class="highlight"><pre><span class="code-line"><span class="cm">/*</span></span>
<span class="code-line"><span class="cm"> * Problem 146 on Project Euler</span></span>
<span class="code-line"><span class="cm"> * Aleksey Lobanov (c) 2016</span></span>
<span class="code-line"><span class="cm"> */</span></span>
<span class="code-line"></span>
<span class="code-line"><span class="cp">#include</span> <span class="cpf">&lt;iostream&gt;</span><span class="cp"></span></span>
<span class="code-line"><span class="cp">#include</span> <span class="cpf">&lt;vector&gt;</span><span class="cp"></span></span>
<span class="code-line"><span class="cp">#include</span> <span class="cpf">&lt;cstdint&gt;</span><span class="cp"></span></span>
<span class="code-line"><span class="cp">#include</span> <span class="cpf">&lt;set&gt;</span><span class="cp"></span></span>
<span class="code-line"><span class="cp">#include</span> <span class="cpf">&lt;iomanip&gt;</span><span class="cp"></span></span>
<span class="code-line"><span class="cp">#include</span> <span class="cpf">&lt;algorithm&gt;</span><span class="cp"></span></span>
<span class="code-line"></span>
<span class="code-line"><span class="cp">#include</span> <span class="cpf">&quot;fmpzxx.h&quot;</span><span class="cp"></span></span>
<span class="code-line"><span class="cp">#include</span> <span class="cpf">&quot;arithxx.h&quot;</span><span class="cp"></span></span>
<span class="code-line"></span>
<span class="code-line"><span class="cp">#include</span> <span class="cpf">&quot;primesieve.hpp&quot;</span><span class="cp"></span></span>
<span class="code-line"></span>
<span class="code-line"><span class="k">using</span> <span class="k">namespace</span> <span class="n">std</span><span class="p">;</span></span>
<span class="code-line"><span class="k">using</span> <span class="k">namespace</span> <span class="n">flint</span><span class="p">;</span></span>
<span class="code-line"></span>
<span class="code-line"><span class="kt">bool</span> <span class="nf">is_prime</span><span class="p">(</span><span class="kt">int64_t</span> <span class="n">num</span><span class="p">)</span> <span class="p">{</span></span>
<span class="code-line"> <span class="n">fmpz_factorxx</span> <span class="n">fact</span><span class="p">;</span></span>
<span class="code-line"> <span class="n">fact</span><span class="p">.</span><span class="n">set_factor</span><span class="p">(</span><span class="n">num</span><span class="p">);</span></span>
<span class="code-line"> <span class="k">if</span> <span class="p">(</span> <span class="n">fact</span><span class="p">.</span><span class="n">size</span><span class="p">()</span> <span class="o">!=</span> <span class="mi">1</span> <span class="p">)</span></span>
<span class="code-line"> <span class="k">return</span> <span class="nb">false</span><span class="p">;</span></span>
<span class="code-line"> <span class="k">if</span> <span class="p">(</span> <span class="n">fact</span><span class="p">.</span><span class="n">exp</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span> <span class="o">!=</span> <span class="mi">1</span><span class="p">)</span> </span>
<span class="code-line"> <span class="k">return</span> <span class="nb">false</span><span class="p">;</span></span>
<span class="code-line"> <span class="k">return</span> <span class="nb">true</span><span class="p">;</span></span>
<span class="code-line"><span class="p">}</span></span>
<span class="code-line"></span>
<span class="code-line"><span class="kt">bool</span> <span class="nf">is_possible</span><span class="p">(</span><span class="kt">int64_t</span> <span class="n">num</span><span class="p">,</span> <span class="k">const</span> <span class="n">vector</span><span class="o">&lt;</span><span class="kt">int64_t</span><span class="o">&gt;</span> <span class="o">&amp;</span><span class="n">to_add</span><span class="p">)</span> <span class="p">{</span></span>
<span class="code-line"> <span class="k">for</span> <span class="p">(</span><span class="k">auto</span> <span class="o">&amp;&amp;</span><span class="nl">add</span><span class="p">:</span> <span class="n">to_add</span><span class="p">)</span></span>
<span class="code-line"> <span class="k">if</span> <span class="p">(</span> <span class="o">!</span><span class="n">is_prime</span><span class="p">(</span><span class="n">num</span><span class="o">*</span><span class="n">num</span> <span class="o">+</span> <span class="n">add</span><span class="p">)</span> <span class="p">)</span></span>
<span class="code-line"> <span class="k">return</span> <span class="nb">false</span><span class="p">;</span></span>
<span class="code-line"></span>
<span class="code-line"> <span class="c1">// primes must be consecutive</span></span>
<span class="code-line"> <span class="c1">// so we need check, that other numbers like n^2 + i is not primes</span></span>
<span class="code-line"> <span class="n">vector</span><span class="o">&lt;</span><span class="kt">int64_t</span><span class="o">&gt;</span> <span class="n">other_adds</span><span class="p">;</span></span>
<span class="code-line"> <span class="k">for</span> <span class="p">(</span><span class="kt">size_t</span> <span class="n">i</span> <span class="o">=</span> <span class="n">to_add</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="o">+</span> <span class="mi">2</span><span class="p">;</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="n">to_add</span><span class="p">[</span><span class="n">to_add</span><span class="p">.</span><span class="n">size</span><span class="p">()</span> <span class="o">-</span> <span class="mi">1</span><span class="p">];</span> <span class="n">i</span> <span class="o">+=</span> <span class="mi">2</span><span class="p">)</span> </span>
<span class="code-line"> <span class="k">if</span> <span class="p">(</span> <span class="o">!</span><span class="n">binary_search</span><span class="p">(</span><span class="n">to_add</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span> <span class="n">to_add</span><span class="p">.</span><span class="n">end</span><span class="p">(),</span> <span class="n">i</span><span class="p">)</span> <span class="p">)</span></span>
<span class="code-line"> <span class="n">other_adds</span><span class="p">.</span><span class="n">push_back</span><span class="p">(</span><span class="n">i</span><span class="p">);</span></span>
<span class="code-line"></span>
<span class="code-line"> <span class="k">for</span> <span class="p">(</span><span class="k">auto</span> <span class="o">&amp;&amp;</span><span class="nl">add</span><span class="p">:</span> <span class="n">other_adds</span><span class="p">)</span></span>
<span class="code-line"> <span class="k">if</span> <span class="p">(</span> <span class="n">is_prime</span><span class="p">(</span><span class="n">num</span><span class="o">*</span><span class="n">num</span> <span class="o">+</span> <span class="n">add</span><span class="p">)</span> <span class="p">)</span></span>
<span class="code-line"> <span class="k">return</span> <span class="nb">false</span><span class="p">;</span> </span>
<span class="code-line"></span>
<span class="code-line"> <span class="k">return</span> <span class="nb">true</span><span class="p">;</span></span>
<span class="code-line"><span class="p">}</span></span>
<span class="code-line"></span>
<span class="code-line"><span class="kt">int</span> <span class="nf">main</span><span class="p">()</span> <span class="p">{</span></span>
<span class="code-line"> <span class="k">const</span> <span class="n">vector</span><span class="o">&lt;</span><span class="kt">int64_t</span><span class="o">&gt;</span> <span class="n">to_add</span> <span class="o">=</span> <span class="p">{</span><span class="mi">1</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">7</span><span class="p">,</span> <span class="mi">9</span><span class="p">,</span> <span class="mi">13</span><span class="p">,</span> <span class="mi">27</span><span class="p">};</span></span>
<span class="code-line"></span>
<span class="code-line"> <span class="k">const</span> <span class="kt">int64_t</span> <span class="n">MAX_N</span> <span class="o">=</span> <span class="mi">1l</span><span class="o">*</span><span class="mi">150</span><span class="o">*</span><span class="mi">1000</span><span class="o">*</span><span class="mi">1000</span><span class="p">;</span></span>
<span class="code-line"> <span class="k">const</span> <span class="kt">int64_t</span> <span class="n">MAX_PRIME</span> <span class="o">=</span> <span class="mi">3000</span><span class="p">;</span></span>
<span class="code-line"></span>
<span class="code-line"> <span class="n">vector</span><span class="o">&lt;</span><span class="kt">int64_t</span><span class="o">&gt;</span> <span class="n">sieve_primes</span><span class="p">;</span></span>
<span class="code-line"> <span class="n">primesieve</span><span class="o">::</span><span class="n">generate_primes</span><span class="p">(</span><span class="n">MAX_PRIME</span><span class="p">,</span> <span class="o">&amp;</span><span class="n">sieve_primes</span><span class="p">);</span></span>
<span class="code-line"></span>
<span class="code-line"> <span class="n">vector</span><span class="o">&lt;</span> <span class="n">vector</span> <span class="o">&lt;</span><span class="kt">int64_t</span><span class="o">&gt;</span> <span class="o">&gt;</span> <span class="n">good_remainders</span><span class="p">;</span> </span>
<span class="code-line"> <span class="k">for</span> <span class="p">(</span><span class="k">auto</span> <span class="o">&amp;&amp;</span><span class="nl">prime</span><span class="p">:</span> <span class="n">sieve_primes</span><span class="p">)</span> <span class="p">{</span></span>
<span class="code-line"> <span class="n">set</span><span class="o">&lt;</span><span class="kt">int64_t</span><span class="o">&gt;</span> <span class="n">remainders</span><span class="p">;</span></span>
<span class="code-line"> <span class="k">for</span><span class="p">(</span><span class="kt">int64_t</span> <span class="n">rem</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="n">rem</span> <span class="o">&lt;</span> <span class="n">prime</span><span class="p">;</span> <span class="o">++</span><span class="n">rem</span><span class="p">)</span></span>
<span class="code-line"> <span class="n">remainders</span><span class="p">.</span><span class="n">insert</span><span class="p">(</span><span class="n">rem</span><span class="p">);</span></span>
<span class="code-line"></span>
<span class="code-line"> <span class="n">set</span><span class="o">&lt;</span><span class="kt">int64_t</span><span class="o">&gt;</span> <span class="n">base_remainders</span><span class="p">;</span></span>
<span class="code-line"> <span class="k">for</span> <span class="p">(</span><span class="k">auto</span> <span class="o">&amp;&amp;</span><span class="nl">base</span><span class="p">:</span> <span class="n">to_add</span><span class="p">)</span></span>
<span class="code-line"> <span class="n">base_remainders</span><span class="p">.</span><span class="n">insert</span><span class="p">(</span><span class="n">base</span> <span class="o">%</span> <span class="n">prime</span><span class="p">);</span></span>
<span class="code-line"></span>
<span class="code-line"> <span class="k">for</span> <span class="p">(</span><span class="kt">int64_t</span> <span class="n">rem</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="n">rem</span> <span class="o">&lt;</span> <span class="n">prime</span><span class="p">;</span> <span class="o">++</span><span class="n">rem</span><span class="p">)</span></span>
<span class="code-line"> <span class="k">for</span> <span class="p">(</span><span class="k">auto</span> <span class="o">&amp;&amp;</span><span class="nl">base_rem</span><span class="p">:</span> <span class="n">base_remainders</span><span class="p">)</span></span>
<span class="code-line"> <span class="k">if</span> <span class="p">(</span> <span class="p">(</span><span class="n">rem</span><span class="o">*</span><span class="n">rem</span> <span class="o">+</span> <span class="n">base_rem</span><span class="p">)</span> <span class="o">%</span> <span class="n">prime</span> <span class="o">==</span> <span class="mi">0</span> <span class="p">)</span></span>
<span class="code-line"> <span class="n">remainders</span><span class="p">.</span><span class="n">erase</span><span class="p">(</span><span class="n">rem</span><span class="p">);</span></span>
<span class="code-line"></span>
<span class="code-line"> <span class="n">good_remainders</span><span class="p">.</span><span class="n">push_back</span><span class="p">(</span><span class="n">vector</span><span class="o">&lt;</span><span class="kt">int64_t</span><span class="o">&gt;</span><span class="p">(</span><span class="n">remainders</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span> <span class="n">remainders</span><span class="p">.</span><span class="n">end</span><span class="p">()));</span></span>
<span class="code-line"> <span class="p">}</span></span>
<span class="code-line"></span>
<span class="code-line"> <span class="kt">size_t</span> <span class="n">cnt</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span></span>
<span class="code-line"> <span class="kt">size_t</span> <span class="n">sum</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span></span>
<span class="code-line"></span>
<span class="code-line"> <span class="cm">/* WARNING</span></span>
<span class="code-line"><span class="cm"> * for small n can be that</span></span>
<span class="code-line"><span class="cm"> * n^2 + [1 or 3 or .. ] is prime in sieve primes</span></span>
<span class="code-line"><span class="cm"> * but there is only one n &lt; 315410 is 10,</span></span>
<span class="code-line"><span class="cm"> * so we need add 10 to n</span></span>
<span class="code-line"><span class="cm"> */</span></span>
<span class="code-line"> <span class="n">sum</span> <span class="o">+=</span> <span class="mi">10</span><span class="p">;</span></span>
<span class="code-line"></span>
<span class="code-line"> <span class="k">for</span> <span class="p">(</span><span class="kt">int64_t</span> <span class="n">i</span> <span class="o">=</span> <span class="mi">1</span><span class="p">;</span> <span class="n">i</span> <span class="o">&lt;</span> <span class="n">MAX_N</span><span class="p">;</span> <span class="o">++</span><span class="n">i</span><span class="p">)</span> <span class="p">{</span></span>
<span class="code-line"> <span class="kt">bool</span> <span class="n">is_good</span> <span class="o">=</span> <span class="nb">true</span><span class="p">;</span></span>
<span class="code-line"> <span class="k">for</span> <span class="p">(</span><span class="kt">size_t</span> <span class="n">prime_ind</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="n">prime_ind</span> <span class="o">&lt;</span> <span class="n">sieve_primes</span><span class="p">.</span><span class="n">size</span><span class="p">();</span> <span class="o">++</span><span class="n">prime_ind</span><span class="p">)</span> <span class="p">{</span></span>
<span class="code-line"> <span class="k">if</span> <span class="p">(</span> <span class="o">!</span><span class="n">binary_search</span><span class="p">(</span><span class="n">good_remainders</span><span class="p">[</span><span class="n">prime_ind</span><span class="p">].</span><span class="n">begin</span><span class="p">(),</span> <span class="n">good_remainders</span><span class="p">[</span><span class="n">prime_ind</span><span class="p">].</span><span class="n">end</span><span class="p">(),</span> <span class="n">i</span> <span class="o">%</span> <span class="n">sieve_primes</span><span class="p">[</span><span class="n">prime_ind</span><span class="p">])</span> <span class="p">)</span> <span class="p">{</span></span>
<span class="code-line"> <span class="n">is_good</span> <span class="o">=</span> <span class="nb">false</span><span class="p">;</span></span>
<span class="code-line"> <span class="k">break</span><span class="p">;</span></span>
<span class="code-line"> <span class="p">}</span></span>
<span class="code-line"> <span class="p">}</span></span>
<span class="code-line"> <span class="k">if</span> <span class="p">(</span> <span class="n">is_good</span> <span class="p">)</span> <span class="p">{</span></span>
<span class="code-line"> <span class="n">cnt</span><span class="o">++</span><span class="p">;</span></span>
<span class="code-line"> <span class="k">if</span> <span class="p">(</span> <span class="n">is_possible</span><span class="p">(</span><span class="n">i</span><span class="p">,</span> <span class="n">to_add</span><span class="p">)</span> <span class="p">)</span> <span class="p">{</span></span>
<span class="code-line"> <span class="n">sum</span> <span class="o">+=</span> <span class="n">i</span><span class="p">;</span></span>
<span class="code-line"> <span class="p">}</span> </span>
<span class="code-line"> <span class="p">}</span></span>
<span class="code-line"> <span class="p">}</span></span>
<span class="code-line"> <span class="n">cout</span> <span class="o">&lt;&lt;</span> <span class="s">&quot;count = &quot;</span> <span class="o">&lt;&lt;</span> <span class="n">cnt</span> <span class="o">&lt;&lt;</span> <span class="n">endl</span><span class="p">;</span></span>
<span class="code-line"> <span class="n">cout</span> <span class="o">&lt;&lt;</span> <span class="s">&quot;Result is: &quot;</span> <span class="o">&lt;&lt;</span> <span class="n">sum</span> <span class="o">&lt;&lt;</span> <span class="n">endl</span><span class="p">;</span></span>
<span class="code-line"> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span></span>
<span class="code-line"><span class="p">}</span></span>
</pre></div><p>Ответ: <strong>676333270</strong></p><script type="text/javascript">if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) {
var mathjaxscript = document.createElement('script');
mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#';
mathjaxscript.type = 'text/javascript';
mathjaxscript.src = '//cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML';
mathjaxscript[(window.opera ? "innerHTML" : "text")] =
"MathJax.Hub.Config({" +
" config: ['MMLorHTML.js']," +
" TeX: { extensions: ['AMSmath.js','AMSsymbols.js','noErrors.js','noUndefined.js'], equationNumbers: { autoNumber: 'AMS' } }," +
" jax: ['input/TeX','input/MathML','output/HTML-CSS']," +
" extensions: ['tex2jax.js','mml2jax.js','MathMenu.js','MathZoom.js']," +
" displayAlign: 'center'," +
" displayIndent: '0em'," +
" showMathMenu: true," +
" tex2jax: { " +
" inlineMath: [ ['\\\\(','\\\\)'] ], " +
" displayMath: [ ['$$','$$'] ]," +
" processEscapes: true," +
" preview: 'TeX'," +
" }, " +
" 'HTML-CSS': { " +
" styles: { '.MathJax_Display, .MathJax .mo, .MathJax .mi, .MathJax .mn': {color: 'black ! important'} }" +
" } " +
"}); ";
(document.body || document.getElementsByTagName('head')[0]).appendChild(mathjaxscript);
}
</script></section><hr><aside class="post-meta"><p>Категория: <a href="../../category/project-euler.html">Project Euler</a></p><p>Теги: <a href="../../tag/project-euler.html">Project Euler</a>, <a href="../../tag/c.html">c++</a>, <a href="../../tag/flint.html">FLINT</a>, </p></aside><hr><div class="comments"><div id="disqus_thread"></div><script type="text/javascript">
var disqus_shortname = 'likemath';
(function() {
var dsq = document.createElement('script'); dsq.type = 'text/javascript'; dsq.async = true;
dsq.src = '//' + disqus_shortname + '.disqus.com/embed.js';
(document.getElementsByTagName('head')[0] || document.getElementsByTagName('body')[0]).appendChild(dsq);
})();
</script><noscript>Please enable JavaScript to view the <a href="http://disqus.com/?ref_noscript">comments powered by Disqus.</a></noscript><a href="http://disqus.com" class="dsq-brlink">comments powered by <span class="logo-disqus">Disqus</span></a></div></article></li></ol></div></div><script>
var _gaq=[['_setAccount','UA-62001537-1'],['_trackPageview']];
(function(d,t){var g=d.createElement(t),s=d.getElementsByTagName(t)[0];
g.src=('https:'==location.protocol?'//ssl':'//www')+'.google-analytics.com/ga.js';
s.parentNode.insertBefore(g,s)}(document,'script'));
</script><script src="../../theme/js/main.js"></script></body></html>

BIN
posts/moio-reshenie-zadachi-146/index.html.gz Normal file
View File

Binary file not shown.

106
sitemap.xml
View File

@@ -5,28 +5,28 @@ xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url> <url>
<loc>http://likemath.ru/</loc> <loc>http://likemath.ru/</loc>
<lastmod>2016-08-31T01:19:15-00:00</lastmod> <lastmod>2016-10-21T01:22:37-00:00</lastmod>
<changefreq>daily</changefreq> <changefreq>daily</changefreq>
<priority>0.5</priority> <priority>0.5</priority>
</url> </url>
<url> <url>
<loc>http://likemath.ru/archives.html</loc> <loc>http://likemath.ru/archives.html</loc>
<lastmod>2016-08-31T01:19:15-00:00</lastmod> <lastmod>2016-10-21T01:22:37-00:00</lastmod>
<changefreq>daily</changefreq> <changefreq>daily</changefreq>
<priority>0.5</priority> <priority>0.5</priority>
</url> </url>
<url> <url>
<loc>http://likemath.ru/tags.html</loc> <loc>http://likemath.ru/tags.html</loc>
<lastmod>2016-08-31T01:19:15-00:00</lastmod> <lastmod>2016-10-21T01:22:37-00:00</lastmod>
<changefreq>daily</changefreq> <changefreq>daily</changefreq>
<priority>0.5</priority> <priority>0.5</priority>
</url> </url>
<url> <url>
<loc>http://likemath.ru/categories.html</loc> <loc>http://likemath.ru/categories.html</loc>
<lastmod>2016-08-31T01:19:15-00:00</lastmod> <lastmod>2016-10-21T01:22:37-00:00</lastmod>
<changefreq>daily</changefreq> <changefreq>daily</changefreq>
<priority>0.5</priority> <priority>0.5</priority>
</url> </url>
@@ -45,6 +45,13 @@ xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<priority>0.5</priority> <priority>0.5</priority>
</url> </url>
<url>
<loc>http://likemath.ru/posts/moio-reshenie-zadachi-146/</loc>
<lastmod>2016-10-21T17:40:00+03:00</lastmod>
<changefreq>monthly</changefreq>
<priority>0.5</priority>
</url>
<url> <url>
<loc>http://likemath.ru/posts/nakhozhdenie-summy-k-ykh-stepenei/</loc> <loc>http://likemath.ru/posts/nakhozhdenie-summy-k-ykh-stepenei/</loc>
<lastmod>2016-07-22T13:35:00+03:00</lastmod> <lastmod>2016-07-22T13:35:00+03:00</lastmod>
@@ -110,35 +117,7 @@ xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url> <url>
<loc>http://likemath.ru/category/project-euler.html</loc> <loc>http://likemath.ru/category/project-euler.html</loc>
<lastmod>2015-11-22T23:41:00+02:30</lastmod> <lastmod>2016-10-21T17:40:00+02:30</lastmod>
<changefreq>daily</changefreq>
<priority>0.5</priority>
</url>
<url>
<loc>http://likemath.ru/tag/go.html</loc>
<lastmod>2016-03-17T13:35:00+02:30</lastmod>
<changefreq>daily</changefreq>
<priority>0.5</priority>
</url>
<url>
<loc>http://likemath.ru/tag/bgl.html</loc>
<lastmod>2015-11-22T23:41:00+02:30</lastmod>
<changefreq>daily</changefreq>
<priority>0.5</priority>
</url>
<url>
<loc>http://likemath.ru/tag/project-euler.html</loc>
<lastmod>2015-11-22T23:41:00+02:30</lastmod>
<changefreq>daily</changefreq>
<priority>0.5</priority>
</url>
<url>
<loc>http://likemath.ru/tag/wxwidgets.html</loc>
<lastmod>2015-08-04T17:40:00+02:30</lastmod>
<changefreq>daily</changefreq> <changefreq>daily</changefreq>
<priority>0.5</priority> <priority>0.5</priority>
</url> </url>
@@ -151,15 +130,15 @@ xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
</url> </url>
<url> <url>
<loc>http://likemath.ru/tag/open-source.html</loc> <loc>http://likemath.ru/tag/wallabag.html</loc>
<lastmod>2016-03-17T13:35:00+02:30</lastmod> <lastmod>2016-03-17T13:35:00+02:30</lastmod>
<changefreq>daily</changefreq> <changefreq>daily</changefreq>
<priority>0.5</priority> <priority>0.5</priority>
</url> </url>
<url> <url>
<loc>http://likemath.ru/tag/blog.html</loc> <loc>http://likemath.ru/tag/wxwidgets.html</loc>
<lastmod>2015-04-17T13:35:00+02:30</lastmod> <lastmod>2015-08-04T17:40:00+02:30</lastmod>
<changefreq>daily</changefreq> <changefreq>daily</changefreq>
<priority>0.5</priority> <priority>0.5</priority>
</url> </url>
@@ -171,13 +150,6 @@ xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<priority>0.5</priority> <priority>0.5</priority>
</url> </url>
<url>
<loc>http://likemath.ru/tag/shakhmaty.html</loc>
<lastmod>2016-01-10T13:35:00+02:30</lastmod>
<changefreq>daily</changefreq>
<priority>0.5</priority>
</url>
<url> <url>
<loc>http://likemath.ru/tag/matematika.html</loc> <loc>http://likemath.ru/tag/matematika.html</loc>
<lastmod>2016-07-22T13:35:00+02:30</lastmod> <lastmod>2016-07-22T13:35:00+02:30</lastmod>
@@ -187,21 +159,63 @@ xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url> <url>
<loc>http://likemath.ru/tag/c.html</loc> <loc>http://likemath.ru/tag/c.html</loc>
<lastmod>2015-11-22T23:41:00+02:30</lastmod> <lastmod>2016-10-21T17:40:00+02:30</lastmod>
<changefreq>daily</changefreq> <changefreq>daily</changefreq>
<priority>0.5</priority> <priority>0.5</priority>
</url> </url>
<url> <url>
<loc>http://likemath.ru/tag/wallabag.html</loc> <loc>http://likemath.ru/tag/go.html</loc>
<lastmod>2016-03-17T13:35:00+02:30</lastmod> <lastmod>2016-03-17T13:35:00+02:30</lastmod>
<changefreq>daily</changefreq> <changefreq>daily</changefreq>
<priority>0.5</priority> <priority>0.5</priority>
</url> </url>
<url>
<loc>http://likemath.ru/tag/open-source.html</loc>
<lastmod>2016-03-17T13:35:00+02:30</lastmod>
<changefreq>daily</changefreq>
<priority>0.5</priority>
</url>
<url>
<loc>http://likemath.ru/tag/project-euler.html</loc>
<lastmod>2016-10-21T17:40:00+02:30</lastmod>
<changefreq>daily</changefreq>
<priority>0.5</priority>
</url>
<url>
<loc>http://likemath.ru/tag/blog.html</loc>
<lastmod>2015-04-17T13:35:00+02:30</lastmod>
<changefreq>daily</changefreq>
<priority>0.5</priority>
</url>
<url>
<loc>http://likemath.ru/tag/flint.html</loc>
<lastmod>2016-10-21T17:40:00+02:30</lastmod>
<changefreq>daily</changefreq>
<priority>0.5</priority>
</url>
<url>
<loc>http://likemath.ru/tag/bgl.html</loc>
<lastmod>2015-11-22T23:41:00+02:30</lastmod>
<changefreq>daily</changefreq>
<priority>0.5</priority>
</url>
<url>
<loc>http://likemath.ru/tag/shakhmaty.html</loc>
<lastmod>2016-01-10T13:35:00+02:30</lastmod>
<changefreq>daily</changefreq>
<priority>0.5</priority>
</url>
<url> <url>
<loc>http://likemath.ru/author/aleksei-lobanov.html</loc> <loc>http://likemath.ru/author/aleksei-lobanov.html</loc>
<lastmod>2016-07-22T13:35:00+02:30</lastmod> <lastmod>2016-10-21T17:40:00+02:30</lastmod>
<changefreq>daily</changefreq> <changefreq>daily</changefreq>
<priority>0.5</priority> <priority>0.5</priority>
</url> </url>

BIN
sitemap.xml.gz
View File

Binary file not shown.

28
tag/c.html
View File

@@ -1,7 +1,33 @@
<!DOCTYPE html> <!DOCTYPE html>
<!--[if lt IE 7]> <html class="no-js lt-ie9 lt-ie8 lt-ie7"> <![endif]--><!--[if IE 7]> <html class="no-js lt-ie9 lt-ie8"> <![endif]--><!--[if IE 8]> <html class="no-js lt-ie9"> <![endif]--><!--[if gt IE 8]><!--><html class="no-js"> <head><meta charset="utf-8"><meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"><title>Блог 529 - c++</title><meta name="description" content><meta name="viewport" content="width=device-width"><link rel="stylesheet" href="../theme/css/normalize.css"><link href="http://fonts.googleapis.com/css?family=Philosopher&subset=latin,cyrillic" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Forum&subset=cyrillic" rel="stylesheet" type="text/css"><link href="//fonts.googleapis.com/css?family=Oswald" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Ubuntu+Mono" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=PT+Sans" rel="stylesheet" type="text/css"><link rel="stylesheet" href="../theme/css/font-awesome.min.css"><link rel="stylesheet" href="../theme/css/main.css"><link rel="stylesheet" href="../theme/css/blog.css"><link rel="stylesheet" href="../theme/css/github.css"><link href="http://likemath.ru/feeds/all.atom.xml" type="application/atom+xml" rel="alternate" title="Блог 529 Atom Feed"><link href="http://likemath.ru/feeds/all.rss.xml" type="application/rss+xml" rel="alternate" title="Блог 529 RSS Feed"><script src="../theme/js/vendor/modernizr-2.6.2.min.js"></script></head><body><!--[if lt IE 7]> <!--[if lt IE 7]> <html class="no-js lt-ie9 lt-ie8 lt-ie7"> <![endif]--><!--[if IE 7]> <html class="no-js lt-ie9 lt-ie8"> <![endif]--><!--[if IE 8]> <html class="no-js lt-ie9"> <![endif]--><!--[if gt IE 8]><!--><html class="no-js"> <head><meta charset="utf-8"><meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"><title>Блог 529 - c++</title><meta name="description" content><meta name="viewport" content="width=device-width"><link rel="stylesheet" href="../theme/css/normalize.css"><link href="http://fonts.googleapis.com/css?family=Philosopher&subset=latin,cyrillic" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Forum&subset=cyrillic" rel="stylesheet" type="text/css"><link href="//fonts.googleapis.com/css?family=Oswald" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Ubuntu+Mono" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=PT+Sans" rel="stylesheet" type="text/css"><link rel="stylesheet" href="../theme/css/font-awesome.min.css"><link rel="stylesheet" href="../theme/css/main.css"><link rel="stylesheet" href="../theme/css/blog.css"><link rel="stylesheet" href="../theme/css/github.css"><link href="http://likemath.ru/feeds/all.atom.xml" type="application/atom+xml" rel="alternate" title="Блог 529 Atom Feed"><link href="http://likemath.ru/feeds/all.rss.xml" type="application/rss+xml" rel="alternate" title="Блог 529 RSS Feed"><script src="../theme/js/vendor/modernizr-2.6.2.min.js"></script></head><body><!--[if lt IE 7]>
<p class="chromeframe">You are using an <strong>outdated</strong> browser. Please <a href="http://browsehappy.com/">upgrade your browser</a> or <a href="http://www.google.com/chromeframe/?redirect=true">activate Google Chrome Frame</a> to improve your experience.</p> <p class="chromeframe">You are using an <strong>outdated</strong> browser. Please <a href="http://browsehappy.com/">upgrade your browser</a> or <a href="http://www.google.com/chromeframe/?redirect=true">activate Google Chrome Frame</a> to improve your experience.</p>
<![endif]--><div id="wrapper"><header id="sidebar" class="side-shadow"><hgroup id="site-header"><a id="site-title" href=".."><h2><i class="icon-coffee"></i> Блог 529</h2></a><p id="site-desc"> Project Euler и остальное </p></hgroup><nav><ul id="nav-links"><li><a href="../">Главная</a></li><li><a href="../pages/projects.html">Мои проекты</a></li><li><a href="../pages/about.html">Об авторе</a></li><li><a href="../feeds/feed.atom.xml">Atom feed</a></li></ul></nav><footer id="site-info"><p> Powered by Pelican. </p></footer></header><div id="post-container"><ol id="post-list"><li><article class="post-entry"><header class="entry-header"><time class="post-time" datetime="2015-08-02T17:40:00+03:00" pubdate> Вс 02 Август 2015 </time><a href="../posts/crossgen-v10/" rel="bookmark"><h1>CrossGen&nbsp;v1.0</h1></a></header><section class="post-content"><p>Читая хабр, случайно натолкнулся на идею сделать программу, которая по заданной кроссвордной сетке находит способ её заполнить. В этом посте вкратце напишу про моё решение и первую версию&nbsp;приложения.</p></section></article></li><hr><li><article class="post-entry"><header class="entry-header"><time class="post-time" datetime="2015-07-17T17:40:00+03:00" pubdate> Пт 17 Июль 2015 </time><a href="../posts/moio-reshenie-zadachi-60/" rel="bookmark"><h1>Моё решение задачи&nbsp;60</h1></a></header><section class="post-content"><p>Краткое условие: необходимо найти множество из пяти простых чисел с минимальной суммой такое, что после &#8220;склеивания&#8221; в любом порядке любых двух чисел из него тоже будет простое&nbsp;число.</p></section></article></li><hr></ol><div class="paginator"> Page 1 / 1 </div></div></div><script> <![endif]--><div id="wrapper"><header id="sidebar" class="side-shadow"><hgroup id="site-header"><a id="site-title" href=".."><h2><i class="icon-coffee"></i> Блог 529</h2></a><p id="site-desc"> Project Euler и остальное </p></hgroup><nav><ul id="nav-links"><li><a href="../">Главная</a></li><li><a href="../pages/projects.html">Мои проекты</a></li><li><a href="../pages/about.html">Об авторе</a></li><li><a href="../feeds/feed.atom.xml">Atom feed</a></li></ul></nav><footer id="site-info"><p> Powered by Pelican. </p></footer></header><div id="post-container"><ol id="post-list"><li><article class="post-entry"><header class="entry-header"><time class="post-time" datetime="2016-10-21T17:40:00+03:00" pubdate> Пт 21 Октябрь 2016 </time><a href="../posts/moio-reshenie-zadachi-146/" rel="bookmark"><h1>Моё решение задачи&nbsp;146</h1></a></header><section class="post-content"><p>Краткое условие: необходимо найти сумму всех натуральных <span class="math">\(n\)</span>, что <span class="math">\(n^2+1\)</span>, <span class="math">\(n^2+3\)</span>, <span class="math">\(n^2+7\)</span>, <span class="math">\(n^2+9\)</span>, <span class="math">\(n^2+13\)</span>, и <span class="math">\(n^2+27\)</span> будут последовательными простыми&nbsp;числами.</p><script type="text/javascript">if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) {
var mathjaxscript = document.createElement('script');
mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#';
mathjaxscript.type = 'text/javascript';
mathjaxscript.src = '//cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML';
mathjaxscript[(window.opera ? "innerHTML" : "text")] =
"MathJax.Hub.Config({" +
" config: ['MMLorHTML.js']," +
" TeX: { extensions: ['AMSmath.js','AMSsymbols.js','noErrors.js','noUndefined.js'], equationNumbers: { autoNumber: 'AMS' } }," +
" jax: ['input/TeX','input/MathML','output/HTML-CSS']," +
" extensions: ['tex2jax.js','mml2jax.js','MathMenu.js','MathZoom.js']," +
" displayAlign: 'center'," +
" displayIndent: '0em'," +
" showMathMenu: true," +
" tex2jax: { " +
" inlineMath: [ ['\\\\(','\\\\)'] ], " +
" displayMath: [ ['$$','$$'] ]," +
" processEscapes: true," +
" preview: 'TeX'," +
" }, " +
" 'HTML-CSS': { " +
" styles: { '.MathJax_Display, .MathJax .mo, .MathJax .mi, .MathJax .mn': {color: 'black ! important'} }" +
" } " +
"}); ";
(document.body || document.getElementsByTagName('head')[0]).appendChild(mathjaxscript);
}
</script></section></article></li><hr><li><article class="post-entry"><header class="entry-header"><time class="post-time" datetime="2015-08-02T17:40:00+03:00" pubdate> Вс 02 Август 2015 </time><a href="../posts/crossgen-v10/" rel="bookmark"><h1>CrossGen&nbsp;v1.0</h1></a></header><section class="post-content"><p>Читая хабр, случайно натолкнулся на идею сделать программу, которая по заданной кроссвордной сетке находит способ её заполнить. В этом посте вкратце напишу про моё решение и первую версию&nbsp;приложения.</p></section></article></li><hr><li><article class="post-entry"><header class="entry-header"><time class="post-time" datetime="2015-07-17T17:40:00+03:00" pubdate> Пт 17 Июль 2015 </time><a href="../posts/moio-reshenie-zadachi-60/" rel="bookmark"><h1>Моё решение задачи&nbsp;60</h1></a></header><section class="post-content"><p>Краткое условие: необходимо найти множество из пяти простых чисел с минимальной суммой такое, что после &#8220;склеивания&#8221; в любом порядке любых двух чисел из него тоже будет простое&nbsp;число.</p></section></article></li><hr></ol><div class="paginator"> Page 1 / 1 </div></div></div><script>
var _gaq=[['_setAccount','UA-62001537-1'],['_trackPageview']]; var _gaq=[['_setAccount','UA-62001537-1'],['_trackPageview']];
(function(d,t){var g=d.createElement(t),s=d.getElementsByTagName(t)[0]; (function(d,t){var g=d.createElement(t),s=d.getElementsByTagName(t)[0];
g.src=('https:'==location.protocol?'//ssl':'//www')+'.google-analytics.com/ga.js'; g.src=('https:'==location.protocol?'//ssl':'//www')+'.google-analytics.com/ga.js';

BIN
tag/c.html.gz
View File

Binary file not shown.

35
tag/flint.html Normal file
View File

@@ -0,0 +1,35 @@
<!DOCTYPE html>
<!--[if lt IE 7]> <html class="no-js lt-ie9 lt-ie8 lt-ie7"> <![endif]--><!--[if IE 7]> <html class="no-js lt-ie9 lt-ie8"> <![endif]--><!--[if IE 8]> <html class="no-js lt-ie9"> <![endif]--><!--[if gt IE 8]><!--><html class="no-js"> <head><meta charset="utf-8"><meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"><title>Блог 529 - FLINT</title><meta name="description" content><meta name="viewport" content="width=device-width"><link rel="stylesheet" href="../theme/css/normalize.css"><link href="http://fonts.googleapis.com/css?family=Philosopher&subset=latin,cyrillic" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Forum&subset=cyrillic" rel="stylesheet" type="text/css"><link href="//fonts.googleapis.com/css?family=Oswald" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Ubuntu+Mono" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=PT+Sans" rel="stylesheet" type="text/css"><link rel="stylesheet" href="../theme/css/font-awesome.min.css"><link rel="stylesheet" href="../theme/css/main.css"><link rel="stylesheet" href="../theme/css/blog.css"><link rel="stylesheet" href="../theme/css/github.css"><link href="http://likemath.ru/feeds/all.atom.xml" type="application/atom+xml" rel="alternate" title="Блог 529 Atom Feed"><link href="http://likemath.ru/feeds/all.rss.xml" type="application/rss+xml" rel="alternate" title="Блог 529 RSS Feed"><script src="../theme/js/vendor/modernizr-2.6.2.min.js"></script></head><body><!--[if lt IE 7]>
<p class="chromeframe">You are using an <strong>outdated</strong> browser. Please <a href="http://browsehappy.com/">upgrade your browser</a> or <a href="http://www.google.com/chromeframe/?redirect=true">activate Google Chrome Frame</a> to improve your experience.</p>
<![endif]--><div id="wrapper"><header id="sidebar" class="side-shadow"><hgroup id="site-header"><a id="site-title" href=".."><h2><i class="icon-coffee"></i> Блог 529</h2></a><p id="site-desc"> Project Euler и остальное </p></hgroup><nav><ul id="nav-links"><li><a href="../">Главная</a></li><li><a href="../pages/projects.html">Мои проекты</a></li><li><a href="../pages/about.html">Об авторе</a></li><li><a href="../feeds/feed.atom.xml">Atom feed</a></li></ul></nav><footer id="site-info"><p> Powered by Pelican. </p></footer></header><div id="post-container"><ol id="post-list"><li><article class="post-entry"><header class="entry-header"><time class="post-time" datetime="2016-10-21T17:40:00+03:00" pubdate> Пт 21 Октябрь 2016 </time><a href="../posts/moio-reshenie-zadachi-146/" rel="bookmark"><h1>Моё решение задачи&nbsp;146</h1></a></header><section class="post-content"><p>Краткое условие: необходимо найти сумму всех натуральных <span class="math">\(n\)</span>, что <span class="math">\(n^2+1\)</span>, <span class="math">\(n^2+3\)</span>, <span class="math">\(n^2+7\)</span>, <span class="math">\(n^2+9\)</span>, <span class="math">\(n^2+13\)</span>, и <span class="math">\(n^2+27\)</span> будут последовательными простыми&nbsp;числами.</p><script type="text/javascript">if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) {
var mathjaxscript = document.createElement('script');
mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#';
mathjaxscript.type = 'text/javascript';
mathjaxscript.src = '//cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML';
mathjaxscript[(window.opera ? "innerHTML" : "text")] =
"MathJax.Hub.Config({" +
" config: ['MMLorHTML.js']," +
" TeX: { extensions: ['AMSmath.js','AMSsymbols.js','noErrors.js','noUndefined.js'], equationNumbers: { autoNumber: 'AMS' } }," +
" jax: ['input/TeX','input/MathML','output/HTML-CSS']," +
" extensions: ['tex2jax.js','mml2jax.js','MathMenu.js','MathZoom.js']," +
" displayAlign: 'center'," +
" displayIndent: '0em'," +
" showMathMenu: true," +
" tex2jax: { " +
" inlineMath: [ ['\\\\(','\\\\)'] ], " +
" displayMath: [ ['$$','$$'] ]," +
" processEscapes: true," +
" preview: 'TeX'," +
" }, " +
" 'HTML-CSS': { " +
" styles: { '.MathJax_Display, .MathJax .mo, .MathJax .mi, .MathJax .mn': {color: 'black ! important'} }" +
" } " +
"}); ";
(document.body || document.getElementsByTagName('head')[0]).appendChild(mathjaxscript);
}
</script></section></article></li><hr></ol><div class="paginator"> Page 1 / 1 </div></div></div><script>
var _gaq=[['_setAccount','UA-62001537-1'],['_trackPageview']];
(function(d,t){var g=d.createElement(t),s=d.getElementsByTagName(t)[0];
g.src=('https:'==location.protocol?'//ssl':'//www')+'.google-analytics.com/ga.js';
s.parentNode.insertBefore(g,s)}(document,'script'));
</script><script src="../theme/js/main.js"></script></body></html>

BIN
tag/flint.html.gz Normal file
View File

Binary file not shown.

28
tag/project-euler.html
View File

@@ -1,7 +1,33 @@
<!DOCTYPE html> <!DOCTYPE html>
<!--[if lt IE 7]> <html class="no-js lt-ie9 lt-ie8 lt-ie7"> <![endif]--><!--[if IE 7]> <html class="no-js lt-ie9 lt-ie8"> <![endif]--><!--[if IE 8]> <html class="no-js lt-ie9"> <![endif]--><!--[if gt IE 8]><!--><html class="no-js"> <head><meta charset="utf-8"><meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"><title>Блог 529 - Project Euler</title><meta name="description" content><meta name="viewport" content="width=device-width"><link rel="stylesheet" href="../theme/css/normalize.css"><link href="http://fonts.googleapis.com/css?family=Philosopher&subset=latin,cyrillic" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Forum&subset=cyrillic" rel="stylesheet" type="text/css"><link href="//fonts.googleapis.com/css?family=Oswald" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Ubuntu+Mono" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=PT+Sans" rel="stylesheet" type="text/css"><link rel="stylesheet" href="../theme/css/font-awesome.min.css"><link rel="stylesheet" href="../theme/css/main.css"><link rel="stylesheet" href="../theme/css/blog.css"><link rel="stylesheet" href="../theme/css/github.css"><link href="http://likemath.ru/feeds/all.atom.xml" type="application/atom+xml" rel="alternate" title="Блог 529 Atom Feed"><link href="http://likemath.ru/feeds/all.rss.xml" type="application/rss+xml" rel="alternate" title="Блог 529 RSS Feed"><script src="../theme/js/vendor/modernizr-2.6.2.min.js"></script></head><body><!--[if lt IE 7]> <!--[if lt IE 7]> <html class="no-js lt-ie9 lt-ie8 lt-ie7"> <![endif]--><!--[if IE 7]> <html class="no-js lt-ie9 lt-ie8"> <![endif]--><!--[if IE 8]> <html class="no-js lt-ie9"> <![endif]--><!--[if gt IE 8]><!--><html class="no-js"> <head><meta charset="utf-8"><meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"><title>Блог 529 - Project Euler</title><meta name="description" content><meta name="viewport" content="width=device-width"><link rel="stylesheet" href="../theme/css/normalize.css"><link href="http://fonts.googleapis.com/css?family=Philosopher&subset=latin,cyrillic" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Forum&subset=cyrillic" rel="stylesheet" type="text/css"><link href="//fonts.googleapis.com/css?family=Oswald" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Ubuntu+Mono" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=PT+Sans" rel="stylesheet" type="text/css"><link rel="stylesheet" href="../theme/css/font-awesome.min.css"><link rel="stylesheet" href="../theme/css/main.css"><link rel="stylesheet" href="../theme/css/blog.css"><link rel="stylesheet" href="../theme/css/github.css"><link href="http://likemath.ru/feeds/all.atom.xml" type="application/atom+xml" rel="alternate" title="Блог 529 Atom Feed"><link href="http://likemath.ru/feeds/all.rss.xml" type="application/rss+xml" rel="alternate" title="Блог 529 RSS Feed"><script src="../theme/js/vendor/modernizr-2.6.2.min.js"></script></head><body><!--[if lt IE 7]>
<p class="chromeframe">You are using an <strong>outdated</strong> browser. Please <a href="http://browsehappy.com/">upgrade your browser</a> or <a href="http://www.google.com/chromeframe/?redirect=true">activate Google Chrome Frame</a> to improve your experience.</p> <p class="chromeframe">You are using an <strong>outdated</strong> browser. Please <a href="http://browsehappy.com/">upgrade your browser</a> or <a href="http://www.google.com/chromeframe/?redirect=true">activate Google Chrome Frame</a> to improve your experience.</p>
<![endif]--><div id="wrapper"><header id="sidebar" class="side-shadow"><hgroup id="site-header"><a id="site-title" href=".."><h2><i class="icon-coffee"></i> Блог 529</h2></a><p id="site-desc"> Project Euler и остальное </p></hgroup><nav><ul id="nav-links"><li><a href="../">Главная</a></li><li><a href="../pages/projects.html">Мои проекты</a></li><li><a href="../pages/about.html">Об авторе</a></li><li><a href="../feeds/feed.atom.xml">Atom feed</a></li></ul></nav><footer id="site-info"><p> Powered by Pelican. </p></footer></header><div id="post-container"><ol id="post-list"><li><article class="post-entry"><header class="entry-header"><time class="post-time" datetime="2015-07-17T17:40:00+03:00" pubdate> Пт 17 Июль 2015 </time><a href="../posts/moio-reshenie-zadachi-60/" rel="bookmark"><h1>Моё решение задачи&nbsp;60</h1></a></header><section class="post-content"><p>Краткое условие: необходимо найти множество из пяти простых чисел с минимальной суммой такое, что после &#8220;склеивания&#8221; в любом порядке любых двух чисел из него тоже будет простое&nbsp;число.</p></section></article></li><hr></ol><div class="paginator"> Page 1 / 1 </div></div></div><script> <![endif]--><div id="wrapper"><header id="sidebar" class="side-shadow"><hgroup id="site-header"><a id="site-title" href=".."><h2><i class="icon-coffee"></i> Блог 529</h2></a><p id="site-desc"> Project Euler и остальное </p></hgroup><nav><ul id="nav-links"><li><a href="../">Главная</a></li><li><a href="../pages/projects.html">Мои проекты</a></li><li><a href="../pages/about.html">Об авторе</a></li><li><a href="../feeds/feed.atom.xml">Atom feed</a></li></ul></nav><footer id="site-info"><p> Powered by Pelican. </p></footer></header><div id="post-container"><ol id="post-list"><li><article class="post-entry"><header class="entry-header"><time class="post-time" datetime="2016-10-21T17:40:00+03:00" pubdate> Пт 21 Октябрь 2016 </time><a href="../posts/moio-reshenie-zadachi-146/" rel="bookmark"><h1>Моё решение задачи&nbsp;146</h1></a></header><section class="post-content"><p>Краткое условие: необходимо найти сумму всех натуральных <span class="math">\(n\)</span>, что <span class="math">\(n^2+1\)</span>, <span class="math">\(n^2+3\)</span>, <span class="math">\(n^2+7\)</span>, <span class="math">\(n^2+9\)</span>, <span class="math">\(n^2+13\)</span>, и <span class="math">\(n^2+27\)</span> будут последовательными простыми&nbsp;числами.</p><script type="text/javascript">if (!document.getElementById('mathjaxscript_pelican_#%@#$@#')) {
var mathjaxscript = document.createElement('script');
mathjaxscript.id = 'mathjaxscript_pelican_#%@#$@#';
mathjaxscript.type = 'text/javascript';
mathjaxscript.src = '//cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML';
mathjaxscript[(window.opera ? "innerHTML" : "text")] =
"MathJax.Hub.Config({" +
" config: ['MMLorHTML.js']," +
" TeX: { extensions: ['AMSmath.js','AMSsymbols.js','noErrors.js','noUndefined.js'], equationNumbers: { autoNumber: 'AMS' } }," +
" jax: ['input/TeX','input/MathML','output/HTML-CSS']," +
" extensions: ['tex2jax.js','mml2jax.js','MathMenu.js','MathZoom.js']," +
" displayAlign: 'center'," +
" displayIndent: '0em'," +
" showMathMenu: true," +
" tex2jax: { " +
" inlineMath: [ ['\\\\(','\\\\)'] ], " +
" displayMath: [ ['$$','$$'] ]," +
" processEscapes: true," +
" preview: 'TeX'," +
" }, " +
" 'HTML-CSS': { " +
" styles: { '.MathJax_Display, .MathJax .mo, .MathJax .mi, .MathJax .mn': {color: 'black ! important'} }" +
" } " +
"}); ";
(document.body || document.getElementsByTagName('head')[0]).appendChild(mathjaxscript);
}
</script></section></article></li><hr><li><article class="post-entry"><header class="entry-header"><time class="post-time" datetime="2015-07-17T17:40:00+03:00" pubdate> Пт 17 Июль 2015 </time><a href="../posts/moio-reshenie-zadachi-60/" rel="bookmark"><h1>Моё решение задачи&nbsp;60</h1></a></header><section class="post-content"><p>Краткое условие: необходимо найти множество из пяти простых чисел с минимальной суммой такое, что после &#8220;склеивания&#8221; в любом порядке любых двух чисел из него тоже будет простое&nbsp;число.</p></section></article></li><hr></ol><div class="paginator"> Page 1 / 1 </div></div></div><script>
var _gaq=[['_setAccount','UA-62001537-1'],['_trackPageview']]; var _gaq=[['_setAccount','UA-62001537-1'],['_trackPageview']];
(function(d,t){var g=d.createElement(t),s=d.getElementsByTagName(t)[0]; (function(d,t){var g=d.createElement(t),s=d.getElementsByTagName(t)[0];
g.src=('https:'==location.protocol?'//ssl':'//www')+'.google-analytics.com/ga.js'; g.src=('https:'==location.protocol?'//ssl':'//www')+'.google-analytics.com/ga.js';

BIN
tag/project-euler.html.gz
View File

Binary file not shown.

2
tags.html
View File

@@ -1,7 +1,7 @@
<!DOCTYPE html> <!DOCTYPE html>
<!--[if lt IE 7]> <html class="no-js lt-ie9 lt-ie8 lt-ie7"> <![endif]--><!--[if IE 7]> <html class="no-js lt-ie9 lt-ie8"> <![endif]--><!--[if IE 8]> <html class="no-js lt-ie9"> <![endif]--><!--[if gt IE 8]><!--><html class="no-js"> <head><meta charset="utf-8"><meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"><title>Блог 529 - Tags</title><meta name="description" content><meta name="viewport" content="width=device-width"><link rel="stylesheet" href="./theme/css/normalize.css"><link href="http://fonts.googleapis.com/css?family=Philosopher&subset=latin,cyrillic" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Forum&subset=cyrillic" rel="stylesheet" type="text/css"><link href="//fonts.googleapis.com/css?family=Oswald" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Ubuntu+Mono" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=PT+Sans" rel="stylesheet" type="text/css"><link rel="stylesheet" href="./theme/css/font-awesome.min.css"><link rel="stylesheet" href="./theme/css/main.css"><link href="http://likemath.ru/feeds/all.atom.xml" type="application/atom+xml" rel="alternate" title="Блог 529 Atom Feed"><link href="http://likemath.ru/feeds/all.rss.xml" type="application/rss+xml" rel="alternate" title="Блог 529 RSS Feed"><script src="./theme/js/vendor/modernizr-2.6.2.min.js"></script></head><body><!--[if lt IE 7]> <!--[if lt IE 7]> <html class="no-js lt-ie9 lt-ie8 lt-ie7"> <![endif]--><!--[if IE 7]> <html class="no-js lt-ie9 lt-ie8"> <![endif]--><!--[if IE 8]> <html class="no-js lt-ie9"> <![endif]--><!--[if gt IE 8]><!--><html class="no-js"> <head><meta charset="utf-8"><meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"><title>Блог 529 - Tags</title><meta name="description" content><meta name="viewport" content="width=device-width"><link rel="stylesheet" href="./theme/css/normalize.css"><link href="http://fonts.googleapis.com/css?family=Philosopher&subset=latin,cyrillic" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Forum&subset=cyrillic" rel="stylesheet" type="text/css"><link href="//fonts.googleapis.com/css?family=Oswald" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=Ubuntu+Mono" rel="stylesheet" type="text/css"><link href="http://fonts.googleapis.com/css?family=PT+Sans" rel="stylesheet" type="text/css"><link rel="stylesheet" href="./theme/css/font-awesome.min.css"><link rel="stylesheet" href="./theme/css/main.css"><link href="http://likemath.ru/feeds/all.atom.xml" type="application/atom+xml" rel="alternate" title="Блог 529 Atom Feed"><link href="http://likemath.ru/feeds/all.rss.xml" type="application/rss+xml" rel="alternate" title="Блог 529 RSS Feed"><script src="./theme/js/vendor/modernizr-2.6.2.min.js"></script></head><body><!--[if lt IE 7]>
<p class="chromeframe">You are using an <strong>outdated</strong> browser. Please <a href="http://browsehappy.com/">upgrade your browser</a> or <a href="http://www.google.com/chromeframe/?redirect=true">activate Google Chrome Frame</a> to improve your experience.</p> <p class="chromeframe">You are using an <strong>outdated</strong> browser. Please <a href="http://browsehappy.com/">upgrade your browser</a> or <a href="http://www.google.com/chromeframe/?redirect=true">activate Google Chrome Frame</a> to improve your experience.</p>
<![endif]--><div id="wrapper"><h1>Tags for Блог 529</h1> <li><a href="./tag/bgl.html">BGL</a> (1)</li><li><a href="./tag/blog.html">блог</a> (1)</li><li><a href="./tag/bot.html">бот</a> (1)</li><li><a href="./tag/c.html">c++</a> (2)</li><li><a href="./tag/go.html">Go</a> (1)</li><li><a href="./tag/matematika.html">математика</a> (1)</li><li><a href="./tag/open-source.html">open source</a> (1)</li><li><a href="./tag/proekt.html">проект</a> (3)</li><li><a href="./tag/project-euler.html">Project Euler</a> (1)</li><li><a href="./tag/shakhmaty.html">шахматы</a> (1)</li><li><a href="./tag/wallabag.html">wallabag</a> (1)</li><li><a href="./tag/wxwidgets.html">wxWidgets</a> (1)</li></div><script> <![endif]--><div id="wrapper"><h1>Tags for Блог 529</h1> <li><a href="./tag/bgl.html">BGL</a> (1)</li><li><a href="./tag/blog.html">блог</a> (1)</li><li><a href="./tag/bot.html">бот</a> (1)</li><li><a href="./tag/c.html">c++</a> (3)</li><li><a href="./tag/flint.html">FLINT</a> (1)</li><li><a href="./tag/go.html">Go</a> (1)</li><li><a href="./tag/matematika.html">математика</a> (1)</li><li><a href="./tag/open-source.html">open source</a> (1)</li><li><a href="./tag/proekt.html">проект</a> (3)</li><li><a href="./tag/project-euler.html">Project Euler</a> (2)</li><li><a href="./tag/shakhmaty.html">шахматы</a> (1)</li><li><a href="./tag/wallabag.html">wallabag</a> (1)</li><li><a href="./tag/wxwidgets.html">wxWidgets</a> (1)</li></div><script>
var _gaq=[['_setAccount','UA-62001537-1'],['_trackPageview']]; var _gaq=[['_setAccount','UA-62001537-1'],['_trackPageview']];
(function(d,t){var g=d.createElement(t),s=d.getElementsByTagName(t)[0]; (function(d,t){var g=d.createElement(t),s=d.getElementsByTagName(t)[0];
g.src=('https:'==location.protocol?'//ssl':'//www')+'.google-analytics.com/ga.js'; g.src=('https:'==location.protocol?'//ssl':'//www')+'.google-analytics.com/ga.js';

BIN
tags.html.gz
View File

Binary file not shown.