SPOJ.com - Problem IITKWPCB

IITKWPCB - Check the coprimeness

#ad-hoc-1

Find largest non-negative number less than or equal to floor (N/2) which is coprime to N.

Two number a and b are considered to coprime if gcd(a, b) = 1.

T : number of test cases (T ≤ 1000).

For next T lines, every line contains n (1 ≤ n ≤ 10¹²).

For each test case, output the answer as described in the problem statement.

Input:
4
3
4
5
100 

Output:
1
1
2
49

< Previous 1 2 3 4 Next >

	azizul hakim: 2015-10-28 07:09:31 solved it using loop and gcd. but how to solve it using just if else, no loop? many people seems to solve like that. :/
	Abishek: 2015-09-23 18:10:39 easy problem! my 50th :) !
	Prakhar Dev Gupta: 2015-09-23 11:25:42 No use of GCD calculation . Simple if else problem
	Liquid_Science: 2015-09-15 18:38:59 gives wrong answer instead of a tle -_-
	sheshan: 2015-08-25 23:43:07 easy... just used if...else.......no loop
	Narendra pal: 2015-08-25 06:26:35 simple and easy... AC in 1 go ;) used O(n) ....
	Shivam Singh: 2015-08-20 23:01:43 Brute Force Algo O(N/2N/2) gives TLE Finding GCD using Euclid's Algo works in time O(N/2log(N/2))
	prakash_reddy: 2015-08-19 21:47:06 Accepted in 1 go... :) my 50th one....
	tjain1999: 2015-08-19 16:45:18 NZEC for java
	Ravi Chandra: 2015-08-13 08:02:10 Same Like ENIGMATH problem..