# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
808743 |
2023-08-05T10:23:20 Z |
Tunglam07 |
Vepar (COCI21_vepar) |
C++17 |
|
206 ms |
18564 KB |
#include<bits/stdc++.h>
using namespace std;
long long t, a, b, c, d, s, s1;
bool chk[10000001];
vector<long long> prim;
long long sol(long long v,long long k)
{
long long ans = 0;
while (v)
{
ans += v/k;
v /= k;
}
return ans;
}
void findprime()
{
for(int i = 2; i <= 10000000; i++)
{
if(!chk[i])
{
prim.push_back(i);
for(int j = i * 2; j <= 10000000; j += i)
{
chk[j] = 1;
}
}
}
}
int main()
{
ios::sync_with_stdio (0);
cin.tie (0);
cout.tie (0);
findprime();
cin >> t;
while(t--)
{
cin >> a >> b >> c >> d;
bool ck = 0;
for (int v : prim)
{
if (sol(b, v) - sol(a - 1, v) > sol(d, v) - sol(c - 1, v))
{
ck = 1;
break;
}
}
if(!ck)
{
cout << "DA" << endl;
}
else
{
cout << "NE" << endl;
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
111 ms |
18368 KB |
Output is correct |
2 |
Correct |
128 ms |
18404 KB |
Output is correct |
3 |
Correct |
62 ms |
18432 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
105 ms |
18352 KB |
Output is correct |
2 |
Correct |
97 ms |
18324 KB |
Output is correct |
3 |
Correct |
98 ms |
18452 KB |
Output is correct |
4 |
Correct |
110 ms |
18368 KB |
Output is correct |
5 |
Correct |
71 ms |
18404 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
105 ms |
18412 KB |
Output is correct |
2 |
Correct |
86 ms |
18424 KB |
Output is correct |
3 |
Correct |
101 ms |
18412 KB |
Output is correct |
4 |
Correct |
100 ms |
18412 KB |
Output is correct |
5 |
Correct |
110 ms |
18368 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
145 ms |
18332 KB |
Output is correct |
2 |
Correct |
96 ms |
18372 KB |
Output is correct |
3 |
Correct |
76 ms |
18564 KB |
Output is correct |
4 |
Correct |
109 ms |
18424 KB |
Output is correct |
5 |
Correct |
103 ms |
18368 KB |
Output is correct |
6 |
Correct |
112 ms |
18400 KB |
Output is correct |
7 |
Correct |
199 ms |
18416 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
142 ms |
18368 KB |
Output is correct |
2 |
Correct |
68 ms |
18412 KB |
Output is correct |
3 |
Correct |
115 ms |
18388 KB |
Output is correct |
4 |
Correct |
98 ms |
18368 KB |
Output is correct |
5 |
Correct |
109 ms |
18396 KB |
Output is correct |
6 |
Correct |
150 ms |
18424 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
143 ms |
18408 KB |
Output is correct |
2 |
Correct |
60 ms |
18396 KB |
Output is correct |
3 |
Correct |
127 ms |
18428 KB |
Output is correct |
4 |
Correct |
85 ms |
18400 KB |
Output is correct |
5 |
Correct |
109 ms |
18444 KB |
Output is correct |
6 |
Correct |
148 ms |
18368 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
151 ms |
18404 KB |
Output is correct |
2 |
Correct |
114 ms |
18528 KB |
Output is correct |
3 |
Correct |
94 ms |
18404 KB |
Output is correct |
4 |
Correct |
119 ms |
18368 KB |
Output is correct |
5 |
Correct |
99 ms |
18356 KB |
Output is correct |
6 |
Correct |
146 ms |
18420 KB |
Output is correct |
7 |
Correct |
206 ms |
18368 KB |
Output is correct |