日韩性视频-久久久蜜桃-www中文字幕-在线中文字幕av-亚洲欧美一区二区三区四区-撸久久-香蕉视频一区-久久无码精品丰满人妻-国产高潮av-激情福利社-日韩av网址大全-国产精品久久999-日本五十路在线-性欧美在线-久久99精品波多结衣一区-男女午夜免费视频-黑人极品ⅴideos精品欧美棵-人人妻人人澡人人爽精品欧美一区-日韩一区在线看-欧美a级在线免费观看

歡迎訪問 生活随笔!

生活随笔

當前位置: 首頁 > 编程资源 > 编程问答 >内容正文

编程问答

Codeforces Beta Round #9 (Div. 2 Only) C. Hexadecimal's Numbers dfs

發布時間:2025/7/14 编程问答 45 豆豆
生活随笔 收集整理的這篇文章主要介紹了 Codeforces Beta Round #9 (Div. 2 Only) C. Hexadecimal's Numbers dfs 小編覺得挺不錯的,現在分享給大家,幫大家做個參考.

C. Hexadecimal's Numbers

題目連接:

http://www.codeforces.com/contest/9/problem/C

Description

One beautiful July morning a terrible thing happened in Mainframe: a mean virus Megabyte somehow got access to the memory of his not less mean sister Hexadecimal. He loaded there a huge amount of n different natural numbers from 1 to n to obtain total control over her energy.

But his plan failed. The reason for this was very simple: Hexadecimal didn't perceive any information, apart from numbers written in binary format. This means that if a number in a decimal representation contained characters apart from 0 and 1, it was not stored in the memory. Now Megabyte wants to know, how many numbers were loaded successfully.

Input

Input data contains the only number n (1?≤?n?≤?109).

Output

Output the only number — answer to the problem.

Sample Input

10

Sample Output

2

Hint

題意

問你小于等于n的數里面,有多少個只由0和1組成的

題解:

感覺上沒多少個數嘛,那就直接dfs就好了啦

代碼

#include<bits/stdc++.h> using namespace std; long long n; map<int,int> vis; long long ans = 0; void dfs(long long x) {if(x>n)return;if(vis[x])return;vis[x]=1;ans++;dfs(x*10);dfs(x*10+1); } int main() {cin>>n;dfs(1);cout<<ans<<endl; }

總結

以上是生活随笔為你收集整理的Codeforces Beta Round #9 (Div. 2 Only) C. Hexadecimal's Numbers dfs的全部內容,希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯,歡迎將生活随笔推薦給好友。