东方博弈OJ/1101~1120解析

S---Curry@2024

已于 2023-08-04 12:25:02 修改

阅读量347

点赞数 3

文章标签：算法数据结构

于 2023-07-14 13:03:04 首次发布

本文链接：https://blog.csdn.net/herryhzx/article/details/131721154

版权

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 (int i = 0; i < c.size(); i++)
	{
		if (c[i] != 0)
		{
			d += c[i];
		}
	}
	for (int i = 0; i < d.size(); i++)
	{
		cout << d[i];
	}
	return 0;
}

1106

#include <iostream>
#include <string>
using namespace std;
int main()
{
	string a;
	getline(cin, a);
	int num = 1;
	for (int i = 0; i < a.size(); i++)
	{
		if (a[i] == ' ' && a[i + 1] != ' ')
		{
			num++;
		}
	}
	cout << num;
	return 0;
}
//这题跟1107搞反了！我真是服了！！！

1107

#include <bits/stdc++.h>
using namespace std;
string s, w = "", ma = "";
int main() {
	getline(cin, s);
	for (int i = 0; i < s.size(); i++)
    {
	if (isalpha(s[i]))
        {
			w = w + s[i];
			if (i == s.size() - 1 || !isalpha(s[i + 1])) 
            {
				if (w.size() > ma.size()) ma = w;
                  w = "";
			}
		}
	}
 
	cout << ma;
	return 0;
}

1108

#include <bits/stdc++.h>
using namespace std;
int main() {
	int a[20];
	int num = 0;
	int length = 0;
	cin >> num;
	while (num / 2) 
	{
		a[length] = num % 2;
		length++;
		num = num / 2;
	}
	a[length] = num;
	length++;
	for (int i = length - 1; i >= 0; i--)
	{
		cout << a[i];
	}
	return 0;
}

1109

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int n,g,s,b,q;
	cin>>n;
	g=n%10+5;
	s=n%100/10+5;
	b=n%1000/100+5;
	q=n/1000+5;
	g%=10;
	s%=10;
	b%=10;
	q%=10;
	cout<<g<<s<<b<<q;
	return 0; 
}

1110

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int n,sum=0;
	cin>>n;
	for(int i=1;i<=n;i=i+2)
{
		sum+=i;
	}
	cout<<sum;
    return 0;
}

1111

#include <bits/stdc++.h>
using namespace std;
int main()
{
	
	string a;
	getline(cin, a);
	a = ' ' + a;
	a[a.size() - 1] = ' ';
	a += '.';
	int loc = 0;
	int num = 0;
	int max_loc = 0;
	int max_num = 0;
	int i;
	if (a.find('a') > a.size())
	{
		cout << "NO";
		return 0;
	}
	else
	{
		for (i = 0; i < a.size(); i++)
		{
			for (i; i < a.size(); i++)
			{
				if (a[i] == 'a')
				{
					break;
				}
			}
			for (i; i >= 0; i--)
			{
				if (a[i] == ' ')
				{
					loc = i + 1;
					break;
				}
			}
			for (i = i + 1; i < a.size(); i++)
			{
				if (a[i] != ' ')
				{
					num++;
				}
				else
				{
					if (max_num < num)
					{
						max_num = num;
						max_loc = loc;
					}
					num = 0;
					break;
				}
			}
		}
		for (int i = max_loc; i < max_loc + max_num; i++)
		{
			cout << a[i];
		}
		return 0;
	}
}

1112

#include <bits/stdc++.h>
using namespace std;
int main() {
	string a;
	string b;
	string c;
	getline(cin, a);
	getline(cin, b);
	getline(cin, c);
	int pos;
	pos = a.find(b);
	while (!(pos > a.size())) 
	{
		a.replace(pos, b.length(), c);
		pos += c.length();
		pos = a.find(b, pos); 
	}
	cout << a;
	return 0;
}

1113

