| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1340012 | caveeee | Tezina (COCI26_tezina) | C++20 | 2095 ms | 1092 KiB |
#include <iostream>
#include <vector>
using namespace std;
int main(){
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int N, k; cin >> N >> k;
vector<long long>v (N);
for(int i = 0; i<N; i++){
cin >> v[i];
}
long long ans = 0;
for(int i = 1; i<=k; i++){
long long sum = 0;
for(int j = 0; j<N; j++){
long long a = v[j]/i;
long long b = min(a*(v[j] + 2), (long long)1e8);
//cout << b << " ";
sum += b;
}
ans += sum;
//cout << sum << " ";
}
cout << ans << '\n';
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
