| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1340741 | rony_js | Tezina (COCI26_tezina) | C++20 | 0 ms | 360 KiB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
inline void solve(){
int n,k; cin>>n>>k;
vector<int>v(n);
set<int>s;
map<int,int>m;
for(int i = 0; i<n; i++){cin>>v[i];
m[v[i]]++;
s.insert(v[i]);
}
int ans = 0;
for(auto to: s){
int c = 0;
for(int j = 1; j<=to; j++){
if(((to/j)*(to+2))>100000000)c+=100000000;
else c+=(to/j)*(to+2) ;
}
ans+=c*m[to];
}
cout<<ans<<endl;
}
signed main(){
solve();
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... | ||||