#include <bits/stdc++.h>
using namespace std;
int main()
{
	string str;
	getline(cin, str);
	int a[101] = { 0 };
	int num1 = 0;
	int a_num = 0;
	int b[101] = { 0 };
	int num2 = 0;
	int b_num = 0;
	int first = 0;
	for (int i = 0; i < str.size(); i++)
	{
		if (str[i] >= 48 && str[i] <= 57 && first == 0)
		{
			num1 = i + 1;
			for (i; i < str.size(); i++)
			{
				if (str[i] >= 48 && str[i] <= 57)
				{
					a[a_num] = str[i] - 48;
					a_num++;
				}
				if (!(str[i] >= 48 && str[i] <= 57))
				{
					break;
				}
			}
			first = 1;
		}
		if (str[i] >= 48 && str[i] <= 57 && first == 1)
		{
			num2 = i + 1;
			for (i; i < str.size(); i++)
			{
				if (str[i] >= 48 && str[i] <= 57)
				{
					b[b_num] = str[i] - 48;
					b_num++;
				}
				if (!(str[i] >= 48 && str[i] <= 57))
				{
					break;
				}
			}
			first = 2;
		}
		if (first == 2)
		{
			if (a_num > b_num)
			{
				num2 = 0;
				b_num = 0;
				for (int i = 0; i < 101; i++)
				{
					b[i] = 0;
				}
				first = 1;
			}
			if (a_num < b_num)
			{
				num1 = 0;
				a_num = 0;
				for (int i = 0; i < 101; i++)
				{
					a[i] = 0;
				}
				for (int i = 0; i < b_num; i++)
				{
					a[i] = b[i];
				}
				num1 = num2;
				a_num = b_num;
				num2 = 0;
				b_num = 0;
				for (int i = 0; i < 101; i++)
				{
					b[i] = 0;
				}
				first = 1;
			}
			if (a_num == b_num)
			{
				int op = 0;
				for (int i = 0; i < a_num; i++)
				{
					if (a[i] > b[i] && op == 0)
					{
						num2 = 0;
						b_num = 0;
						for (int i = 0; i < 101; i++)
						{
							b[i] = 0;
						}
						op = 1;
					}
					if (a[i] < b[i] && op == 0)
					{
						num1 = 0;
						a_num = 0;
						for (int i = 0; i < 101; i++)
						{
							a[i] = 0;
						}
						for (int i = 0; i < b_num; i++)
						{
							a[i] = b[i];
						}
						num1 = num2;
						a_num = b_num;
						num2 = 0;
						b_num = 0;
						for (int i = 0; i < 101; i++)
						{
							b[i] = 0;
						}
						op = 1;
					}
					if (a[i] == b[i])
					{
						continue;
					}
				}
			}
		}
	}
	cout << num1;
	return 0;
}

手已经废了！

1114

#include <bits/stdc++.h>
using namespace std;
int main()
{
	string a;
	getline(cin, a);
	int result = 0;
	int adjust = 0;
	int j = 0;
	int q = 0;
	int can = 0;
	int num = 0;
	for (int i = a.size() - 1; i >= 0; i--)
	{
		if (a[i] != '=')
		{
			result += (a[i] - 48) * pow(10, j);
			j++;
		}
		else
		{
			break;
		}
	}
	for (int i = 0; i < a.size(); i++)
	{
		if (a[i] != '=')
		{
			adjust = adjust * 10 + a[i] - 48;
			q++;
		}
		else
		{
			break;
		}
	}
	for (int i = 1; i <= q - 1; i++)
	{
		num = adjust - adjust / (int)pow(10, i) * (int)pow(10, i) + adjust / (int)pow(10, i);
		
		if (num == result)
		{
			cout << adjust / (int)pow(10, i) << "+" << adjust - adjust / (int)pow(10, i) * (int)pow(10, i) << "=" << result;
			can = 1;
			break;
		}
	}
	if (can == 0)
	{
		cout << "Impossible!";
	}
	return 0;
}

1115

#include<bits/stdc++.h>
using namespace std;
int main()
{
	char a[210];
	int i,s=0;
	cin>>a;
	for(i=0;i<strlen(a);i++)
		s=s+(a[i]-48);
	cout<<s;
	return 0;
}

1116

#include <bits/stdc++.h>
using namespace std;
int main()
{
	char s[10000],t[10000];
	int i=0;
	while(cin>>s[i])
	{
	    if(s[i]==',')
	{
    s[i]='\0';
    break;
    }
	   i++;
	}
    cin>>t;
    strcat(t,",");
    cout<<t<<s<<endl;
}

1117

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

1118

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int x,y,s,flag=1;
	int a[100];
	cin>>x>>y;
	for(int i=x;i<=y;i++)
    {
		s=i*i;
		if(s>=1000000 && s<=9999999)
        {
			flag=1;
			for(int j=7;j>=1;j--)
            {
				a[j]=s%10;
				s/=10;
			}
			for(int k=1;k<=7;k++)
            {
				for(int l=k+1;l<=7;l++)
                {
					if(a[k]==a[l])
                    {
						flag=0;
						break;
						}
					}
				}
			}
			if(flag==1)
            {
				cout<<i<<endl;
			}
		}

  return 0;
}

1119

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	int sum=0;
	cin>>n;
	while(n)
    {
		sum+=n%10;
		n/=10;
	}
	cout<<sum;
    return 0;
}

1120

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

如果你喜欢我的博客可以点个赞支持一下。