Fighting For 2017 Season Contest 1

【Fighting For 2017 Season Contest 1】的更多相关文章

Fighting For 2017 Season Contest 1

比赛地址[https://vjudge.net/contest/147011#problem/A].960626 题目一:[http://codeforces.com/problemset/problem/701/A].水题题意:给出N张纸牌,N为偶数,每张纸牌上有数值,把这N张纸牌分给(N/2)个人,每个人分到两张纸牌,并且数值相同.一定存在解. 法一: #include<bits/stdc++.h> using namespace std; ], vis[]; int N; int ma…

ACM ICPC 2017 Warmup Contest 9 I

I. Older Brother Your older brother is an amateur mathematician with lots of experience. However, his memory is very bad. He recently got interested in linear algebra over finite fields, but he does not remember exactly which finite fields exist. For…

ACM ICPC 2017 Warmup Contest 9 L

L. Sticky Situation While on summer camp, you are playing a game of hide-and-seek in the forest. You need to designate a “safe zone”, where, if the players manage to sneak there without being detected,they beat the seeker. It is therefore of utmost i…

IOI 2017 Practice Contest mountains

Mountains 题面题意: 选最多的点使得两两看不见. 分析: 分治,solve(l,r)为区间[l,r]的答案.那么如果不选最高点,分治两边即可,选了最高点,那么在最高点看不见的区间里分治. 代码: #include"mountains.h" #include<bits/stdc++.h> using namespace std; ; int y[N]; int f[N][N]; bool Judge(int a,int b,int c) { // a see c…

ACM ICPC 2017 Warmup Contest 1 D

Daydreaming Stockbroker Gina Reed, the famous stockbroker, is having a slow day at work, and between rounds of solitaire she is day-dreaming. Foretelling the future is hard, but imagine if you could just go back in time and use your knowledge of stoc…