Codeforces Round #812 (Div. 2)
(🕊了好久呜呜呜~) 题目大意:对一个序列可以进行一次操作:选择两个索引 l , r ,对 l , r 范围内的数都减一,然后称f(a)为将所有数删为0所需要的次数࿰…
C. Make Equal With Mod
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
You are given an array of nn non-negative integers a1,a2,…,ana1,a2,…,an. You can make the following operation: c…
链接
#include <iostream>
#include <algorithm>
using namespace std;const int N 1e4 10;int a[N], b[N];int main()
{int n, k;scanf("%d %d", &n, &k);for(int i 1; i < n - 1; i) {printf("and %d %d\n", i, i1);fflush(s…