forked from PKUanonym/REKCARC-TSC-UHT
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
unknown
committed
Apr 5, 2019
1 parent
4f85ecc
commit b49f0a2
Showing
4,674 changed files
with
6,299,468 additions
and
0 deletions.
The diff you're trying to view is too large. We only load the first 3000 changed files.
There are no files selected for viewing
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,3 @@ | ||
# Tips | ||
|
||
在大礼堂享受午觉的课。3000字论文国庆节赶紧写掉,1000字的三篇尽量在前4周全部写完,不然后面会有一些奇怪的事情导致锅应接不暇。 |
Binary file not shown.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,3 @@ | ||
# Tips | ||
|
||
课听不听无所谓,认真做作业刷题刷往年考卷,就能4.0(反正贵系不学) |
Binary file not shown.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Binary file not shown.
Binary file not shown.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,3 @@ | ||
# Tips | ||
|
||
看《微积分之倚天宝剑》(美 C.亚当斯等),课可以不上,但书一定要看。看完稍微看看课本,就能够比那些去刷辅导书比如《微积分学教程》(菲赫金哥尔茨)的学霸还要牛逼,轻松吊打。 |
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Oops, something went wrong.
Oops, something went wrong.
Oops, something went wrong.
Oops, something went wrong.
Oops, something went wrong.
Oops, something went wrong.
Oops, something went wrong.
Oops, something went wrong.
Oops, something went wrong.
Oops, something went wrong.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,45 @@ | ||
// | ||
// main.cpp | ||
// 2013期中考试题1 | ||
// | ||
// Created by 刘家硕 on 16/10/24. | ||
// Copyright © 2016年 刘家硕. All rights reserved. | ||
// | ||
|
||
#include <iostream> | ||
using namespace std; | ||
const int maxn=51; | ||
char a[maxn][maxn]; | ||
|
||
|
||
void solve(int,int); | ||
|
||
int main() | ||
{ | ||
int n=0; | ||
cin >> n; | ||
for (int i=1;i<=n;i++) | ||
for (int j=1;j<=n;j++) a[i][j] = ' '; | ||
solve(1,n); | ||
for (int i=1;i<=n;i++) | ||
{ | ||
for (int j=1;j<=n;j++) cout << a[i][j]; | ||
cout <<endl; | ||
|
||
} | ||
|
||
return 0; | ||
} | ||
|
||
|
||
|
||
|
||
void solve(int be,int length) | ||
{ | ||
if ((length==0)||(length<0)) return; | ||
for (int i=be;i<=be+length-1;i++) a[be][i] = '*'; | ||
for (int i=be;i<=be+length-1;i++) a[i][be] = '*'; | ||
for (int i=be;i<=be+length-1;i++) a[be+length-1][i] = '*'; | ||
for (int i=be;i<=be+length-1;i++) a[i][be+length-1] = '*'; | ||
solve(be+2,length-4); | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,51 @@ | ||
// | ||
// main.cpp | ||
// 2013期中考试题2 | ||
// | ||
// Created by 刘家硕 on 16/10/24. | ||
// Copyright © 2016年 刘家硕. All rights reserved. | ||
// | ||
|
||
#include <iostream> | ||
|
||
using namespace std; | ||
|
||
int main() | ||
{ | ||
int sum=0,truth=0; | ||
char X; | ||
cin >> sum >> X >> truth; | ||
int a,b,c,d,e,x; | ||
int k=0; | ||
for (a=0;a<2;a++) | ||
for (b=0;b<2;b++) | ||
for (c=0;c<2;c++) | ||
for (d=0;d<2;d++) | ||
for (e=0;e<2;e++) | ||
{ | ||
if (X=='A') x = a; | ||
if (X=='B') x = b; | ||
if (X=='C') x = c; | ||
if (X=='D') x = d; | ||
if (X=='E') x = e; | ||
int ans1 = (a&&(!x))||(!a&&x); | ||
int ans2 = (c||e); | ||
int ans3 = (c||d||a); | ||
int ans4 = (!b&&!c); | ||
int ans5 = (!e); | ||
if ((ans1+ans2+ans3+ans4+ans5==truth)&&(a+b+c+d+e==sum)) | ||
{ | ||
k = k+1; | ||
if (a>0) cout << 'A'; | ||
if (b>0) cout << 'B'; | ||
if (c>0) cout << 'C'; | ||
if (d>0) cout << 'D'; | ||
if (e>0) cout << 'E'; | ||
cout <<endl; | ||
|
||
} | ||
|
||
} | ||
if (k==0) cout << '0'; | ||
return 0; | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,60 @@ | ||
// | ||
// main.cpp | ||
// 2013期中考试题3 | ||
// | ||
// Created by 刘家硕 on 16/10/24. | ||
// Copyright © 2016年 刘家硕. All rights reserved. | ||
// | ||
|
||
#include <iostream> | ||
using namespace std; | ||
|
||
|
||
|
||
int main() | ||
{ | ||
char a[100]; | ||
int b[9]; //标准的IP地址数 | ||
char c[100]; //需要比较的序列 | ||
int d[9]; | ||
cin >> a; | ||
|
||
int temp = 0; | ||
int k=1; | ||
for (int i=0;i<=10;i++) b[i]=0; | ||
|
||
while(a[temp] != '\0') | ||
{ | ||
if ((a[temp] == '-')||(a[temp] == '.')) k = k+1; | ||
else if (a[temp]=='*') {b[k]=-1;k = k+1;b[k] = 1000000;} | ||
else b[k] = b[k]*10+a[temp]-48; | ||
temp = temp +1; | ||
} | ||
//for (int i=1;i<=k;i++) cout << b[i] <<endl; | ||
int m=0; | ||
|
||
cin >> m; | ||
|
||
for (int h=1;h<=m;h++) | ||
{ | ||
cin >> c; | ||
temp = 0; | ||
k = 1; | ||
for (int i=0;i<=10;i++) d[i]=0; | ||
while(c[temp] != '\0') | ||
{ | ||
if ((c[temp] == '-')||(c[temp] == '.')) k = k+1; | ||
//else if (c[temp]=='*') {d[k]=-1;k = k+1;d[k] = 1000000;} | ||
else d[k] = d[k]*10+c[temp]-48; | ||
temp = temp +1; | ||
} | ||
if ((d[1]<b[1])||(d[1]>b[2])||(d[2]<b[3])||(d[2]>b[4])||(d[3]<b[5])||(d[3]>b[6])||(d[4]<b[7])||(d[4]>b[8])) cout << "Failed"<<endl; | ||
else cout << "Accepted"; | ||
|
||
|
||
}//for_end | ||
|
||
|
||
|
||
return 0; | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,51 @@ | ||
// | ||
// main.cpp | ||
// 2013期中考试题4-最近平方根 | ||
// | ||
// Created by 刘家硕 on 16/10/24. | ||
// Copyright © 2016年 刘家硕. All rights reserved. | ||
// | ||
|
||
#include <iostream> | ||
#include <cmath> | ||
using namespace std; | ||
|
||
const int maxn=5001; | ||
int a[maxn]={0}; | ||
|
||
int main() | ||
{ | ||
int n=0,temp; | ||
int m=0,num,judge; | ||
cin >> n; | ||
for (int i=1;i<=n;i++) cin >> a[i]; | ||
for (int i=1;i<n;i++) | ||
for (int j=1;j<=n-i;j++) | ||
{ | ||
if (a[i]>a[i+1]) { | ||
temp = a[i]; | ||
a[i] = a[i+1]; | ||
a[i+1] = temp; | ||
} | ||
} | ||
cin >> m; | ||
for (int i=1;i<=m;i++) | ||
{ | ||
cin >> num >> judge; | ||
num = sqrt(num); | ||
int k=0; | ||
if (judge==0) | ||
{ | ||
for (int j=n;j>=1;j--) if (a[j]<=num) { cout << a[j] << endl;k++;break;}; | ||
if (k==0) cout << "-1"<< endl; | ||
} | ||
else | ||
{ | ||
for (int j=1;j<=n;j++) if (a[j]>num) { cout << a[j] << endl;k++;break;}; | ||
if (k==0) cout << "-1" << endl; | ||
} | ||
} | ||
|
||
|
||
return 0; | ||
} |
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,29 @@ | ||
// | ||
// main.cpp | ||
// diyiti | ||
// | ||
// Created by 刘家硕 on 16/10/25. | ||
// Copyright © 2016年 刘家硕. All rights reserved. | ||
// | ||
|
||
#include <iostream> | ||
using namespace std; | ||
|
||
int main() | ||
{ | ||
char a[16][16]; | ||
int n=0; | ||
cin >> n; | ||
int i,j; | ||
for (i=1;i<=n;i++) | ||
for (j=1;j<=i;j++) | ||
a[i][j] = '*'; | ||
for (i=1;i<=n;i++) | ||
{ | ||
for (j=1;j<=n-i;j++) cout << ' '; | ||
for (j=1;j<=i;j++) cout << a[i][j] <<' '; | ||
cout << endl; | ||
} | ||
|
||
return 0; | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,46 @@ | ||
// | ||
// main.cpp | ||
// 第三题 | ||
// | ||
// Created by 刘家硕 on 16/10/25. | ||
// Copyright © 2016年 刘家硕. All rights reserved. | ||
// | ||
|
||
#include <iostream> | ||
using namespace std; | ||
|
||
int main() | ||
{ | ||
int sum; | ||
int h[4][3]; | ||
cin >> sum; //说假话的人数 | ||
int i,j; | ||
for (i=1;i<4;i++) | ||
for (j=1;j<3;j++) cin >>h[i][j]; | ||
int a,b,c; | ||
int s1,s2,s3; | ||
for (a=0;a<2;a++) | ||
for (b=0;b<2;b++) | ||
for (c=0;c<2;c++) | ||
{ | ||
|
||
if ((h[1][1]==1)&&(h[1][2]==a)) s1 = 1; | ||
else if ((h[2][1]==1)&&(h[2][2]==a)) s1 = 1; | ||
else if ((h[3][1]==1)&&(h[3][2]==a)) s1 = 1; else s1=0; | ||
|
||
if ((h[1][1]==2)&&(h[1][2]==b)) s2 = 1; | ||
else if ((h[2][1]==2)&&(h[2][2]==b)) s2 = 1; | ||
else if ((h[3][1]==2)&&(h[3][2]==b)) s2 = 1;else s2=0; | ||
|
||
if ((h[1][1]==3)&&(h[1][2]==c)) s3 = 1; | ||
else if ((h[2][1]==3)&&(h[2][2]==c)) s3 = 1; | ||
else if ((h[3][1]==3)&&(h[3][2]==c)) s3 = 1;else s3=0; | ||
if (s1+s2+s3==3-sum){ | ||
if (a==1) cout <<'1'; | ||
else if (b==1) cout <<'2'; | ||
else if (c==1) cout <<'3'; | ||
return 0; | ||
} | ||
} | ||
return 0; | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,24 @@ | ||
// | ||
// main.cpp | ||
// 第二题 | ||
// | ||
// Created by 刘家硕 on 16/10/25. | ||
// Copyright © 2016年 刘家硕. All rights reserved. | ||
// | ||
|
||
#include <iostream> | ||
using namespace std; | ||
|
||
int main() | ||
{ | ||
int a,b,c,d; | ||
for (a=1;a<10;a++) | ||
for (b=0;b<10;b++) | ||
for (c=0;c<10;c++) | ||
for (d=1;d<10;d++) | ||
if (3999*a+390*b==996*d+60*c) cout << a<<b<<c<<d; | ||
|
||
|
||
|
||
return 0; | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,26 @@ | ||
// | ||
// main.cpp | ||
// 第四题 | ||
// | ||
// Created by 刘家硕 on 16/10/25. | ||
// Copyright © 2016年 刘家硕. All rights reserved. | ||
// | ||
|
||
#include <iostream> | ||
using namespace std; | ||
|
||
int main() | ||
{ | ||
int a[20]={0}; | ||
int n=0; | ||
cin >> n; | ||
a[0] = 0; | ||
a[1] = 0; | ||
a[2] = 1; | ||
for (int i=3;i<=n;i++) | ||
a[i] = (i-1)*(a[i-1]+a[i-2]); | ||
cout << a[n]; | ||
|
||
|
||
return 0; | ||
} |
Oops, something went wrong.