Skip to content

Commit 00db0d2

Browse files
myk502myk502
committed
Delete several unuseful files
1 parent 2a33077 commit 00db0d2

File tree

151 files changed

+2023
-63
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

151 files changed

+2023
-63
lines changed

‎2016_ccpcfinal/A.cpp

+21
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
#include<cstdio>
2+
#include<algorithm>
3+
#include<vector>
4+
using namespace std;
5+
const int maxn = 100000 + 10;
6+
int p[maxn], n;
7+
int cmp(int x, int y)
8+
{
9+
return x > y;
10+
}
11+
12+
int main(void)
13+
{
14+
int T;
15+
scanf("%d", &T);
16+
for(int ii = 1; ii <= T; ii++)
17+
{
18+
19+
}
20+
return 0;
21+
}

‎2016_ccpcfinal/J.cpp

+105
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,105 @@
1+
#include<map>
2+
#include<vector>
3+
#include<set>
4+
#include<iostream>
5+
#include<cmath>
6+
#include<cstring>
7+
using namespace std;
8+
int rnk[7], G;
9+
set<string> s;
10+
vector<string> a[7];
11+
vector<string> ec;
12+
string ss;
13+
vector<string> ANS;
14+
bool status[25];
15+
int main(void)
16+
{
17+
int cnt = 0;
18+
string temp;
19+
int T;
20+
scanf("%d", &T);
21+
for(int ii = 1; ii <= T; ii++)
22+
{
23+
memset(rnk, 0, sizeof(rnk));
24+
s.clear();
25+
ANS.clear();
26+
ec.clear();
27+
cnt = 0;
28+
for(int i = 1; i <= 5; i++)
29+
a[i].clear();
30+
scanf("%d", &G);
31+
cin>>ss;
32+
for(int i = 1; i <= 5; i++)
33+
{
34+
for(int j = 1; j <= 20; j++)
35+
{
36+
cin >> temp;
37+
a[i].push_back(temp);
38+
}
39+
}
40+
for(int j = 1; j <= 20; j++)
41+
{
42+
cin >> temp;
43+
ec.push_back(temp);
44+
}
45+
while(cnt <= 20)
46+
{
47+
for(int i = 1; i <= 5; i++)
48+
{
49+
int id = rnk[i];
50+
rnk[i]++;
51+
if(s.find(a[i][id]) != s.end())
52+
continue;
53+
ANS.push_back(a[i][id]);
54+
s.insert(a[i][id]);
55+
cnt++;
56+
if(cnt > 20)
57+
break;
58+
}
59+
}
60+
int idx = -1;
61+
for(int i = 0; i < 20; i++)
62+
{
63+
if(ANS[i] == ss)
64+
idx = i + 1;
65+
}
66+
memset(status, 0, sizeof(status));
67+
s.clear();
68+
for(int y = 0; y <= G; y++)
69+
{
70+
int x = G - y;
71+
if((idx != -1) && (idx <= x))
72+
{
73+
status[y] = true;
74+
continue;
75+
}
76+
for(int i = 0; i < x; i++)
77+
s.insert(ANS[i]);
78+
cnt = 0;
79+
for(int i = 0; (i < 20) && (cnt < y); i++)
80+
{
81+
if(s.find(ec[i]) != s.end())
82+
continue;
83+
cnt++;
84+
s.insert(ec[i]);
85+
if(ec[i] == ss)
86+
status[y] = true;
87+
}
88+
}
89+
bool flag = true;
90+
int ans = -1;
91+
for(int i = 0; i <= G; i++)
92+
if(!status[i])
93+
{
94+
flag = false;
95+
if(ans == -1)
96+
ans = i;
97+
}
98+
if(flag)
99+
printf("Case #%d: ADVANCED!\n", ii);
100+
else
101+
printf("Case #%d: %d\n", ii, ans);
102+
}
103+
104+
return 0;
105+
}

