/** * @brief Codeforces Round #275 (Div. 2) a * @file a.cpp * @author 面码 * @created 2014/12/10 15:35 * @edited 2014/12/10 15:35 * @type brute * */#include #include #include #include #include #include using namespace std;#define max(a, b) ((a) > (b) ? (a) : (b))#define min(a, b) ((a) > (b) ? (b) : (a)) #define abs(a) ((a) > 0 ? (a) : (0 - (a)))#define CLR(vec) memset(vec, 0, sizeof(vec))#ifdef DEBUGifstream in;ofstream out;#define CIN in#define COUT out#else#define CIN cin#define COUT cout#endiftypedef long long int ll;ll l, r, mid, lft, rht;ll division;int search;int main(void){ ios_base::sync_with_stdio(0);#ifdef DEBUG CIN.open("./in", ios::in); COUT.open("./out", ios::out);#endif CIN >> l >> r; if(r - l mid; rht--){ search = 0; for(division = 2; division
查看更多关于CodeforcesRound#275(Div.2)a_html/css_WEB-ITnose的详细内容...
声明：本文来自网络，不代表【好得很程序员自学网】立场，转载请注明出处：http://www.haodehen.cn/did113382