Submission #51800680

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define fr(i, j, k) for (int i = j; i < k; i++)
#define fr2(i, j, k) for (int i = j - 1; i >= k; i--)
#define vp vector<pair<int, int>>
#define vi vector<int>
#define For(s) for (auto i : s)
#define pii pair<int, int>
#define mp map<int, int>
#define ld long double
#define se set<int>
#define ms multiset<int>
#define pb push_back
#define in insert
#define all(v) (v.begin(), v.end())
template <class T>
using oset = tree<T, null_type, less<T>, rb_tree_tag,
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define fr(i, j, k) for (int i = j; i < k; i++)
#define fr2(i, j, k) for (int i = j - 1; i >= k; i--)
#define vp vector<pair<int, int>>
#define vi vector<int>
#define For(s) for (auto i : s)
#define pii pair<int, int>
#define mp map<int, int>
#define ld long double
#define se set<int>
#define ms multiset<int>
#define pb push_back
#define in insert
#define all(v) (v.begin(), v.end())
template <class T>
using oset = tree<T, null_type, less<T>, rb_tree_tag,
                  tree_order_statistics_node_update>;

signed main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  // ceil a/b=(a-1+b)/b do remember
  int t;
  t=1;
  while (t--)
  {
    int n,k;
    cin>>n>>k;
    int a[n];
    fr(i,0,n){
      cin>>a[i];
      if(a[i]%k){
        continue;
      }
      cout<<a[i]/k<<" ";
    }
    cout<<"\n";
  }
}

Submission Info

Judge Result