Codeforces Round #283 (Div. 2) a_html/css_WEB-ITnose
程序员文章站
2022-03-16 21:25:18
...
/** * @brief Codeforces Round #283 (Div. 2) a * @file a.cpp * @author mianma * @created 2014/12/18 17:45 * @edited 2014/12/18 17:45 * @type brute * @note */#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#endif#define MAXN 105#define INF 1000100int n;int table[MAXN];int ans = INF;int main(void){ ios_base::sync_with_stdio(0);#ifdef DEBUG CIN.open("./in", ios::in); COUT.open("./out", ios::out);#endif CIN >> n; for(int i = 0; i > table[i]; } for(int i = 1; i
上一篇: SQL命令有哪几种类型
下一篇: HTML中使背景图片自适应浏览器大小
推荐阅读
-
Codeforces Round #251 (Div. 2)-C,D_html/css_WEB-ITnose
-
Codeforces Round #252 (Div. 2)-C,D_html/css_WEB-ITnose
-
Codeforces Round #277.5 (Div. 2)-D_html/css_WEB-ITnose
-
Codeforces Round #225 (Div. 1) C 树状数组 || 线段树_html/css_WEB-ITnose
-
Codeforces Round #275 (Div. 1)D(树形DP)_html/css_WEB-ITnose
-
Codeforces Round #264 (Div. 2)
-
Codeforces Round #281 (Div. 2)_html/css_WEB-ITnose
-
Codeforces Round #259 (Div. 2) A B C 三连发_html/css_WEB-ITnose
-
Codeforces Round #281 (Div. 2) (A、B、C、D题)_html/css_WEB-ITnose
-
Codeforces Round #222 (Div. 2)