CodeForces 1883C Raspberries

合集 - Codeforces(21)

1.CodeForces 1992E Novice's Mistake2024-07-16 2.CodeForces 1935A Entertainment in MAC2024-06-16 3.CodeForces 1992C Gorilla and Permutation2024-07-16 4.CodeForces 1992D Test of Love2024-07-16 5.CodeForces 1992B Angry Monk2024-07-16 6.CodeForces 1992A Only Pluses2024-07-16 7.CodeForces 1983B Corner Twist2024-07-16 8.CodeForces 1983A Array Divisibility2024-07-16 9.CodeForces 1983C Have Your Cake and Eat It Too2024-07-16 10.CodeForces 1883B Chemistry2024-07-26 11.CodeForces 1883A Morning2024-07-26

12.CodeForces 1883C Raspberries2024-07-28

13.CodeForces 1883D In Love2024-07-28 14.CodeForces 1883E Look Back2024-07-28 15.CodeForces 1883F You Are So Beautiful2024-07-28 16.CodeForces 1883G1 Dances (Easy version)2024-07-28 17.CodeForces 908B New Year and Buggy Bot2024-08-01 18.CodeForces 908C New Year and Curling2024-08-01 19.CodeForces 1132B Discounts2024-08-01 20.CodeForces 1619D New Year's Problem2024-08-01 21.Codeforces Round 964 (Div. 4)2024-08-07

题目链接：CodeForces 1883C【Raspberries】

思路

依次枚举，特判k = 4的情况，因为k = 4可以由2个2拼凑起来，这2个2可以不在同一个元素上，如K = 4时，数组a可以为2, 3, 2, 5, 7, 9，此时数组中所有的元素乘积可以被4整除。若k = 4时，此时数组中元素没有可以拆分出2的情况时，所有的数组元素都是奇数，所以取出两个奇数，分别加1，就可以使得数组元素乘积为4的倍数。

代码

 #include <bits/stdc++.h>
 
using namespace std;
const int N = 1e5 + 10;
 
int a[N];
void solve() {
  int n, k;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  int ans = 1e7, num = 0;
  for (int i = 1; i <= n; i++) {
    // 计算结果
    ans = min(ans, (a[i] + k - 1) / k * k - a[i]);
    if (k == 4) {
      while (a[i] % 2 == 0 && num <= 1) {
        a[i] /= 2;
        num++;
      }
    }
  }
 
  if (k == 4 && num == 2) {
    cout << 0 << endl;
  } else if (k == 4 && num == 1) {
    cout << min(ans, 1) << endl;
  } else if (k == 4 && num == 0) {
    cout << min(ans, 2) << endl;
  } else {
    cout << ans << endl;
  }
 
}
 
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
 
  return 0;
}

posted @ 2024-07-28 11:14 薛定谔的AC 阅读(12) 评论(0) 编辑收藏举报

againss

CodeForces 1883C Raspberries

思路

代码

公告

搜索

常用链接

合集

随笔分类

随笔档案

阅读排行榜

推荐排行榜

	#include <bits/stdc++.h>

	using namespace std;
	const int N = 1e5 + 10;

	int a[N];
	void solve() {
	int n, k;
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
	cin >> a[i];
	}
	int ans = 1e7, num = 0;
	for (int i = 1; i <= n; i++) {
	// 计算结果
	ans = min(ans, (a[i] + k - 1) / k * k - a[i]);
	if (k == 4) {
	while (a[i] % 2 == 0 && num <= 1) {
	a[i] /= 2;
	num++;
	}
	}
	}

	if (k == 4 && num == 2) {
	cout << 0 << endl;
	} else if (k == 4 && num == 1) {
	cout << min(ans, 1) << endl;
	} else if (k == 4 && num == 0) {
	cout << min(ans, 2) << endl;
	} else {
	cout << ans << endl;
	}

	}

	int main() {
	int t;
	cin >> t;
	while (t--) {
	solve();
	}

	return 0;
	}