870C. Maximum splitting

C. Maximum splitting：题目

这凭啥1300分？

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> a((int)6e5);
vector<ll> b((int)6e5);
string str;
int main()
{int t;cin>>t;while (t--){int n;cin>>n;int res = 0;if (n&1){if (n<9) res = -1;else {if (n<9||n==11) res = -1;else if ((n-9)%4==0) res = 1+(n-9)/4;else if ((n-9-6)%4==0) res = 2+(n-9-6)/4;else res = -1;}}else {if (n<4) res = -1; else if (n%4==0) res = n/4;else if ((n-6)%4==0) res = 1+(n-6)/4;else res = -1;}cout<<res<<endl;}
}

870C. Maximum splitting相关推荐

Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)
一场挺简单的CF,但是我打炸了啊 A. Search for Pretty Integers time limit per test 1 second memory limit per test 25 ...
Codeforces #440.Div.2
A - Search for Pretty Integers 题目大意: 给两组数.给一个叫"pretty integer"的定义. 如果这个数至少有一位来自第一个数组,又有一位来 ...
Codeforces 题目合集+分类+代码【Updating...】【361 in total】
961A - Tetris 模拟 ...
【C++】C++11 STL算法(六)：最小/最大操作(Minimum/maximum operations)、比较运算(Comparison operations)
目录最小/最大操作(Minimum/maximum operations) 一.max 1.原型: 2.说明: 3.官方demo 二.max_element 1.原型: 2.说明: 3.官方demo ...
Lintcode42 Maximum Subarray II solution 题解
[题目描述] Given an array of integers, find two non-overlapping subarrays which have the largest sum.The ...
[LintCode] Maximum Subarray 最大子数组
Given an array of integers, find a contiguous subarray which has the largest sum. Notice The subarra ...
UVA11059 Maximum Product
问题链接:UVA11059 Maximum Product.基础级练习题,用C语言编写程序. 题意简述:输入n个整数序列,有正有负,求这个序列中最大连续累乘的子序列,其最大的值为多少.如果结果为负数, ...
Leetcode | Binary Tree Maximum Path Sum
Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. ...
贪心 ---- E. Maximum Subsequence Value[位运算]
E. Maximum Subsequence Value 题目大意:有点难解释..建议自己看题.我这里就粗略解释:给定一个数组aaa,要求选出具有最大价值的子序列.假设此子序列的长度为kkk,那么最大 ...

870C. Maximum splitting

870C. Maximum splitting相关推荐

最新文章

热门文章