-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path038-not-adding.cpp
More file actions
49 lines (48 loc) · 1.11 KB
/
Copy path038-not-adding.cpp
File metadata and controls
49 lines (48 loc) · 1.11 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
/*
* Not Adding [1627D]
* Problem: https://codeforces.com/problemset/problem/1627/D
* Verdict: ACCEPTED Solved: 2022-06-22
* Language: C++20 (GCC 11-64)
* Runtime: 218 ms Memory: 100 KB
* Tags: brute force, dp, math, number theory
* Author: BidoTeima
* Source: https://codeforces.com/contest/1627/submission/161510940
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void ACPLS()
{
#ifndef ONLINE_JUDGE
freopen("output.txt", "w", stdout);
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void moo(string fileName){
freopen((fileName+".in").c_str(),"r",stdin);
freopen((fileName+".out").c_str(),"w",stdout);
}
#define tc int tttt;cin>>tttt;while(tttt--)
int main()
{
ACPLS();
int n;
cin>>n;
bitset<1000001>vis{};
for(int i = 0; i < n; i++){
int x;
cin>>x;
vis[x]=1;
}
for(int i = 1; i <= 1e6; i++){
int g=0;
for(int j = i; j <= 1e6; j+=i){
g=__gcd(g,vis[j]*j);
}
if(g==i)vis[i]=1;
}
cout<<vis.count()-n;
}