Tag: Div. 1 + Div. 2)
Tinkoff Challenge – Final...
#include<cstdio>
int main()
{
int a,b,c,i,ans=0;
scanf("%d%d%d",&a,&b,&c);
for(scanf("%d",&i);i--;)scanf("%d",&a),a>b&&a<c?++ans:0;
printf("%d",ans);
}
Playrix Codescapes Cup (Codeforces...
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...
Playrix Codescapes Cup (Codeforces...
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...
Playrix Codescapes Cup (Codeforces...
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define N 200010
#define ll long long
#define INF...
Playrix Codescapes Cup (Codeforces...
#include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
#define f(i,j,k) for(int i=j;i<k;i++)
const...
Playrix Codescapes Cup (Codeforces...
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int n, c, d;
int...
Playrix Codescapes Cup (Codeforces...
from heapq import heappush, heappop
n = input()
p = map(int,...
Playrix Codescapes Cup (Codeforces...
main(n,t,k,d){scanf("%d%d%d%d",&n,&t,&k,&d);puts(d<(n-1)/k*t?"YES":"NO");}