CodeChef is a non-commercial competitive programming community
Login
Username (New User? Signup) Password (Forgot Password?)
Signup
Login or
Signup with
Connect
Note
  • Publicize your achievements on your Facebook Wall.
  • Challenge your friends or ask them for help.

Site Navigation

  • PRACTICE
    • Easy
    • Medium
    • Hard
    • Challenge
    • Peer
  • COMPETE
    • All Contests
    • June Long 2012
    • May Cook-Off
    • May Long 2012
  • DISCUSS
    • Forums
    • Blog
    • Wiki
    • Facebook
    • Twitter
  • COMMUNITY
    • CodeChef Meetups
    • Campus Chapters
    • Host your Contest
    • User Groups
    • CodeChef TechTalks
    • All Educational Initiatives
  • HELP
    • Frequently Asked Questions
    • FAQ for problem setters
    • Problem Setting
    • Tutorials
    • Long Contest Ranks
    • Short Contest Ranks
    • Event Calendar
  • ABOUT
    • About CodeChef
    • Team CodeChef
    • Press Room
    • CodeChef Financials
    • CodeChef Sponsorships
    • CEO's Corner
    • Contact Us
    • About Directi
Home » Compete » December 2011 Long Contest » Short II

Short II

Problem code: SHORT2

  • All Submissions

All submissions for this problem are available.

Given a prime number p, find the number of pairs of integers (a, b) such that p < a, p < b and ab is divisible by (a-p)(b-p).

Input

The first line contains the number of test cases t (1 ? t ? 5). Then t test cases follow, each test case consists of a line containing one prime integer p (1 < p < 1012).

Output

For each test case output one line containing the required number. It's guaranteed that this number won't exceed 263-1.

Example

Input:
3
2
23
59

Output:
14
80
116

Explanation:

In the first test case the sought pairs are (3,3), (3,4), (3,5), (3,8), (4,3), (4,4), (4,6), (5,3), (5,12), (6,4), (6,8), (8,3), (8,6) and (12,5).


Author: gennady.korotkevich
Date Added: 30-09-2011
Time Limit: 3 sec
Source Limit: 50000 Bytes
Languages: ADA, ASM, BASH, BF, C, C99 strict, CAML, CLOJ, CLPS, CPP 4.0.0-8, CPP 4.3.2, CS2, D, ERL, F#, FORT, GO, HASK, ICK, ICON, JAR, JAVA, JS, LISP clisp, LISP sbcl, LUA, NEM, NICE, PAS fpc, PAS gpc, PERL, PERL6, PHP, PIKE, PRLG, PYTH, PYTH 3.1.2, RUBY, SCALA, SCM guile, SCM qobi, ST, TCL, TEXT, WSPC


  • Submit

Comments

  • Login or Register to post a comment.

How is a=3, b=4 satisfying

rohitkgp @ 1 Dec 2011 07:44 PM
How is a=3, b=4 satisfying the condition that (ab)=(12) is divisible by (a-p/b-p)=(1/2) for (p=2) ??

hey rohit , its not

tsndiffopera @ 1 Dec 2011 09:28 PM
hey rohit , its not (a-p)/(b-p) , its (a-p)(b-p) ...

ohh..thanks!

rohitkgp @ 1 Dec 2011 10:32 PM
ohh..thanks!

What's the constraint for a,b

adu101992 @ 1 Dec 2011 11:58 PM
What's the constraint for a,b Is it also 10^12???????

@adu101992: As there's no

gennady_adm @ 2 Dec 2011 01:22 AM
@adu101992: As there's no such constraint in the problem statement, you have to figure it out by yourself.

k thanks :)

adu101992 @ 2 Dec 2011 10:26 AM
k thanks :)

How cum anything divided by

chandu_333 @ 3 Dec 2011 11:56 PM
How cum anything divided by zero is infinity..for pair (3,4) n for first case ab=12...ab/(a-p)(b-p)....12/(3-3)(4-3)=12/(0)(1)....how?

@chandu_333 The prime number

phantom11 @ 4 Dec 2011 01:50 AM
@chandu_333 The prime number is 2 not 3

@phantom11 thank u

chandu_333 @ 5 Dec 2011 06:39 PM
@phantom11 thank u

Does JS mean Javascript ?

raghavan999 @ 10 Dec 2011 07:57 AM
Does JS mean Javascript ?

Are negative integers

moawalling @ 11 Dec 2011 02:12 PM
Are negative integers permissible for 'a' or 'b'? if p=2 and a= -4, b= 6; then ab= -24 and (a-p)= -6, (b-p)= 4. This gives (a-p)(b-p)= -24 which can also divide ab=24.

SUCCESSFUL SUBMISSIONS FOR THIS PROBLEM:

Programming Competition Fetching successful submissions
Directi Go for Gold
CodeChef is a global programming communityCodeChef hosts online programming competitions
CodeChef is a non-commercial competitive programming community
  • About CodeChef
  • About Directi
  • CEO's Corner
  • C-Programming
  • Programming Languages
  • Contact Us
© 2009 Directi Group. All Rights Reserved. CodeChef uses SPOJ © by Sphere Research Labs
In order to report copyright violations of any kind, send in an email to copyright@codechef.com
CodeChef a product of Directi
The time now is:
CodeChef - A Platform for Aspiring Programmers

CodeChef was created as a platform to help programmers make it big in the world of algorithms, computer programming and programming contests. At CodeChef we work hard to revive the geek in you by hosting a programming contest at the start of the month and another smaller programming challenge in the middle of the month. We also aim to have training sessions and discussions related to algorithms, binary search, technicalities like array size and the likes. Apart from providing a platform for programming competitions, CodeChef also has various algorithm tutorials and forum discussions to help those who are new to the world of computer programming.

Practice Section - A Place to hone your 'Computer Programming Skills'

Try your hand at one of our many practice problems and submit your solution in a language of your choice. Our programming contest judge accepts solutions in over 35+ programming languages. Preparing for coding contests were never this much fun! Receive points, and move up through the CodeChef ranks. Use our practice section to better prepare yourself for the multiple programming challenges that take place through-out the month on CodeChef.

Compete - Monthly Programming Contests and Cook-offs

Here is where you can show off your computer programming skills. Take part in our 10 day long monthly coding contest and the shorter format Cook-off coding contest. Put yourself up for recognition and win great prizes. Our programming contests have prizes worth up to Rs.20,000 and $700lots more CodeChef goodies up for grabs.

Discuss

Are you new to computer programming? Do you need help with algorithms? Then be a part of CodeChef's Forums and interact with all our programmers - they love helping out other programmers and sharing their ideas. Have discussions around binary search, array size, branch-and-bound, Dijkstra's algorithm, Encryption algorithm and more by visiting the CodeChef Forums and Wiki section.

CodeChef Community

As part of our Educational initiative, we give institutes the opportunity to associate with CodeChef in the form of Campus Chapters. Hosting online programming competitions is not the only feature on CodeChef. You can also host a coding contest for your institute on CodeChef, organize an algorithm event and be a guest author on our blog.

Go For Gold

The Go for Gold Initiative was launched about a year after CodeChef was incepted, to help prepare Indian students for the ACM ICPC World Finals competition. In the run up to the ACM ICPC competition, the Go for Gold initiative uses CodeChef as a platform to train students for the ACM ICPC competition via multiple warm up contests. As an added incentive the Go for Gold initiative is also offering over Rs.8 lacs to the Indian team that beats the 29th position at the ACM ICPC world finals. Find out more about the Go for Gold and the ACM ICPC competition here.

Domain Name Registration, Web hosting, and Website Design provided by BigRock.com