hi can u help me withe the problem
uva 13083 - Yet another GCDSUM
my idea was simple first i prime factor the num then use backtrack to generate the divisor , then i use a n^2 loop to sum up the gcd
but for the n^2 loop i got TLE
what can i do . thanks in advance.
All about problems in Volume 130. If there is a thread about your problem, please use it. If not, create one with its number in the subject.
1 post • Page 1 of 1