<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[som_nico的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/som_nico</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; som_nico]]></copyright><item><title><![CDATA[stl中stack]]></title><link>https://blog.youkuaiyun.com/som_nico/article/details/79211129</link><guid>https://blog.youkuaiyun.com/som_nico/article/details/79211129</guid><author>som_nico</author><pubDate>Tue, 30 Jan 2018 21:44:12 +0800</pubDate><description><![CDATA[stackst;//栈先出后进，不能被遍历，没有迭代器
st.top();//引用栈定元素
st.pop();//出栈
st.push();//入栈
st.empty();//栈是否为空
st.size();//栈元素所少个]]></description><category></category></item><item><title><![CDATA[#include<bits/stdc++.h>]]></title><link>https://blog.youkuaiyun.com/som_nico/article/details/79163656</link><guid>https://blog.youkuaiyun.com/som_nico/article/details/79163656</guid><author>som_nico</author><pubDate>Thu, 25 Jan 2018 16:35:37 +0800</pubDate><description><![CDATA[#include这个头文件包含以下等等C++中包含的所有头文件： 

#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  


等等…]]></description><category></category></item><item><title><![CDATA[线段树模板及习题]]></title><link>https://blog.youkuaiyun.com/som_nico/article/details/78157552</link><guid>https://blog.youkuaiyun.com/som_nico/article/details/78157552</guid><author>som_nico</author><pubDate>Wed, 04 Oct 2017 10:56:48 +0800</pubDate><description><![CDATA[#include 
#include 
#define lid (id << 1)
#define rid (id << 1 | 1)

using namespace std;

const int N=100005;
struct node
{
    int l,r;
    long long sum;
}tr[N * 4];
int a[N];

void push_up(int id)]]></description><category></category></item><item><title><![CDATA[HD4268 - Alice and Bob]]></title><link>https://blog.youkuaiyun.com/som_nico/article/details/77920491</link><guid>https://blog.youkuaiyun.com/som_nico/article/details/77920491</guid><author>som_nico</author><pubDate>Sun, 10 Sep 2017 10:17:38 +0800</pubDate><description><![CDATA[Alice and Bob
Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5010    Accepted Submission(s): 1577



Problem Description
Alice and Bob]]></description><category></category></item><item><title><![CDATA[HDOJ5047-Sawtooth]]></title><link>https://blog.youkuaiyun.com/som_nico/article/details/76886346</link><guid>https://blog.youkuaiyun.com/som_nico/article/details/76886346</guid><author>som_nico</author><pubDate>Tue, 08 Aug 2017 10:29:04 +0800</pubDate><description><![CDATA[Sawtooth


Problem Description
Think about a plane:

● One straight line can divide a plane into two regions.
● Two lines can divide a plane into at most four regions.
● Three lines can divide]]></description><category></category></item><item><title><![CDATA[并查集专栏]]></title><link>https://blog.youkuaiyun.com/som_nico/article/details/76828109</link><guid>https://blog.youkuaiyun.com/som_nico/article/details/76828109</guid><author>som_nico</author><pubDate>Mon, 07 Aug 2017 11:44:24 +0800</pubDate><description><![CDATA[How Many Tables（hd 1213）




Today is Ignatius'birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants toknow how many tables he needs at least. You have to notice that not al]]></description><category></category></item><item><title><![CDATA[计蒜客-单独的数字]]></title><link>https://blog.youkuaiyun.com/som_nico/article/details/76826854</link><guid>https://blog.youkuaiyun.com/som_nico/article/details/76826854</guid><author>som_nico</author><pubDate>Mon, 07 Aug 2017 11:31:51 +0800</pubDate><description><![CDATA[单独的数字
给定一个数组 AAA，除了一个数出现一次之外，其余数都出现三次。找出出现一次的数。
如：{1,2,1,2,1,2,7}\{1, 2, 1, 2, 1,2, 7\}{1,2,1,2,1,2,7}，找出 777。
你的算法只能是线性时间的复杂度，并且不能使用额外的空间哦～
输入格式
第一行输入一个数 n(1≤n≤500)n(1 \leq n \leq500)n(1≤n≤500)，]]></description><category></category></item><item><title><![CDATA[CF770-B-Maximize Sum of Digits]]></title><link>https://blog.youkuaiyun.com/som_nico/article/details/72791655</link><guid>https://blog.youkuaiyun.com/som_nico/article/details/72791655</guid><author>som_nico</author><pubDate>Sun, 28 May 2017 11:09:28 +0800</pubDate><description><![CDATA[B. Maximize Sum of Digits


time limit per test
1 second


memory limit per test
256 megabytes


input
standard input


output
standard output



Anton has the integer x. He is int]]></description><category></category></item><item><title><![CDATA[HD6015 Skip the Class]]></title><link>https://blog.youkuaiyun.com/som_nico/article/details/72773008</link><guid>https://blog.youkuaiyun.com/som_nico/article/details/72773008</guid><author>som_nico</author><pubDate>Fri, 26 May 2017 19:35:48 +0800</pubDate><description><![CDATA[Skip the Class
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1078    Accepted Submission(s): 625



