回复 @{iomanip} :
加上头文件#include<cstdio>
你就会发现，你第四个错了，我用了你的代码试了下，爆0
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
freopen("aplusb.in","r",stdin);
freopen("aplusb.out","w",stdout);
float a,b;
cin>>a>>b;
cout<<a+b<<endl;
fclose(stdin);fclose(stdout);
return 0;
}
这样写第4个可以但是第6个不行了。。。

我曾以为这只是个
int a,b;
a=a+b;
的问题，直到我看了评论

是时候展现真正的技术了

请问用不用freoprn

用特判过的应该不止我一个吧

qwq

[size=200]啊[/size]

求大佬看一下为什么这个代码过不去这道题，W了三个点啊！！！

#include<iostream>

#include<cstring>

#include<cstdio>

#include<cstring>

using namespace std;

struct node

{

 int data,rev,sum;

 node *son[2],*pre;

 bool judge();

 bool isroot();

 void pushdown();

 void update();

 void setson(node *child,int lr);

}lct[233];

int top,a,b;

node *getnew(int x)

{

 node *now=lct+ ++top;

 now->data=x;

 now->pre=now->son[1]=now->son[0]=lct;

 now->sum=0;

 now->rev=0;

 return now;

}

bool node::judge(){return pre->son[1]==this;}

bool node::isroot()

{

 if(pre==lct)return true;

 return !(pre->son[1]==this||pre->son[0]==this);

}

void node::pushdown()

{

 if(this==lct||!rev)return;

 swap(son[0],son[1]);

 son[0]->rev^=1;

 son[1]->rev^=1;

 rev=0;

}

void node::update(){sum=son[1]->sum+son[0]->sum+data;}

void node::setson(node *child,int lr)

{

 this->pushdown();

 child->pre=this;

 son[lr]=child;

 this->update();

}

void rotate(node *now)

{

 node *father=now->pre,*grandfa=father->pre;

 if(!father->isroot()) grandfa->pushdown();

 father->pushdown();now->pushdown();

 int lr=now->judge();

 father->setson(now->son[lr^1],lr);

 if(father->isroot()) now->pre=grandfa;

 else grandfa->setson(now,father->judge());

 now->setson(father,lr^1);

 father->update();now->update();

 if(grandfa!=lct) grandfa->update();

}

void splay(node *now)

{

 if(now->isroot())return;

 for(;!now->isroot();rotate(now))

 if(!now->pre->isroot())

 now->judge()==now->pre->judge()?rotate(now->pre):rotate(now);

}

node *access(node *now)

{

 node *last=lct;

 for(;now!=lct;last=now,now=now->pre)

 {

 splay(now);

 now->setson(last,1);

 }

 return last;

}

void changeroot(node *now)

{

 access(now)->rev^=1;

 splay(now);

}

void connect(node *x,node *y)

{

 changeroot(x);

 x->pre=y;

 access(x);

}

void cut(node *x,node *y)

{

 changeroot(x);

 access(y);

 splay(x);

 x->pushdown();

 x->son[1]=y->pre=lct;

 x->update();

}

int query(node *x,node *y)

{

 changeroot(x);

 node *now=access(y);

 return now->sum;

}

int main()

{

 freopen("aplusb.in","r",stdin);

 freopen("aplusb.out","w",stdout);

 scanf("%d%d",&a,&b);

 node *A=getnew(a);

 node *B=getnew(b);

 //连边 Link

 connect(A,B);

 //断边 Cut

 cut(A,B);

 //再连边 Again

 connect(A,B);

 printf("%d\n",query(A,B));

 return 0;

}

简直就是世纪难题！

这算是没有偷鸡摸狗的过了……

非常无耻的过了第四个测试点，c=a+b+0.000001…………………………

我第五个点死活过不去
明明自己运行的时候是15，硬要说我是14.。。。
于是我用了一个很脏的办法，如果输入的是第五个点，则直接输出15
手动滑稽

容我说一声mmp，谁搞的hack这么diao

#include <stdio.h>
int main()
{
float a,b;
int c;
freopen("aplusb.in","r",stdin);
freopen("aplusb.out","w",stdout);
scanf("%f",&a);
scanf("%f",&b);
c=a+b;
printf("%d",c);
return 0;
}
过不来啊！！！

回复 @Makazeu :
不慌 老哥

回复 @Makazeu :
不慌 老哥

我还记得我第一次来cogs做这题，都做吐了QAQ

#include <cstdio>
int main() {
printf("hello, world\n");
return 0;
}

醉了，我记得题是保留两位小数，但是一看错了、、、、我的代码
#include<fstream>
#include<iomanip>
using namespace std;
int main()
{
ifstream fin("aplusb.in");
ofstream fout("aplusb.out");
double a,b,c;
fin>>a>>b;
c=a+b;
fout<<setiosflags(ios::fixed)<<setprecision(0);
fout<<c<<endl;
return 0;
}

#include<bits/stdc++.h>
#define il inline
#define RG register
#define ll long long
#define db double
#define N 86444
#define rs ((o<<1)|1)
#define ls (o<<1)
#define mid ((l+r)>>1)
using namespace std;
int Min[N*4],lazy[N*4],n;int tag[N];
void down(int o){
if(lazy[o]){
lazy[rs]=Min[rs]=lazy[o];
lazy[ls]=Min[ls]=lazy[o];
lazy[o]=0;
}
}
void Insert(int o,int l,int r,int L,int R,int num){
if(l!=r)down(o);
if(l>=L&&r<=R){if(Min[o]>num)
lazy[o]=Min[o]=num;
return;
}
if(mid<L)Insert(rs,mid+1,r,L,R,num);
else if(mid>=R)Insert(ls,l,mid,L,R,num);
else Insert(rs,mid+1,r,mid+1,R,num),Insert(ls,l,mid,L,mid,num);
Min[o]=min(Min[rs],Min[ls]);
}
int Query(int o,int l,int r,int pos){
if(l==r)return Min[o];
if(mid<pos)return Query(rs,mid+1,r,pos);
else return Query(ls,l,mid,pos);
}
int L,R;
struct s{
int l,r,val;
void read(){
scanf("%d%d%d",&l,&r,&val);
l++,r++;
l=max(l,L);
r=min(R,r);
tag[l]++,tag[r+1]--;
}
}seg[N];
bool comp(const s & a,const s & b){return a.l<b.l;}
int f[N];
int main(){
freopen("1.in","r",stdin);
freopen("1.out","w",stdout);
memset(Min,127/3,sizeof(Min));
scanf("%d",&n);scanf("%d%d",&L,&R);L++,R++;
for(int i=1;i<=n;++i)seg[i].read();
int tot(0);for(int i=L;i<=R;++i){
tot+=tag[i];
if(!tot)cout<<"-1",exit(0);
}
sort(seg+1,seg+n+1,comp);
int n1=1;
for(int i=L-1;i<=R;++i){
if(i!=L-1)f[i]=Query(1,1,N-1,i);
while(i==seg[n1].l-1)
Insert(1,1,N-1,seg[n1].l,seg[n1].r,f[min(i,0)]+seg[n1].val),n1++;
}cout<<f[R];
return 0;
}