211218函数

//01美丽数字

# include <iostream>
using namespace std;
int quyu(int a)
{
	int b;
	while(a>=10)
	{
		if(a%10==6 || a/10==6)
		{
			return 6;
			break;
		}
		else
			a=a/10;
	}
	return 0;
}
int beau(int a)
{
	if(a%6==0)
	{	
		cout<<a<<endl;
		return 1;
	}
	else if(a>10 && quyu(a)==6)
	{
		cout<<a<<endl;
		return 1;
	}
	else return 0;
}
int main ()
{
	int a;
	int n=0;
	int b=1;
	cin>>a;
	while(b<=a)
	{
		n+=beau(b);
		b+=1;
	}
	cout<<n;
	return 0;
}

//2 一个整数有几个奇数字，几个偶数字

# include <iostream>
using namespace std;
int ji(long long int i)
{
	int sum=0;
	while(i==0)
		return sum;
	while(i!=0)
	{
		if(i%10%2!=0)
			sum++;
		i=i/10;
	}
	return sum;
}
int ou(long long int i)
{
	int sum=0;
	while(i==0)
		return 1;
	while(i!=0)
	{
		if(i%10%2==0)
			sum++;
		i=i/10;
	}
	return sum;
}
int main ()
{
	long long int n;
	cin>>n;
	cout<<ji(n)<<endl;
	cout<<ou(n);
	return 0;
}

//03 因子

# include <iostream>
using namespace std;

int ret(int a)
{
	int sum=0;
	for(int i=2;i<a;i++)
	{
		if(a%i==0)
		{
			sum++;
			cout<<i<<" ";
		}
	}
	return sum;
}
int main ()
{
	long int n;
	cin>>n;
	cout<<ret(n);
	return 0;
}

//4 数字反转

# include <iostream>
using namespace std;

int back(int a)
{
	long int b=0,i=1000000000;
	if(a==0)
		return b;
	else if(a>0)
	{
		while(a/i==0)
			i=i/10;
		while(a!=0)
		{
			b=b+a%10*i;
			i=i/10;
			a=a/10;
		}
		return b;
	}
	else if(a<0)
	{
		while(a/i==0)
			i=i/10;
		while(a!=0)
		{
			b=b+a%10*i;
			i=i/10;
			a=a/10;
		}
		return b;
	}
}
int main ()
{
	long int n;
	cin>>n;
	cout<<back(n);
	return 0;
}

//5 验证歌德巴赫猜想

# include <iostream>
using namespace std;
int sushu(int i)
{
	int b=3,c=0;
	for(int b=3;b<i;b++)
	{
		if(i%b==0)
		return 0;
	}
	return i;
}
void sushuhe(int a)
{
	int x=3,y=a-3;
	while(x<=a/2 && y>0)
	{
		if(sushu(x) && sushu(y))
		{
			cout<<a<<" = "<<x<<" + "<<y<<endl;
		}
		x++;
		y--;
	}
}
int main ()
{
	long int n;
	cin>>n;
	sushuhe(n);
	return 0;
}

//6 求两数的最大公约数

# include <iostream>
using namespace std;
int gongyueshu(int a,int b)
{
	int n=10000000;
	while(n!=0)
	{
		if(a%n==0 && b%n==0 )
			return n;
		n=n-1;
	}
}
int main ()
{
	int a,b;
	cin>>a>>b;
	cout<<gongyueshu(a,b);
	return 0;
}

//7 求两数的最小公倍数

# include <iostream>
using namespace std;
int gongbeishu(int a,int b)
{
	int n;
	n=a>b?a:b;
	while(1)
	{
		if(n%a==0 && n%b==0 )
			return n;
		n=n+1;
	}
}
int main ()
{
	int a,b;
	cin>>a>>b;
	cout<<gongbeishu(a,b);
	return 0;
}

//8 按要求输出$

# include <iostream>
using namespace std;
void prin(int a)
{
	int c;
	for(int b=1;b<=a;b++)
	{
		c=b;
		while(c!=0)
		{
			cout<<"$";
			c--;
		}
		cout<<endl;
	}
}
int main ()
{
	int a;
	cin>>a;
	prin(a);
	return 0;
}