不忘初心，知行统一

CodeForces - 762C  Two stringsYou are given two strings a and b. You have to remove the minimum possible number of consecutive (standing one after another) characters from string b in such a way that ...

Codeforces 797C Minimal stringPetya recieved a gift of a string s with length up to 105 characters for his birthday. He took two more empty strings t and u and decided to play a game. This game has tw...

题目大意：给出数n（1<=n<=10^9)，求不超过n，只由0、1构成的数的个数。分析：1位数：12位数：10、113位数：100、101、110、111……即有：k位数：a、bk+1位数：a*10,a*10+1,b*10,b*10+1。#include<bits/stdc++.h> using namespace std; int ans=0; void dfs(int...