‎2016_ccpcfinal/a.out

197 KB
Binary file not shown.

‎2016_ccpcfinal/in

+20
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
1
2+
10 IJU
3+
UIV GEV LJTV UKV QLV TZTV AKOV TKUV
4+
GAV DVIL TDBV ILVTU AKV VTUD IJU IEV
5+
HVDBT YKUV ATUV TDOV
6+
TKUV UIV GEV AKV AKOV GAV DOV TZTV
7+
AVDD IEV LJTV CVQU HVDBT AKVU XIV TDVU
8+
OVEU OVBB KMV OFV
9+
QLV OCV TDVU COV EMVU TEV XIV
10+
VFTUD OVBB OFV DVHC ISCTU VTUD OVEU DTV
11+
HEVU TEOV TDV TDBV CKVU
12+
CVBB IJU QLV LDDLQ TZTV GEV GAV KMV
13+
OFV AVGF TXVTU VFTUD IEV OVEU OKV DVIL
14+
TEV XIV TDVU TKUV
15+
UIV DVIL VFTUD GEV ATUV AKV TZTV QLV
16+
TIV OVEU TKUV UKV IEV OKV CVQU COV
17+
OFOV CVBB TDVU IOV
18+
UIV TKUV CVBB AKV TZTV VFTUD UKV GEV
19+
QLV OVEU OVQU AKOV TDBV ATUV LDDLQ AKVU
20+
GAV SVD TDVU UPOHK

‎2016_final/E.cpp

+38
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,38 @@
1+
#include<cstdio>
2+
#include<iostream>
3+
#include<cstring>
4+
#include<cmath>
5+
#include<algorithm>
6+
using namespace std;
7+
const int maxn = 100 + 10;
8+
int n;
9+
double a[maxn],b[maxn],w[maxn];
10+
int main(void)
11+
{
12+
int T;
13+
int ANS;
14+
scanf("%d", &T);
15+
for(int ii = 1; ii <= T; ii++)
16+
{
17+
scanf("%d", &n);
18+
for(int i = 1; i <= n; i++)
19+
{
20+
scanf("%lf:%lf",&a[i],&b[i]);
21+
w[i] = a[i] / (a[i] + b[i]);
22+
}
23+
sort(w + 1, w + n + 1);
24+
int ans = 0;
25+
double sum = 0;
26+
while(1 - sum > 0.001 && ans < n)
27+
{
28+
ans++;
29+
sum += w[ans];
30+
}
31+
if(1 - sum > 0.001)
32+
ANS = ans;
33+
else
34+
ANS = ans - 1;
35+
printf("Case #%d: %d\n",ii, ANS);
36+
}
37+
return 0;
38+
}

‎2016_final/H.cpp

+43
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,43 @@
1+
#include<cstdio>
2+
#include<iostream>
3+
#include<cmath>
4+
#include<algorithm>
5+
#include<cstring>
6+
using namespace std;
7+
const long long Mod = 1e9 + 7;
8+
int n, m, k;
9+
long long cal_mod(long long x, long long n)
10+
{
11+
long long ans = 1;
12+
while(n)
13+
{
14+
if(n & 1LL)
15+
ans = (ans * x) % Mod;
16+
x = (x * x) % Mod;
17+
n >>= 1;
18+
}
19+
return ans;
20+
}
21+
int main(void)
22+
{
23+
int T;
24+
scanf("%d", &T);
25+
for(int ii = 1; ii <= T; ii++)
26+
{
27+
scanf("%d%d%d", &n, &m, &k);
28+
long long temp = cal_mod(k, (n - 1) * (m - 1));
29+
long long ans = 0;
30+
for(int i = 2; i <= k; i++)
31+
{
32+
long long tmp = cal_mod(i - 1, n + m - 2);
33+
tmp = (tmp * temp) % Mod;
34+
ans = (ans + tmp) % Mod;
35+
}
36+
ans *= n * m;
37+
ans %= Mod;
38+
ans += cal_mod(k, n * m);
39+
ans %= Mod;
40+
printf("Case #%d: %lld\n",ii,ans);
41+
}
42+
return 0;
43+
}

