1036F - Relatively Prime Powers what's wrong with this code please?
include<stdio.h>
include<math.h>
/*function to find how many positive integers from 1 to n are power of m. as there are 3 numbers from 1 to 10 which is power of 2. so, ret_com(10,2.00) = 3*/
long long ret_com(long long n, double m){
return pow(n,(1/m)) - 1;
}
int main(){
long long a,x; int i,j; scanf("%d",&j); for(i = 0; i < j; i++){ scanf("%lld",&a);
/* i am trying to find how many numbers are power of a number. as gcd(k1,k2,k3,k4,.....) = 1, i have to find numbers of only single power(no square, no cube, no forth power and so on)*/
x = ret_com(a,2.00) + ret_com(a,3.00) + ret_com(a,5.00) + ret_com(a,7.00) + ret_com(a,11.00) + ret_com(a,13.00) + ret_com(a,17.00) + ret_com(a,19.00) + ret_com(a,23.00) + ret_com(a,29.00) + ret_com(a,31.00) + ret_com(a,37.00) + ret_com(a,41.00) + ret_com(a,43.00) + ret_com(a,47.00) + ret_com(a,53.00) + ret_com(a,59.00) - ret_com(a,6.00) - ret_com(a,10.00) - ret_com(a,14.00) - ret_com(a,15.00) - ret_com(a,21.00) - ret_com(a,22.00) - ret_com(a,26.00) - ret_com(a,33.00) - ret_com(a,34.00) - ret_com(a,35.00) - ret_com(a,38.00) - ret_com(a,39.00) - ret_com(a,46.00) - ret_com(a,51.00) - ret_com(a,55.00) - ret_com(a,57.00) - ret_com(a,58.00) + ret_com(a,30.00) + ret_com(a,42.00);/*using inclusion and exclusion principle.*/ printf("%lld\n",a - x - 1); } return 0;
}
If you want people to help you, you should make it easy for them to help you.
For me, the code you gave is pretty hard to read. You don't even attempt to explain what this does, you just blurt out a program and ask "what's wrong with this?".
What's wrong with this?
shows wa 42885338
cannot get the case
Auto comment: topic has been updated by zarif_2002 (previous revision, new revision, compare).