#include<bits/stdc++.h>
#define lcm(a,b) (a/__gcd(a,b))*b
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define F first
#define S second
#define mp make_pair
//salida rapida "\n"
//DECIMALES fixed<<sp(n)<<x<<endl;
//gcd(a,b)= ax + by
//lCB x&-x
//set.erase(it) - ersases the element present at the required index//auto it = s.find(element)
//set.find(element) - iterator pointing to the given element if it is present else return pointer pointing to set.end()
//set.lower_bound(element) - iterator pointing to element greater than or equal to the given element
//set.upper_bound(element) - iterator pointing to element greater than the given element
// | ^
using namespace std;
int main()
{
int n,k,h;
cin>>n>>k;
vi v;
map<int,int>m;
for(int i=0;i<n;i++){
cin>>h;
m[h]++;
v.pb(h);
}
vi res;
for(int i=0;i<n;i++){
int aux=0;
for(int i=1;i<=sqrt(h);i++){
if(h%i==0){
aux+=m[i];
if(h/i != i){
aux+=m[h/i];
}
}
}
aux--;
res.pb(aux);
}
for(int i=0;i<n;i++){
cout<<res[i]<<" ";
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
16 ms |
364 KB |
Output isn't correct |
| 2 |
Incorrect |
2 ms |
364 KB |
Output isn't correct |
| 3 |
Incorrect |
606 ms |
1860 KB |
Output isn't correct |
| 4 |
Incorrect |
456 ms |
4772 KB |
Output isn't correct |
| 5 |
Incorrect |
262 ms |
6116 KB |
Output isn't correct |
| 6 |
Incorrect |
775 ms |
8796 KB |
Output isn't correct |
| 7 |
Incorrect |
662 ms |
6116 KB |
Output isn't correct |
| 8 |
Incorrect |
757 ms |
6244 KB |
Output isn't correct |
| 9 |
Execution timed out |
2085 ms |
7900 KB |
Time limit exceeded |
| 10 |
Execution timed out |
2083 ms |
9052 KB |
Time limit exceeded |
