Playrix Codescapes Cup (Codeforces Round #413 Archive

import java.io.OutputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.StringTokenizer; import java.io.IOException; import java.io.BufferedReader; import java.io.InputStreamReader; import java.io.InputStream; /** * Built using CHelper plug-in * Actual solution is at the top */ public class Main …

include<cstdio> using namespace std; inline int read(){ char c=getchar();int p=1,ret=0; while((c<'0')||(c>'9')){if(c=='-')p=-1;c=getchar();} while((c>='0')&&(c<='9'))ret=(ret<<1)+(ret<<3)+c-'0',c=getchar(); return ret*p; } int n,m; long long ans; struct tree{ int v,num; long long sum; void add(int x,int y,int p){v+=p;} }t; struct ele{ …

#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; #define N 200010 #define ll long long #define INF 2000000000 ll Ans=1e18,Res; int i,j,k,n,Sum,m,x,y,l,a,b,p,M,f; inline int Min(int x,int y){return x<y?x:y;} inline ll Min(ll x,ll y){return x<y?x:y;} int main(){ …

#include <bits/stdc++.h> using namespace std; typedef int64_t ll; #define f(i,j,k) for(int i=j;i<k;i++) const int maxn = 1e5 + 10; int A, a,b,h,w,n,ans; void dfs(ll aa, ll bb, int cnt) { if (cnt==n+1) return; if (aa>=a …

#include <iostream> #include <algorithm> #include <vector> using namespace std; int n, c, d; int bit; void insertBIT (int id, int a, int x) { for (int i=a; i<=100100; i+=i&(-i)) bit=max(x, bit); } int queryBIT (int …

from heapq import heappush, heappop n = input() p = map(int, raw_input().split()) a = map(int, raw_input().split()) b = map(int, raw_input().split()) m = input() c = map(int, raw_input().split()) colors = {} for i in range(1, 4): …

main(n,t,k,d){scanf(“%d%d%d%d”,&n,&t,&k,&d);puts(d<(n-1)/k*t?”YES”:”NO”);}