题目链接:http://codeforces.com/contest/1110/problem
第一题(模拟):
#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll unsigned long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=2;
const int maxn=1e5+100;
const int maxm=1e5+100;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
ll b,k,x;
ll ans=0;
int main()
{
cin>>b>>k;
rep(i,0,k){
cin>>x;
ans=(ans+x*powmod(b,k-i-1)%2)%2;
}
if(ans&1) puts("odd");
else puts("even");
return 0;
}
第二题(贪心):
#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll unsigned long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=1e5+100;
const int maxm=1e5+100;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
struct node{
int len,x,y;
bool operator<(const node& q){
return len<q.len;
}
}p[maxn];
int a[maxn];
set<int> st;
int n,m,k;
int main()
{
cin>>n>>m>>k;
int ans=0;
rep(i,0,n) cin>>a[i],st.insert(a[i]);
rep(i,0,n-1) p[i].len=a[i+1]-a[i]+1,p[i].x=a[i],p[i].y=a[i+1];
sort(p,p+n-1);
///cout<<p[0].len<<endl;
rep(i,0,n-1){
///cout<<p[i].x<<p[i].y<<endl;
if(st.size()==k) break;
k--,a