2019个人训练赛第二场-A - BowWow and the Timetable题解

最新推荐文章于 2021-08-07 22:56:33 发布

ミ渴望ヽ不可及ゞ

最新推荐文章于 2021-08-07 22:56:33 发布

阅读量294

点赞数

分类专栏： ACM

本文链接：https://blog.csdn.net/qq_43876850/article/details/100780950

版权

ACM 专栏收录该内容

17 篇文章 0 订阅

订阅专栏

本文介绍了一道编程竞赛题目，背景设定在圣彼得堡，一天有 pow(2,100) 分钟。火车按照4的幂次规律发车。团队BowWow在时间s到达车站，需要计算他们错过多少趟已出发的列车。输入为不带前导零的二进制数s，输出为在此之前已出发的列车数量。提供了几个样例输入和输出。文章将探讨解题方法和代码实现。" 112493687,10340200,Vue项目常用插件安装指南,"['Vue', '前端开发', 'npm', 'Vue框架', 'Vuex状态管理', 'axios']

摘要由CSDN通过智能技术生成

题目描述：

In the city of Saint Petersburg, a day lasts for pow(2,100) minutes. From the main station of Saint Petersburg, a train departs after 1 minute, 4 minutes, 16 minutes, and so on; in other words, the train departs at time pow(4,k) for each integer k≥0. Team BowWow has arrived at the station at the time s and it is trying to count how many trains have they missed; in other words, the number of trains that have departed strictly before time s. For example if s=20, then they missed trains which have departed at 1, 4 and 16. As you are the only one who knows the time, help them!

Note that the number s will be given you in a binary representation without leading zeroes.

Input
The first line contains a single binary number s (0≤s<2100) without leading zeroes.

Output
Output a single number — the number of trains which have departed strictly before the time s.

Examples
Input
100000000
Output
4
Input
101
Output
2
Input
10100
Output
3

分析：

代码：

#include<iostream>
#include<cstring>
using namespace std;
string s;
int i,j;
int ans;
int cnt;
int main()
{
  cin>>s;
  int n=s.length()-1;
  for(i=0;i<=n;i++)
  {
    if(s[i]=='1')
     cnt++;
  }
  if(n%2==0&&cnt==1) 
    ans=n/2;
  else if(n!=0)
    ans=n/2+1;
  else
    ans=0;
  cout<<ans;

  return 0;
}