Stool_Monster的专栏

#include #include #include #include #include using namespace std;int N,ans;int a[10010];int main(){ while(scanf("%d",&N)!=EOF){ for(int i=0;i<N;i++){ scanf("%d",&a[i]); } ans=0; fo

#include #include #include #include using namespace std;int p,a,b,c,d,n;double pp[1000010];int main(){ while(scanf("%d%d%d%d%d%d",&p,&a,&b,&c,&d,&n)!=EOF){ for(int i=1;i<=n;i++){ pp[i]=p*

#include #include #include #include using namespace std;int N,M;double W,x[1010],y[1010];bool f1,f2;int main(){ while(scanf("%d%d%lf",&N,&M,&W)!=EOF){ if(N==0&&M==0&&W==0){ break; }

#include #include #include using namespace std;int T,N;long long n,d;int a,b,x,y,tmp;int main(){ scanf("%d",&T); while(T--){ scanf("%d",&N); if(N<3){ printf("IMPOSSIBLE\n"); cont

#include #include #include #include #include using namespace std;const int MAXN=1000010;int P[MAXN];int N,K,num,ans;bool fun(int mi){ for(int i=0,j=0,lab=1;i<N;i++,lab+=(2*K)){ for(;j<la

#include #include #include using namespace std;int N,M,ans,n1,n2,m1,m2,fi,minn;//n1 stand for the number of zero//n2 stand for the number of oneint a[20],b[20],c[20],d[20];bool vis[20];void