2022/3/17阿尔法

#include <iostream>
#include <cstdlib> 
using namespace std;
int rollDice();
enum GameStatus { WIN, LOSE, PLAYING };
int main() {
	GameStatus status;
	int sum, myPoint;
	unsigned seed;

	cin >> seed;
	srand(seed);
	sum = rollDice();
	switch (sum)
	{
	case 7:
	case 11:
		status = WIN; break;
	case 2:
	case 3:
	case 12:
		status = LOSE; break;
	default:
		status = PLAYING;
		myPoint = sum;
		cout << "Point is " << myPoint << endl;
	}
	while (status == PLAYING) {
		sum = rollDice();
		if (sum == myPoint)
			status = WIN;
		else if (sum == 7)
			status = LOSE;
	}
	if (status == WIN)
		cout << "player wins" << endl;
	else
		cout << "player loses" << endl;
	return 0;
}
int rollDice() {
	int point1 = 1 + rand() % 6;
	int point2 = 1 + rand() % 6;
	int sum = point1 + point2;
	cout << "player rolled " <<" "<< point1 << "+" << " "<<point2 << "=" << sum << endl;
	return sum;
}

#include<stdio.h>

float c,f;
int main(){
     scanf("%f",&f);
		c=(f-32)*5/9;
		printf("转换后的摄氏温度为%.2lf\n",c);
	
	return 0;
}

#include <iostream>
#include <cstring>
#include <algorithm>
#include<bits/stdc++.h>
using namespace std;

int main()
{
	int n;
	cin >> n;
	int sum = 1;
	for (int i = 1; i <n; i++)
	{
		sum = (sum + 1) * 2;

	}
	cout << sum;

}

#include <iostream>
#include <cstring>
#include <algorithm>
#include<bits/stdc++.h>
using namespace std;

int main()
{
	double a, b;
	cin >> a >> b;
	printf("%.3f%%", b / a*100);


}

#include <iostream>
#include <cstring>
#include <algorithm>
#include<bits/stdc++.h>
using namespace std;

int main()
{
	double  h, r; 
	cin >> h >> r;
	double  s = 3.14 * r * r * h;
cout << ceil( 20000 / s);

	


}

#include <iostream>
using namespace std;


int leapYear(int y)
{
    if(y % 4 == 0 && y % 100 != 0 || y % 400 == 0)
        return 1;
    return 0;
}


int whatDay(int year, int month)
{
	int n = 0, w = 0, i;
	for (i = 1; i < year; i++)
	{
		if(leapYear(i))
		{
			n += 366;

		}
		else
			n += 365;
	}
	
	if(leapYear(year))
		switch(month)
		{
			case 12:
				n += 336;
				break;
			case 11:
				n += 306;
				break;
			case 10:
				n += 275;
				break;
			case 9:
				n += 245;
				break;
			case 8:
				n += 214;
				break;
			case 7:
				n += 183;
				break;
			case 6:
				n += 153;
				break;
			case 5:
				n += 122;
				break;
			case 4:
				n += 92;
				break;
			case 3:
				n += 61;
				break;
			case 2:
				n += 31;
				break;
			case 1:
				n += 1;
				break;
		}
	else 
		switch(month)
		{
			case 12:
				n += 335;
				break;
			case 11:
				n += 305;
				break;
			case 10:
				n += 274;
				break;
			case 9:
				n += 244;
				break;
			case 8:
				n += 213;
				break;
			case 7:
				n += 182;
				break;
			case 6:
				n += 152;
				break;
			case 5:
				n += 121;
				break;
			case 4:
				n += 91;
				break;
			case 3:
				n += 60;
				break;
			case 2:
				n += 32;
				break;
			case 1:
				n += 1;
				break;;
		}	
	w += n;
	w = w % 7;
	if (w == 0) w = 7;

	return w;
}

int main()
{
    int y, m, xq;     
    cin >> y >> m;   
    xq = whatDay(y,m);   
    cout << y << "年" << m << "月1日是星期";    
    if(xq == 7)
        cout << "日" << endl;
    else
        cout << xq << endl;
    return 0;
}

