HYSBZ - 1026 && BZOJ1026 windy数

最新推荐文章于 2020-08-19 22:45:15 发布
最新推荐文章于 2020-08-19 22:45:15 发布
阅读量251 收藏
点赞数
分类专栏： 杂题解 文章标签： 数位dp
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/swunHJ/article/details/82927790
版权

给两个数1 <= a <= b <= 2e9,求他们之间的windy数的个数

windy数定义：不含前导零且相邻两个数字之差至少为2的正整数被称为windy数。

这题用数位dp来做

定义：dp[i][j]:第i位数字为j，并且满足情况数的个数.

那么状态转移方程为

dp[i][j] = ∑dp[i−1][k] (abs(k−j) >= 2)

最后用差分搞一搞，solve(b + 1) - solve(a)就是a, b之间满足情况的个数了(solve(x)表示小于x的满足条件的个数)

“注意一下dp细节即可”

咳咳还是说一下dp的细节：

初始化为0，不谈。

dp[1][i]初始化为1，这是处理只有一位的情况

然后对于2-11位，枚举这一位的数字j，对于这个j，枚举它的前面一位数字为k，满足abs(k - j) >= 2就更新

dp[i][j] += dp[i-1][k]

好啦，dp数组初始化好了，对于一个数n，如何求小于它的满足条件的数的个数呢

比如一个数是四位的

首先加上三位的所有情况，再加上第四位1-(num[4] - 1)的所有情况

以上这些情况都是能严格保证小于所给的数的

所以要特殊对待一下第四位就是所给的数的第四位的时候

从高位往地位遍历，如果相差可以大于2的话就加上这个位置的答案，并且一旦碰到给出的相差就小于2，直接break

（因为你往下不能改了）

最后很容易发现所给的数本身是没有判断的，所以算出来的是小于这个数的答案

#pragma GCC diagnostic error "-std=c++11"
#include<set>
#include<map>
#include<cmath>
#include<ctime>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<cstdlib>
#include<cstring>
#include<iomanip>
#include<iostream>
#include<algorithm>
#define fi first
#define se second
#define pb push_back
#define lowbit(x) x&(-x)
#define PII  pair<int, int> 
#define all(x) x.begin(), x.end()
#define FAST ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int mod = (int)1e9 + 7;
const int maxn = (int)1e5 + 5;
using namespace std;
#define int ll

int dp[12][10];
int num[12];

void init(){
	memset(dp, 0, sizeof(dp));
	for(int i = 0; i <= 9; i++) dp[1][i] = 1;
	for(int i = 2; i <= 11; i++){
		for(int j = 0; j <= 9; j++){
			for(int k = 0; k <= 9; k++){
				if(abs(j - k) >= 2) dp[i][j] += dp[i-1][k];
			}
		}
	}
}

int solve(int n){
	int cnt = 0, sum = 0;
	while(n){
		num[++cnt] = n % 10;
		n /= 10;
	}
	num[cnt+1] = 0;
	for(int i = 1; i < cnt; i++){
		for(int j = 1; j <= 9; j++){
			sum += dp[i][j];
		}
	}
	for(int i = 1; i < num[cnt]; i++) sum += dp[cnt][i];
	for(int i = cnt - 1; i >= 1; i--){
		for(int j = 0; j <= num[i] - 1; j++){
			if(abs(num[i+1] - j) >= 2) sum += dp[i][j];
		}
		if(abs(num[i+1] - num[i]) < 2) break;
	}
	return sum;
}

int32_t main()
{
	init();
	ll a, b;
	scanf("%lld %lld", &a, &b);
	printf("%lld\n", solve(b + 1) - solve(a));
	return 0;
}

还有一种骚操作把这题做出来

极限数据2e9，分块打表，每1e6个数打出一个来，得到一个2e3的数组，输入两个数判断一下分别在哪个块，再差分搞一搞就行了

复杂度最差1e6，完全可以做出来

