A Blog

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>using namespace std;#define maxn 105int f[maxn][maxn];int num[maxn];bool vis[maxn];int p, t;bool same(int a, int b){ if (num[a] != num[b]) return false; for (int i = 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 40int x, y;bool map[maxn][maxn];char st[maxn * maxn * 2];void input(){ scanf("%d%d", &x, &y); scanf("%s", st); int n = strlen(st); 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <queue>using namespace std;#define maxn 1000005#define maxm 10004struct Node1{ int a; Node1(int aa) : a(aa) { }};struct Node2{ int a; Node2(int aa) : a(aa) { }};int m, n, p;int 阅读全文

摘要： 简单题java输出可以使用System.out.format();这个的使用方法与printf();相同。View Code import java.io.*;import java.util.*;import java.math.*;public class Main { public static void main(String[] args) { Scanner cin = new Scanner(new BufferedInputStream(System.in)); int a; while (cin.hasNext()) { a = cin.nextInt(); if (a == 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 100int n, r;int f[maxn], g[maxn];void work(int p, int c){ for (int i = 0; i < c; i++) g[i] = f[p + i]; for (int i = p - 1; i > 0; i--) f[i + c] = f[i]; 阅读全文