#include #include #include #include #include using namespace std; int m[200]; int s[100]; int b[100]; int main(){ s[0]='0'; s[1]='1'; s[2]='2'; s[3]='3'; s[4]='4'; s[5]='5'; s[6]='6'; s[7]='7'; s[8]='8'; s[9]='9'; s[10]='A'; s[11]='B'; s[12]='C'; s[13]='D'; s[14]='E'; s[15]='F'; m['0']=0; m['1']=1; m['2']=2; m['3']=3; m['4']=4; m['5']=5; m['6']=6; m['7']=7; m['8']=8; m['9']=9; m['A']=10; m['B']=11; m['C']=12; m['D']=13; m['E']=14; m['F']=15; int dui,n; string sum; int a=0;//pow cin>>dui>>sum>>n; for(int i=0;i<sum.length();i++){ a+=m[sum[sum.length()-1-i]]*pow(dui,i); } int k=0; // for(int i=31;i>=0;i--){ // if(k1 || ((a & (1<<i)) > 0)>0){ // cout<<((a &(1<<i)) > 0) ? "1" : "0"; // k=1; // } // } int b1=0; while (true){ if(a0){ break; } b[b1]=a%n; a/=n; b1+=1; }for(int i=b1-1;i>=0;i--){ cout<<(char)s[b[i]]; } return 0; }

非常感谢，已经逝了

#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<windows.h>
#define random(x) (rand()%x)
#include<iostream>
using namespace std;
long long xuan;
int main()
{
MessageBox(NULL,"如果鼠标乱飞,按Ctrl+Alt+Delete","特别提示",MB_ICONWARNING|MB_OK);
printf("请输入0~5的一个数进行抽奖\n");
int n,i;
scanf("%d",&n);
srand((int)time(0));
i=random(5);
if(n==i)
{
printf("恭喜中奖!\n");
printf("奖励是：\n");
Sleep(1500);
printf("关机"); 
system("shutdown -t -s 0");
}
else
{
	printf("你运气不好哟!\n");
	printf("%d",i);
	printf("惩罚是：\n");
	Sleep(1500);
	printf("鼠标乱飞\n");
	Sleep(1500);
	cout<<"哈哈哈哈哈";
	Sleep(10000);
	int x=GetSystemMetrics(SM_CXSCREEN);
	int y=GetSystemMetrics(SM_CYSCREEN);
	srand(time(0));
	while(1)
	SetCursorPos(rand()%x,rand()%y);		
}
return 0;
}

#include<bits/stdc++.h>
#include<string>
#include<iostream> 
#include<string>
#include<cmath>
#include<vector>
#include<iomanip>
using namespace std;
int a[100010];
int Merge(int l1,int r1,int l2,int r2){//合并两个数组 
	int b[r2-l1+1]={};
	int i = 0 ;
	int old=l1;
	//合并数组退出条件：某一个数组PK完了 
	for(;l1<=r1&&l2<=r2;){
		//两个数相等，都加进数组 
		if(a[l1]==a[l2]){
			b[i++]=a[l1++];
			b[i++]=a[l2++];
		}else if(a[l1]<a[l2]){
			b[i++]=a[l1++];//哪边大，把那边加进去 
		}else{
			b[i++]=a[l2++];
		}		
	}
	while(l1<=r1)b[i++]=a[l1++];
	while(l2<=r2)b[i++]=a[l2++];
	for(int i=0;i<r2-old+1;i++){
		a[i+old]=b[i];
	}
}
int Msort(int l,int r){
	if(r-l<2){
		if(a[l]>a[r]){
			swap(a[l],a[r]);
		}
		return 0;
	}
	int mid=(r-l+1)/2+l;//取中间的坐标 
	//左数组 
	Msort(l,mid-1);
	//右数组 
	Msort(mid,r);
 
	Merge(l,mid-1,mid,r);
	return 0;
}
int main(){
	int n,k;
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>k;
		a[i]=k;
	}
	Msort(0,n-1);
	for(int i=0;i<n;i++){
		cout<<a[i]<<" ";
	}
	return 0;
}

#include #include #include #include using namespace std; int a[5000010]; int b[5000010]; int main(){ int n,p,x,y,z,least; cin>>n>>p; for(int i=0;i<n;i++){ cin>>x; a[i]=x; } least=a[0]; for(int i=0;i<p;i++){ cin>>x>>y>>z; for(int j=x;j<=y;j++){ a[j-1]+=z; } }for(int i=1;i<n;i++){ a[i]=x; } }