随笔分类 - ccf_csp
摘要：实现 #include <iostream> #include <string> #include <cstring> using namespace std; string line; int line_index = 0; void handle_link() { ++line_index; c
阅读全文
摘要：实现 #include <iostream> #include <string> #include <vector> #include <map> #include <sstream> #include <algorithm> #include <cstdlib> using namespace s
阅读全文
摘要：实现 #include<stdio.h> #include<vector> using namespace std; struct state{ int life,power; state(int a=0,int b=0):life(a),power(b){} }; vector<state>p[2
阅读全文
摘要：实现 #include <cstdio> int game_graph[16][16]; int block[4][4]; int main() { for (int i = 0;i < 15;++i) { for (int j = 0;j < 10;++j) { scanf("%d",&game_
阅读全文
摘要：实现 #include <iostream> #include <string> #include <vector> #include <sstream> using namespace std; void handle_path(vector<string>& paths, string path
阅读全文
摘要：实现 #include <cstdio> int main() { long long num; scanf("%lld",&num); int sum = 0; while (num != 0) { sum += num % 10; num /= 10; } printf("%d",sum); }
阅读全文
摘要：实现 #include <cstdio> #define MAXN 32 int chess[MAXN][MAXN]; int marks[MAXN][MAXN]; int main() { int row, col; scanf("%d%d",&row,&col); for (int i = 0;
阅读全文
摘要：实现 #include <cstdio> #define MAXN 0x6f char map[MAXN][MAXN]; int row, col, ops_num; void paint_line(int x1, int y1, int x2, int y2) { char line; if (x
阅读全文
摘要：实现 #include <cstdio> #define MAXN 0x3ef int main() { int num; int nums[MAXN]; scanf("%d",&num); for (int i = 0;i < num;++i) { scanf("%d",&nums[i]); }
阅读全文
摘要：实现 #include <cstdio> bool is_leap_year_leap_month(int year,int month) { if (month == 2 && ((year % 400 == 0) || (year % 100 != 0 && year % 4 == 0))) {
阅读全文
摘要：实现 #include <iostream> #include <vector> #include <string> #include <map> using namespace std; vector<string> html_lines; map<string,string> vars_val;
阅读全文
摘要：实现 #include <cstdio> #define MAXN 0x3ef int origin_matrix[MAXN][MAXN]; int new_matrix[MAXN][MAXN]; int main() { int x_size, y_size; scanf("%d%d",&x_si
阅读全文
摘要：实现 #include <cstdio> #include <algorithm> #define MAXN 0x3ef class figure_cnt { public: int figure; int cnt; figure_cnt() {}; figure_cnt(int figure, i
阅读全文
摘要：蔡勒公式 \({\displaystyle w=\left( \left(y+\left[{\frac {y}{4}}\right]+\left[{\frac {c}{4}}\right]-2c+\left[{\frac {26(m+1)}{10}}\right]+d-1\right){\bmod
阅读全文
摘要：实现 #include <cstdio> #define MAXN 0x3ef int cnts[MAXN]; int main() { int num; scanf("%d",&num); for (int i = 0;i < num;++i) { int id; scanf("%d",&id);
阅读全文
摘要：实现 #include <cstdio> #define MAXN 0x1ff int directions[4][2] = { {0,1}, // right {1,-1}, // left and down {1,0}, // down {-1,1} // right and up }; int
阅读全文
摘要：实现 #include <cstdio> #include <cstring> #include <algorithm> #define MAX_ORDER_NUM 0x1400 using namespace std; struct order { int type; // 0: buy, 1:
阅读全文
摘要：实现 #include <cstdio> #include <algorithm> #define MAXN 0x3ef int nums[MAXN]; int main() { int num; scanf("%d",&num); for (int i = 0;i < num;++i) { sca
阅读全文
摘要：实现 #include <cstdio> #define MAX_SIZE 0x70 int map[MAX_SIZE][MAX_SIZE]; int main() { int num_triangle; scanf("%d",&num_triangle); for (int i = 0;i < n
阅读全文
摘要：实现 #include <cstdio> #include <cstring> #define MAX_STR_LEN 0xff char sub_str[MAX_STR_LEN]; char str[MAX_STR_LEN]; char str_cpy[MAX_STR_LEN]; int main
阅读全文
浙公网安备 33010602011771号