Qer的博客

B. The Queuetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputFinally! Vasya have come of age and that means

D. Timofey and rectanglestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne of Timofey's birthday present

E. Timofey and remodulingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Timofey likes integers a l

D. Dasha and Very Difficult Problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDasha logged into the s

E. Dasha and Puzzletime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDasha decided to have a rest after solv

C. Success Ratetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are an experienced Codeforces user. Tod

D. Dynamic Problem Scoringtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya and Petya take part in a C

E. Prairie Partitiontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIt can be shown that any positive inte

题意：给定n个集合，每个集合中有一些数字，问给出的一个长数字串中的所有匹配。 匹配：如果连续n个数字分别出现在1~n这些集合中，则是一个成功的匹配。 考虑每个数字出现的集合，用十个01二进制表示0~9这十个数字出现在那些集合中（预处理占位），然后通过左移操作和与运算验证是否匹配到n位。 使用bitset更方便操作。#include<bits/stdc++.h>using namespace s