先算出目标状态,然后拿当前状态与目标状态对比,即可算出答案 #include<cstdio> #include<cmath> #include<cstring> #include<algorithm> using namespace std; +; int a[maxn]; int b[maxn]; int main() { int n; scanf("%d",&n); ;i<=n;i++) scanf("%d&q…
#include<bits/stdc++.h> using namespace std; ],c[]; int main() { int n,i; while(cin >> n){ ; ;i<n;i++){ cin >> num[i]; c[i]=num[i]; sum+=num[i]; } sort(num,num+n); long long ave=sum/n; long long left=sum%n; fill(c,c+n,ave); ;i>=&am…
http://codeforces.com/contest/738/problem/D Galya is playing one-dimensional Sea Battle on a 1 × n grid. In this game a ships are placed on the grid. Each of the ships consists of bconsecutive cells. No cell can be part of two ships, however, the shi…
http://codeforces.com/contest/738/problem/C Vasya is currently at a car rental service, and he wants to reach cinema. The film he has bought a ticket for starts in t minutes. There is a straight road of length s from the service to the cinema. Let's…
http://codeforces.com/contest/738/problem/A Polycarp has interviewed Oleg and has written the interview down without punctuation marks and spaces to save time. Thus, the interview is now a string s consisting of n lowercase English letters. There is…
