<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[nare123的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/nare123</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; nare123]]></copyright><item><title><![CDATA[Tensorflow 写构建神经网络]]></title><link>https://blog.youkuaiyun.com/nare123/article/details/80725441</link><guid>https://blog.youkuaiyun.com/nare123/article/details/80725441</guid><author>nare123</author><pubDate>Mon, 18 Jun 2018 17:59:31 +0800</pubDate><description><![CDATA[转自：https://blog.youkuaiyun.com/roseki/article/details/70171684

import tensorflow as tf
import numpy as np
learning_rate = 0.01 #学习速率
batch_size = 16      #输入数据个数
epoch_step = 10000   # 遍历总数
display_step = ...]]></description><category></category></item><item><title><![CDATA[hihocoder #1033 : 交错和 (数位dp)]]></title><link>https://blog.youkuaiyun.com/nare123/article/details/79344785</link><guid>https://blog.youkuaiyun.com/nare123/article/details/79344785</guid><author>nare123</author><pubDate>Wed, 21 Feb 2018 23:24:54 +0800</pubDate><description><![CDATA[1033 : 交错和

时间限制:10000ms 
单点时限:1000ms 
内存限制:256MB 
描述 
给定一个数 x，设它十进制展从高位到低位上的数位依次是 a0, a1, …, an - 1，定义交错和函数：

f(x) = a0 - a1 + a2 - … + ( - 1)n - 1an - 1

例如：

f(3214567) = 3 - 2 + 1 - 4 + 5 - 6 + 7 ...]]></description><category></category></item><item><title><![CDATA[AtCoder Regular Contest 090 D - People on a Line]]></title><link>https://blog.youkuaiyun.com/nare123/article/details/79315268</link><guid>https://blog.youkuaiyun.com/nare123/article/details/79315268</guid><author>nare123</author><pubDate>Mon, 12 Feb 2018 10:47:52 +0800</pubDate><description><![CDATA[Problem Statement 
There are N people standing on the x-axis. Let the coordinate of Person i be xi. For every i, xi is an integer between 0 and 109 (inclusive). It is possible that more than one perso...]]></description><category></category></item><item><title><![CDATA[BZOJ 1002：[FJOI2007] 轮状病毒 (基尔霍夫矩阵生成树定理)]]></title><link>https://blog.youkuaiyun.com/nare123/article/details/79286378</link><guid>https://blog.youkuaiyun.com/nare123/article/details/79286378</guid><author>nare123</author><pubDate>Thu, 08 Feb 2018 09:56:31 +0800</pubDate><description><![CDATA[　轮状病毒有很多变种，所有轮状病毒的变种都是从一个轮状基产生的。一个N轮状基由圆环上N个不同的基原子 
和圆心处一个核原子构成的，2个原子之间的边表示这2个原子之间的信息通道。如下图所示 


　　N轮状病毒的产生规律是在一个N轮状基中删去若干条边，使得各原子之间有唯一的信息通道，例如共有16个不 
同的3轮状病毒，如下图所示 


