Submission #2706116


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vt = vector<T>;
template<class T> using vvt = vector<vt<T>>;
template<class T> using ttt = tuple<T,T>;
using tii = tuple<int,int>;
using vi = vector<int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define mt make_tuple
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second
#define DEB cerr<<"!"<<endl
#define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl
#define DIV int(1e9+7)
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-8;
//const double PI = M_PI;  
inline ll pow(ll x,ll n,ll m){ll r=1;while(n>0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;}
inline ll lcm(ll d1, ll d2){return d1 / __gcd(d1, d2) * d2;}

/*Coding Space*/
int main(){
  ll n,q; cin >> n >> q;
  vt<ll> a(q); rep(i,q) cin >> a[i];
  reverse(ALL(a));
  unordered_set<ll> b,c;
  c.insert(1);
  for(auto qq:a){
    swap(c,b);
    c.clear();
    for(auto bb:b){
      if(bb % qq)c.insert(bb);
      if(bb * qq <= n )c.insert(bb * qq);
    }
  }
  cout << c.size() << endl;
}

Submission Info

Submission Time
Task B - Division 2
User cashisu1
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1145 Byte
Status AC
Exec Time 25 ms
Memory 3992 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 25 / 25 75 / 75
Status
AC × 4
AC × 10
AC × 18
Set Name Test Cases
Sample sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt
Subtask1 sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt, sub1_1.txt, sub1_2.txt, sub1_3.txt, sub1_4.txt, sub1_5.txt, sub1_6.txt
Subtask2 sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt, sub1_1.txt, sub1_2.txt, sub1_3.txt, sub1_4.txt, sub1_5.txt, sub1_6.txt, sub2_1.txt, sub2_2.txt, sub2_3.txt, sub2_4.txt, sub2_5.txt, sub2_6.txt, sub2_7.txt, sub2_8.txt
Case Name Status Exec Time Memory
sample_1.txt AC 1 ms 256 KB
sample_2.txt AC 1 ms 256 KB
sample_3.txt AC 1 ms 256 KB
sample_4.txt AC 1 ms 256 KB
sub1_1.txt AC 1 ms 256 KB
sub1_2.txt AC 1 ms 256 KB
sub1_3.txt AC 1 ms 256 KB
sub1_4.txt AC 1 ms 256 KB
sub1_5.txt AC 1 ms 256 KB
sub1_6.txt AC 1 ms 256 KB
sub2_1.txt AC 2 ms 384 KB
sub2_2.txt AC 2 ms 512 KB
sub2_3.txt AC 2 ms 512 KB
sub2_4.txt AC 3 ms 384 KB
sub2_5.txt AC 7 ms 1152 KB
sub2_6.txt AC 4 ms 896 KB
sub2_7.txt AC 12 ms 1920 KB
sub2_8.txt AC 25 ms 3992 KB