Submission #7475314
Source Code Expand
#include <bits/stdc++.h> using namespace std; using ll = long long; template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; } #define rep(i, n) REP(i, 0, n) #define ALL(v) v.begin(), v.end() #define MSG(a) cout << #a << " " << a << endl; #define REP(i, x, n) for(int i = x; i < n; i++) #define all(x) (x).begin(),(x).end() ll tmp1,tmp2,tmp3; const ll mod = 1e9+7; const int INF = 1e9; const ll INFLONG = 1e18; void swap(ll *x,ll *y){ ll z = *x; *x = *y; *y = z; } void print(vector<ll> vec){ ll length = (ll)vec.size(); rep(i,length){ if(i != 0){cout << " ";} cout << vec[i]; } cout << endl; } int main(){ ll n; cin >> n; vector<ll> vec(n); vector<ll> pres(n,-1); rep(i,n){ cin >> vec[i]; } sort(all(vec)); rep(i,n){ rep(j,n){ if(vec[i] % vec[j] == 0){ pres[i]++; } } } double sum = 0; double tmp; rep(i,n){ cout << i << " " << pres[i] << endl; if(pres[i] == 0){ sum++; }else{ tmp = (double)(pres[i] / 2) + 1; //cout << tmp; sum += (tmp / (pres[i]+1)); } } printf("%.10f\n",sum); }
Submission Info
Submission Time | |
---|---|
Task | C - コイン |
User | ojiso |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1283 Byte |
Status | WA |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 99 | 0 / 1 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
Subtask1 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt |
Subtask2 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | WA | 1 ms | 256 KB |
sample_02.txt | WA | 1 ms | 256 KB |
sample_03.txt | WA | 1 ms | 256 KB |
subtask1_01.txt | WA | 1 ms | 256 KB |
subtask1_02.txt | WA | 1 ms | 256 KB |
subtask1_03.txt | WA | 1 ms | 256 KB |
subtask1_04.txt | WA | 1 ms | 256 KB |
subtask1_05.txt | WA | 1 ms | 256 KB |
subtask1_06.txt | WA | 1 ms | 256 KB |
subtask1_07.txt | WA | 1 ms | 256 KB |
subtask1_08.txt | WA | 1 ms | 256 KB |
subtask1_09.txt | WA | 1 ms | 256 KB |
subtask1_10.txt | WA | 1 ms | 256 KB |
subtask1_11.txt | WA | 1 ms | 256 KB |
subtask1_12.txt | WA | 1 ms | 256 KB |
subtask1_13.txt | WA | 1 ms | 256 KB |
subtask1_14.txt | WA | 1 ms | 256 KB |
subtask1_15.txt | WA | 1 ms | 256 KB |
subtask1_16.txt | WA | 1 ms | 256 KB |
subtask1_17.txt | WA | 1 ms | 256 KB |
subtask1_18.txt | WA | 1 ms | 256 KB |
subtask1_19.txt | WA | 1 ms | 256 KB |
subtask1_20.txt | WA | 1 ms | 256 KB |
subtask2_01.txt | WA | 1 ms | 256 KB |
subtask2_02.txt | WA | 1 ms | 256 KB |
subtask2_03.txt | WA | 1 ms | 256 KB |
subtask2_04.txt | WA | 1 ms | 256 KB |
subtask2_05.txt | WA | 2 ms | 256 KB |
subtask2_06.txt | WA | 1 ms | 256 KB |
subtask2_07.txt | WA | 1 ms | 256 KB |
subtask2_08.txt | WA | 2 ms | 256 KB |
subtask2_09.txt | WA | 2 ms | 256 KB |
subtask2_10.txt | WA | 2 ms | 256 KB |
subtask2_11.txt | WA | 2 ms | 256 KB |
subtask2_12.txt | WA | 2 ms | 256 KB |
subtask2_13.txt | WA | 1 ms | 256 KB |
subtask2_14.txt | WA | 2 ms | 256 KB |
subtask2_15.txt | WA | 2 ms | 256 KB |
subtask2_16.txt | WA | 2 ms | 256 KB |
subtask2_17.txt | WA | 2 ms | 256 KB |
subtask2_18.txt | WA | 1 ms | 256 KB |
subtask2_19.txt | WA | 2 ms | 256 KB |
subtask2_20.txt | WA | 2 ms | 256 KB |