QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#518720 | #4229. GCD Harmony | user33 | WA | 1ms | 3700kb | C++14 | 1.4kb | 2024-08-14 02:11:04 | 2024-08-14 02:11:05 |
Judging History
answer
#include<bits/stdc++.h>
#define maxn 5001
using namespace std;
long long a[maxn];
int n;
int dem[100];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for(int i=1;i<=n;i++){
cin >> a[i];
if(a[i]%2==0) dem[2]++;
if(a[i]%3==0) dem[3]++;
if(a[i]%5==0) dem[5]++;
if(a[i]%7==0) dem[7]++;
if(a[i]%11==0) dem[11]++;
if(a[i]%13==0) dem[13]++;
if(a[i]%17==0) dem[17]++;
if(a[i]%19==0) dem[19]++;
if(a[i]%23==0) dem[23]++;
if(a[i]%29==0) dem[29]++;
if(a[i]%31==0) dem[31]++;
if(a[i]%37==0) dem[37]++;
if(a[i]%41==0) dem[41]++;
if(a[i]%43==0) dem[43]++;
if(a[i]%47==0) dem[47]++;
if(a[i]%53==0) dem[53]++;
if(a[i]%59==0) dem[59]++;
if(a[i]%61==0) dem[61]++;
if(a[i]%67==0) dem[67]++;
if(a[i]%71==0) dem[71]++;
if(a[i]%73==0) dem[73]++;
if(a[i]%79==0) dem[79]++;
if(a[i]%83==0) dem[83]++;
if(a[i]%89==0) dem[89]++;
if(a[i]%97==0) dem[97]++;
}
for(int i=1;i<=n-1;i++){
int u,v;
cin >> u >> v;
}
// for(int i=1;i<=100;i++) cout << dem[i] << ' ';
int nho = 0, ds = 0;
for(int i=1;i<=100;i++){
if(ds<dem[i]){
ds = dem[i];
nho = i;
}
}
cout << (n - ds)*nho << '\n';
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3700kb
input:
6 5 6 3 4 9 12 1 2 1 3 1 4 1 6 3 5
output:
0
result:
wrong answer 1st lines differ - expected: '6', found: '0'