Tag: Codeforces Round #416 (Div. 2)
Codeforces Round #416 (Div....
#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<cctype>
#include<vector>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define...
Codeforces Round #416 (Div....
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int main(){
int n,a,c,f;
scanf("%d",&n);
for(int i=0;i<n;i++)scanf("%d",a+i),c]++;
for(int i=0;i<n;i++){
int v={0},temp=0,xo=0;
for(int j=i;j>=0;j--){
if(v]==0)v]=1,temp+=c],xo^=a;
f=max(f,f+(--temp?0:xo));
}
}
printf("%d",f);
return...
Codeforces Round #416 (Div....
#include<cstdio>
int p,n,m,l,r,x;
int main(){
scanf("%d%d",&n,&m);
for(x=1;x<=n;x++)scanf("%d",&p);
for(;m--;){
scanf("%d%d%d",&l,&r,&x);
for(n=l;n<=r;n++)if(p<p)l++;
printf("%sn",l==x?"Yes":"No");
}
return 0;
}
Codeforces Round #416 (Div....
#include<bits/stdc++.h>
using namespace std;
int main()
{
long a,b;
cin>>a>>b;
a=sqrt(a);
if(a*(a+1)>b)cout<<"Valera";
else
cout<<"Vladik";
}