从没有,我重复一遍,*从没有*哪一部电影,能像腐尔摸死2这样从头看到尾之后让人困惑到言语不能如坠五里云雾中的,这一点,连那些看两个小时能睡着大概四五次的著名文艺片也望尘莫及:作为一部打着动作片旗号、扒着漫画改编的边边、大张旗鼓地以新奇的视效以及豪迈的铁血男儿情怀为卖点的喧哗无脑圣诞档圈钱爆米花电影,该片**搞基**的阵容之强、比重之高、尺度之大、情节之言情狗血、手段之花样翻新无不让人对各位编导演丰富精彩的内心世界再一次刮目相看。不,赶紧使劲掐自己几下吧,你不是在看着Maurice、Milk、Brokeback
Mountain做白日梦,你甚至没在呆愣愣地盯着闷骚忧郁的Brideshead
Revisited,你正冠冕堂皇人面兽心地坐在某大型影城的豪华放映厅里欣赏猛男导演Gay哦不Guy
Richie为您奉上的本年度万众期待之合家欢大片一部。抱歉,各位乘兴而来捂脸而归双手发抖欲哭无泪而且还不能去窗口退票的直男们,眼睁睁地看着秃花生气势汹汹地一把撕掉变装糖摩斯的上衣并且把他夹在两腿中间(预告片里已经出现过这一幕了,于是你知道怎么回事了吧:这在全片里才不算最瞎狗眼的一段呢)……真的是委屈你们了。

A. Fair Game

我只是想问一句,亲爱的腐尔摸死各位主创人员,您各位拍戏的时候真的没有脸红心跳反复扪心自问这样挂羊头卖狗肉到底算不算坑华纳的钱吗。——哦不不,我可不是在抱怨哟。

time limit per test

而且不光我,今天坐在电影院里比我还活泼欢乐十倍并从头淫笑到尾的各位女性观众也一定不会抱怨的。
……………………
对我来说比较意外的是,作为一个很大程度上的原著党,前年此时抱着强烈的抵触情绪去看片之后对上一部腐尔摸死我的接受度还是很高的。花钱请来大明星、整合漫画人设、完全打消向原著靠拢的念头和Guy
Richie电影中一贯的精巧视效齐心合力四位一体,打造了一部在腹背受敌的情况下还赚到盆满钵满的surprise
hit。数钱数得笑逐颜开的华纳迅速将续集提上日程,两年的制作周期也许不算短,但是从自第二部去年开拍起就一路走高的关注度,该片显然大有成为长寿圈钱系列的潜质。潜在观众群有了、Buzz有了,现在无论制片方还是观众,眼睛盯着的就只有一个问题了——费了这么多人力物力/网络资源/吐沫星子,成片的质量到底如何?

1 second

必发365娱乐官网,让人松一口气的是,哪怕除去更为凶猛的搞基来说,第二部的整体感觉也明显好过第一部。剧情,——虽然说还是大话满篇科幻且扯淡,但细节到底是丰满了不少,上一部借以扬名的“推理咏春拳”也玩出了新花样,而Richie式的“子弹时间”(请参考预告片)也给视效加分多多。至少这是个人物更多、情节更复杂、还勉强算是有那么点悬念能兜到最后的故事了,如果说第一部的成功完全出自于讲故事的人,那么对第二部来说,故事至少没有拖片子的后腿。

memory limit per test

表演方面明显没什么好说的:是啊,糖泥又胖了不少,发线君又秃了不少,但两位明显都还是风韵犹存,而且配合的默契程度也突飞猛进,于是导致无论任何互动,效果都比上一部要基了不少——不过看看人家二位那一副何乐而不为一见面就亲热腻歪的样子,就算是导演的本意不是要搞基,估计也是套上八匹马都拉不回来的状况。新加的人物……基本上现身的目的都十分可疑,女性角色们变本加厉地争相炮灰属于意料之中,意料之外的是难得在大荧幕上现身一次的大伯乐颠颠跑来演麦哥的原因是……我真不好意思剧透了,请大家尽请期待掉下巴一刻吧。……

256 megabytes

回到开头说的困惑上:这场电影简直就是一次无限循环“妈啊我看到了什么眼睛瞎了啊啊啊啊啊这对狗男男真是不要脸靠靠靠哇啊啊啊啊啊不会吧这也可以的你们反了天了啊啊啊啊苍天又来了啊啊啊啊啊啊……”的心理过程。在不剧透的前提下,请看FF为您贴心总结的以下几条:

input

1、该片中的男人,全部都是成对出现的。Yup,一个落单的都没有。包括出场时间不超过十分钟还只说过一句英语的中老年群众演员。

