Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- #define mx 1765789
- int a[mx],cnt[mx];
- int sp[mx+3];
- int p=0;
- void seive()
- {
- sp[1]=1;
- for(int i=2;i<=mx;i+=2){
- sp[i]=2;
- }
- for(int i=3;i<=mx;i+=2){
- sp[i]=i;
- }
- for(int i=3;i<=sqrt(mx);i+=2){
- if(sp[i]==i){
- for(int j=i*i;j<=mx;j+=i){
- if(sp[j]==j){
- sp[j]=i;
- }
- }
- }
- }
- a[p++]=2;
- for(int i=3;i<=mx;i+=2){
- if(sp[i]==i) a[p++]=i;
- }
- }
- int main()
- {
- seive();
- int t;
- long long int n;
- int c=0;
- scanf("%d",&t);
- while(t--){
- c++;
- scanf("%lld",&n);
- int mn=INT_MIN;
- int mul=1;
- int x=sqrt(n);
- for(int i=0;i<p ;i++){
- if(n%a[i]==0){
- int cnt=0;
- while(n%a[i]==0){
- n/=a[i];
- cnt++;
- }
- mul*=(cnt+1);
- }
- }
- if(n!=1) mul*=2;
- printf("Case %d: %d\n",c,mul-1);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement