Skip to content

Commit bcbd03a

Browse files
author
Jie Feng
committed
haha
2 parents 625c9a2 + 6cde45e commit bcbd03a

File tree

13 files changed

+822
-6
lines changed

13 files changed

+822
-6
lines changed

‎.gitignore‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,4 @@
1+
try.cpp
12
codeforces/in
23
codejam/in
34
codejam/out

‎.gitignore.swp‎

-12 KB
Binary file not shown.

‎codejam/in‎

Lines changed: 345 additions & 0 deletions
Large diffs are not rendered by default.

‎codejam/makefile‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
target= R1B2014B
1+
target= manyPrices
22

33
all:
44
g++ -o $(target) -g $(target).cpp -std=c++11 -Wno-deprecated

‎codejam/manyPrices‎

37.6 KB
Binary file not shown.

‎codejam/manyPrices.cpp‎

Lines changed: 113 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,113 @@
1+
#include <cmath>
2+
#include <set>
3+
#include <list>
4+
#include <unordered_set>
5+
#include <hash_map>
6+
#include <climits>
7+
#include <queue>
8+
#include <vector>
9+
#include <map>
10+
#include <set>
11+
#include <cstdlib>
12+
#include <fstream>
13+
#include <iomanip>
14+
#include <iostream>
15+
#include <sstream> // istringstream buffer(myString);
16+
#include <stack>
17+
#include <algorithm>
18+
#include <cstring>
19+
#include <cassert>
20+
using namespace std;
21+
#define bit(x,i) (x&(1<<i))
22+
#define lowbit(x) ((x)&((x)^((x)-1)))
23+
//#define max(a,b) (a<b?b:a)
24+
//#define abs(x) (x<0?-x:x)
25+
#define IN(i,l,r) (l<i&&i<r)
26+
#define LINR(i,l,r) (l<=i&&i<=r)
27+
#define LIN(i,l,r) (l<=i&&i<r)
28+
#define INR(i,l,r) (l<i&&i<r)
29+
#define F(i,L,R) for (int i = L; i < R; i++)
30+
#define FE(i,L,R) for (int i = L; i <= R; i++)
31+
#define FF(i,L,R) for (int i = L; i > R; i--)
32+
#define FFE(i,L,R) for (int i = L; i >= R; i--)
33+
#define char2Int(c) (c-'0')
34+
#define lastEle(vec) vec[vec.size()-1]
35+
#define hBit(msb,n) asm("bsrl %1,%0" : "=r"(msb) : "r"(n))
36+
#define clr(a,x) memset(a,x,sizeof(a))
37+
#define getI(a) scanf("%d", &a)
38+
#define getII(a,b) scanf("%d%d", &a, &b)
39+
#define getIII(a,b,c) scanf("%d%d%d", &a, &b, &c)
40+
#define getS(x) scanf("%s", x);
41+
#define SZ(x) ((int)((x).size()))
42+
#define REMAX(a,b) (a)=max((a),(b));
43+
#define DBG(vari) cerr<<#vari<<" = "<<(vari)<<endl;
44+
#define REMIN(a,b) (a)=min((a),(b));
45+
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
46+
#define ALL(t) t.begin(),t.end()
47+
#define ll long long
48+
#define ull unsigned long long
49+
#define ui unsigned int
50+
#define us unsigned short
51+
#define IOS ios_base::sync_with_stdio(0);
52+
#define pb push_back
53+
#define INF 1001001001
54+
#define PI 3.1415926535897932384626
55+
#define mp make_pair
56+
#define ll long long
57+
#define fi first
58+
#define se second
59+
#define wez(n) int (n); scanf("%d",&(n));
60+
#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));
61+
#define wez3(n,m,k) int (n),(m),(k); scanf("%d %d %d",&(n),&(m),&(k));
62+
inline void pisz(int n) { printf("%d\n",n); }
63+
#define TESTS wez(testow)while(testow--)
64+
#define whileZ int T; getI(T); while(T--)
65+
#define printA(a,L,R) FE(i,L,R) cout << a[i] << (i==R?'\n':' ')
66+
#define printM(a,n,m) F(i,0,n){ F(j,0,m) cout << a[i][j] << ' '; cout << endl;}
67+
#define printV(a) printA(a,0,a.size()-1);
68+
#define printVV(a) F(i,0,a.size()) {F(j,0,a[i].size())cout << a[i][j] << ' '; cout << endl;}
69+
#define MAXN 10000
70+
#define sz(a) int((a).size())
71+
#define pb push_back
72+
#define all(c) (c).begin(),(c).end()
73+
#define tr(c,i) for(typeof((c).begin() i = (c).begin(); i != (c).end(); i++)
74+
#define present(c,x) ((c).find(x) != (c).end())
75+
#define cpresent(c,x) (find(all(c),x) != (c).end())
76+
typedef int elem_t;
77+
typedef vector<int> vi;
78+
typedef vector<vi> vvi;
79+
typedef pair<int,int> ii;
80+
template<typename T,typename TT> ostream& operator<<(ostream &s,pair<T,TT> t) {return s<<"("<<t.first<<","<<t.second<<")";}
81+
template<typename T> ostream& operator<<(ostream &s,vector<T> t){F(i,0,SZ(t))s<<t[i]<<" ";return s; }
82+
int gcd(int a,int b){return a?gcd(b%a,a):b;}
83+
ll gcd(ll a,ll b){return a?gcd(b%a,a):b;}
84+
ll powmod(ll a,ll p,ll m){ll r=1;while(p){if(p&1)r=r*a%m;p>>=1;a=a*a%m;}return r;}
85+
const int fx[4][2] = {{0,1}, {1,0}, {0,-1}, {-1,0}};
86+
int main ( int argc, char *argv[] ) {
87+
int T;
88+
getI(T);
89+
FE(cases,1,T){
90+
printf("Case #%d: ", cases);
91+
ll p, n;
92+
cin >> n >> p;
93+
ll nn = (ll) 1 << n;
94+
ll x = 0, y = 0, N = nn, rank = 1;
95+
//at most been beated x rounds
96+
if (nn == p){
97+
cout << p-1 << ' ' << p-1 << endl;
98+
continue;
99+
}
100+
while(rank + (N / 2) <= p){
101+
N /= 2;
102+
rank += N;
103+
x++;
104+
}
105+
rank = nn;
106+
while(rank > p){
107+
y++;
108+
rank >>= 1;
109+
}
110+
cout << (((ll)1<<(x+1))-2)<< ' ' << (nn-((ll)1<<y)) << endl;
111+
}
112+
return EXIT_SUCCESS;
113+
}