#include<set>
#include<map>
#include<cmath>
#include<ctime>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<cstdlib>
#include<cstring>
#include<iomanip>
#include<iostream>
#include<algorithm>
#define fi first
#define se second
#define pb push_back
#define lowbit(x) x&(-x)
#define PII  pair<int, int> 
#define all(x) x.begin(), x.end()
#define FAST ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int mod = (int)1e9 + 7;
const int maxn = (int)1e5 + 5;
using namespace std;

int table[maxn] = {
	202174,338305,476808,615022,753274,891526,1029740,1168243,1304374,1459689,1459689,1459689,1459689,1597903,1736155,1874407,2012621,2151124,2287255,2442570,
	2597885,2597885,2597885,2597885,2736137,2874389,3012603,3151106,3287237,3442552,3597867,3733998,3733998,3733998,3733998,3872250,4010464,4148967,4285098,4440413,
	4595728,4731859,4870362,4870362,4870362,4870362,5008576,5147079,5283210,5438525,5593840,5729971,5868474,6006688,6006688,6006688,6006688,6145191,6281322,6436637,
	6591952,6728083,6866586,7004800,7143052,7143052,7143052,7143052,7279183,7434498,7589813,7725944,7864447,8002661,8140913,8279165,8279165,8279165,8279165,8434480,
	8589795,8725926,8864429,9002643,9140895,9279147,9417361,9417361,9417361,9417361,9572676,9708807,9847310,9985524,10123776,10262028,10400242,10538745,10538745,10538745,
	10538745,10538745,10538745,10538745,10538745,10538745,10538745,10538745,10538745,10538745,10538745,10538745,10538745,10538745,10538745,10538745,10538745,10538745,10538745,10538745,
	10538745,10538745,10538745,10538745,10538745,10538745,10538745,10538745,10538745,10538745,10694060,10830191,10830191,10830191,10830191,10968443,11106657,11245160,11381291,11536606,
	11691921,11828052,11966555,11966555,11966555,11966555,12104769,12243272,12379403,12534718,12690033,12826164,12964667,13102881,13102881,13102881,13102881,13241384,13377515,13532830,
	13688145,13824276,13962779,14100993,14239245,14239245,14239245,14239245,14375376,14530691,14686006,14822137,14960640,15098854,15237106,15375358,15375358,15375358,15375358,15530673,
	15685988,15822119,15960622,16098836,16237088,16375340,16513554,16513554,16513554,16513554,16668869,16805000,16943503,17081717,17219969,17358221,17496435,17634938,17634938,17634938,
	17634938,17634938,17773441,17911655,18049907,18188159,18326373,18464876,18601007,18756322,18756322,18756322,18756322,18756322,18756322,18756322,18756322,18756322,18756322,18756322,
	18756322,18756322,18756322,18756322,18756322,18756322,18756322,18756322,18756322,18756322,18756322,18756322,18756322,18756322,18756322,18756322,18756322,18756322,18756322,18756322,
	18911637,19047768,19186271,19186271,19186271,19186271,19324485,19462988,19599119,19754434,19909749,20045880,20184383,20322597,20322597,20322597,20322597,20461100,20597231,20752546,
	20907861,21043992,21182495,21320709,21458961,21458961,21458961,21458961,21595092,21750407,21905722,22041853,22180356,22318570,22456822,22595074,22595074,22595074,22595074,22750389,
	22905704,23041835,23180338,23318552,23456804,23595056,23733270,23733270,23733270,23733270,23888585,24024716,24163219,24301433,24439685,24577937,24716151,24854654,24854654,24854654,
	24854654,24854654,24993157,25131371,25269623,25407875,25546089,25684592,25820723,25976038,25976038,25976038,25976038,26114252,26252504,26390756,26528970,26667473,26803604,26958919,
	26958919,26958919,26958919,26958919,26958919,26958919,26958919,26958919,26958919,26958919,26958919,26958919,26958919,26958919,26958919,26958919,26958919,26958919,26958919,26958919,
	26958919,26958919,26958919,26958919,26958919,26958919,26958919,26958919,26958919,26958919,27114234,27250365,27388868,27527082,27527082,27527082,27527082,27665585,27801716,27957031,
	28112346,28248477,28386980,28525194,28663446,28663446,28663446,28663446,28799577,28954892,29110207,29246338,29384841,29523055,29661307,29799559,29799559,29799559,29799559,29954874,
	30110189,30246320,30384823,30523037,30661289,30799541,30937755,30937755,30937755,30937755,31093070,31229201,31367704,31505918,31644170,31782422,31920636,32059139,32059139,32059139,
	32059139,32059139,32197642,32335856,32474108,32612360,32750574,32889077,33025208,33180523,33180523,33180523,33180523,33318737,33456989,33595241,33733455,33871958,34008089,34163404,
	34318719,34318719,34318719,34318719,34456971,34595223,34733437,34871940,35008071,35163386,35163386,35163386,35163386,35163386,35163386,35163386,35163386,35163386,35163386,35163386,
	35163386,35163386,35163386,35163386,35163386,35163386,35163386,35163386,35163386,35163386,35163386,35163386,35163386,35163386,35163386,35163386,35163386,35163386,35163386,35163386,
	35318701,35454832,35593335,35731549,35869801,35869801,35869801,35869801,36005932,36161247,36316562,36452693,36591196,36729410,36867662,37005914,37005914,37005914,37005914,37161229,
	37316544,37452675,37591178,37729392,37867644,38005896,38144110,38144110,38144110,38144110,38299425,38435556,38574059,38712273,38850525,38988777,39126991,39265494,39265494,39265494,
	39265494,39265494,39403997,39542211,39680463,39818715,39956929,40095432,40231563,40386878,40386878,40386878,40386878,40525092,40663344,40801596,40939810,41078313,41214444,41369759,
	41525074,41525074,41525074,41525074,41663326,41801578,41939792,42078295,42214426,42369741,42525056,42661187,42661187,42661187,42661187,42799439,42937653,43076156,43212287,43367602,
	43367602,43367602,43367602,43367602,43367602,43367602,43367602,43367602,43367602,43367602,43367602,43367602,43367602,43367602,43367602,43367602,43367602,43367602,43367602,43367602,
	43367602,43367602,43367602,43367602,43367602,43367602,43367602,43367602,43367602,43367602,43522917,43659048,43797551,43935765,44074017,44212269,44212269,44212269,44212269,44367584,
	44522899,44659030,44797533,44935747,45073999,45212251,45350465,45350465,45350465,45350465,45505780,45641911,45780414,45918628,46056880,46195132,46333346,46471849,46471849,46471849,
	46471849,46471849,46610352,46748566,46886818,47025070,47163284,47301787,47437918,47593233,47593233,47593233,47593233,47731447,47869699,48007951,48146165,48284668,48420799,48576114,
	48731429,48731429,48731429,48731429,48869681,49007933,49146147,49284650,49420781,49576096,49731411,49867542,49867542,49867542,49867542,50005794,50144008,50282511,50418642,50573957,
	50729272,50865403,51003906,51003906,51003906,51003906,51142120,51280623,51416754,51572069,51572069,51572069,51572069,51572069,51572069,51572069,51572069,51572069,51572069,51572069,
	51572069,51572069,51572069,51572069,51572069,51572069,51572069,51572069,51572069,51572069,51572069,51572069,51572069,51572069,51572069,51572069,51572069,51572069,51572069,51572069,
	51727384,51863515,52002018,52140232,52278484,52416736,52554950,52554950,52554950,52554950,52710265,52846396,52984899,53123113,53261365,53399617,53537831,53676334,53676334,53676334,
	53676334,53676334,53814837,53953051,54091303,54229555,54367769,54506272,54642403,54797718,54797718,54797718,54797718,54935932,55074184,55212436,55350650,55489153,55625284,55780599,
	55935914,55935914,55935914,55935914,56074166,56212418,56350632,56489135,56625266,56780581,56935896,57072027,57072027,57072027,57072027,57210279,57348493,57486996,57623127,57778442,
	57933757,58069888,58208391,58208391,58208391,58208391,58346605,58485108,58621239,58776554,58931869,59068000,59206503,59344717,59344717,59344717,59344717,59483220,59619351,59774666,
	59774666,59774666,59774666,59774666,59774666,59774666,59774666,59774666,59774666,59774666,59774666,59774666,59774666,59774666,59774666,59774666,59774666,59774666,59774666,59774666,
	59774666,59774666,59774666,59774666,59774666,59774666,59774666,59774666,59774666,59774666,59929981,60066112,60204615,60342829,60481081,60619333,60757547,60896050,60896050,60896050,
	60896050,60896050,61034553,61172767,61311019,61449271,61587485,61725988,61862119,62017434,62017434,62017434,62017434,62155648,62293900,62432152,62570366,62708869,62845000,63000315,
	63155630,63155630,63155630,63155630,63293882,63432134,63570348,63708851,63844982,64000297,64155612,64291743,64291743,64291743,64291743,64429995,64568209,64706712,64842843,64998158,
	65153473,65289604,65428107,65428107,65428107,65428107,65566321,65704824,65840955,65996270,66151585,66287716,66426219,66564433,66564433,66564433,66564433,66702936,66839067,66994382,
	67149697,67285828,67424331,67562545,67700797,67700797,67700797,67700797,67836928,67992243,67992243,67992243,67992243,67992243,67992243,67992243,67992243,67992243,67992243,67992243,
	67992243,67992243,67992243,67992243,67992243,67992243,67992243,67992243,67992243,67992243,67992243,67992243,67992243,67992243,67992243,67992243,67992243,67992243,67992243,67992243,
	67992243,67992243,68130746,68268960,68407212,68545464,68683678,68822181,68958312,69113627,69113627,69113627,69113627,69251841,69390093,69528345,69666559,69805062,69941193,70096508,
	70251823,70251823,70251823,70251823,70390075,70528327,70666541,70805044,70941175,71096490,71251805,71387936,71387936,71387936,71387936,71526188,71664402,71802905,71939036,72094351,
	72249666,72385797,72524300,72524300,72524300,72524300,72662514,72801017,72937148,73092463,73247778,73383909,73522412,73660626,73660626,73660626,73660626,73799129,73935260,74090575,
	74245890,74382021,74520524,74658738,74796990,74796990,74796990,74796990,74933121,75088436,75243751,75379882,75518385,75656599,75794851,75933103,75933103,75933103,75933103,76088418,
	76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,
	76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,
	76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,
	76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,
	76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,
	76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,
	76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,
	76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,
	76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,
	76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,
	76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,
	76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,
	76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,
	76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,
	76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,
	76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,76088418,
	76088418,76088418,76226921,76365135,76503387,76641639,76779853,76918356,77054487,77209802,77209802,77209802,77209802,77348016,77486268,77624520,77762734,77901237,78037368,78192683,
	78192683,78192683,78192683,78192683,78192683,78192683,78192683,78192683,78192683,78192683,78192683,78192683,78192683,78192683,78192683,78192683,78192683,78192683,78192683,78192683,
	78192683,78192683,78192683,78192683,78192683,78192683,78192683,78192683,78192683,78192683,78347998,78484129,78622632,78760846,78760846,78760846,78760846,78899349,79035480,79190795,
	79346110,79482241,79620744,79758958,79897210,79897210,79897210,79897210,80033341,80188656,80343971,80480102,80618605,80756819,80895071,81033323,81033323,81033323,81033323,81188638,
	81343953,81480084,81618587,81756801,81895053,82033305,82171519,82171519,82171519,82171519,82326834,82462965,82601468,82739682,82877934,83016186,83154400,83292903,83292903,83292903,
	83292903,83292903,83431406,83569620,83707872,83846124,83984338,84122841,84258972,84414287,84414287,84414287,84414287,84552501,84690753,84829005,84967219,85105722,85241853,85397168,
	85552483,85552483,85552483,85552483,85690735,85828987,85967201,86105704,86241835,86397150,86397150,86397150,86397150,86397150,86397150,86397150,86397150,86397150,86397150,86397150,
	86397150,86397150,86397150,86397150,86397150,86397150,86397150,86397150,86397150,86397150,86397150,86397150,86397150,86397150,86397150,86397150,86397150,86397150,86397150,86397150,
	86552465,86688596,86827099,86965313,87103565,87103565,87103565,87103565,87239696,87395011,87550326,87686457,87824960,87963174,88101426,88239678,88239678,88239678,88239678,88394993,
	88550308,88686439,88824942,88963156,89101408,89239660,89377874,89377874,89377874,89377874,89533189,89669320,89807823,89946037,90084289,90222541,90360755,90499258,90499258,90499258,
	90499258,90499258,90637761,90775975,90914227,91052479,91190693,91329196,91465327,91620642,91620642,91620642,91620642,91758856,91897108,92035360,92173574,92312077,92448208,92603523,
	92758838,92758838,92758838,92758838,92897090,93035342,93173556,93312059,93448190,93603505,93758820,93894951,93894951,93894951,93894951,94033203,94171417,94309920,94446051,94601366,
	94601366,94601366,94601366,94601366,94601366,94601366,94601366,94601366,94601366,94601366,94601366,94601366,94601366,94601366,94601366,94601366,94601366,94601366,94601366,94601366,
	94601366,94601366,94601366,94601366,94601366,94601366,94601366,94601366,94601366,94601366,94756681,94892812,95031315,95169529,95307781,95446033,95446033,95446033,95446033,95601348,
	95756663,95892794,96031297,96169511,96307763,96446015,96584229,96584229,96584229,96584229,96739544,96875675,97014178,97152392,97290644,97428896,97567110,97705613,97705613,97705613,
	97705613,97705613,97844116,97982330,98120582,98258834,98397048,98535551,98671682,98826997,98826997,98826997,98826997,98965211,99103463,99241715,99379929,99518432,99654563,99809878,
	99965193,99965193,99965193,99965193,100103445,100241697,100379911,100518414,100654545,100809860,100965175,101101306,101101306,101101306,101101306,101239558,101377772,101516275,101652406,101807721,
	101963036,102099167,102237670,102237670,102237670,102237670,102375884,102514387,102650518,102805833,102805833,102805833,102805833,102805833,102805833,102805833,102805833,102805833,102805833,102805833,
	102805833,102805833,102805833,102805833,102805833,102805833,102805833,102805833,102805833,102805833,102805833,102805833,102805833,102805833,102805833,102805833,102805833,102805833,102805833,102805833,
	102961148,103097279,103235782,103373996,103512248,103650500,103788714,103788714,103788714,103788714,103944029,104080160,104218663,104356877,104495129,104633381,104771595,104910098,104910098,104910098,
	104910098,104910098,105048601,105186815,105325067,105463319,105601533,105740036,105876167,106031482,106031482,106031482,106031482,106169696,106307948,106446200,106584414,106722917,106859048,107014363,
	107169678,107169678,107169678,107169678,107307930,107446182,107584396,107722899,107859030,108014345,108169660,108305791,108305791,108305791,108305791,108444043,108582257,108720760,108856891,109012206,
	109167521,109303652,109442155,109442155,109442155,109442155,109580369,109718872,109855003,110010318,110165633,110301764,110440267,110578481,110578481,110578481,110578481,110716984,110853115,111008430,
	111008430,111008430,111008430,111008430,111008430,111008430,111008430,111008430,111008430,111008430,111008430,111008430,111008430,111008430,111008430,111008430,111008430,111008430,111008430,111008430,
	111008430,111008430,111008430,111008430,111008430,111008430,111008430,111008430,111008430,111008430,111163745,111299876,111438379,111576593,111714845,111853097,111991311,112129814,112129814,112129814,
	112129814,112129814,112268317,112406531,112544783,112683035,112821249,112959752,113095883,113251198,113251198,113251198,113251198,113389412,113527664,113665916,113804130,113942633,114078764,114234079,
	114389394,114389394,114389394,114389394,114527646,114665898,114804112,114942615,115078746,115234061,115389376,115525507,115525507,115525507,115525507,115663759,115801973,115940476,116076607,116231922,
	116387237,116523368,116661871,116661871,116661871,116661871,116800085,116938588,117074719,117230034,117385349,117521480,117659983,117798197,117798197,117798197,117798197,117936700,118072831,118228146,
	118383461,118519592,118658095,118796309,118934561,118934561,118934561,118934561,119070692,119226007,119226007,119226007,119226007,119226007,119226007,119226007,119226007,119226007,119226007,119226007,
	119226007,119226007,119226007,119226007,119226007,119226007,119226007,119226007,119226007,119226007,119226007,119226007,119226007,119226007,119226007,119226007,119226007,119226007,119226007,119226007,
	119226007,119226007,119364510,119502724,119640976,119779228,119917442,120055945,120192076,120347391,120347391,120347391,120347391,120485605,120623857,120762109,120900323,121038826,121174957,121330272,
	121485587,121485587,121485587,121485587,121623839,121762091,121900305,122038808,122174939,122330254,122485569,122621700,122621700,122621700,122621700,122759952,122898166,123036669,123172800,123328115,
	123483430,123619561,123758064,123758064,123758064,123758064,123896278,124034781,124170912,124326227,124481542,124617673,124756176,124894390,124894390,124894390,124894390,125032893,125169024,125324339,
	125479654,125615785,125754288,125892502,126030754,126030754,126030754,126030754,126166885,126322200,126477515,126613646,126752149,126890363,127028615,127166867,127166867,127166867,127166867,127322182,
	127322182,127322182,127322182,127322182,127322182,127322182,127322182,127322182,127322182,127322182,127322182,127322182,127322182,127322182,127322182,127322182,127322182,127322182,127322182,127322182
};


