Submission #1966931
Source Code Expand
#include<stdio.h> #include<math.h> #include<algorithm> #include<queue> #include<deque> #include<string> #include<string.h> #include<vector> #include<set> #include<map> #include<bitset> #include<stdlib.h> #include<cassert> #include<time.h> using namespace std; const long long mod=1000000007; const long long inf=mod*mod; const long long d2=500000004; const double EPS=1e-6; const double PI=acos(-1.0); int ABS(int a){return max(a,-a);} long long ABS(long long a){return max(a,-a);} int p[11][11]; int main(){ long long n,a,b,c,d; scanf("%lld%lld%lld%lld%lld",&n,&a,&b,&c,&d); n--; for(int i=0;i<=n;i++){ long long LM=a-d*i+c*(n-i); if(LM<=b&&b<=LM+n*(d-c)){ printf("YES\n");return 0; } } printf("NO\n"); }
Submission Info
Submission Time | |
---|---|
Task | B - Moderate Differences |
User | tozangezan |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 754 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:26:46: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld%lld%lld%lld%lld",&n,&a,&b,&c,&d); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt, sample4.txt |
All | sample1.txt, sample2.txt, sample3.txt, sample4.txt, a01.txt, a02.txt, a03.txt, a04.txt, b01.txt, b02.txt, b03.txt, b04.txt, c01.txt, c02.txt, c03.txt, c04.txt, d01.txt, d02.txt, d03.txt, d04.txt, d05.txt, d06.txt, d07.txt, d08.txt, d09.txt, d10.txt, d11.txt, d12.txt, d13.txt, d14.txt, d15.txt, d16.txt, d17.txt, d18.txt, sample1.txt, sample2.txt, sample3.txt, sample4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
a01.txt | AC | 1 ms | 128 KB |
a02.txt | AC | 1 ms | 128 KB |
a03.txt | AC | 1 ms | 128 KB |
a04.txt | AC | 1 ms | 128 KB |
b01.txt | AC | 1 ms | 128 KB |
b02.txt | AC | 1 ms | 128 KB |
b03.txt | AC | 1 ms | 128 KB |
b04.txt | AC | 1 ms | 128 KB |
c01.txt | AC | 1 ms | 128 KB |
c02.txt | AC | 1 ms | 128 KB |
c03.txt | AC | 1 ms | 128 KB |
c04.txt | AC | 1 ms | 128 KB |
d01.txt | AC | 1 ms | 128 KB |
d02.txt | AC | 1 ms | 128 KB |
d03.txt | AC | 1 ms | 128 KB |
d04.txt | AC | 1 ms | 128 KB |
d05.txt | AC | 1 ms | 128 KB |
d06.txt | AC | 1 ms | 128 KB |
d07.txt | AC | 1 ms | 128 KB |
d08.txt | AC | 1 ms | 128 KB |
d09.txt | AC | 1 ms | 128 KB |
d10.txt | AC | 1 ms | 128 KB |
d11.txt | AC | 1 ms | 128 KB |
d12.txt | AC | 1 ms | 128 KB |
d13.txt | AC | 1 ms | 128 KB |
d14.txt | AC | 1 ms | 128 KB |
d15.txt | AC | 1 ms | 128 KB |
d16.txt | AC | 1 ms | 128 KB |
d17.txt | AC | 1 ms | 128 KB |
d18.txt | AC | 1 ms | 128 KB |
sample1.txt | AC | 1 ms | 128 KB |
sample2.txt | AC | 1 ms | 128 KB |
sample3.txt | AC | 1 ms | 128 KB |
sample4.txt | AC | 1 ms | 128 KB |