• 2010 成都预选赛 Binary Number


    水题!可惜没看清当A中有多个相同结果时,要取最小值,被WA了一次。

    #include <iostream>
    using namespace std;

    int AC(int a,int b)
    {
         int n=0;
         while(a!=0||b!=0)
         {
                if(a%2!=b%2)
                n++;
                a/=2;
                b/=2;
         }
         return n;
    }
    int main()
    {
        int x,y,i,j,A[101],B[101],n,e,f,top;
        cin>>n;
        while(n--)
        {
                  cin>>x>>y;
                  for(i=0;i<x;i++)
                  cin>>A[i];
                  for(i=0;i<y;i++)
                 cin>>B[i];
                  for(i=0;i<y;i++)
                  {e=1000000;

                  for(j=0;j<x;j++)
                  {
                                  f=AC(A[j],B[i]);
                                  if(e>f)
                                  {
                                         top=A[j];
                                         e=f;
                                  }
                                  else if(e==f&&top>A[j])
                                  {
                                       top=A[j];
                                  }
                  }
                  cout << top<< endl;

                  }
        }   
     
    }
     

  • 相关阅读:
    友链
    CF496E Distributing Parts(贪心)题解
    CF786C Till I Collapse(根号分治)题解
    CF578B "Or" Game(贪心)题解
    CF433C Ryouko's Memory Note(贪心)题解
    Luogu4177 [CEOI2008]order(网络流)题解
    骗分专辑
    CF718A Efim and Strange Grade(贪心)题解
    prufer序列--学习笔记
    bzoj3450 Tyvj1952 Easy(期望DP)题解
  • 原文地址:https://www.cnblogs.com/zxj015/p/2740299.html
Copyright © 2020-2023  润新知