2. Getting a simple simulation algorithm (2)

1.B1001

#include<stdio.h>
int main(){
	int n;
	while(scanf("%d",&n)!=EOF){
		int s = 0;
		while(n!=1){
			if(n%2==0)
				n/=2;
			else
				n = (3*n+1)/2;
			s++;
		}
		printf("%d\n",s);	
	}
	return 0;
}

2.B1008

#include<stdio.h> 
int main(){
	int N,M,count = 0;
	scanf("%d%d",&N,&M);
	M = M % N;	//防止M>N 
	int a[110];
	for(int i = 0;i<N;i++)
		scanf("%d",&a[i]);
	for(int i = N-M;i<N;i++){
		printf("%d ",a[i]);
		count++;
	}
	for(int i = 0;i<N-M;i++){
		count++;
		if(count!=N)
			printf("%d ",a[i]);
		else
			printf("%d",a[i]);
	}	
	return 0;
}

3.B1010

#include<stdio.h> 
int main(){
	int a[1010] = {0};
	int k,e,count = 0;
	while(scanf("%d%d",&k,&e)!=EOF){
		a[e] = k;
	}
	a[0] = 0;
	for(int i = 1;i<=1000;i++){
		a[i-1] = a[i] * i;
		a[i] = 0;
		if(a[i-1] != 0)	count++; 
	} 
	if(count== 0)	printf("0 0");
	else{
		for(int i = 1000;i>=0;i--){
			if(a[i] != 0){
				printf("%d %d",a[i],i);
				count--;
				if(count != 0)	printf(" "); 
			}
		} 
	} 
	return 0;
}

4.B1011

#include<stdio.h> 
int main(){
	int n,tcase = 1;
	scanf("%d",&n);
	while(n--){
		long long a,b,c;
		scanf("%lld%lld%lld",&a,&b,&c);
		if(a+b>c)
			printf("Case #%d:true\n",tcase++);
		else
			printf("Case #%d:false\n",tcase++);
	}
	return 0;
}

5.B1012

#include<stdio.h> 
int main(){
	int n,temp;
	int a[5] = {0};
	int count[5] = {0};
	scanf("%d",&n);
	while(n--){
		scanf("%d",&temp);
		if(temp%5 == 0){
			if(temp%2 == 0){
				a[0] += temp;
				count[0]++;	
			}	
		}else if(temp%5 == 1){
			if(count[1]%2 == 0)
				a[1] += temp;
			else
				a[1] -= temp;
			count[1]++;
		}else if(temp%5 == 2){
			count[2]++;
		}else if(temp%5 == 3){
			a[3] += temp;
			count[3]++;
		}else{
			if(temp>a[4])
				a[4] = temp;
			count[4]++;
		}			
	}
	if(count[0] == 0)	printf("N ");
	else	printf("%d ",a[0]);
	if(count[1] == 0)	printf("N ");
	else	printf("%d ",a[1]);
	if(count[2] == 0)	printf("N ");
	else	printf("%d ",count[2]);
	if(count[3] == 0)	printf("N ");
	else	printf("%.1f ",(double)a[3] / count[3]);
	if(count[4] == 0)	printf("N");
	else	printf("%d",a[4]);
	
	return 0;
}

6.B1016

#include<stdio.h> 
int main(){
	long long a,da,b,db;
	scanf("%lld%lld%lld%lld",&a,&da,&b,&db);
	long long pa = 0,pb = 0;
	while(a!=0){
		if(a%10==da)	pa = pa * 10 + da; 
		a /= 10;		
	}
	while(b!=0){
		if(b%10==db)	pb = pb * 10 + db; 
		b /= 10;		
	}	
	printf("%lld\n",pa+pb);
	return 0;
}
Published 26 original articles · won praise 3 · Views 195

Guess you like

Origin blog.csdn.net/qq_41898248/article/details/104051470