Codeforces Round #277 (Div. 2) 题解

最新推荐文章于 2022-11-19 18:52:08 发布

码代码的猿猿的AC之路

最新推荐文章于 2022-11-19 18:52:08 发布

阅读量1.8k

点赞数

分类专栏： ACM比赛 DP 水题字符串

本文链接：https://blog.csdn.net/ck_boss/article/details/41076855

版权

该博客详细介绍了Codeforces Round #277 (Div. 2) 比赛中的题目解答，包括数列计算、矩阵还原、字符串操作和树形DP等算法问题，解析了如何通过有效步骤使字符串变为回文串，计算树的合法子集数量，以及最长递增子序列等问题的解决方案。

摘要由CSDN通过智能技术生成

Codeforces Round #277 (Div. 2)

For a positive integer n let's define a function f:

f(n) = - 1 + 2 - 3 + .. + ( - 1)nn

Your task is to calculate f(n) for a given integer n.

Input

The single line contains the positive integer n (1 ≤ n ≤ 1015).

Output

Print f(n) in a single line.

       Sample test(s) 
     
         input 
       
4

         output 
       
2

         input 
       
5

         output 
       
-3

Note

f(4) = - 1 + 2 - 3 + 4 = 2

f(5) = - 1 + 2 - 3 + 4 - 5 = - 3

简单公式:

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>

using namespace std;

typedef long long int LL;

LL n;

int main()
{
    cin>>n;
    if(n%2==0)
    {
        LL t=n/2;
        cout<<t<<endl;
    }
    else
    {
        LL t=(n-1)/2;
        cout<<t-n<<endl;
    }
    return 0;
}

Let's define logical OR as an operation on two logical values (i. e. values that belong to the set {0, 1}) that is equal to 1 if either or both of the logical values is set to 1, otherwise it is 0. We can define logical OR of three or more logical values in the same manner:

$\text{[math]}$ where $\text{[math]}$ is equal to 1 if some ai = 1, otherwise it is equal to 0.

Nam has a matrix A consisting of m rows and n columns. The rows are numbered from 1 to m, columns are numbered from 1 to n. Element at row i(1 ≤ i ≤ m) and column j (1 ≤ j ≤ n) is denoted as Aij. All elements of A are either 0 or 1. From matrix A, Nam creates another matrix B of the same size using formula:

$\text{[math]}$ .

(Bij is OR of all elements in row i and column j of matrix A)

Nam gives you matrix B and challenges you to guess matrix A. Although Nam is smart, he could probably make a mistake while calculating matrix B, since size of A can be large.

Input

The first line contains two integer m and n (1 ≤ m, n ≤ 100), number of rows and number of columns of matrices respectively.

The next