(I7
I122
I150
(dp0
Vremoval.%l
p1
(Vremoval.cpp
p2
S'#include <bits/stdc++.h>\r\nusing namespace std;\r\n\r\nint t;\r\n\r\nbool pnums[10000000];\r\nint primes[80000];\r\nint cprimes = 0;\r\n\r\nvoid find_primes() {\r\n    for (int i = 2; i < 1000000; ++ i) {\r\n        if(!pnums[i]) {\r\n            primes[cprimes] = i;\r\n            cprimes ++;\r\n            for (int j = i + i; j < 10000000; j += i) {\r\n                pnums[j] = true;\r\n            }\r\n        }\r\n    }\r\n}\r\n\r\nint main() {\r\n    cin >> t;\r\n    find_primes();\r\n    for (int ti = 0; ti < t; ++ ti) {\r\n        int n;\r\n        int nums[100000];\r\n        cin >> n;\r\n        for (int i = 0; i < n; ++ i) {\r\n            cin >> nums[i];\r\n        }\r\n        int curr = 0, ans = 0;\r\n        sort(nums, nums + n);\r\n        for (int i = 0; primes[i] <= nums[n - 1]; ++ i) {\r\n            for (int j = 0; j < n; ++ j) {\r\n                if (nums[j] % primes[i] == 0) {\r\n                    curr ++;\r\n                }\r\n            }\r\n            ans = max(ans, curr);\r\n            curr = 0;\r\n        }\r\n        cout << n - ans << endl;\r\n    }\r\n    return 0;\r\n}\r\n'
p3
tp4
stp5
.