3040. 非重复二进制串

这个过了
using namespace std;

int main() {
int t, count = 0;
cin >> t;
while (t–) {
int n;
cin >> n;
int pre = n % 2;
n /= 2;
int s = 1, max = 1;
while (n) {
int temp = n % 2;
n /= 2;
if (pre == temp)
s = 1;
else if (pre != temp)
s++;
if (s > max)
max = s;
pre = temp;
}
cout << “case #” << count++ << “:\n”;
cout << max << endl;
}
return 0;
}

这个过了
using namespace std;

int main() {
int t, count = 0;
cin >> t;
while (t–) {
int n;
cin >> n;
int pre = n % 2;
n /= 2;
int s = 1, max = 1;
while (n) {
int temp = n % 2;
n /= 2;
if (pre == temp)
s = 1;
else if (pre != temp)
s++;
if (s > max)
max = s;
pre = temp;
}
cout << “case #” << count++ << “:\n”;
cout << max << endl;
}
return 0;
}

哈哈是不是没ac本题有大坑
[em:08]

好吧理解有误

话说第三个数据是不是有问题啊，不是应该是3 么

跪了，求大神提供错的测试数据

include

include

include

int cmp(const voida,const voidb)
{
return (int)b-(int)a;
}

int main()
{
int t,x,y,q[33],i=0,e;
scanf(“%d”,&t);
while(t–)
{
scanf(“%d”,&x);
y=0;
for(e=0;e<33;e++)
q[e]=1;
while(x/2)
{
if((x%2)!=((x/2)%2))
q[y]++;
else
y++;
x>>=1;
}
qsort(q,32,sizeof(q[0]),cmp);
printf(“case #%d:\n”,i);
printf(“%d\n”,q[0]);
}
return 0;
}