Submission #7745971


Source Code Expand

Copy
#include<bits/stdc++.h>
using namespace std;

using i64 = int64_t;

map<i64, i64> prime_factor(i64 n) {
    map<i64, i64> res;
    for (i64 i = 2; i * i <= n; i++) {
        while (n % i == 0) {
            res[i]++;
            n /= i;
        }
    }
    if (n != 1)
        res[n] = 1;
    return res;
}

int main(){
    i64 a, b;
    cin >> a >> b;
    auto mp = prime_factor(a);
    i64 ans = 1;
    for(auto e: mp){
        if(b%e.first == 0)ans++;
    }
    cout << ans << endl;

    return 0;
}

Submission Info

Submission Time
Task D - Disjoint Set of Common Divisors
User nicklaw296
Language C++14 (GCC 5.4.1)
Score 400
Code Size 533 Byte
Status AC
Exec Time 10 ms
Memory 256 KB

Judge Result

Set Name All Sample
Score / Max Score 400 / 400 0 / 0
Status
AC × 26
AC × 3
Set Name Test Cases
All sample_01, sample_02, sample_03, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10, testcase_11, testcase_12, testcase_13, testcase_14, testcase_15, testcase_16, testcase_17, testcase_18, testcase_19, testcase_20, testcase_21, testcase_22, testcase_23
Sample sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
sample_01 AC 1 ms 256 KB
sample_02 AC 1 ms 256 KB
sample_03 AC 1 ms 256 KB
testcase_01 AC 2 ms 256 KB
testcase_02 AC 2 ms 256 KB
testcase_03 AC 4 ms 256 KB
testcase_04 AC 1 ms 256 KB
testcase_05 AC 1 ms 256 KB
testcase_06 AC 1 ms 256 KB
testcase_07 AC 1 ms 256 KB
testcase_08 AC 1 ms 256 KB
testcase_09 AC 3 ms 256 KB
testcase_10 AC 1 ms 256 KB
testcase_11 AC 1 ms 256 KB
testcase_12 AC 1 ms 256 KB
testcase_13 AC 1 ms 256 KB
testcase_14 AC 1 ms 256 KB
testcase_15 AC 1 ms 256 KB
testcase_16 AC 1 ms 256 KB
testcase_17 AC 1 ms 256 KB
testcase_18 AC 1 ms 256 KB
testcase_19 AC 1 ms 256 KB
testcase_20 AC 2 ms 256 KB
testcase_21 AC 2 ms 256 KB
testcase_22 AC 2 ms 256 KB
testcase_23 AC 10 ms 256 KB