Tag: Codeforces Round #420 (Div. 2)
Codeforces Round #420 (Div....
#include <stdio.h>
#define m 1000000007u
typedef long long unsigned llu;
typedef unsigned...
Codeforces Round #420 (Div....
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<cmath>
using namespace std;
const int maxn=1e4+5;
const int inf=0x7f7f7f7f;
int x,y,dis;
bool vis;
int...
Codeforces Round #420 (Div....
#include <cstdio>
using namespace std;
int n,s,top;
int main()
{
int i,j,ans=0;
char op;
scanf("%d",&n);
for(i=j=1;i<=2*n;++i)
{
scanf("%s",op);
if(op=='a')
scanf("%d",&s);
else
{
if(top)
{
if(s==j) --top;
else...
Codeforces Round #420 (Div....
#include <iostream>
using namespace std;
int main(){
long long int m,b,s=0,x;
cin>>m>>b;
for(int i=0;i<=b;i++){
x=(b-i)*m;
s=max(s,((i+1)*(x+1)*(i+x))/2);
}
cout<<s;
}
Codeforces Round #420 (Div....
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,a,i,j,k,l,f;
cin>>n;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
cin>>a;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
{
f=0;
for(k=0;k<n;k++)
for(l=0;l<n;l++)
if(a==a+a||a==1)
f=1;
if(!f)
{
cout<<"Non";
return 0;
}
}
cout<<"Yesn";
return 0;
}