- 博客(31)
- 收藏
- 关注
RSS订阅原创 CodeForces - 429B
#include"iostream"#include"algorithm"#include"cstdio"#include"cstring"#include"string"#include"vector"#include"queue"#include"map"#include"set"#include"
2018-11-03 17:00:15
183
原创 UVa 11464-Even Parity
#include"iostream"#include"algorithm"#include"vector"#include"stack"#include"queue"#include"map"#include"cstring"#include"cstdio"#include"set"#include"c
2018-09-15 16:09:54
195
原创 poj-3320
#include"iostream"#include"algorithm"#include"vector"#include"stack"#include"queue"#include"map"#include"cstring"#include"cstdio"#include"set"using namespace
2018-09-15 08:46:30
239
原创 uva-10881
#include"iostream"#include"algorithm"#include"vector"#include"queue"#include"map"#include"cstdio"#include"string"#include"stack"#include"set"#include"cs
2018-09-14 15:47:38
195
原创 HDU - 6322
题目给定 k，求第 k 小的数 n，满足 φ(n) 是合数。（1 ≤ k ≤ 10 9 ）#include"iostream"#include"algorithm"#include"vector"#include"queue"#include"map"#include"cstdio"#include"string"#include"stack
2018-08-24 17:30:48
188
原创 codeforces-992B
#include"iostream"#include"algorithm"#include"vector"#include"queue"#include"map"#include"cstdio"#include"string"#include"stack"#include"set"#include"c
2018-08-24 08:17:42
161
原创 Codeforces-975A - Aramic script
在STL中unique函数是一个去重函数， unique的功能是去除相邻的重复元素(只保留一个),其实它并不真正把重复的元素删除，是把重复的元素移到后面去了，然后依然保存到了原数组中，然后 返回去重后最后一个元素的地址，因为unique去除的是相邻的重复元素，所以一般用之前都会要排一下序。 #include"iostream"#include"algorithm"#include"v...
2018-08-20 20:15:50
145
原创 HYSBZ - 1800
#include"iostream"#include"algorithm"#include"vector"#include"queue"#include"map"#include"cstdio"#include"string"#include"stack"#include"set"#include"cs
2018-08-20 08:49:44
122
原创 CodeForces-869B
#include"iostream"#include"algorithm"#include"vector"#include"queue"#include"map"#include"cstdio"#include"string"#include"stack"#include"set"#include"c
2018-08-20 08:08:35
152
原创 poj-2752
#include"iostream"#include"algorithm"#include"vector"#include"queue"#include"map"#include"cstdio"#include"string"#include"stack"#include"set"#include"cs
2018-08-18 15:14:02
206
转载 substr函数
C++中substr函数的用法 1 2 3 4 5 6 7 8 9 #include<string> #include<iostream> using namespace std; int main() { string s("1234...
2018-08-02 15:30:17
1267
原创 Codeforces Round #486 (Div. 3) B:Substrings Sort
#include"iostream"#include"algorithm"#include"vector"#include"queue"#include"map"#include"cstdio"#include"string"#include"stack"#include"set"#include"cs
2018-08-02 15:12:48
135
原创 hdu-1181
#include"iostream"#include"algorithm"#include"vector"#include"queue"#include"map"#include"cstdio"#include"string"#include"stack"#include"set"#include"cs
2018-08-02 14:08:40
228
原创 poj-3984
#include"iostream"#include"algorithm"#include"vector"#include"queue"#include"map"#include"cstdio"#include"string"#include"stack"#include"set"#include"cs
2018-08-02 08:39:36
1297
原创 poj-3320
运用尺取法#include"iostream"#include"algorithm"#include"vector"#include"stack"#include"queue"#include"map"#include"cstring"#include"cstdio"#include"set"using na
2018-07-30 21:21:07
196
原创 poj-2976
http://www.cnblogs.com/perseawe/archive/2012/05/03/01fsgh.html详细解释在上述网站。#include"iostream"#include"algorithm"#include"cstring"#include"cstdio"#include"cmath"using namespace std;int m,n;doub...
2018-07-30 16:49:45
246
原创 CodeForces - 999B
G - Reversing Encryption CodeForces - 999B A string ss of length nn can be encrypted by the following algorithm:iterate over all divisors of nn in decreasing order (i.e. from nn to 11), for eac...
2018-07-30 14:13:25
205
原创 codeforces-401c
#include"iostream"#include"algorithm"#include"vector"#include"stack"#include"queue"#include"map"#include"cstring"#include"cstdio"using namespace std;int n[200005];int
2018-07-30 14:05:29
190
原创 codeforces-546c
#include"iostream"#include"algorithm"#include"vector"#include"stack"#include"queue"#include"map"#include"cstring"#include"cstdio"using namespace std;queue<int&a
2018-07-30 14:04:24
250
原创 poj-2376
#include"iostream"#include"algorithm"#include"vector"#include"stack"#include"queue"#include"map"#include"cstring"#include"cstdio"using namespace std;struct NODE{
2018-07-28 20:02:52
446
原创 uva-514
本题可以理解为先对列车排序，然后根据所给排序判断是否可以得到。 得到方式为a-b或a-c-b或者同时有如1 2 3 5 4便可以达成先将123放到b上，将4移到c，将5移到b， 最后将4从c移到b。#include"iostream"#include"algorithm"#include"vector"#include"stack"using namespace std;...
2018-07-27 08:41:02
198
原创 uva-101
我们先思考如何找到a，b位置，然后通过分析，可以知道出现move，a上的物块就要归位出现onto，b上的物块就要归位。然后我们就考虑如何将a放到b上。#include"iostream"#include"algorithm"#include"string"#include"vector"#include"cstdio"using namespace std;int m;...
2018-07-26 21:05:10
261
原创 poj-2431
#include"iostream"#include"algorithm"#include"vector"#include"queue"#include"map"#include"cstdio"using namespace std;struct cmp{int a,b;bool operator < (const cmp&bb) cons
2018-07-26 09:53:46
254
原创 CodeForces - 659D
#include"iostream"#include"cstdio"#include"cstring"#include"algorithm"using namespace std;int main(){ int m,n,i,j,g,x[1005],y[1005]; scanf("%d",&g); for(i=0;i<=g;i++)
2018-07-23 20:15:50
152
原创 codeforces-651B
#include"cstdio"#include"algorithm"using namespace std;int main(){ int a[1010],m=0,n[1010]={0},i,c; scanf("%d",&c); for(i=0;i<c;i++) scanf("%d",&a[i]); sort(a,a+...
2018-07-23 10:07:23
162
原创 hysbz-1008
#include<stdio.h>#define xc 100003long long qu(long long a,long long b){ long long c,d=1;c=a%xc; while(b!=0) { if(b&1) d=d*c%xc; c=c*c%xc; b>>=1; } return d;}int main() { long long a...
2018-06-20 10:19:48
107
原创 Gym - 101775L
#include<stdio.h> int main() { int a,b,i=1; scanf("%d",&a); while(a--) { scanf("%d",&b); if(b<7) printf("Case #%d: Draw\n",i); else if(b>=7&&b<=15) {
2018-06-15 19:54:59
528
原创 hdu-5974
#include<stdio.h>#include<math.h> long long int f(long long int c,long long int d){long long int r;while((r=d%c)!=0){d=c;c=r;}return c;}int main(){ long long int a,b,c,i,m; double n; while...
2018-06-15 19:18:37
138
原创 hdu-1003
考虑全为负数。#include"stdio.h"int main(){ int d,m[100000],i,j,a,b,s,h,max,st;while(~scanf("%d",&d)) {for(j=0;j<d;j++){h=1;st=1; scanf("%d",&a); for(i=1;i<=a;i++) scanf("%d",&m[i]);s
2018-06-09 19:20:02
111
原创 codeforces-978g
#include"iostream"#include"stdio.h"#include"string.h"#include"algorithm"using namespace std;typedef struct f{int c;int m;int n;int g;}F;bool cmp(F a,F b){return a.m<b.m;}int main(){ int a,b,i,j,h; ...
2018-06-09 09:18:02
173
原创 Codeforces-816A
已经Ac。#include"stdio.h"int main(){ int a,c,d,m,n;while(~scanf("%d:%d",&a,&d)){ m=a/10;c=a%10; if(d==c*10+m) printf("0\n"); else if((a>=15&&a<=19)) { if(a==15){if(c*10+m-d>0
2018-06-07 08:52:52
188
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人