‎codejam/manyPrices.o‎

45.1 KB
Binary file not shown.

‎codejam/out‎

Lines changed: 223 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,223 @@
1+
<<<<<<< HEAD
2+
Case #1: 0 1125899906842620
3+
Case #2: 0 16711680
4+
Case #3: 126 16777214
5+
Case #4: 0 1125899906842112
6+
Case #5: 274877906943 274877906943
7+
Case #6: 0 16128
8+
Case #7: 131070 137438953470
9+
Case #8: 254 134217726
10+
Case #9: 16382 2097150
11+
Case #10: 0 33553920
12+
Case #11: 17592186044414 1125899906842622
13+
Case #12: 14 4194302
14+
Case #13: 131070 536870910
15+
Case #14: 2 17179869182
16+
Case #15: 0 0
17+
Case #16: 2 1125899906842622
18+
Case #17: 0 985162418487296
19+
Case #18: 0 8796093022206
20+
Case #19: 2097150 549755813886
21+
Case #20: 0 134217712
22+
Case #21: 0 68719476732
23+
Case #22: 30 131070
24+
Case #23: 0 1121501860331520
25+
Case #24: 14 14
26+
Case #25: 0 4092
27+
Case #26: 0 480
28+
Case #27: 0 33554176
29+
Case #28: 16382 65534
30+
Case #29: 8388606 8388606
31+
Case #30: 0 0
32+
Case #31: 1048574 8388606
33+
Case #32: 1099511627775 1099511627775
34+
Case #33: 2 1125899906842622
35+
Case #34: 0 0
36+
Case #35: 0 536608768
37+
Case #36: 1048574 562949953421310
38+
Case #37: 0 8053063680
39+
Case #38: 6 281474976710654
40+
Case #39: 4194302 17179869182
41+
Case #40: 254 1125899906842622
42+
Case #41: 2 562949953421310
43+
Case #42: 0 17592186044384
44+
Case #43: 0 0
45+
Case #44: 0 281474976710654
46+
Case #45: 134217726 4294967294
47+
Case #46: 134217726 2199023255550
48+
Case #47: 0 1098437885952
49+
Case #48: 0 2147483640
50+
Case #49: 6 8190
51+
Case #50: 0 520192
52+
Case #51: 0 507904
53+
Case #52: 2 4398046511102
54+
Case #53: 1 1
55+
Case #54: 0 1125899906840576
56+
Case #55: 0 274877906940
57+
Case #56: 1125899906842622 1125899906842622
58+
Case #57: 126 8190
59+
Case #58: 2 274877906942
60+
Case #59: 0 28
61+
Case #60: 65534 1125899906842622
62+
Case #61: 0 17179869182
63+
Case #62: 63 63
64+
Case #63: 0 1125899906842622
65+
Case #64: 254 1125899906842622
66+
Case #65: 68719476734 137438953470
67+
Case #66: 0 960
68+
Case #67: 510 32766
69+
Case #68: 281474976710654 562949953421310
70+
Case #69: 0 4092
71+
Case #70: 1125899906842623 1125899906842623
72+
Case #71: 0 68718428160
73+
Case #72: 2 2147483646
74+
Case #73: 0 534773760
75+
Case #74: 1022 8796093022206
76+
Case #75: 254 510
77+
Case #76: 16777214 16777214
78+
Case #77: 0 12288
79+
Case #78: 0 16777212
80+
Case #79: 0 1099511627774
81+
Case #80: 0 4
82+
Case #81: 33554431 33554431
83+
Case #82: 2 134217726
84+
Case #83: 0 0
85+
Case #84: 6 254
86+
Case #85: 262142 4294967294
87+
Case #86: 126 262142
88+
Case #87: 6 2046
89+
Case #88: 6 6
90+
Case #89: 30 65534
91+
Case #90: 6 126
92+
Case #91: 0 8796093022206
93+
Case #92: 0 0
94+
Case #93: 2046 33554430
95+
Case #94: 6 549755813886
96+
Case #95: 0 17590038560768
97+
Case #96: 0 6291456
98+
Case #97: 0 8796093022192
99+
Case #98: 549755813886 549755813886
100+
Case #99: 0 8064
101+
Case #100: 0 17591112302592
102+
=======
103+
Case #1: BAD
104+
Case #2: GOOD
105+
Case #3: GOOD
106+
Case #4: GOOD
107+
Case #5: GOOD
108+
Case #6: BAD
109+
Case #7: GOOD
110+
Case #8: BAD
111+
Case #9: GOOD
112+
Case #10: BAD
113+
Case #11: BAD
114+
Case #12: BAD
115+
Case #13: BAD
116+
Case #14: BAD
117+
Case #15: BAD
118+
Case #16: BAD
119+
Case #17: BAD
120+
Case #18: BAD
121+
Case #19: BAD
122+
Case #20: BAD
123+
Case #21: GOOD
124+
Case #22: BAD
125+
Case #23: GOOD
126+
Case #24: BAD
127+
Case #25: BAD
128+
Case #26: BAD
129+
Case #27: GOOD
130+
Case #28: BAD
131+
Case #29: BAD
132+
Case #30: GOOD
133+
Case #31: GOOD
134+
Case #32: BAD
135+
Case #33: GOOD
136+
Case #34: BAD
137+
Case #35: BAD
138+
Case #36: BAD
139+
Case #37: GOOD
140+
Case #38: GOOD
141+
Case #39: BAD
142+
Case #40: BAD
143+
Case #41: BAD
144+
Case #42: GOOD
145+
Case #43: BAD
146+
Case #44: GOOD
147+
Case #45: BAD
148+
Case #46: BAD
149+
Case #47: BAD
150+
Case #48: GOOD
151+
Case #49: GOOD
152+
Case #50: BAD
153+
Case #51: BAD
154+
Case #52: BAD
155+
Case #53: BAD
156+
Case #54: BAD
157+
Case #55: BAD
158+
Case #56: BAD
159+
Case #57: BAD
160+
Case #58: GOOD
161+
Case #59: BAD
162+
Case #60: BAD
163+
Case #61: GOOD
164+
Case #62: GOOD
165+
Case #63: GOOD
166+
Case #64: BAD
167+
Case #65: BAD
168+
Case #66: BAD
169+
Case #67: BAD
170+
Case #68: BAD
171+
Case #69: BAD
172+
Case #70: BAD
173+
Case #71: BAD
174+
Case #72: BAD
175+
Case #73: BAD
176+
Case #74: GOOD
177+
Case #75: BAD
178+
Case #76: BAD
179+
Case #77: BAD
180+
Case #78: BAD
181+
Case #79: BAD
182+
Case #80: BAD
183+
Case #81: BAD
184+
Case #82: GOOD
185+
Case #83: BAD
186+
Case #84: GOOD
187+
Case #85: BAD
188+
Case #86: GOOD
189+
Case #87: GOOD
190+
Case #88: GOOD
191+
Case #89: BAD
192+
Case #90: BAD
193+
Case #91: BAD
194+
Case #92: BAD
195+
Case #93: BAD
196+
Case #94: GOOD
197+
Case #95: GOOD
198+
Case #96: BAD
199+
Case #97: BAD
200+
Case #98: GOOD
201+
Case #99: BAD
202+
Case #100: BAD
203+
Case #101: BAD
204+
Case #102: BAD
205+
Case #103: BAD
206+
Case #104: BAD
207+
Case #105: BAD
208+
Case #106: BAD
209+
Case #107: BAD
210+
Case #108: GOOD
211+
Case #109: BAD
212+
Case #110: BAD
213+
Case #111: GOOD
214+
Case #112: BAD
215+
Case #113: BAD
216+
Case #114: BAD
217+
Case #115: BAD
218+
Case #116: BAD
219+
Case #117: BAD
220+
Case #118: BAD
221+
Case #119: BAD
222+
Case #120: BAD
223+
>>>>>>> 8ea67614540813d9826e3c029eb36e4cc7116fb2

‎codejam/ticketSwapping‎

131 KB
Binary file not shown.

0 commit comments

Comments
 (0)