bc&CF...比赛OJ
文章平均质量分 62
小堃哥
这个作者很懒,什么都没留下…
展开
-
bc1002+字符串和数字的转换+日期的计算。以后日期直接用模板了
点击打开链接#include#include#include#include#include#include#include#includeusing namespace std;string s1;int day1[2][12]={{31,28,31,30,31,30,31,31,30,31,30,31},{31,29,31,30,31,30,31,31,30,31,30,3原创 2016-01-24 14:33:27 · 329 阅读 · 0 评论 -
bestcoder+置换群组成的各自环后减一累加
点击打开链接#include#include#include#includeusing namespace std;bool visit[100005];struct node{ int a,b;} p[100005];bool cmp(node x,node y){ return x.a<y.a;}int main(){ int T=0,n=0,原创 2015-10-06 00:05:47 · 274 阅读 · 0 评论 -
bc+一道模拟题
点击打开链接#include#include#include#include#include#include#includeusing namespace std;int T,n,m;struct node{ string name; string sex; int score1,score2; double su原创 2015-10-10 23:45:17 · 308 阅读 · 0 评论 -
bc+判定正五边形,由于是保证凸性了只需判定边相等+枚举方法好
点击打开链接#include #include #include #include #include using namespace std;const double eps = 1e-4;#define inf 0x3f3f3f3fdouble x[5],y[5],ans[5];double dist(int i,int j){ double tx = x[i] - x原创 2015-11-16 17:18:45 · 338 阅读 · 0 评论 -
cf+在于优化去除一些重复耗时的操作+明白了runtime意义了
点击打开链接#includeusing namespace std;int main(){ string s1,s2; cin>>s1; s2=s1; int m;cin>>m; while(m--){ int l,r,k;cin>>l>>r>>k; l--,r--; int len = r-l+1;k%原创 2015-11-17 14:19:02 · 329 阅读 · 0 评论 -
cf+注意impossible优先级大于Ambiguity+也会使用二维的vector
点击打开链接///AC#include#include#include#include#include#include#include#includeusing namespace std;#define maxn 100005int a[maxn];int f[maxn];int b[maxn];vector Q[maxn];int main(){ int原创 2015-11-21 16:19:36 · 267 阅读 · 0 评论 -
bc+2,3,5倍数看末尾和各位数和+毕竟这个数据为10^30
点击打开链接#include#include#include#include#include#include#include#includeusing namespace std;int main(){ string s1; int len=0,sum=0,i=0; while(cin>>s1){ len=s1.length();原创 2015-11-28 23:30:13 · 330 阅读 · 0 评论 -
bc+变化后与变化前相减成一个数组,然后就是求最大子串和的问题了
点击打开链接#include#include#include#include#include#include#include#includeusing namespace std;int Sum1[100005],dp[100005];int main(){ long long result=0; int n=0,i=0,num=0,temp=0,max1=0原创 2015-11-28 23:32:06 · 261 阅读 · 0 评论 -
bc1001+一道枚举题,然而错了细节+写完代码最好多想点样例防止wrong answer
点击打开链接///多想样例防止wrong answer!!!#include#include#include#include#include#include#include#includeusing namespace std;#define inf 0x3f3f3f3fint T=0,a=0,b=0,C=0;void solve(){ if(C%2!=0){原创 2016-01-24 14:31:10 · 347 阅读 · 0 评论 -
51NOde+大数相乘+注意找规律
点击打开链接#include#include#include#include#include#include#include#include#include#include#include#include #include #define LL long long#define inf 0x3f3f3f3f#define maxn 1e5+5using namesp原创 2016-05-24 23:25:19 · 273 阅读 · 0 评论