Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

额滴神哪~这么做：

Posted by Juliet at 2008-01-04 16:59:02 on Problem 3456

1. flag[i]=flag[i-a]||flag[i-b]||flag[i-c]||flag[i-d]; //flag[i]=true表示可以用不定方程表示，flag[0]=true;
2. 1..1000000中最大的flag[i]=false的i有可能成为N（这取决于1000001+1010000中还有没有flag[i]=false;有的话显然N=-1；）
3. 这个问题貌似可扩充~

Followed by:

Post your reply here:

Home Page Go Back To top