- 博客(15)
- 收藏
- 关注
RSS订阅原创 阶段codeforces小结
这些天除了每天的训练刷了一些的CD，最近状态奇差，那就总结一下吧Codeforces Round #236 (Div. 2)C:这题猜了一下，大致就是让边均匀分布，构造了一下感悟了一下，挺对D:看数据范围和时间大致是n*n的复杂度，以为是任意选取区间，后来发现必须是1-k(1Codeforces Round #237 (Div. 2)C:根据某个点到各个点的距离恢复原图，并且保
2017-08-14 23:34:51
383
转载 lightoj 1054
n^m的因子数之和http://blog.csdn.net/a601025382s/article/details/12946973
2016-09-01 21:12:05
414
转载 进制转换 lightoj 1045
http://www.cnblogs.com/phinecos/archive/2009/09/11/1564975.html
2016-08-31 21:03:58
251
原创 Southern Subregion Problem C. Equivalent Cards
#include #include #include #include #define maxn 105using namespace std;int n;double val[maxn];struct Point{ double x,y; Point(double x=0.0,double y = 0.0):x(x),y(y){} void init(){ c
2016-08-15 19:50:56
221
原创 Southern Subregion Problem F. Judging Time Prediction
Problem F. Judging Time PredictionInput le: stdin Output le: stdout Time limit: 2 seconds Memory limit: 256 megabytes Feedback:It is not easy to predict. Do you know that the modern weather pred
2016-08-15 19:48:37
290
原创 Southern Subregion Problem H. Password Service
这题坑了有一会 直接粘的队友代码 WA54注意一种样例 >>>>>#include #include using namespace std;int main(){ int n; cin>>n; char a[5005],ans[5005],b[5005]; cin>>a; strcpy(b,a); //cout<<b<<endl;
2016-08-15 19:44:26
314
原创 Southern Subregion Problem K. Road Work
贪心#include using namespace std;const int maxn=300050;int d[maxn]; vectorL;vectorR;int main(){ int n; cin>>n; for(int i=1;i<=n;i++){ scanf("%d",&d[i]); } for(int i=1;i<=n;i++){ int r=0
2016-08-15 19:25:44
225
原创 Southern Subregion Problem L. Stock Trading Robot
模拟#include #include #include using namespace std;int n,d,a,b;int num;int num_a = 1;int num_b = 1;int last;int cur;int main(){ //freopen("main.in","r",stdin); cin >> n >> d >> a >> b;
2016-08-15 19:06:13
278
原创 Southern Subregion Problem I. Plugs and Sockets
模拟 读题真的是#includeusing namespace std;vector >v1;// Berland vector >v2;// Beuropean vector >v3;// allvector >ans1;vector >ans2;int n,a,b,t,rem=0;long long powe=0;int main(){ //freopen("C://Use
2016-08-15 18:36:38
328
原创 Southern Subregional Problem B. Travelling Camera Problem
二分找区间 直接算#include using namespace std;const int maxn=300050;double x[maxn];double a[maxn];int main(){ int n,m; double rr; //cin>>m>>n>>rr; scanf("%d%d%lf",&m,&n,&rr); double r=sqrt(rr*rr-1
2016-08-15 18:34:23
217
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人