　　现给定n(N&amp;lt;=100)，编程计算有多少个不同的n轮状...]]></description><category></category></item><item><title><![CDATA[CodeForces  55D Beautiful numbers （数位dp）]]></title><link>https://blog.youkuaiyun.com/nare123/article/details/78279387</link><guid>https://blog.youkuaiyun.com/nare123/article/details/78279387</guid><author>nare123</author><pubDate>Wed, 18 Oct 2017 23:44:12 +0800</pubDate><description><![CDATA[D. Beautiful numbers 
time limit per test4 seconds 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
Volodya is an odd boy and his taste is strange as well. It seems to h]]></description><category></category></item><item><title><![CDATA[hdu 3652 B-number(数位dp)]]></title><link>https://blog.youkuaiyun.com/nare123/article/details/78276615</link><guid>https://blog.youkuaiyun.com/nare123/article/details/78276615</guid><author>nare123</author><pubDate>Wed, 18 Oct 2017 19:24:15 +0800</pubDate><description><![CDATA[B-numberTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) 
Total Submission(s): 7199    Accepted Submission(s): 4216Problem Description 
A wqb-number, or B-number for]]></description><category></category></item><item><title><![CDATA[hdu 3709 Balanced Number(数位dp)]]></title><link>https://blog.youkuaiyun.com/nare123/article/details/78276305</link><guid>https://blog.youkuaiyun.com/nare123/article/details/78276305</guid><author>nare123</author><pubDate>Wed, 18 Oct 2017 18:52:00 +0800</pubDate><description><![CDATA[Balanced NumberTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others) 
Total Submission(s): 6504    Accepted Submission(s): 3112Problem Description 
A balanced number is a]]></description><category></category></item><item><title><![CDATA[BZOJ 1026 (数位dp)]]></title><link>https://blog.youkuaiyun.com/nare123/article/details/78273481</link><guid>https://blog.youkuaiyun.com/nare123/article/details/78273481</guid><author>nare123</author><pubDate>Wed, 18 Oct 2017 15:32:28 +0800</pubDate><description><![CDATA[1026: [SCOI2009]windy数Time Limit: 1 Sec  Memory Limit: 162 MB 
Submit: 8505  Solved: 3834 
[Submit][Status][Discuss] 
Description　　windy定义了一种windy数。不含前导零且相邻两个数字之差至少为2的正整数被称为windy数。 windy想知道， 
在A和B之间，包括]]></description><category></category></item><item><title><![CDATA[hdu 3292 佩尔方程一系列操作]]></title><link>https://blog.youkuaiyun.com/nare123/article/details/77185192</link><guid>https://blog.youkuaiyun.com/nare123/article/details/77185192</guid><author>nare123</author><pubDate>Tue, 15 Aug 2017 11:00:22 +0800</pubDate><description><![CDATA[No more tricks, Mr NanguoTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others) 
Total Submission(s): 445    Accepted Submission(s): 294Problem Description 
Now Sailormoon]]></description><category></category></item><item><title><![CDATA[POJ 3243 Clever Y BSGS 算法 （模板）]]></title><link>https://blog.youkuaiyun.com/nare123/article/details/77148994</link><guid>https://blog.youkuaiyun.com/nare123/article/details/77148994</guid><author>nare123</author><pubDate>Sun, 13 Aug 2017 19:11:47 +0800</pubDate><description><![CDATA[Clever Y 
Time Limit: 5000MS      Memory Limit: 65536K 
Total Submissions: 8920     Accepted: 2222 
DescriptionLittle Y finds there is a very interesting formula in mathematics:XY mod Z = KGiven X, Y,]]></description><category></category></item><item><title><![CDATA[hdu 1695 GCD(容斥原理)]]></title><link>https://blog.youkuaiyun.com/nare123/article/details/76888349</link><guid>https://blog.youkuaiyun.com/nare123/article/details/76888349</guid><author>nare123</author><pubDate>Tue, 08 Aug 2017 11:02:45 +0800</pubDate><description><![CDATA[GCDTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) 
Total Submission(s): 12106    Accepted Submission(s): 4576Problem Description 
Given 5 integers: a, b, c, d, k, y]]></description><category></category></item><item><title><![CDATA[hdu 5668 中国剩余定理（模版）]]></title><link>https://blog.youkuaiyun.com/nare123/article/details/76855881</link><guid>https://blog.youkuaiyun.com/nare123/article/details/76855881</guid><author>nare123</author><pubDate>Mon, 07 Aug 2017 19:41:06 +0800</pubDate><description><![CDATA[CircleTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) 
Total Submission(s): 565    Accepted Submission(s): 190Problem Description 
    Satiya August is in charge of]]></description><category></category></item><item><title><![CDATA[hdu 5728 （公式推导+指数循环节）]]></title><link>https://blog.youkuaiyun.com/nare123/article/details/76691665</link><guid>https://blog.youkuaiyun.com/nare123/article/details/76691665</guid><author>nare123</author><pubDate>Fri, 04 Aug 2017 18:49:49 +0800</pubDate><description><![CDATA[PowModTime Limit: 3000/1500 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others) 
