C. Seat Arrangements   time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Suppose that you are in a campus and have to go for classes day by day. As you may see, when you hurry to a classroom,…

C. Seat Arrangements time limit per test1 second memory limit per test256 megabytes Problem Description Suppose that you are in a campus and have to go for classes day by day. As you may see, when you hurry to a classroom, you surprisingly find that…

C. Seat Arrangements time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Suppose that you are in a campus and have to go for classes day by day. As you may see, when you hurry to a classroom, y…

传送门:http://codeforces.com/contest/919/problem/C 给出一张n×m的座位表(有已占座位和空座位),请选择同一行(或列)内连续的k个座位.求选择的方法数. Hack:首先,若k=1,则所有的空座位均可选,方法数即为空座位数. 对于某一行(或列)中连续的len个座位,选择的方法数为len-k+1. 于是,分别逐行.逐列地统计,求出答案.参考程序如下: #include <stdio.h> #define MAX_N 2000 char map[MAX_N…

[链接] 我是链接,点我呀:) [题意] 在这里输入题意 [题解] 用pre[i][j]表示第i行前j列的和. 然后枚举连续座位的最左上点. (有两种可能向右或向下k个. 则还需要处理出pre2[i][j]表示第j列前i行的和. (都可以O(N^2)求出 然后pre[i][j+k-1]-pre[i][j-1]就是第i行第j列往右k个格子的空(或被占据)的格子数目了. 看看是不是符合要求就好. 往下扩展同理. k==1的时候只要取向右一种就好.所以直接除个2 [代码] #include <bits…

题目描述 Given an integer xx . Your task is to find out how many positive integers nn ( 1<=n<=x1<=n<=x ) satisfy  where a,b,pa,b,p are all known constants. 输入输出格式 输入格式: The only line contains four integers a,b,p,xa,b,p,x ( 2<=p<=10^{6}+32<…

题目描述 You are given a graph with nn nodes and mm directed edges. One lowercase letter is assigned to each node. We define a path's value as the number of the most frequently occurring letter. For example, if letters on a path are "abaca", then th…

  B. Perfect Number   time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output We consider a positive integer perfect, if and only if the sum of its digits is exactly 10. Given a positive integer k…

这场cf有点意思,hack场,C题等于1的特判hack很多人(我hack成功3个人,上分了,哈哈哈,咳咳...) D题好像是树形dp,E题好像是中国剩余定理,F题好像还是dp,具体的不清楚,最近dp的题目好多,一会滚去学dp. 写A,B,C的题解. A. Supermarket   time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard outpu…

A B C #include <bits/stdc++.h> #define PI acos(-1.0) #define mem(a,b) memset((a),b,sizeof(a)) #define TS printf("!!!\n") #define pb push_back #define inf 1e9 //std::ios::sync_with_stdio(false); using namespace std; //priority_queue<int,…