avatar
Exploring the Fascinating Universe of Paper Folding

Guest 139 27th Dec, 2024

#include <iostream>

using namespace std;

int tohop(int n, int k)
{
	if (k == 1)
		return n;
	if (k == 0 || k == n)
		return 1;
	return tohop(n - 1, k - 1) + tohop(n - 1, k);
}

int demsonguyen(int n)
{
	if (n < 10)
		return 1;
	return 1 + demsonguyen(n / 10);
}

int tinhtong(int n)
{
	if (n < 10)
		return n;
	return tinhtong(n/10)+ n%10;
}

int ktrasole(int n)
{
	if (n % 2 != 0)
		return 1;
	return 0;
}

int demsole(int n)
{
	if (n == 1)
		return 1;
	return demsole(n / 10) + ktrasole(n);
}

int ktrasochan(int n)
{
	if (n % 2 == 0)
		return n;
	return 0;
}

int tongsochan(int n)
{
	if (n == 1||n==0)
		return 0;
	return tongsochan(n / 10) + ktrasochan(n%10);
}

int timsodautien(int n)
{
	if (n < 10)
		return n;
	return timsodautien(n / 10);
}

int timsodaonguoc(int n)
{
	if (n < 10)
		return n;
	return timsodaonguoc(n / 10) + (n % 10)*pow(10, demsonguyen(n) - 1);
}


int MAX(int n)
{
	if (n < 10)
		return n;
	if ((n % 10) > MAX(n / 10))
		return n%10;
	return  MAX(n / 10);
}

int toanle(int n)
{
	if (n == 0)
	{
		return 1;
	}
	else
	{
		int chuso = n % 10;
		if (chuso % 2 == 0)
		{
			return 0;
		}
		return toanle(n / 10);
	}
}

int main()
{
	int n, k;
	cin >> n >> k;
	//cout << tohop(n, k) << endl;
	//cout << demsonguyen(n);
	//cout << tinhtong(n);
	//cout << demsole(n);
	//cout << tongsochan(n);
	//cout << timsodautien(n);
	//cout<<timsodaonguoc(n);
	//cout << MAX(n);
	cout << toanle(n);
	system("pause");
}
Markup
Description

No description

To share this paste please copy this url and send to your friends
RAW Paste Data