• Welcome to the world's largest Chinese hacker forum

    Welcome to the world's largest Chinese hacker forum, our forum registration is open! You can now register for technical communication with us, this is a free and open to the world of the BBS, we founded the purpose for the study of network security, please don't release business of black/grey, or on the BBS posts, to seek help hacker if violations, we will permanently frozen your IP and account, thank you for your cooperation. Hacker attack and defense cracking or network Security

    business please click here: Creation Security  From CNHACKTEAM

Recommended Posts

今天组队赛实惨,0题牢底坐穿,题目一直看不懂在讲什么,弄不清楚题意,最后想出I题的正解,但是比赛结束一分钟了,哎,好好补题吧。。。

F .Fighting Monsters

题意:给定N个怪兽,问是否能选处两个怪兽,使得他们相互攻击,最后活着的怪兽剩1滴血。

分析:判断是否存在相邻的Fibonacci数。

#包含位/标准数据h。

使用命名空间标准

int a[100];

int ver[10000010];

带符号的主()

{

a[1]=1;

a[2]=1;

for(int I=3;i=32我)

{

a=a[I-1]a[I-2];

}

int n;

桂皮酸

for(int I=1;I=n;我)

cinver

int x,y;

for(int I=1;i=32我)

{

x=0,y=0;

for(int j=1;j=n;j)

{

if (a==ver[j])

{

x=j;

打破;

}

}

for(int j=1;j=n;j)

{

如果(j==x)继续;

if (a[i 1]==ver[j])

{

y=j;

打破;

}

}

if (xy)//不能写在外面,每次都在更新,情况不同了

{

coutx ' ' y ' \ n

返回0;

}

}

puts('不可能');

返回0;

}

Link to comment
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now