oj.uz

Submission #332596

# Submission time Handle Problem Language Result Execution time Memory
332596 2020-12-02T22:40:55 Z thecodingwizard Strongbox (POI11_sej) C++11
28 / 100
 1000 ms 5868 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
#define ii pair<int, int>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define F0R(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define inf 1000000010

int main() {
    cin.tie(0)->sync_with_stdio(0);

    ll n; int k; cin >> n >> k;
    ll bad[k-1]; F0R(i, k-1) cin >> bad[i];
    ll good; cin >> good;

    ll gcd = __gcd(n, good);
    for (int i = 1; i <= gcd; i++) {
        if (gcd % i == 0) {
            bool legal = true;
            F0R(j, k-1) if (bad[j] % i == 0) legal = false;
            if (legal) {
                cout << n/i << endl;
                return 0;
            }
        }
    }

    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1088 ms 364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Execution timed out 1084 ms 364 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 364 KB Output is correct
2 Execution timed out 1094 ms 364 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1043 ms 364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1049 ms 364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 543 ms 492 KB Output is correct
4 Correct 40 ms 364 KB Output is correct

Subtask #10
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Execution timed out 1087 ms 364 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #11
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1082 ms 2156 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #12
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1094 ms 4496 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #13
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1044 ms 5356 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #14
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 4844 KB Output is correct
2 Execution timed out 1093 ms 5868 KB Time limit exceeded
3 Halted 0 ms 0 KB -