bool check(int n)
{
	int now = n % 10;
	n /= 10;
	while(n){
		if(abs(now - (n % 10)) < 2) return false;
		now = n % 10;
		n /= 10;
	}
	return true;
}

int main()
{
	int div = (int)1e6;
	int a, b; scanf("%d %d", &a, &b);
	int ta = a / div, tb = b / div;
	if(ta == tb){
		int cnt = 0;
		for(int i = a; i <= b; i++){
			if(check(i)) cnt++;
		}
		cout << cnt << endl;
	}
	else {
		int sum1 = 0, sum2 = 0;
		if(a >= div) sum1 += table[ta-1];
		if(b >= div) sum2 += table[tb-1];
		int lower1 = a / div * div, lower2 = b / div * div;
		for(int i = lower1 + 1; i <= a - 1; i++) if(check(i)) sum1++;
		for(int i = lower2 + 1; i <= b; i++) if(check(i)) sum2++;
		printf("%d\n", sum2 - sum1);
	}
	return 0;
}

为什么我学的都是这些骚东西。。

 

 

悲伤的牛奶
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
contests-all-in-one:BZOJ，POJ，LeetCode，USACO，HDUOJ，LA的比赛解决方案
03-15
BZOJ，POJ，LeetCode，USACO，HDUOJ，LA的比赛解决方案 有话要说 嗨，我是Ex10si0n。 该存储库用于记录我的OJ AC代码。 关于我 OIer，Develpoer。 希望这个仓库可以帮助那些通过Probelm ID找到LeetCode或其他OJ解决...
Node.js-ZOJCH是BZOJ题库的离线版
08-09
【标题】"Node.js-ZOJCH是BZOJ题库的离线版"揭示了这个项目的核心功能，即提供一个基于Node.js平台的离线版本的BZOJ（BestCoder Judging System）题库。BZOJ是一个在线编程竞赛平台，而ZOJCH则允许用户在没有网络...
BZOJ-1026 windy数
weixin_30535565的博客
11-21 53
数位DP。 终于在BZOJ找到一道【一眼题】了！ 【Code】 转载于:https://www.cnblogs.com/NanoApe/p/4396717.html
bzoj1026
syh0313的博客
02-08 193
1026 windy数   数位dp，首先预处理出数组dp[i][j]表示首位为i的包含首位总位数为j的满足条件的数的个数，sum[i]表示位数为i的所有满足条件的数的个数，work(x)表示[1,x]中满足条件的数的个数，然后按套路dp下即可   /**************************************************************     Pro...
BZOJ 1026 (数位dp)
nare123的博客
10-18 220
1026: [SCOI2009]windy数Time Limit: 1 Sec Memory Limit: 162 MB Submit: 8505 Solved: 3834 [Submit][Status][Discuss] Description　　windy定义了一种windy数。不含前导零且相邻两个数字之差至少为2的正整数被称为windy数。 windy想知道， 在A和B之间，包括
BZOJ 1026
trouble_的博客
08-19 109
题目大意：   　windy定义了一种windy数。不含前导零且相邻两个数字之差至少为2的正整数被称为windy数。 windy想知道，在A和B之间，包括A和B，总共有多少个windy数？(来源于：黑暗爆炸oj) 解题思路： 数位dp，加个前导0的判断条件以及设dp[i][sta]dp[i][sta]dp[i][sta]代表第i+1i+1i+1位选stastasta的总个数 AC代码： #include <bits/stdc++.h> using namespace std; typedef
Codeforces 914 C 数位DP+暴力打表+思维
dicui07574的专栏
04-24 117
题意 给出一个二进制数\(n\)，每次操作可以将一个整数\(x\)简化为\(x\)的二进制表示中\(1\)的个数，如果一个数简化为\(1\)所需的最小次数为\(k\)，将这个数叫做特殊的数， 问从\(1\)到\(n\)一共有多少个特殊的数，答案对\(1e9+7\)取模。 分析 \(n\)最大为\(2^{1000}\)，二进制表示中最多有\(1000\)个\(1\)，所以\(n\)以内的数...
bzoj 1000-1499
11-26
bzoj部分数据.
BZOJ第一部分
11-03
【BZOJ第一部分】 BZOJ，全称为“北京邮电大学在线评测系统”（Beijing Zhiyuan Online Judge），是中国最早的一批在线编程竞赛平台之一，它为编程爱好者提供了一个练习和检验编程技能的环境。在这个系统中，用户...
BZOJ全代码
02-05
【标题】"BZOJ全代码"所指的是一份包含BZOJ（BestCoder Zhijiang Online Judge）平台所有编程题目解决方案的压缩文件。BZOJ是一个在线编程竞赛平台，它提供了大量的算法题目供参赛者练习和提交代码，以检验编程能力...
BZOJ 1026, Windy数
Lucius-THU的博客
10-11 184
求区间[A,B]中相邻位数字之差均大于1的元素个数。 数位DP。 第一次写这中类型的DP题，细节处理上还是有很多盲点，花了不少时间来调试。 solve(b+1)-solve(a)相较于solve(b)-solve(a-1)好处在于可以不必单独处理匹配至最后一位的情形。
BZOJ1026windy数
DCrusher's blog
08-18 733
1026: [SCOI2009]windy数 Time Limit: 1 Sec Memory Limit: 162 MB Submit: 5859 Solved: 2612 Description 　　windy定义了一种windy数。不含前导零且相邻两个数字之差至少为2的正整数被称为windy数。 windy想知道， 在A和B之间，包括A和B，总共有多少个windy数？ Inpu
数位dp
Aczy156的博客
08-06 105
板题 hdu2089 题目意思，输出某个给定区间（给定左和右）区间中满足一下条件的数，不含数字4 不含连续的62，(分开的6 和 2 是允许的)，输出答案。 直接数字打表可以解 利用itoa打表也可以 利用数位dp 利用数位dp解法 1、利用前缀和，注意最后输出的时候是r-(l-1),不是r-l，这样没有排除左端点的数 2、分别计算两个端点前面满足条件的数的个数 3、计算的时候利用dfs碰到不...
HYSBZ 1026 windy数
菜鸟
04-28 564
从别人那里学的数位dp，，然后直接套模板写的。。#include #include #include #include using namespace std; int dig[15]; int dp[15][10][2]; //pos表示当前的数位，pre表示前一个数位上的数 //sta表示前面是否存在非0的数，limit表示当前的数是否受限于前一个数位上的数 int dfs(int
bzoj1026 windy数 数位dp 记忆化搜索
yxr0105
01-27 1177
bzoj1026 题目大意:求[A,B]相邻两位差>=2的个数 1 <= A <= B <= 2000000000 题解: 在网上找了找题解都是用上一种方法(预处理+递推)写的 然而自认为记忆化搜索才是数位dp的通解(勿喷= = 记忆化搜索记录三个变量int dfs(int pos,int pre,bool limit)分别记录 当前位置 前一位数 是否有限制 如果(!limit) 当
HYSBZ - 1026 windy数
子灬丶逾
07-27 156
1026 windy数 题 意:给你一个区间，问这个区间有多少个数字，满足不含前导0，且满足两个数位之间的差值最少位2. 输入范围 1&amp;lt;=l&amp;lt;=r&amp;lt;=1e6 输入样例: 【输入样例一】 1 10 【输入样例二】 25 50 输出样例: 【输出样例一】 9 【输出样例二】 20 思 路：还是一样的数位dp,状态定义dp[i][j] 枚举到第i位，前一位是j的...
暑假D16 T3 密道（数位DP？ 打表找规律）
weixin_30716141的博客
07-29 248
题意 对于一个（n+1）*（n+1）的矩阵，第一列和第一排为1，其他位置为1当且仅当上方和左方有一个1，其他为0； 对于100%的数据，n<=1e9 题解 稍微画了一下，感觉从图像看不大出来，就去打了一个表： 1,3,7,9,17,21,25,27,43,51,59,63,71,75,81; 这种东西一般就求差再看看，就会发现：2,4,2,8,4,4,2,16,8,8,4,8,4...
BZOJ2627 伯努利数
最新发布
05-26
这是一道经典的组合数学题目，需要一些基本的组合数学知识。 首先，我们先来了解一下伯努利数。伯努利数是组合数学中的一类数列，它们的递推式如下： $$B_0 = 1, B_n = -\frac{1}{n+1}\sum_{i=0}^{n-1}{{n+1}\choose{i}}B_i$$ 其中 $n\geq 1$，${n\choose k}$ 表示组合数，$B_n$ 表示第 $n$ 个伯努利数。 接下来，我们考虑如何计算 $\sum_{i=0}^{n}{n+1\choose{i}}B_i$。根据二项式定理，我们有： $$(1+x)^{n+1} = \sum_{i=0}^{n+1}{n+1\choose{i}}x^i$$ 对上式两边求导可以得到： $$(n+1)(1+x)^n = \sum_{i=1}^{n+1}{n+1\choose{i}}ix^{i-1}$$ 将 $x=1$ 带入上式，得到： $$(n+1)\cdot 2^n = \sum_{i=1}^{n+1}{n+1\choose{i}}i$$ 注意到 $B_0=1$，我们可以对伯努利数的递推式进行变形： \begin{aligned} B_n &= -\frac{1}{n+1}\sum_{i=0}^{n-1}{{n+1}\choose{i}}B_i \\ &= -\frac{1}{n+1}\left({{n+1}\choose{0}}B_0 + \sum_{i=1}^{n}{{n+1}\choose{i}}B_i\right) \\ &= -\frac{1}{n+1}\left({{n+1}\choose{0}}B_0 + \sum_{i=1}^{n}{n+1\choose{i}}B_i\right) + \frac{1}{n+1}{{n+1}\choose{0}}B_0 \\ &= -\frac{1}{n+1}\sum_{i=0}^{n}{n+1\choose{i}}B_i + \frac{1}{n+1} \end{aligned} 因此，我们有： $$\sum_{i=0}^{n}{n+1\choose{i}}B_i = (n+1)(B_{n+1}-1)$$ 这个式子可以通过数学归纳法进行证明。 现在，我们已经得到了 $\sum_{i=0}^{n}{n+1\choose{i}}B_i$ 的计算公式，只需要预处理出前 $n$ 个伯努利数就可以在 $O(n)$ 的时间复杂度内解决这个问题了。
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值