T1：

//2022ts097
#include<bits/stdc++.h>
using namespace std;
int a[10],num,sum;
int main()
{
	for(int i=0;i<10;i++)cin>>a[i];
	cin>>num;
	for(int i=0;i<10;i++)if(a[i]<=num+30)sum++;
	cout<<sum;
	return 0;
}

T2：

//2022ts097
#include<bits/stdc++.h>
using namespace std;
int main()
{
	long long n;
	cin>>n;
	char flag='0';
	if(n<0)flag='1',n=-n;
	string sum="";
	while(n)
	{
		sum=(char)((n%2)+'0')+sum;
		n/=2;
	}
	long long len=sum.size();
	for(int i=0;i<31-len;i++)
	{
		sum="0"+sum;
	}
	sum=flag+sum;
	cout<<sum;
	return 0;
}
//User1
//00000000000000000000000000000101
//Ans1
//00000000000000000000000000000101
//User2
//00000000000000000000000000001010
//Ans2
//00000000000000000000000000001010
//User3
//10000000000000000000001111101000
//Ans3
//10000000000000000000001111101000

T3：

//2022ts097
#include<bits/stdc++.h>
using namespace std;
bool bum[10000010],chk[10000010];
long long sum[10000010];
long long ans=0;
int main()
{
	for(long long i=2;i<=10000000;i++)
	{
		if(bum[i])continue;
		for(long long j=2;i*j<=10000000;j++)
		{
			bum[i*j]=true;
		}
	}
	for(long long i=2;i<=10000000;i++)
	{
		if(bum[i])continue;
		long long num=i*i;
		for(long long j=1;num*j<=10000000;j++)
		{
			chk[num*j]=true;
		}
	}
	for(long long i=1;i<=10000000;i++)
	{
		sum[i]=sum[i-1]+(i*(1-chk[i]));
	}
	long long T;
	cin>>T;
	long long L,R,a,b,c;
	cin>>L>>R>>a>>b>>c;
	for(long long i=1;i<=T;i++)
	{
		ans^=sum[R]-sum[L-1];
		long long x=((L^b)+a)%c+1,y=((R^b)+a)%c+1;
		L=min(x,y),R=max(x,y);
	}
	cout<<ans;
	return 0;
}

T4：

//2022ts097
#include<bits/stdc++.h>
using namespace std;
long long sum,a[20][20],dp[20][20][2];
int main()
{
	long long m,n;
	cin>>m>>n;
	for(long long i=1;i<=m;i++)
	{
		for(long long j=1;j<=n;j++)
		{
			cin>>a[i][j];
		}
	}
	dp[0][1][0]=1,dp[1][0][0]=1;
	for(long long i=1;i<=m;i++)
	{
		for(long long j=1;j<=n;j++)
		{
			if(a[i][j]==1)
			{
				dp[i][j][1]+=dp[i-1][j][0];
				dp[i][j][1]+=dp[i][j-1][0];
			}
			dp[i][j][0]+=dp[i-1][j][0];
			dp[i][j][0]+=dp[i-1][j][1];
			dp[i][j][0]+=dp[i][j-1][0];
			dp[i][j][0]+=dp[i][j-1][1];
			sum=max(sum,dp[i][j][1]);
		}
	}
	cout<<sum+1;
	return 0;
}

T5：

//2022ts097
#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
using namespace std;
int t,x,y;
char m[30][30];
int d[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
int s_x=-1,s_y=-1,m_x=-1,m_y=-1;
struct node{int x,y,q,t;};
int bfs()
{
	deque<node> num;
	num.push_back({s_x,s_y,0,0});
	while(!num.empty())
	{
		if(num.front().q)
		{
			num.front().q=0;
			num.front().t+=1;
			num.push_back(num.front());
			num.pop_front();
			continue;
		}
		int now_x=num.front().x,now_y=num.front().y,now_t=num.front().t;
		m[now_x][now_y]='o';
		num.pop_front();
		if(now_x==m_x && now_y==m_y)return now_t;
		for(int i=0;i<4;i++)
		{
			int nxt_x=now_x+d[i][0],nxt_y=now_y+d[i][1];
			if(nxt_x<1 || nxt_x>x || nxt_y<1 || nxt_y>y)continue;
			if(m[nxt_x][nxt_y]=='o')continue;
			if(m[nxt_x][nxt_y]=='#')num.push_back({nxt_x,nxt_y,1,now_t+1});
			if(m[nxt_x][nxt_y]=='.' || m[nxt_x][nxt_y]=='m')num.push_back({nxt_x,nxt_y,0,now_t+1});
		}
	}
	return INF;
}
int main()
{
	cin>>t>>y>>x;
	for(int i=1;i<=x;i++)
	{
		for(int j=1;j<=y;j++)
		{
			cin>>m[i][j];
			if(m[i][j]=='s')
			{
				s_x=i,s_y=j;
			}
			if(m[i][j]=='m')
			{
				m_x=i,m_y=j;
			}
		}
	}
	int ct=bfs();
	if(ct>t)
	{
		cout<<"55555";
		return 0;
	}
	cout<<ct;
	return 0;
}
//
//Input1
//11
//10
//8
//......s...
//..........
//#ooooooo.o
//#.........
//#.........
//#.........
//#.....m...
//#.........
//User1
//10
//STD1
//10
//
//Input2
//11
//10
//8
//......s...
//..........
//#ooooooo.o
//#.........
//#.........
//#.....#...
//#....#m#..
//#.....#...
//User2
//11
//STD2
//11
//
//Input3
//10
//10
//8
//......s...
//..........
//#ooooooo.o
//#.........
//#.........
//#.....o...
//#....om#..
//#.....o...
//User3
//55555
//STD3
//55555