#include <iostream>
#include <cstring>
#include <algorithm>
#include<bits/stdc++.h>
using namespace std;

int main()
{
	int q[1000];
	int a, b;
	cin >> a >> b;
	int ans = 0;
	for (int i = a; i <= b; i++) {
		if (i % 400 == 0 || i % 4 == 0 && i % 100 != 0) {
			ans++;
			q[ans] = i;

		}
	}
    
    
	cout << ans;
    
     cout << endl;
	for (int i = 1; i <= ans; i++)
		cout << q[i]<<" ";




}

#include <iostream>
#include <cstring>
#include <algorithm>
#include<bits/stdc++.h>
using namespace std;

int main()
{
	string a ;
	cin >> a; 
	for (int i = 0; i < a.size(); i++)
	{
		if (a[i] >= 'a' && a[i] <= 'z') a[i] = a[i] - 32;
		cout << a[i];


	}



}

#include<bits/stdc++.h>
int main()
{
	int n,sum,count=0;
	scanf("%d%d",&sum,&n);
	for(int i=1;i<=n;i++)
	{
		int p;
		scanf("%d",&p);
		if(p<=sum)
		sum-=p;
		else
		count++;
	}
	printf("%d",count);
}

#include<bits/stdc++.h>
using namespace std;
int main() {
	char a[50], b[50]; 
	cin >> a;


	for (int i = 0; i < strlen(a); i++) {
		if (a[i] >= 'a' && a[i] <= 'z') {
			if (a[i] >= 'a' && a[i] <= 'w') 
				b[i] = char(a[i] + 3 - 32);
			else 
				b[i] = char(a[i] - 23 - 32);
		}
		else {
			if (a[i] >= 'A' && a[i] <= 'W') 
				b[i] = char(a[i] + 3 + 32);
			else
				b[i] = char(a[i] - 23 + 32);
		}
	}
	for (int i =strlen(a)- 1; i >= 0; i--) 
		cout << b[i];
	return 0; 
}

#include<iostream>
using namespace std;
void hanoi(char a,char b,char c,int n){
    if (n==1) cout<<a<<" -> "<<c<<endl;  //直接移动到C柱，输出 
    else {
        hanoi(a,c,b,n-1);  //把上面n-1个移到B柱
        cout<<a<<"-->"<<c<<endl;  //输出
        hanoi(b,a,c,n-1);  //把剩下n-1个从B柱移到C柱
    }
}
int main(){
    int n;
    cin>>n;
    hanoi('A','B','C',n);
}

#include <iostream>
using namespace std;

int main()
{
	int n, k;
	cin >> n >> k;
	int q = n - k+1 ;
	int sum = -0;
	int jc1 = 1;
	for (int i = 1; i <= k;i++)
	{
		jc1 = jc1* i;
	
	}
	int jc2 = 1;
	int sum2 = 0;
	for (int i = q; i <= n;i++) {
		jc2 = i * jc2;
		
	}
//	cout << jc1 << " " << jc2<<"\n";

	cout << jc2 / jc1;

}

#include <iostream>
using namespace std;
int fun(int n)
{
	if (n == 1 || n == 2) return 1;
	else
	{
		return fun(n - 1) + fun(n - 2);

	}
}
int main()
{

	int n;
	cin >> n;

	cout << fun(n);

	return 0;
}

#include <iostream>
#include<vector>
using namespace std;
int solve(int x, int y) {//递归
	if (x == 1 || y == 1) {
		return 1;
	}
	return solve(x - 1, y) + solve(x, y - 1);
}
int main()
{

	int n, m;
	cin >> n >> m;
	cout << solve(n, m);



}

#include <iostream>
using namespace std;

int fun(int n) {
    /*********** begin *************/
    
    
    
    
    /************ end **************/
}

int main() {
    /*********** begin *************/
    
    cout << 18;
    
    
    /************ end **************/
    return 0;
}