质数因子,取近似值，合并表记录，提取不重复整数

#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main()
{
	long long a;
	int s;
	while (cin >> a)
	{
		for (int i = 2; i <= a; ++i)
		{
			while (a % i == 0)
			{
				cout << i << " ";
				a = a / i;
			}
		}
	}
	return 0;
}

#include<iostream>
#include<string>
using namespace std;
int main()
{
    float a;
    cin>>a;
    int b = a * 10;
    b = b % 10;
    if(b >= 5)
        cout<<(int)(a + 1)<<endl;
    else 
        cout<<(int)a <<endl;
    return 0;
}

#include<string>
#include<iostream>
#include<vector>
#include<map>
using namespace std;
int main()
{
	int line;
	cin >> line;

	map<int, int> mmap;
	for (int i = 0; i < line; ++i)
	{
		int a, b;
		cin >> a >> b;
		if (mmap.find(a) != mmap.end())
		{
			int c = mmap.find(a)->second;
			mmap.erase(a);
			mmap.insert(make_pair(a, c + b));
		}
		else
			mmap.insert(make_pair(a, b));
	}
	for (auto e : mmap)
		cout << e.first << " " << e.second << endl;
	return 0;
}

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
	int array[10] = { 0 };
	int a;
	cin >> a;
	string b = to_string(a);
	reverse(b.begin(),b.end());
	string count;
	for (size_t i = 0; i < b.size(); ++i)
	{
		if (array[b[i] - 48] == 0)
		{
			count += b[i];
			array[b[i] - 48] = 1;
		}
	}
	//reverse(count.begin(), count.end());
	cout << atoi(count.c_str()) << endl;


	return 0;
}