Monthly Archives: July, 2017
Try searching for what you're looking for instead.
Codeforces Round #424 (Div....
#include<bits/stdc++.h>
using namespace std;
const int maxn=2e3+5;
int main(){
int n,k,p,a,b;
int res=INT_MAX,i,j;
cin>>n>>k>>p;
for(i=0;i<n;i++) scanf("%d",a+i);
for(i=0;i<k;i++)...
Codeforces Round #424 (Div....
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>k>>n;
int t;
int arr;
set<int>c;
for(int i=0;i<k;i++){
cin>>t;
arr= arr+t;
}
for(int...
Codeforces Round #424 (Div....
#include <bits/stdc++.h>
using namespace std;
string s1, s2, t;
int main() {
cin...
Codeforces Round #424 (Div....
#include<cstdio>
using namespace std;
int n,i,la,nw,fl,tp;
int main(){
for(scanf("%d%d",&n,&la);++i<n;la=nw,fl=tp)
if(scanf("%d",&nw),fl>(tp=(nw>la?0:(nw<la?2:1))))return puts("NO");
return puts("YES");
}
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 <cstdio>
#include <algorithm>
using namespace std;
int n,m,x,y;
char s;
char l='L',r='R',u='U',d='D';
int fx,fy,fl,an,vis;
inline...
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";
}
Codeforces Round #415 (Div....
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<queue>
#include<set>
using namespace std;
typedef long long LL;
const int N=4e5;
int gi()...
Codeforces Round #415 (Div....
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define nMax 300010
#define INF 2000000100
using namespace std;
int n;
struct Node
{
int...
Codeforces Round #415 (Div....
import java.util.*;
public class C{
final int MOD = (int)1e9 +...