A Blog

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <algorithm>using namespace std;#define maxn 705#define eps 10E-9struct Point{ int x, y;} point[maxn];struct Node{ double k; int a, b;} f[maxn * maxn];int 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 10struct Point{ int x, y;}q[maxn * maxn], stk[maxn * maxn];int map[maxn][maxn];int cost[maxn][maxn];int from[maxn][maxn];int dir[4][2] ={{ 1, 0 },{ 0, 1 },{ - 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;int main(){ //freopen("t.txt", "r", stdin); string st; while (getline(cin, st)) { int pos; while ((pos = st.find("you")) != string::npos) { s 阅读全文

摘要： 简单题 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;int main(){ //freopen("t.txt", "r", stdin); int a, b; while (scanf("%d%d", &a, &b)!= EOF) printf("%d\n", a % b); return 0;} 阅读全文