QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#199418 | #1461. Greedy Algorithm | 123456667 | WA | 0ms | 3584kb | C++14 | 389b | 2023-10-04 12:05:36 | 2023-10-04 12:05:36 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, k;
int arr[N];
void solve()
{
for(int i = 1; i <= n; i++){
scanf("%d", &arr[i]);
}
int maxk = n / 20;
int mink = 2;
while(mink < maxk && n % maxk != 0)
{
maxk--;
}
cout << maxk;
}
int main()
{
cin >> n;
solve();
return 0;
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3584kb
input:
2 3 1 2 3 4 5 99
output:
0
result:
wrong answer 1st numbers differ - expected: '8', found: '0'