standard input

2、相信我,不停地问秃花生和糖摩斯“你大爷啊有必要每个一起出现的镜头都拉拉扯扯搂搂抱抱鼻尖挨着鼻尖眼看就要亲上了吗你们又不是聋子瞎子”这种问题是没有意义的。人家就是愿意这样儿你管得着么。

output

3、瞎狗眼场景平均5-10分钟会出现一次,从文艺言情小清新到狗血肉搏上H无一不有,请各位做好心理准备各取所需。

standard output

4、靠大伯。哦不大伯。法克椰大伯。《——当大英帝国的国宝Stephen
Fry先生“那啥”的时候(相信我你会知道我说的是神马的哟*winkwink*),欢迎自行排列这三个想法。可以看出你到底直不直哟。

Petya and Vasya decided to play a game. They have n cards (n is an even
number). A single integer is written on each card.

5、不光糖泥喜欢出丑,一向在大银幕上佯装文艺青年、生活中经常二逼打扮的发线君也喜欢。观赏时请收好您的BLX。

Before the game Petya will choose an integer and after that Vasya will
choose another integer (different from
the number that Petya chose). During the game each player takes all the
cards with number he chose. For example, if Petya chose number 5 before the game he will take all cards on which 5 is written and if Vasya chose number 10 before the game he will take all cards on which
10 is written.

6、如果第一部都能让正统Sherlockian组织的负责人暴跳如雷的话,那么:请问您不觉得这片充满了“他们俩就是搞过了/就是正在搞/差不多准备出柜了”的暗示吗!!!真的不觉得吗!!!您要给Gay导寄炭疽信吗!!!要去炸华纳的摄影棚吗!!!我们拭目以待哟亲!!!

The game is considered fair if Petya and Vasya can take all n cards, and the number of cards each player gets is
the same.

吐槽大概就这样了,我还是听着刚下的原声继续谴责搞基二人组之令人发指去,祝各位保得住钛金狗眼。

Determine whether Petya and Vasya can choose integer numbers before the
game so that the game is fair.

Input

The first line contains a single integer n
(2 ≤ n ≤ 100) — number of cards. It is
guaranteed that n is an even
number.

The following n lines contain a sequence of
integers a1, a2, …, a*n*
(one integer per line, 1 ≤ a*i* ≤ 100) — numbers written on the
n cards.

Output

If it is impossible for Petya and Vasya to choose numbers in such a way
that the game will be fair, print “NO”
(without quotes) in the first line. In this case you should not print
anything more.

In the other case print “YES” (without
quotes) in the first line. In the second line print two distinct
integers — number that Petya should choose and the number that Vasya
should choose to make the game fair. If there are several solutions,
print any of them.

Examples

Input

4
11
27
27
11

Output

YES
11 27

Input

2
6
6

Output

NO

Input

6
10
20
30
20
10
20

Output

NO

Input

6
1
1
2
2
3
3

Output

NO

Note

In the first example the game will be fair if, for example, Petya
chooses number 11, and Vasya chooses number 27. Then the will take all cards — Petya will take
cards 1 and 4, and Vasya
will take cards 2 and 3.
Thus, each of them will take exactly two
cards.

In the second example fair game is impossible because the numbers
written on the cards are equal, but the numbers that Petya and Vasya
should choose should be distinct.

In the third example it is impossible to take all cards. Petya and Vasya
can take at most five cards — for example, Petya can choose number 10 and Vasya can choose number 20. But for the game to be fair it is necessary to take
6 cards.

 

题意就是给你偶数个数,两个人分,每个人要分的一样多,而且选的数要一样.

 1 #include <iostream>
 2 #include <cstring>
 3 #include <cstdio>
 4 #include <algorithm>
 5 #include <set>
 6 #define N 105
 7 using namespace std;
 8 int k[N];
 9 set<int>s;
10 int main(){
11   int n,x,y;
12   cin>>n;
13   bool prime=true;
14   for(int i=0;i<n;i++){
15     cin>>k[i];
16     s.insert(k[i]);
17   }
18   if(s.size()==2){
19     set<int>::iterator it=s.begin();
20     x=*it;
21     it++;
22     y=*it;
23     int ans=0;
24     for(int i=0;i<n;i++){
25       if(k[i]==x)
26         ans++;
27     }
28     if(ans!=n/2)
29       prime=false;
30   }else{
31     prime=false;
32   }
33   if(prime){
34     cout<<"YES"<<endl;
35     cout<<x<<" "<<y<<endl;
36   }else{
37     cout<<"NO"<<endl;
38   }
39   return 0;
40 }

 

相关文章