第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-914 计算器

#include<stdio.h>
#include<math.h>
int m[32]={0},g[32]={0};
void add(long long x,int d,int k){
	int k1;
	if(x==0){
		if(k==1){
			while(m[d]==1&&d<32&&!g[d]){ 
				m[d++]=0; 
			}
			if(!g[d]) m[d]=1;
		}
		return;
	}
	if(!g[d]){
		if((m[d]+(x&1)+k)>1) k1=1;
		else k1=0;
		m[d]=(m[d]+(x&1)+k)%2;
	}
	else
		k1=0;
	add(x/2,d+1,k1);
}
int main(){
	long long x,a,b,sum=0;
	scanf("%lld",&x);
	while(x--){
		scanf("%lld%lld",&a,&b);
		switch(a){
			case 0:
				add(b,0,0);
				break;
			case 1:
				g[b]=1;
				break;
			case 2:
				g[b]=0;
		}
	}
	for(x=0;x<32;x++)
		sum+=m[x]*pow(2,x);
	printf("%lld",sum);
	return 0;
}

#include <stdio.h>
int main(void){
	int n,sum[32]={0},bug[32]={0};
	unsigned long long out=0;
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		int k,a;
		scanf("%d %d",&k,&a);
		if(k)bug[a]=!bug[a];
		else{
			int s=0;
			for(int j=0;j<32;j++,a/=2){
				if(!bug[j]){
					int temp=s+sum[j]+a%2;
					sum[j]=temp%2;
					s=temp/2;
				}
				else s=0;
			}
		}
	}
	for(int i=0;i<32;i++){
		out+=sum[i]*(1<<i);
	}
	printf("%u",out);
	return 0;
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;
import java.util.Arrays;

public class Main {
	public static void main(String[] args) throws IOException {
		StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
    long sum = 0;
    in.nextToken();
    int c = (int)in.nval;
	short[] nx = new short[32];
	boolean[] yn = new boolean[32];
	Arrays.fill(yn, true);
    while (c-- > 0) {
      in.nextToken();
      switch((int)in.nval) {
      case 0:
      in.nextToken();
      long j = (long)in.nval;
        for(int i =0, k = 0; i < 32; i++){
			if(yn[i]){
				nx[i] += ((j >>> i) & 1) + k;
				k = nx[i] / 2;
				nx[i] &= 1;
			} else {
				k = 0;
				}
        }
        break;
      case 1:
        in.nextToken();
        yn[(int)in.nval] = false;
        break;
      case 2:
        in.nextToken();
        yn[(int)in.nval] = true;
        break;
      }
    }
    long k = 1;
    for(int i = 0; i < 32; i++){
    	if (1 == nx[i])
    		sum += k;
    	k <<= 1;
    }
    System.out.println(sum);
	}
}