Submission #353682


Source Code Expand

#include <bits/stdc++.h>

#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(i, n) REP (i, 0, n)

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pair<int, int> > vpii;

const int INF = 1000000000;
const int MOD = 1000000007;
const double EPS = 1e-8;

int main() {
  int n; cin >> n;
  int a[n]; rep(i, n) cin >> a[i];

  rep(i, n) {
    while (a[i] % 2 == 0) a[i] /= 2;
  }
  sort(a, a + n);
  int ans = 1, tmp = a[0];
  rep(i, n) {
    if (tmp != a[i]) {
      tmp = a[i];
      ans++;
    }
  }
  cout << ans << endl;
}

Submission Info

Submission Time
Task C - 高橋くんと魔法の箱
User s5412039
Language C++ (G++ 4.6.4)
Score 100
Code Size 641 Byte
Status AC
Exec Time 116 ms
Memory 1656 KB

Judge Result

Set Name Sample Subtask1 Subtask2 All
Score / Max Score 0 / 0 20 / 20 30 / 30 50 / 50
Status
AC × 3
AC × 23
AC × 13
AC × 43
Set Name Test Cases
Sample subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
Subtask1 subtask1_0.txt, subtask1_1.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_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
Subtask2 subtask2_0.txt, subtask2_1.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
All subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.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_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask2_0.txt, subtask2_1.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt, subtask3_0.txt, subtask3_1.txt, subtask3_2.txt, subtask3_3.txt, subtask3_4.txt, subtask3_5.txt, subtask3_6.txt, subtask3_7.txt, subtask3_8.txt, subtask3_9.txt
Case Name Status Exec Time Memory
subtask0_0.txt AC 36 ms 1272 KB
subtask0_1.txt AC 30 ms 1204 KB
subtask0_2.txt AC 30 ms 1204 KB
subtask1_0.txt AC 33 ms 1172 KB
subtask1_1.txt AC 34 ms 1212 KB
subtask1_10.txt AC 35 ms 1204 KB
subtask1_11.txt AC 34 ms 1200 KB
subtask1_12.txt AC 34 ms 1168 KB
subtask1_13.txt AC 34 ms 1204 KB
subtask1_14.txt AC 34 ms 1204 KB
subtask1_15.txt AC 33 ms 1172 KB
subtask1_16.txt AC 38 ms 1208 KB
subtask1_17.txt AC 39 ms 1200 KB
subtask1_18.txt AC 34 ms 1172 KB
subtask1_19.txt AC 35 ms 1200 KB
subtask1_2.txt AC 35 ms 1272 KB
subtask1_3.txt AC 34 ms 1216 KB
subtask1_4.txt AC 32 ms 1276 KB
subtask1_5.txt AC 30 ms 1268 KB
subtask1_6.txt AC 32 ms 1136 KB
subtask1_7.txt AC 32 ms 1280 KB
subtask1_8.txt AC 33 ms 1204 KB
subtask1_9.txt AC 32 ms 1276 KB
subtask2_0.txt AC 87 ms 1596 KB
subtask2_1.txt AC 99 ms 1480 KB
subtask2_2.txt AC 99 ms 1556 KB
subtask2_3.txt AC 99 ms 1588 KB
subtask2_4.txt AC 100 ms 1588 KB
subtask2_5.txt AC 99 ms 1588 KB
subtask2_6.txt AC 98 ms 1652 KB
subtask2_7.txt AC 98 ms 1560 KB
subtask2_8.txt AC 100 ms 1552 KB
subtask2_9.txt AC 100 ms 1552 KB
subtask3_0.txt AC 88 ms 1480 KB
subtask3_1.txt AC 116 ms 1588 KB
subtask3_2.txt AC 116 ms 1516 KB
subtask3_3.txt AC 116 ms 1480 KB
subtask3_4.txt AC 116 ms 1584 KB
subtask3_5.txt AC 116 ms 1560 KB
subtask3_6.txt AC 114 ms 1656 KB
subtask3_7.txt AC 116 ms 1588 KB
subtask3_8.txt AC 116 ms 1480 KB
subtask3_9.txt AC 116 ms 1584 KB