# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
256549 | blacktulip | Spiderman (COCI20_spiderman) | C++17 | 196 ms | 23672 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define int long long
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 1000005;
const lo mod = 1000000007;
int n,m,b[li],a[li],k,flag,t;
int cev,mpp[li];
string s;
PII p[li];
vector<int> v;
inline void sieve(){
for(int i=2;i<=1000000;i++){
if(mpp[i]==0)continue;
for(int j=0;j<=1000000;j+=i){
if(j+k<=1000000 && j+k<j+i)a[j+k]+=mpp[i];
}
}
}
main(void){
scanf("%lld %lld",&n,&k);
FOR{
scanf("%lld",&p[i].fi);
mpp[p[i].fi]++;
}
sieve();
FOR{
printf("%lld ",a[p[i].fi]);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |