Sponsors

Admin

942 animes navigated

ISC Declares Quarterly Dividend

Information Services Corporation Declares $0.23 Quarterly Dividend In a significant announcement for its shareholders, Information...

Electrolux 10kg Front Load Washing Machine EWF1042R9WC $725 + Delivery ($0 to Selected Cities Only) @ Appliance Central

Massive Deal Alert: Electrolux 10kg Front Loader EWF1042R9WC Slashed to $725 Home appliance shoppers, prepare...

RFK Jr.’s top drug regulator resigns after ‘revenge campaign’ against ex-colleague: report

Top FDA Regulator Resigns Amid Scandal Involving 'Revenge Campaign' The political and regulatory landscape was...

National Guard, DC Police Respond As Dozens Descend On Navy Yard, Several Arrests Made

National Guard Deployed as Chaos Grips DC Navy Yard on Halloween Night Halloween night traditionally...

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 +...

Codeforces Round #415 (Div....

#include <cstdio> using namespace std; #define ff fflush(stdout) #define mid (lef+rig>>1) int n,...

Codeforces Round #415 (Div....

#include <bits/stdc++.h> using namespace std; long long n,a,r,m=1e9+7,sum=0; int main(){...

Codeforces Round #415 (Div....

#include<bits/stdc++.h> using namespace std; int64_t n,f,k,l,i,w,s,a; int main(){ for(cin>>n>>f;i<n;i++)cin>>k>>l,w=min(k,l),a=min(2*k,l)-w,s+=w; sort(a,a+n); for(i=0;i<n;i++)s+=i<f?a:0; cout<<s; }

Codeforces Round #415 (Div....

#include <cstdio> int n,k,sum=0,mark; int main() { scanf("%d%d",&n,&k); for(int i=1;i<=n;i++)scanf("%d",&mark),sum+=mark; mark=(n*k-sum)*2-n; if(mark>0)printf("%d",mark); else printf("0"); }

Tinkoff Challenge – Final...

#include<set> #include<map> #include<ctime> #include<cmath> #include<queue> #include<bitset> #include<string> #include<cstdio> #include<cctype> #include<vector> #include<cstdlib> #include<cstring> #include<cassert> #include<sstream> #include<numeric> #include<iostream> #include<algorithm> #include<functional> using namespace std; #define For(i,x,y) for(int i=x,_y=y;i<=_y;++i) #define Rep(i,x,y) for(int i=x,_y=y;i>=_y;--i) #define...

Tinkoff Challenge – Final...

#include <cstdio> #include <iostream> #include <algorithm> #define N 100010 using namespace std; typedef long...