Submission #7509900

---

Source Code Expand

#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <complex>
#include <cctype>
#include <bitset>
using namespace std;
typedef string::const_iterator State;
#define Ma_PI 3.141592653589793
const long double eps = 1e-12;
#define LONG_INF 1e18
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL
#define MOD 998244353LL
#define seg_size 262144*2
#define REP(a,b) for(long long a = 0;a < b;++a)
int main() {
	vector<int> go;
	int n;
	cin >> n;
	REP(i, n) {
		int a;
		cin >> a;
		go.push_back(a);
	}
	sort(go.begin(), go.end());
	set<int> hoge;
	int ans = 0;
	for (int i = go.size() - 1; i >= 0; --i) {
		if (hoge.find(go[i] * 2) != hoge.end()) {
			ans--;
		}
		ans++;
		hoge.insert(go[i]);
	}
	cout << ans << endl;
}

Submission Info

Judge Result