Admin
875 animes navigated
Celebrating Black History Month: Past, Future
As February unfolds, so does the annual celebration of Black History Month, a time...
The Path to Self-Mastery: Lessons from Book ‘The Mountain Is You’
Embarking on a journey of self-mastery and breaking free from self-sabotage is a transformative...
Wizards of Waverly Place Cast Reunites for Enchanting Revival
In a spellbinding announcement, Disney has officially revealed that the beloved fantasy series "Wizards...
Jim Irsay’s Reported ‘Suspected Overdose’: A Closer Look
In a shocking turn of events last month, Jim Irsay, the owner of the...
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;
}
Codeforces Round #421 (Div....
#include<cstdlib>
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=301;
const int M=100001;
const int K=4;
int...
Codeforces Round #421 (Div....
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n,t,k,i,m,q,f;
ll a,s,w,p,res;
map...
Codeforces Round #421 (Div....
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
import java.util.TreeMap;
/**
*...
Codeforces Round #421 (Div....
#include<stdio.h>
#include<stdlib.h>
#define LL long long
int p, cur;
int main(void)
{
LL ans, sum;
int...
Codeforces Round #421 (Div....
import java.util.Scanner;
public class C {
public static void main(String args)...
Codeforces Round #421 (Div....
#include <iostream>
using namespace std;
int main(){
int n,m,q;
cin>>n>>m;
q=(n*m+90)/180+2;
if(q<n){
n=q;
}
if(n<3){
n=3;
}
cout<<"2 1 "<<n;
return 0;
}
Codeforces Round #421 (Div....
#include <iostream>
using namespace std;
int c,v,vl,l,a;
int main(){
cin>>c>>v>>vl>>a>>l;
int s=1;
for(int i=v;i<c;){
v+=a;
if(v>vl) v=vl;
i-=l;
i+=v;
s++;}
cout<<s<<endl;
}
Codeforces Round #427 (Div....
#include <bits/stdc++.h>
using namespace std;
int n;
int to, pre, cost, last,...
Codeforces Round #427 (Div....
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=1010;
int n,x,y,bit,ans;
int cnta,cntb;
int a,b;
int ans1,ans2;
int...
Codeforces Round #427 (Div....
#include <stdio.h>
#include <string.h>
#define N 5000
int main() {
static char cc;
static...