We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
public static void main(String[] args) {
/* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
Scanner sc = new Scanner(System.in);
int n=sc.nextInt();
int m[] = new int[n];
int p[] = new int[n];
int result=0;
for(int i=0;i<n;i++)
{
m[i]=sc.nextInt();
p[i]=sc.nextInt();
}
for(int i=0;i<n;i++)
{
result=0;
for(int j=1;j<=m[i];j++)
{
int sum = 0;
for(int k=1;k<=j/2;k++)
{
if(j%k==0)
{
sum+=(k*k);
}
}
sum+=(j*j);
int sqr = (int)Math.sqrt(sum);
if((sum-(sqr*sqr)<=p[i]) || (((sqr+1)*(sqr+1))-sum)<=p[i] )
result+=j;
}
System.out.println(result);
}
}
}
terminated due to timeout
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #211: Divisor Square Sum
You are viewing a single comment's thread. Return to all comments →
import java.io.; import java.util.;
public class Solution {
}
terminated due to timeout