摘要: 斐波那契数列<10^9的数很少很少...所以直接暴力枚举就行了...-------------------------------------------------------------#include#include#include#include#define rep( i , n ) fo... 阅读全文
posted @ 2015-06-24 21:33 JSZX11556 阅读(269) 评论(0) 推荐(0) 编辑
摘要: LCT...略麻烦...--------------------------------------------------------------------------------#include#include#include#include#define rep( i , n ) for( ... 阅读全文
posted @ 2015-06-24 21:07 JSZX11556 阅读(239) 评论(0) 推荐(0) 编辑
摘要: LCT..------------------------------------------------------------------------#include#include#include#include#define rep( i , n ) for( int i = 0 ; i ... 阅读全文
posted @ 2015-06-24 17:32 JSZX11556 阅读(217) 评论(0) 推荐(0) 编辑