4

I need some help

 3 years ago
source link: http://codeforces.com/blog/entry/96739
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
neoserver,ios ssh client

By adsijf, history, 11 hours ago,

UVa 12775

I don't know how to solve this problem with constraints A,B,C <= 31; P <= 10^9; T<=1000 and of course C/gcd(A,B,C) >= 200 doesn't true anymore. I need help with this new problem.

The idea that I've used on the original problem can't be used here (that is I iterate over z from 0 to D/C, because the constraint C/gcd(A,B,C) >= 200 shows that C >= 200 and can be deduced that D/C <= D/200 which fits the time limit and sum up the number of solutions to diophantine equation on each iteration).


Recommend

About Joyk


Aggregate valuable and interesting links.
Joyk means Joy of geeK