Total Submission(s): 1221    Accepted Submission(s): 428Problem Description 
Declare: 
k=∑（m，i=1）φ(i∗n) mod]]></description><category></category></item><item><title><![CDATA[Gym - 101350G (容斥原理)]]></title><link>https://blog.youkuaiyun.com/nare123/article/details/76495151</link><guid>https://blog.youkuaiyun.com/nare123/article/details/76495151</guid><author>nare123</author><pubDate>Tue, 01 Aug 2017 09:44:24 +0800</pubDate><description><![CDATA[G. Snake Rana 
time limit per test4.0 s 
memory limit per test256 MB 
inputstandard input 
outputstandard output 
Old Macdonald wants to build a new hen house for his hens. He buys a new rectangular ar]]></description><category></category></item><item><title><![CDATA[（多校） hdu  6035 Colorful Tree]]></title><link>https://blog.youkuaiyun.com/nare123/article/details/76263872</link><guid>https://blog.youkuaiyun.com/nare123/article/details/76263872</guid><author>nare123</author><pubDate>Fri, 28 Jul 2017 15:46:04 +0800</pubDate><description><![CDATA[Colorful TreeTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) 
Total Submission(s): 1741    Accepted Submission(s): 722Problem Description 
There is a tree with n n]]></description><category></category></item><item><title><![CDATA[(多校)hdu 6050 Funny Function]]></title><link>https://blog.youkuaiyun.com/nare123/article/details/76216570</link><guid>https://blog.youkuaiyun.com/nare123/article/details/76216570</guid><author>nare123</author><pubDate>Thu, 27 Jul 2017 19:27:05 +0800</pubDate><description><![CDATA[Funny Function

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) 
Total Submission(s): 142    Accepted Submission(s): 53

Problem Description 
Function Fx,ysatisfies]]></description><category></category></item><item><title><![CDATA[1010: [HNOI2008]玩具装箱toy 斜率优化]]></title><link>https://blog.youkuaiyun.com/nare123/article/details/72790092</link><guid>https://blog.youkuaiyun.com/nare123/article/details/72790092</guid><author>nare123</author><pubDate>Sun, 28 May 2017 09:42:07 +0800</pubDate><description><![CDATA[P教授要去看奥运，但是他舍不下他的玩具，于是他决定把所有的玩具运到北京。他使用自己的压缩器进行压 
缩，其可以将任意物品变成一堆，再放到一种特殊的一维容器中。P教授有编号为1…N的N件玩具，第i件玩具经过 
压缩后变成一维长度为Ci.为了方便整理，P教授要求在一个一维容器中的玩具编号是连续的。同时如果一个一维容 
器中有多个玩具，那么两件玩具之间要加入一个单位长度的填充物，形式地说如果将第i件玩具到]]></description><category></category></item><item><title><![CDATA[1597: [Usaco2008 Mar]土地购买 斜率优化]]></title><link>https://blog.youkuaiyun.com/nare123/article/details/72783834</link><guid>https://blog.youkuaiyun.com/nare123/article/details/72783834</guid><author>nare123</author><pubDate>Sat, 27 May 2017 21:20:13 +0800</pubDate><description><![CDATA[Description

农夫John准备扩大他的农场,他正在考虑N (1 <= N <= 50,000) 块长方形的土地. 每块土地的长宽满足(1 <= 宽 <= 1,000,000; 1 <= 长 <= 1,000,000). 每块土地的价格是它的面积,但FJ可以同时购买多快土地. 这些土地的价格是它们最大的长乘以它们最大的宽, 但是土地的长宽不能交换. 如果FJ买一块3x5的地和一块5x]]></description><category></category></item><item><title><![CDATA[HDU 5674 Function(斐波那契模数列循环节)]]></title><link>https://blog.youkuaiyun.com/nare123/article/details/71106858</link><guid>https://blog.youkuaiyun.com/nare123/article/details/71106858</guid><author>nare123</author><pubDate>Wed, 03 May 2017 09:25:57 +0800</pubDate><description><![CDATA[Problem Description 
There is a function  
f(n)=(a+√b)^n+(a−√b)^n. a and b are integers  
(1≤a,b≤1,000,000). 
Maybe the function looks complex but it is actually an integer.The question is to calculate]]></description><category></category></item><item><title><![CDATA[Educational Codeforces Round 18 C. Divide by Three]]></title><link>https://blog.youkuaiyun.com/nare123/article/details/68949808</link><guid>https://blog.youkuaiyun.com/nare123/article/details/68949808</guid><author>nare123</author><pubDate>Sun, 02 Apr 2017 00:31:46 +0800</pubDate><description><![CDATA[C. Divide by Three 
time limit per test1 second 
memory limit per test256 megabytes 
inputstandard input 
outputstandard output 
A positive integer number n is written on a blackboard. It consists of n]]></description><category></category></item></channel></rss>