Problem Description

Finally term]]></description><category></category></item><item><title><![CDATA[HD2094产生冠军]]></title><link>https://blog.youkuaiyun.com/som_nico/article/details/72701028</link><guid>https://blog.youkuaiyun.com/som_nico/article/details/72701028</guid><author>som_nico</author><pubDate>Wed, 24 May 2017 19:29:58 +0800</pubDate><description><![CDATA[F -
产生冠军
 有一群人，打乒乓球比赛，两两捉对撕杀，每两个人之间最多打一场比赛。 
球赛的规则如下： 
如果A打败了B，B又打败了C，而A与C之间没有进行过比赛，那么就认定，A一定能打败C。 
如果A打败了B，B又打败了C，而且，C又打败了A，那么A、B、C三者都不可能成为冠军。 
根据这个规则，无需循环较量，或许就能确定冠军。你的任务就是面对一群比赛选手，在经过了若干场撕杀之后]]></description><category></category></item><item><title><![CDATA[HD6019MG loves gold]]></title><link>https://blog.youkuaiyun.com/som_nico/article/details/72667239</link><guid>https://blog.youkuaiyun.com/som_nico/article/details/72667239</guid><author>som_nico</author><pubDate>Tue, 23 May 2017 21:04:33 +0800</pubDate><description><![CDATA[MGloves gold
Time Limit: 3000/1500 MS (Java/Others)    MemoryLimit: 262144/262144 K (Java/Others)
Total Submission(s): 969    Accepted Submission(s): 416



Problem Description
MGis a lucky boy]]></description><category></category></item><item><title><![CDATA[Maximal GCD]]></title><link>https://blog.youkuaiyun.com/som_nico/article/details/72594052</link><guid>https://blog.youkuaiyun.com/som_nico/article/details/72594052</guid><author>som_nico</author><pubDate>Sun, 21 May 2017 09:42:18 +0800</pubDate><description><![CDATA[C. Maximal GCD
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
You are given positive integer number n. You shouldcreate such stri]]></description><category></category></item><item><title><![CDATA[开灯问题]]></title><link>https://blog.youkuaiyun.com/som_nico/article/details/72571140</link><guid>https://blog.youkuaiyun.com/som_nico/article/details/72571140</guid><author>som_nico</author><pubDate>Sat, 20 May 2017 10:52:01 +0800</pubDate><description><![CDATA[Problem M: Turn on and Turn off the lights
Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 102  Solved: 32
[Submit][Status][Web
 Board]

Description

有N盏灯,编号为 1 ～ n .第一个人把所有灯打开,第二个人按下所有编号为2的倍数]]></description><category></category></item><item><title><![CDATA[数字1的数量]]></title><link>https://blog.youkuaiyun.com/som_nico/article/details/71882937</link><guid>https://blog.youkuaiyun.com/som_nico/article/details/71882937</guid><author>som_nico</author><pubDate>Sat, 13 May 2017 19:49:59 +0800</pubDate><description><![CDATA[数字1的数量

给定一个十进制正整数N，写下从1开始，到N的所有正数，计算出其中出现所有1的个数。

例如：n = 12，包含了5个1。1,10,12共包含3个1，11包含2个1，总共5个1。


Input输入N(1 
Output输出包含1的个数
Sample Input
12

Sample Output
5
题意：。
思路：（水题思想肯定超时，然后以为会是有规]]></description><category></category></item><item><title><![CDATA[CF 467A-George and Accommodation]]></title><link>https://blog.youkuaiyun.com/som_nico/article/details/71837768</link><guid>https://blog.youkuaiyun.com/som_nico/article/details/71837768</guid><author>som_nico</author><pubDate>Sat, 13 May 2017 16:27:55 +0800</pubDate><description><![CDATA[CF 467A
A. George and Accommodation


time limit per test
1 second


memory limit per test
256 megabytes


input
standard input


output
standard output



George has recently ent]]></description><category></category></item><item><title><![CDATA[CF 546A-Soldier and Bananas]]></title><link>https://blog.youkuaiyun.com/som_nico/article/details/71835619</link><guid>https://blog.youkuaiyun.com/som_nico/article/details/71835619</guid><author>som_nico</author><pubDate>Sat, 13 May 2017 16:16:48 +0800</pubDate><description><![CDATA[A. Soldier and Bananas


time limit per test
1 second


memory limit per test
256 megabytes


input
standard input


output
standard output



A soldier wants to buy w bananas in t]]></description><category></category></item><item><title><![CDATA[Pseudoprime numbers]]></title><link>https://blog.youkuaiyun.com/som_nico/article/details/71792389</link><guid>https://blog.youkuaiyun.com/som_nico/article/details/71792389</guid><author>som_nico</author><pubDate>Sat, 13 May 2017 11:45:28 +0800</pubDate><description><![CDATA[POJ - 3641 



Fermat's theorem states that for any prime number p and for any integer a > 1, ap =a (mod p). That is, if we raise a to the pth power and divide by p, the remainder
 isa. Some (but]]></description><category></category></item></channel></rss>