东方博弈OJ/1101~1120解析

1101

#include <iostream>
using namespace std;
int a,b,c;
char a2,b2;
int a1,b1,c1;
long long ans,sum;
int main()
{
	cin>>a>>a2>>b>>b2>>c;
	cin>>a1>>a2>>b1>>b2>>c1;
	a*=3600;
	a1*=3600;
	b*=60;
	b1*=60;
	ans=ans+a+b+c;
	sum=sum+a1+b1+c1;
	cout<<ans-sum;
	return 0;
}

1102

#include <bits/stdc++.h>
using namespace std;
int main()
{
	string a;
	getline(cin, a);
	for (int i = 0; i < a.size()-1; i++)
	{
		for (int j = 0; j < a.size() - i - 1; j++)
		{
			if (a[j] != ' ' && a[j + 1] == ' ')
			{
				int temp = a[j];
				a[j] = a[j + 1];
				a[j + 1] = temp;
			}
		}
	}
	for (int i = 0; i < a.size(); i++)
	{
		cout << a[i];
	}
	return 0;
}

1103

#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) 
{
	char a[400];
	gets(a);
	int n = 0;
	char x = '\0';
	
	for (int i=0 ; i<=strlen(a); i++) 
    {
		if (a[i]!=x)
        { 
			if (n>1)
            {
				cout<<n<<x;
			}
            else if (n==1)
            { 
				cout<<x;
			}
			x= a[i];
			n  = 1;
		}
        else
        { 
			n++;
		}
	}	
}

1104

#include <bits/stdc++.h>
using namespace std;
int main()
{
	string a;
	getline(cin, a);
	int num = 0;
	int i;
	for (i = 0; i < a.size(); i++)
	{
		if (a[i] >= 48 && a[i] <= 57)
		{
			num = num * 10 + (a[i] - 48);
		}
		if ((a[i] >= 65 && a[i] <= 90) || (a[i] >= 97 && a[i] <= 122))
		{
			if (num == 0)
			{
				cout << a[i];
			}
			else
			{
				for (int j = 1; j <= num; j++)
				{
					cout << a[i];
				}
				num = 0;
			}
		}
	}
	return 0;
}

1105

#include <bits/stdc++.h>
using namespace std;
int main()
{
	string a, b;
	getline(cin, a);
	getline(cin, b);
	string c;
	c = a + b;
	for (int i = 0; i < c.size() - 1; i++)
	{
		for (int j = i + 1; j <= c.size(); j++)
		{
			if (c[i] == c[j])
			{
				c[j] = 0;
			}
		}
	}
	string d;
	for (i