‎2016_final/L.cpp

+105
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,105 @@
1+
#include<cstdio>
2+
#include<iostream>
3+
#include<algorithm>
4+
#include<queue>
5+
#include<vector>
6+
#include<cmath>
7+
using namespace std;
8+
struct Point
9+
{
10+
int aa,bb,cc,dd;
11+
Point(int aa = 0, int bb = 0, int cc = 0, int dd = 0):aa(aa),bb(bb),cc(cc),dd(dd)
12+
{
13+
14+
}
15+
bool operator == (const Point &X)const
16+
{
17+
return (aa == X.aa) && (bb == X.bb) && (cc == X.cc) && (dd == X.dd);
18+
}
19+
Point operator +(const Point& X)const
20+
{
21+
return Point((aa + X.aa), (bb + X.bb), (cc + X.cc), (dd + X.dd));
22+
}
23+
};
24+
queue<Point> q;
25+
vector<Point> v1, v2;
26+
void init(void)
27+
{
28+
Point a_win = Point(3,0,0,0);
29+
Point b_win = Point(0,3,0,0);
30+
Point c_win = Point(0,0,3,0);
31+
Point d_win = Point(0,0,0,3);
32+
v1.clear();
33+
v2.clear();
34+
//a vs b
35+
v2.push_back(a_win);
36+
v2.push_back(b_win);
37+
v2.push_back(Point(1,1,0,0));
38+
//a vs c
39+
for(auto it:v2)
40+
{
41+
v1.push_back(it + a_win);
42+
v1.push_back(it + c_win);
43+
v1.push_back(it + Point(1,0,1,0));
44+
}
45+
//a vs d
46+
v2.clear();
47+
for(auto it:v1)
48+
{
49+
v2.push_back(it + a_win);
50+
v2.push_back(it + d_win);
51+
v2.push_back(it + Point(1,0,0,1));
52+
}
53+
//b vs c
54+
v1.clear();
55+
for(auto it:v2)
56+
{
57+
v1.push_back(it + b_win);
58+
v1.push_back(it + c_win);
59+
v1.push_back(it + Point(0,1,1,0));
60+
}
61+
//b vs d
62+
v2.clear();
63+
for(auto it:v1)
64+
{
65+
v2.push_back(it + b_win);
66+
v2.push_back(it + d_win);
67+
v2.push_back(it + Point(0,1,0,1));
68+
}
69+
//c vs d
70+
v1.clear();
71+
for(auto it:v2)
72+
{
73+
v1.push_back(it + c_win);
74+
v1.push_back(it + d_win);
75+
v1.push_back(it + Point(0,0,1,1));
76+
}
77+
78+
}
79+
80+
int main(void)
81+
{
82+
int T, a, b, c, d;
83+
init();
84+
scanf("%d",&T);
85+
int cnt = 0;
86+
for(int ii = 1; ii <= T; ii++)
87+
{
88+
cnt = 0;
89+
scanf("%d%d%d%d", &a, &b, &c, &d);
90+
printf("Case #%d: ",ii);
91+
for(auto it:v1)
92+
{
93+
if(it == Point(a,b,c,d))
94+
cnt++;
95+
}
96+
if(cnt == 1)
97+
printf("Yes\n");
98+
else if(cnt == 0)
99+
printf("Wrong Scoreboard\n");
100+
else
101+
printf("No\n");
102+
}
103+
104+
return 0;
105+
}

‎2016_final/a.out

52.3 KB
Binary file not shown.

‎2016_final/in

+5
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
1
2+
3
3+
1:1.1
4+
1:0.2
5+
1.5:1.7

0 commit comments

Comments
 (0)