坤坤

小芒果很忙

https://win7simu.visnalize.com/?utm_source=pwa

小码君

/*在女同学面前装X：基数排序，时间复杂度o(n+k),空间复杂度o(n)*/
#include<bits/stdc++.h>
using namespace std;
int mkc[114514];
int main(){
	int n,LAL;
	scanf("%d",&n);
	for(int i=1;i<=n;++i){
		scanf("%d",&LAL);
		mkc[LAL]++;
	}
	for(int i=1;i<=114514;++i){
		if(mkc[i]){
			while(mkc[i]--) printf("%d ",i);
		}
	}
	return 0;
}

//装逼哥：快速幂
#include<bits/stdc++.h>
using namespace std;
int p;
long long a,b;
long long mkc(long long a,long long b){
	if(b==0) return 1;
	if(b%2==0) return mkc(a*a%p,b/2)%p;
	else{
		return a*mkc(a,b-1)%p;
	}
}
int main(){
	cin>>a>>b>>p;
	cout<<a<<"^"<<b<<" mod "<<p<<"="<<mkc(a,b);
}

//深度优先搜索
//我是傻逼(mkh)来装逼了
#include<bits/stdc++.h>
using namespace std;
char mat[505][505];
int vis[505][505];
int n,m,flag=0;;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
void dfs(int x,int y){
    vis[x][y]=1;
    if(mat[x][y]=='g'){
        flag=1;
        return;
    }
    for(int i=0;i<4;++i){
        int tx=x+dx[i];
        int ty=y+dy[i];
        if(mat[tx][ty]=='#') continue;
        if(tx>n||ty>m||tx<1||ty<1) continue;
        if(vis[tx][ty]==1) continue;
        dfs(tx,ty);
    }
}
int main(){
    int a,b;
    cin>>n>>m;
    for(int i=1;i<=n;++i){
        for(int j=1;j<=m;++j){
            cin>>mat[i][j];
            if(mat[i][j]=='s'){
                a=i;b=j;
            }
        }
    }
    dfs(a,b);
    if(flag) cout<<"Yes";
    else cout<<"No";
}

#include<bits/stdc++.h>
#include<windows.h>
using namespace std;
int Count=0;
int Question_Answer(int cnt){
	int Ua;
	if(cnt){
		printf("=============================================\n");
		printf("           嗨，我的朋友，好久不见\n");
		printf("=============================================\n");
		Sleep(3000);
		system("cls");
	}
	printf("=============================================\n");
	printf("          想玩游戏吗？\n");
	printf("        你可以说出你的需求：\n");
	Sleep(500);
	printf("        1:猜数字\n");
	Sleep(500);
	printf("        2:博弈\n");
	Sleep(500);
	printf("        3:走迷宫\n");
	Sleep(500);
	printf("        4:生日\n");
	Sleep(500);
	printf("        5:排序\n");
	Sleep(500);
	printf("=============================================\n");
	printf("请输入：");
	scanf("%d",&Ua);
	printf("\n");
	return Ua;
}
int main(){
	Count=1;
	while(1){
		int G_Answer=Question_Answer(Count);
		Count=0;
		system("cls");
		printf("好的，请稍等");
		int CNT=0;
		for(int i=1;i<=9;++i){
			CNT++;
			printf(".");
			Sleep(1000);
			if(CNT==3){
				system("cls");
				printf("好的，请稍等.");
				Sleep(1000);
				CNT=1;
			}
		}
		system("cls");
		/*switch(G_Answer){
			case 1
				break;
			case 2
				break;
			case 3
				break;
			case 4
				break;
			case 5
				break;
		}*/
	}
}

#include<bits/stdc++.h>
using namespace std;
vector<int> vt[560005];
int dep[1000005];
void dfs(int x,int f,int d){
	dep[x]=d;
	for(int i=0;i<vt[x].size();i++){
		int y=vt[x][i];
		if(y!=f){
			dfs(y,x,d+1);
		}
	}
}	
int arr[100005];		
int main(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		for(int j=2;j<=sqrt(i);j++){
			if(i%j==0){
				arr[i]+=j+i/j;
				if(j==i/j)arr[i]-=i/j;
			}
			
		} 
		arr[i]++;
	}
	for(int i=1;i<=n;i++){
		if(arr[i]<i){
			vt[arr[i]].push_back(i);
			vt[i].push_back(arr[i]);
		}
	}
	dfs(1,0,1);
	int id=0,ma=0;
	for(int i=1;i<=n;i++){
		if(dep[i]>ma){
			id=i;ma=dep[i];
		}
	}
	for(int i=1;i<=100005;i++)dep[i]=0;
	dfs(id,0,1);
	ma=0;
	for(int i=1;i<=n;i++){
		ma=max(ma,dep[i]);
	}
	cout<<ma-1;
	return 0;
}