<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Phoebe201421085的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Phoebe201421085</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Phoebe201421085]]></copyright><item><title><![CDATA[poj3320]]></title><link>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126893</link><guid>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126893</guid><author>Phoebe201421085</author><pubDate>Sun, 19 Apr 2015 10:17:26 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
# include 

using namespace std;

int a[1000005],p;
setint>com;
mapint,int>mp;

int main()                  /*尺取法*/
{   //freopen("in.txt","r",stdin);
    cin>>p;
    com]]></description><category></category></item><item><title><![CDATA[poj3278]]></title><link>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126859</link><guid>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126859</guid><author>Phoebe201421085</author><pubDate>Sun, 19 Apr 2015 10:16:41 +0800</pubDate><description><![CDATA[#include 
#include 

using namespace std;

long long  a[200020][2];
bool b[200020];

int main()
{  long long n,k,f,r,maxx=100000;
    cin>>n>>k;
    for (f=0;f200000;f++) b[f]=0;
    f=1;r=f;
    a[f]]]></description><category></category></item><item><title><![CDATA[poj3299]]></title><link>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126875</link><guid>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126875</guid><author>Phoebe201421085</author><pubDate>Sun, 19 Apr 2015 10:16:12 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;

double HH(double TT,double DD)
{
    double h,e;
    e=6.11*exp(5417.7530*((1/273.16)-(1/(DD+273.16))));
    h=0.5555*(e-10.0);
    return TT+h;
}

]]></description><category></category></item><item><title><![CDATA[poj3273]]></title><link>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126845</link><guid>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126845</guid><author>Phoebe201421085</author><pubDate>Sun, 19 Apr 2015 10:14:01 +0800</pubDate><description><![CDATA[#include 
#include 

using namespace std;

long long  n,m,a[100005];

long long   check(long long mid)
{
    long long total=0;
    long long s=0;
    for (int i=1;in;)
    {
        while (s+a[i]mid&]]></description><category></category></item><item><title><![CDATA[poj3258]]></title><link>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126803</link><guid>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126803</guid><author>Phoebe201421085</author><pubDate>Sun, 19 Apr 2015 10:11:24 +0800</pubDate><description><![CDATA[#include 
#include 
#include 

using namespace std;

long long rock[50005],l,n,m;

bool check(long long d)
{
    int total=0,i=1,j=1;
    while (in)
    {
        j=i+1;
        while (rock[j]-rock[i]]]></description><category></category></item><item><title><![CDATA[poj3122]]></title><link>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126777</link><guid>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126777</guid><author>Phoebe201421085</author><pubDate>Sun, 19 Apr 2015 10:09:03 +0800</pubDate><description><![CDATA[#include 
#include 
#include 

double pi=acos(-1.0),eps=1e-6;  /*pi的取值*/
int t;
long long pie[10005];

using namespace std;

bool div(double s,int n,int f)
{
    double nn=0;
    for (int i=1;in;i++) ]]></description><category></category></item><item><title><![CDATA[poj3094]]></title><link>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126767</link><guid>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126767</guid><author>Phoebe201421085</author><pubDate>Sun, 19 Apr 2015 10:04:59 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;

int main()
{   char a[300];
    int i,n;
    long long sum;
   // freopen("in.txt","r",stdin);
    gets(a);
    while (a[0]!='#')
    {
        sum=]]></description><category></category></item><item><title><![CDATA[poj3061]]></title><link>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126667</link><guid>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126667</guid><author>Phoebe201421085</author><pubDate>Sun, 19 Apr 2015 09:51:52 +0800</pubDate><description><![CDATA[#include 
#include 
#include 

using namespace std;

int a[100010];

int main()
{
   long long n,s,t,sum,ans;
    int left,right,i,j;
   // freopen("in.txt","r",stdin);
    cin>>t;
    for (j=1;jt;j++]]></description><category></category></item><item><title><![CDATA[poj3006]]></title><link>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126651</link><guid>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126651</guid><author>Phoebe201421085</author><pubDate>Sun, 19 Apr 2015 09:51:39 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;

int main()
{   bool a[1000005],p[1000005];
    int i,j,t,d,n;
    long long c;
   // freopen("in.txt","r",stdin);
    memset(a,true,sizeof(a));
    ]]></description><category></category></item><item><title><![CDATA[poj2996]]></title><link>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126643</link><guid>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126643</guid><author>Phoebe201421085</author><pubDate>Sun, 19 Apr 2015 09:48:51 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;

int main()
{   char chess[20][33],loca[65][4];
    int i,j,t;
   // freopen("in.txt","r",stdin);
    for (i=1;i17;i++)
        for (j=1;j33;j++) cin>>chess[i]]]></description><category></category></item><item><title><![CDATA[poj2993]]></title><link>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126621</link><guid>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126621</guid><author>Phoebe201421085</author><pubDate>Sun, 19 Apr 2015 09:48:08 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;

int main()
{   char chess[20][40],whi[20][5],bla[20][4];
    string color,white,black;
    int i,j,k,tw,tb,l;
    //freopen("in.txt","r",stdin);
   ]]></description><category></category></item><item><title><![CDATA[poj2965]]></title><link>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126583</link><guid>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126583</guid><author>Phoebe201421085</author><pubDate>Sun, 19 Apr 2015 09:39:03 +0800</pubDate><description><![CDATA[#include 
#include 

using namespace std;

struct game
{
    char p[4][4];
    char f[4][4];
    int n,i,j,up;
};
game dl[100000],a;

char fan(char kaig)
{
    if (kaig=='-') return '+';else return '-]]></description><category></category></item><item><title><![CDATA[poj2739]]></title><link>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126527</link><guid>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126527</guid><author>Phoebe201421085</author><pubDate>Sun, 19 Apr 2015 09:32:44 +0800</pubDate><description><![CDATA[#include 
#include 

using namespace std;

int main()
{   int a[10005],i,j,n,t;
    long long sum;
    //freopen("in.txt","r",stdin);
    for (i=1;i10005;i++) a[i]=1;
    a[1]=0;
    for (i=2;i10005;i]]></description><category></category></item><item><title><![CDATA[poj2833]]></title><link>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126555</link><guid>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126555</guid><author>Phoebe201421085</author><pubDate>Sun, 19 Apr 2015 09:32:29 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 

using namespace std;

long long  maxx[15],minx[15],total,r;
double avr;

int main()
{
    int n1,n2,n,i;
   // freopen("in.txt","r",stdin);
    while (1)
    {]]></description><category></category></item><item><title><![CDATA[poj2636]]></title><link>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126511</link><guid>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126511</guid><author>Phoebe201421085</author><pubDate>Sun, 19 Apr 2015 09:29:27 +0800</pubDate><description><![CDATA[#include 

using namespace std;

int main()
{   int n,k,m,i,j,tol;
    cin>>n;
    for (i=1;in;i++)
    {
        cin>>m;
        tol=1-m;
        for (j=1;jm;j++)
        {
            cin>>k;
      ]]></description><category></category></item><item><title><![CDATA[poj2635]]></title><link>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126463</link><guid>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126463</guid><author>Phoebe201421085</author><pubDate>Sun, 19 Apr 2015 09:26:53 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 

using namespace std;

int main()
{   char ss[110];
    bool pa[1000010];
    long long b;
    int a[110],i,j,g,l,s,judge,k;
   // freopen("in.txt","r",stdin);
]]></description><category></category></item><item><title><![CDATA[poj2488]]></title><link>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126439</link><guid>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126439</guid><author>Phoebe201421085</author><pubDate>Sun, 19 Apr 2015 09:18:57 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;

int step[900][2],a[30][30],p,q,bingo,n;
int dicy[8] = {-2,-2,-1,-1,1,1,2,2};
int dicx[8] = {-1,1,-2,2,-2,2,-1,1};

void print()
{  int i,j;
    for (i=1;ip;i+]]></description><category></category></item><item><title><![CDATA[poj2386]]></title><link>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126413</link><guid>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126413</guid><author>Phoebe201421085</author><pubDate>Sun, 19 Apr 2015 09:12:09 +0800</pubDate><description><![CDATA[#include 
#include 

using namespace std;

char a[110][110];
int n,m,
    xx[8]={-1,-1,-1,0,0,1,1,1},
    yy[8]={-1,0,1,-1,1,-1,0,1},
    vis[110][110];

void did(int i, int j,int k)
{
    if (i1||j1|]]></description><category></category></item><item><title><![CDATA[poj2388]]></title><link>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126427</link><guid>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126427</guid><author>Phoebe201421085</author><pubDate>Sun, 19 Apr 2015 09:12:06 +0800</pubDate><description><![CDATA[#include 
#include 

using namespace std;

int main()
{ int a[10100],n;
    cin>>n;
    for (int i=1;in;i++) cin>>a[i];
    sort(a+1,a+n+1);
    couta[(n+1)/2];
    return 0;
}
【题意】给定n（n为奇数）个数，输出其中位数]]></description><category></category></item><item><title><![CDATA[poj2262]]></title><link>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126411</link><guid>https://blog.youkuaiyun.com/Phoebe201421085/article/details/45126411</guid><author>Phoebe201421085</author><pubDate>Sun, 19 Apr 2015 09:07:35 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
using namespace std;

int main()
{   bool a[1000005],p[1000005];
    int i,j,n;
   // freopen("in.txt","r",stdin);
    memset(a,true,sizeof(a));
    memset(p,fa]]></description><category></category></item></channel></rss>