oj.uz

Submission #396176

# Submission time Handle Problem Language Result Execution time Memory
396176 2021-04-29T14:08:01 Z MrRobot_28 Vepar (COCI21_vepar) C++17
70 / 70
 519 ms 1488 KB 
#include<bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define sz(a) (int)a.size()
#define ll long long
const int N = 1e7;
const int T = 20;

signed main()
{
  //  ifstream cin("input1.txt.4c");
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    vector <bool> pr(N + 1, 1);
    for(int i = 2; i <= N; i++)
    {
        int j = i * 2;
        while(j <= N)
        {
            pr[j] = 0;
            j += i;
        }
    }
    while(t--)
    {
        int a, b, c, d;
        cin >> a >> b >> c >> d;
        int fl = 1;
        for(int j = 2; j <= N; j++)
        {
            if(pr[j])
            {
                int k = j;
                int s1 = 0, s2 = 0;
                while(1)
                {
                    s1 += ((b / k) - ((a - 1) / k));
                    s2 += ((d / k) - ((c - 1) / k));
                    if(N / j < k)
                    {
                        break;
                    }
                    k *= j;
                }
                if(s2 < s1)
                {
                    fl = 0;
                }
            }
        }
        if(fl)
        {
            cout << "DA\n";
        }
        else
        {
            cout << "NE\n";
        }
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 460 ms 1484 KB Output is correct
2 Correct 475 ms 1484 KB Output is correct
3 Correct 482 ms 1484 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 450 ms 1484 KB Output is correct
2 Correct 519 ms 1484 KB Output is correct
3 Correct 465 ms 1484 KB Output is correct
4 Correct 461 ms 1476 KB Output is correct
5 Correct 473 ms 1484 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 443 ms 1484 KB Output is correct
2 Correct 489 ms 1488 KB Output is correct
3 Correct 458 ms 1484 KB Output is correct
4 Correct 479 ms 1484 KB Output is correct
5 Correct 462 ms 1484 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 467 ms 1484 KB Output is correct
2 Correct 471 ms 1484 KB Output is correct
3 Correct 464 ms 1484 KB Output is correct
4 Correct 466 ms 1484 KB Output is correct
5 Correct 478 ms 1484 KB Output is correct
6 Correct 343 ms 1484 KB Output is correct
7 Correct 471 ms 1484 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 468 ms 1484 KB Output is correct
2 Correct 464 ms 1484 KB Output is correct
3 Correct 467 ms 1468 KB Output is correct
4 Correct 488 ms 1484 KB Output is correct
5 Correct 463 ms 1484 KB Output is correct
6 Correct 442 ms 1484 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 483 ms 1484 KB Output is correct
2 Correct 469 ms 1484 KB Output is correct
3 Correct 477 ms 1484 KB Output is correct
4 Correct 461 ms 1484 KB Output is correct
5 Correct 476 ms 1484 KB Output is correct
6 Correct 466 ms 1484 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 479 ms 1484 KB Output is correct
2 Correct 463 ms 1488 KB Output is correct
3 Correct 463 ms 1484 KB Output is correct
4 Correct 480 ms 1468 KB Output is correct
5 Correct 505 ms 1484 KB Output is correct
6 Correct 452 ms 1484 KB Output is correct
7 Correct 488 ms 1484 KB Output is correct