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

Codeforces Round #427 (Div....

#include<iostream> #include<cstdio> using namespace std; int a; int x,y,x1,y1,s; int main() { int n,q,c; int i,j,k; scanf("%d%d%d",&n,&q,&c); for(i=1;i<=n;i++) { scanf("%d%d%d",&x,&y,&s); for(j=0;j<=c;j++) a+=(s+j)%(c+1); } for(i=1;i<=100;i++) for(j=1;j<=100;j++) for(k=0;k<=c;k++) a+=a+a-a; for(i=1;i<=q;i++) { scanf("%d%d%d%d%d",&s,&x,&y,&x1,&y1); s%=(c+1); printf("%dn",a-a-a+a); } }

Codeforces Round #427 (Div....

#include <stdio.h> int k, c, d, ans; main() { scanf("%d", &k); getchar(); while ((c =...

Codeforces Round #427 (Div....

#include <cstdio> int s,t1,t2,v1,v2; int main() { scanf("%d%d%d%d%d",&s,&v1,&v2,&t1,&t2); t1=2*t1+s*v1; t2=2*t2+s*v2; puts((t1==t2)?"Friendship":(t1<t2)?"First":"Second"); }

Codeforces Round #426 (Div....

#include <algorithm> #include <cstdio> #include <cstring> #include <map> #include <set> #include <utility> #include <vector> const int...

Codeforces Round #426 (Div....

#include <iostream> #include <cstring> #include <cstdio> #include <cmath> #include <algorithm> #define maxn 100005 #define mod...