Sponsors

Admin

954 animes navigated

The Road Wraps Up Its Oklahoma Ranch, OKC Run: Our S01E05 Preview

"The Road" Hits a Major Milestone: Wrapping Up the Oklahoma Leg in S01E05 Music competition...

A Radical New Kind of Particle Accelerator Could Transform Science

The Tabletop Revolution: Compact Particle Accelerators Poised to Transform Research For decades, the realm of...

Why Native American Heritage Month matters in San Diego

The Profound Significance of Native American Heritage Month in San Diego November marks Native American...

Driverless rideshare service Waymo coming to San Diego gets mixed reactions

Waymo’s Driverless Rideshare Service Headed to San Diego Amid Mixed Community Reactions San Diego is...

Codeforces Round #419 (Div....

#include <bits/stdc++.h> #define ll long long using namespace std; const int N...

Codeforces Round #419 (Div....

#include<cstdio> #include<algorithm> #include<queue> using namespace std; const int N=5010; int n,m,c,d,fa; int w,head,next; void add(int f,int...

Codeforces Round #419 (Div....

#include <cstdio> #include <iostream> #include <cstring> #include <cstdlib> using namespace std; #define ll long...

Codeforces Round #419 (Div....

#include <bits/stdc++.h> #define inf 0x3f3f3f3f #define rep(i, n) for (int i...

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; }

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; /** *...