摘要:
Gcd QueriesProblem code: GCDQSubmitAll SubmissionsAll submissions for this problem are available.Read problems statements in Mandarin Chinese and Rus... 阅读全文
posted @ 2015-02-21 13:10
hl_mark
阅读(367)
评论(0)
推荐(0)
摘要:
GCD2Problem code: GCD2SubmitAll SubmissionsAll submissions for this problem are available.Frank explained its friend Felman the algorithm of Euclides ... 阅读全文
posted @ 2015-02-21 13:04
hl_mark
阅读(189)
评论(0)
推荐(0)
摘要:
Sereja and LCMProblem code: SEALCMSubmitAll SubmissionsAll submissions for this problem are available.Read problems statements in Mandarin Chinese an... 阅读全文
posted @ 2015-02-21 12:57
hl_mark
阅读(415)
评论(0)
推荐(0)
摘要:
Sereja and GCDProblem code: SEAGCDSubmitAll SubmissionsAll submissions for this problem are available.Read problems statements in Mandarin Chinese an... 阅读全文
posted @ 2015-02-21 00:45
hl_mark
阅读(349)
评论(0)
推荐(0)
摘要:
Given an array A1,A2...AN, you have to print the size of the largest contiguous subarray such that LCM of all integers in that subarray is equal to th... 阅读全文
posted @ 2015-02-21 00:03
hl_mark
阅读(336)
评论(0)
推荐(0)

浙公网安备 33010602011771号