1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 `#include #include using namespace std; //#define DEBUG //#define PRINTARR int n; struct Ball { int r; string v; bool inline operator<(const Ball& other) const { return r>(istream& is, Ball& b) { return is>>b.r>>b.v; } Ball b1, b2, b3; const long long BASE = 1000000007LL; const int MAX_N = 10002; long long inline mod(long long res) { return res%BASE; } long long inline normalize(long long n) { while(n>BASE) n = mod(n); while(n<0) n = mod(BASE+n); return n; } long long binominal[MAX_N][MAX_N]; void precalc() { binominal[0][0]=1; for(int i=1;i<=n;++i) { binominal[i][0] = 1; long long sum=2; for(int j=1;ji_b) break; } return mod(intersection); } long long intersect(const Ball& b1, const Ball& b2, const Ball& b3) { return 0LL; } long long solution2(Ball& b1, Ball& b2) { long long area1 = area(b1); long long area2 = area(b2); long long p12 = intersect(b1, b2); #if defined(DEBUG) cerr<>n >>b1>>b2>>b3; precalc(); if(b1==b2) cout<