A Blog

摘要： 简单题View Code #include <iostream>#include <cstdlib>#include <cstdio>#include <cstring>using namespace std;int main(){ //freopen("t.txt", "r", stdin); int t; scanf("%d", &t); while (t--) { int x, y; scanf("%d%d", &x, &y); if ( 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxl 60int n;char st[maxl];bool have_bed[maxl];bool occured[maxl];int hash(char ch){ return ch - 'A';}int work(){ int len = strlen(st); int ans = 0; for (i 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 40int n;int f[maxn];int sum;void input(){ for (int i = 0; i < n; i++) scanf("%d", &f[i]);}void work(){ sum = 0; for (int i = 0; i < n; i++ 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define pi 3.14159bool reachable(int x, int y, int z, int &ans){ if (360 - z < z) z = 360 - z; if (z == 0) { ans = y; return true; } double dist = 2 * pi * x *... 阅读全文

摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxl 300char decipher(char a){ if (!isupper(a)) return a; return (a - 'A' + (26 - 5)) % 26 + 'A';}int main(){ //freopen("t.txt", "r& 阅读全文