Tczxw的专栏

#include using namespace std;const int maxn = 1E6 + 10;typedef unsigned long long ull;ull T, a, b, n, F[maxn] = {0, 1};int pow_mod(ull a, ull n, ull b){ ull ans = 1; while (n) { if (n & 1)

#include using namespace std;int n, r, kase;double inp[22], Pe[22];#define REP(i,n) for(int i=0;i<(n);i++)int main(int argc, char const *argv[]){ while (cin >> n >> r && n) { double Ptal = 0

#include using namespace std;int main(int argc, char const *argv[]){ double a, b, c; while (cin >> a >> b >> c) printf("%.5f\n", b * (a + b - 1) / (a + b) / (a + b - c - 1)); return 0;}

#include using namespace std;int main(int argc, char const *argv[]){ string str; while (cin >> str) { int a = 0, b = 0, len = str.size(); for (int i = 0; i < len; i++) if (str[i] == '0')

#include using namespace std;#define REP(i,n) for(int i=0;i<(n);i++)int T, n; string in[2][6];int main(int argc, char const *argv[]){ cin >> T; while (T-- && cin >> n) { string ans, inp[5];

#include using namespace std;int n, kase;int divide_all(int d){ int x = 1; while (n % d == 0) {n /= d; x *= d;} return x;}long long solve(){ if (n == 1) return 2; int m = floor(sqrt(n) + 0

#include using namespace std;int p, q, r, s;int main(int argc, char const *argv[]){ while (cin >> p >> q >> r >> s) { q = min(p - q, q); s = min(r - s, s); double sum = 1.0; for (int i = 1

#include using namespace std;const int maxn = 100 * 2 + 5;const int M = 10001;int T, x[maxn];void solve(){ for (int i = 0; i < M; i++) for (int j = 0; j < M; j++) { bool ok = 1; for (

#include using namespace std;const int maxn = 1E5 + 10;bool prim[maxn];vector > Fta;vectorprimes, ans;int n, m, kase, Irrelevant[maxn];void init(){ for (int i = 2; i <= maxn; i++) if (!prim

#include using namespace std;#include using namespace std;const int maxn = 3E7 + 10;int kase, T, n, cnt[maxn];void init(){ int m = maxn / 2; for (int i = 1; i <= m; i++) for (int j = i * 2;

#include using namespace std;const int maxn = 5E4 + 10;int f[maxn], phi[maxn] = {0, 1}, n;void init(){ for (int i = 2; i < maxn; i++) { if (phi[i]) continue; for (int j = i; j < maxn; j +=

#include #include using namespace std;int main(int argc, char const *argv[]){ unsigned long long n, m; while (cin >> n >> m) { if (!n && !m) break; if (n > m) swap(n, m); cout << n*m*(n +