Qer的博客

B. The Queue time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Finally! Vasya have come of age and that means

D. Timofey and rectangles time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output One of Timofey's birthday present

E. Timofey and remoduling time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Little Timofey likes integers a l

D. Dasha and Very Difficult Problem time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Dasha logged into the s

E. Dasha and Puzzle time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Dasha decided to have a rest after solv

C. Success Rate time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You are an experienced Codeforces user. Tod

D. Dynamic Problem Scoring time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Vasya and Petya take part in a C

E. Prairie Partition time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output It can be shown that any positive inte

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