Admin

1055 animes navigated

How to be proactive about cancer prevention

Taking Charge: How to be Proactive About Cancer Prevention Every year, millions of families are...

Workday’s stock slumps again on weak guidance and AI disruption fears

Workday Shares Plunge as Future Outlook Dims Amid AI Concerns Workday Inc. (WDAY), a long-standing...

Milan Cortina Olympics Attracts 23.5 Million Viewers Across NBCUniversal and Versant Outlets, Best Winter Games Since 2014

Milan Cortina Olympics Sees Record-Breaking Viewership and PerformanceThe Milan Cortina Winter Olympics have officially...

New York City’s Last Striking Nurses Approve New Contract

New York City Nurses Reach Historic Agreement Ending Major StrikeIn a significant development for...

Codeforces Round #384 (Div....

C/C++
#include <stdio.h> #include <string.h> #define MAX(X,Y) ((X)>(Y) ? (X) : (Y)) #define...
Read more

Codeforces Round #384 (Div....

C/C++
#include<stdio.h> int main(){ long x; scanf("%ld",&x); if(x==1) printf("-1"); else printf("%ld %ld %ld",x,x+1,x*(x+1)); return 0; }
Read more

Codeforces Round #384 (Div....

C/C++
long long k; main() { scanf("%d%lld",&k,&k); printf("%dn",1+__builtin_ctzll(k)); }
Read more

Codeforces Round #384 (Div....

C/C++
#include<stdio.h> int main() { int i,j,n,a,b; char s; scanf("%d%d%d",&n,&a,&b); scanf("%s",s); if(s==s) { printf("0"); } else printf("1"); return 0; }
Read more

Codeforces Round #383 (Div....

C/C++
#include <stdio.h> #include <iostream> #include <algorithm> #include <memory.h> #include <string.h> #define rank _ran using...
Read more

Codeforces Round #383 (Div....

C/C++
#include <bits/stdc++.h> using namespace std; #define fo(i,a,b) for(int i=(a);i<(b);i++) #define MOD 1000000007 #define...
Read more

Codeforces Round #383 (Div....

C/C++
#include <stdio.h> #include <string.h> int n,a,b,c,p; void dfs(int k,int col); int main(void) { ...
Read more

Codeforces Round #383 (Div....

C/C++
#include<stdio.h> int n, m, maxW, p, w, b, prev, next,...
Read more

odeforces Round #383 (Div....

C/C++
#include<stdio.h> int n, c, v; int gcd(long long a, long long...
Read more

Codeforces Round #383 (Div....

C/C++
#include<stdio.h> int v; int main(){ int i,l,n,x; long long int r; scanf("%d%d",&n,&x); for(i=0;i<n;i++) { scanf("%d",&l); r=r+v; v++; } printf("%I64d",r); return 0; }
Read more

Codeforces Round #383 (Div....

C/C++
#include<stdio.h> int main(){int n, a={6,8,4,2}; scanf("%d",&n); if(n) printf("n%d",a); else printf("n1"); return 0; }
Read more

Codeforces Round #382 (Div....

C/C++
#include<iostream> #include<cstdio> #include<algorithm> #define N 3010 using namespace std; int n,m,f; struct ma{int x,y;}a; bool operator<(ma...
Read more