Codeforces 1034A. Enlarge GCD?????????????????

正常程序 

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1.5e7+5;
const int INF = MAXN+100;
int n, cnt, maxx, answer;
int a[300005];

bool isPrime[MAXN+100];
int GCD;
int eqNum[MAXN];

int gcd(int a, int b){
	if (a<b) swap(a, b);
	return b==0 ? a : gcd(b, a%b); 
}
void getPrime(){
	memset(isPrime, 1, sizeof(isPrime));
	for (int i=2; i<=MAXN; i++){
		int cnt = 0;
		if (isPrime[i]) {
			for (int j=i; j<MAXN; j+=i){
				isPrime[j] = 0;
				cnt += eqNum[j];
			}
		}
		//cout<<cnt<<endl;
		if (answer == -1) {
			printf("before i = %d\n", i);
			return;
		}
		answer = min(answer, n-cnt);
		if (answer == -1) {
			printf("after i = %d\n", i);
			return;
		}
	}
}

int main(){
	scanf("%d", &n);
	answer = INF;
	for (int i=0; i<n; i++){
		scanf("%d", &a[i]);
		GCD = gcd(GCD, a[i]);
	}
	//printf("gcd = %d\n", GCD);
	for (int i=0; i<n; i++){
		eqNum[a[i]/GCD]++;
	}
	//printf("%d", eqNum[4]);
	getPrime();
	if (answer == INF || answer == n) cout<<-1<<endl;
	else cout<<answer<<endl;
}

 爆炸程序

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1.5e7+5;
const int INF = MAXN+100;
int n, cnt, maxx, answer;
int a[300005];

bool isPrime[MAXN+100];
int GCD;
int eqNum[MAXN];

int gcd(int a, int b){
	if (a<b) swap(a, b);
	return b==0 ? a : gcd(b, a%b); 
}
void getPrime(){
	memset(isPrime, 1, sizeof(isPrime));
	for (int i=2; i<=MAXN; i++){
		int cnt = 0;
		if (isPrime[i]) {
			for (int j=i; j<=MAXN; j+=i){
				isPrime[j] = 0;
				cnt += eqNum[j];
			}
		}
		//cout<<cnt<<endl;
		if (answer == -1) {
			printf("before i = %d\n", i);
			return;
		}
		answer = min(answer, n-cnt);
		if (answer == -1) {
			printf("after i = %d\n", i);
			return;
		}
	}
}

int main(){
	scanf("%d", &n);
	answer = INF;
	for (int i=0; i<n; i++){
		scanf("%d", &a[i]);
		GCD = gcd(GCD, a[i]);
	}
	//printf("gcd = %d\n", GCD);
	for (int i=0; i<n; i++){
		eqNum[a[i]/GCD]++;
	}
	//printf("%d", eqNum[4]);
	getPrime();
	if (answer == INF || answer == n) cout<<-1<<endl;
	else cout<<answer<<endl;
}

数组越界 OSX正常 CF测评机报错 查了半天啊-。-。-。-。-。-。-

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值