Calculate a + b and output the sum in standard format -- that is, the digits must be separated into groups of three by commas (unless there are less than four digits).

Input

Each input file contains one test case. Each case contains a pair of integers a and b where -1000000 <= a, b <= 1000000. The numbers are separated by a space.

Output

For each test case, you should output the sum of a and b in one line. The sum must be written in the standard format.

-1000000 9

-999,991

#include <iostream>
#include <string>
#include <vector>
using namespace std;

int main()
{
	int a, b;
	int res;
	string temp;
	cin >> a >> b;

	res = a + b;
	if(res == 0)
	{
		cout << "0"<< endl;
		return 0;
	}
	int flag = 0;
	if(res < 0)
	{
		flag = 1;
		res = -res;
	}

	int len = 0;
	
	while(res)
	{
		temp.insert(temp.begin(), res%10+'0');
		res /= 10;
		len++;
		if(len % 3 == 0 && res > 0)
		{
			temp.insert(temp.begin(), ',');
		}
	}
	
	if(flag)
		cout<< "-";
	cout<< temp<< endl;
	return 0;
}

1002. A+B for Polynomials (25)

2 1 2.4 0 3.2
2 2 1.5 1 0.5

3 2 1.5 1 2.9 0 3.2

#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;

struct node {
	int a;
	double n;
};

int main()
{
	int k1, k2;
	vector<node> l1, l2;
	int i, j;

	cin>> k1;
	for(i = 0; i <k1; i++)
	{
		node temp;
		cin >>temp.a >> temp.n;
		l1.push_back(temp);
	}

	cin>> k2;
	for(i = 0; i <k2; i++)
	{
		node temp;
		cin >>temp.a >> temp.n;
		l2.push_back(temp);
	}

	vector<node> res;

	i = j = 0;
	while(i< l1.size() && j < l2.size())
	{
		node temp;
		if(l1[i].a > l2[j].a)
		{
			temp.a = l1[i].a;
			temp.n = l1[i].n;
			i++;
		}
		else if(l1[i].a < l2[j].a)
		{
			temp.a = l2[j].a;
			temp.n = l2[j].n;
			j++;
		}
		else
		{
			temp.a = l1[i].a;
			temp.n = l1[i].n + l2[j].n;
			i++; j++;
		}
		if(abs(temp.n - 0) < 0.1)	//第二个case的注意点
			continue;
		res.push_back(temp);
	}

	while(i < l1.size())
		res.push_back(l1[i++]);
	while(j < l2.size())
		res.push_back(l2[j++]);

	if(res.size() > 0)
	{
		printf("%d", res.size());
		for(i = 0;  i < res.size(); i++)
		{
			printf(" %d %.1lf", res[i].a, res[i].n);
		}
		printf("\n");
	}
	else
		printf("0\n");

	return 0;
}

1003. Emergency (25)

5 6 0 2
1 2 1 5 3
0 1 1
0 2 2
0 3 1
1 2 1
2 4 1
3 4 1

2 4

#include <iostream>
#include <vector>
#include <climits>
using namespace std;

struct city {
	city():reached(0), nr_team(0){};
	int reached;
	int  nr_team;
};

int N, M, C1, C2;
int min_l = INT_MAX , max_t = 0;
int path = 0;
void rescue(vector<city>& cities, vector<vector<int>>& matrix, int &dis, int &nr_t, int x)
{
	int i;
	
	for(i = 0; i < cities.size(); i++)
	{
		if(matrix[i][x] > 0 && cities[i].reached == 0)
		{
			dis += matrix[i][x];
			nr_t += cities[i].nr_team;
			cities[i].reached = 1;
			if(i == C2)
			{
				if(dis < min_l)
				{
					min_l = dis;
					path = 1;
					max_t = nr_t;
				}
				else if(dis == min_l)
				{
					max_t = max(max_t, nr_t);
					path++;
				}
			}
			else
			{
				rescue(cities, matrix, dis, nr_t, i);
			}
			dis -= matrix[i][x];
			nr_t -= cities[i].nr_team;
			cities[i].reached = 0;
		}
	}
}

int main()
{
	vector<city> cities;

	cin>> N >> M>> C1>> C2;
	int i;
	for(i = 0; i < N; i++)
	{
		city temp;
		cin >> temp.nr_team;
		cities.push_back(temp);
	}

	if(C1 == C2)	//重要的边界条件
	{
		cout<<"1 "<<cities[C1].nr_team<< endl;
		return 0;
	}

	vector<vector<int>> matrix(N, vector<int>(N, 0));
	for(i = 0; i < M; i++)
	{
		int x, y, l;
		cin >> x>> y >>l;
		matrix[x][y] = l;
		matrix[y][x] = l;
	}

	int dis = 0, nr_t = cities[C1].nr_team;
	cities[C1].reached = 1;
	rescue(cities, matrix, dis, nr_t, C1);

	cout<< path << " "<< max_t<< endl;

	return 0;
}

1004. Counting Leaves (30)

ID K ID[1] ID[2] ... ID[K]

2 1
01 1 02

0 1

#include <iostream>
#include <vector>
#include <string>
#include <queue>
using namespace std;

int N, M;

struct node {
	node():id(-1){};
	int id;
	vector<int> children;
};

int main()
{
	cin >> N>> M;
	vector<node> nodes(100);

	int i;
	for(i = 0; i < M; i++)
	{
		int id, k;
		cin >> id>> k;
		nodes[id].id = id;
		for(int j = 0; j < k; j++)
		{
			int t;
			cin >> t;
			nodes[t].id = t;
			nodes[id].children.push_back(t);
		}
	}
	int flag = 0;
	queue<int> q;
	q.push(1);
	while(!q.empty())
	{
		int num = q.size();
		int leaves = 0;
		for(i = 0; i < num; i++)
		{
			node temp = nodes[q.front()];
			q.pop();

			if(temp.children.empty())
				leaves++;
			else
			{
				for(int j =0; j < temp.children.size(); j++)
				{
					q.push(temp.children[j]);
				}
			}
		}
		if(!flag)
		{
			cout<< leaves;
			flag = 1;
		}
		else
			cout<<  " "<< leaves;
	}
	cout<< endl;
	return 0;
}

版权声明：本文为博主原创文章，未经博主允许不得转载。