fork download
copy 
  1. #include<stdio.h>
  2. #include<math.h>
  3. int prime(long long int num)
  4. {
  5.  long long int i=1,j,k;
  6.   int c=0;
  7.   while(i<=num){
  8.       k=0;
  9.       if(num%i==0){
  10.          j=1;
  11.           while(j<=i){
  12.             if(i%j==0)
  13.                  k++;
  14.              j++;
  15.           }
  16.           if(k==2)
  17.              c=c+1;
  18.       }
  19.       i++;
  20.    }
  21. return c;
  22. }
  23. long long int divisor(int n)
  24. {
  25. 	long long int sum=1+n;
  26. 	int i;int sq=0;
  27. 	int max=sqrt(n);
  28. 	for(i=2;i<=max;i++)
  29. 	{
  30. 		if(n%(i*i)==0)
  31. 		sq=1;
  32. 		if(n%i==0)
  33. 		{
  34. 		sum=sum+i;
  35. 		int d=n/i;
  36. 		if(d!=i)
  37. 		sum=sum+d;
  38. 	}
  39. 	}
  40. 	if(sq==1)
  41. 	return 0;
  42. 	else
  43. 	return sum;
  44. }
  45. int main()
  46. {
  47. 	int t;
  48. 	scanf("%d",&t);
  49. 	while(t--)
  50. 	{
  51. 		int l,r;
  52. 		scanf("%d%d",&l,&r);
  53. 		int i,j=0;long long int a[100001];
  54. 		for(i=0;i<100001;i++)
  55. 		a[i]=0;
  56. 		long long int sum=0;
  57. 		for(i=l;i<=r;i++)
  58. 		{
  59. 			if(divisor(i)!=0)
  60. 			{
  61. 				j=prime(divisor(i));
  62. 				if(j==2||j==3||j==5||j==7||j==11)
  63. 				a[i-1]=divisor(i);
  64. 			}
  65. 		}
  66. 		for(i=0;i<10000;i++)
  67. 		printf("%lld,",a[i]);
  68.  
  69. 	}
  70. 	return 0;
  71. }
  72.  
Time limit exceeded #stdin #stdout 5s 2820KB
comments (?)
stdin
copy 
1
10001 20000
stdout
copy 
Standard output is empty
https://ideone.com/qCfLda
language:
C (gcc 8.3)
created:
7 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!