SNNN

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int tot;
int ini[5000][10];
int search(int x,int w,int k)//x为调料序号，w为美味程度,k为累加值
{
if(x>11)
return 0;
else
if(k<w)
for(int i=1;i<=3;i++)
{search(x+1,w,k+i);
ini[tot][x]=t;
}
if(k==w&&x==11)
tot=tot+1;
return 0;
if(w>30)
tot=0;
}
int main()
{
int m;
cin>>m;
search(1,m,0);
cout<<tot<<endl;
for(int k=1;k<=tot;k++)
for(int u=1;u<=10;u++)
{
cout<<ini[k][u]<<" ";
if(u==10)
cout<<endl;
}
return 0;
}

P1706
#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
int a[15];
int n;
cin>>n;
for(int i=1;i<=n;i++)
{a[i]=i;
}
do{
for(int k=1;k<=n;k++)
printf("%5d",a[k]);
printf("%d","\n");
}
while(next_permutation(a,a+n+1));
return 0;
}

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<cmath>
#define eps 1e-7
using namespace std;
int a[100];
int n;
int q=0;
float f(float x)
{
for(int j=n;j>=0;j--)
{
q+=a[j]*pow(x,j);
}
}
float search(float l,float r)
{
while(l+eps<r)
{
float lmid=(2*l+r)/3;
float rmid=(l+2*r)/3;
if(f(lmid)<f(rmid))
l=lmid;
else
r=rmid;
}
return l;
}
int main()
{
float L;
float R;
cin>>n>>L>>R;
for(int i=n;i>=0;i--)
{
cin>>a[i];
}
cout<<search(L,R);
return 0;
}

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
int A;
int B;
int target[100005];
int choose[100005];
int check(int x)
{
}
long long erfen(long long l,long long r)
{
while(l<r)
{
long long mid=(l+r+1)/2;
if(check(mid))
l=mid;
else
r=mid-1;
}
return l;
}
int main()
{
cin>>A>>B;
for(int i=1;i<=A;i++)
{
cin>>target[i];
}
sort(target+1,target+A+1);
return 0;
}

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int cp;
int ct;
int rp;
int T;
int M;
int now;
int best;
int ans;
int time[114];
int herb[114];
double border(int x)
{
while(x<=M)
{
rp=rp+herb[x];
x++;
}
return rp+cp;
}
int dfs(int now)
{
if(now==M+1)
{
if(cp>best)
{
best=cp;
}
return best;
}
else if(ct<T&&border(now)>best)
{
ct=ct+time[now];
cp=cp+herb[now];
dfs(now+1);
ct=ct-time[now];
cp=cp-time[now];
}
//{
//dfs(now+1);
//}
}
int main()
{
cin>>T>>M;
for(int i=1;i<=M;i++)
{
cin>>time[i]>>herb[i];
}
cout<<dfs(1);
return 0;
}

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
vector<int> p[20010];
int n,m,c[20010],used[20010],sum,flag,tot;
int dfs(int start,int col)
{
if(c[start]!=-1)
if(c[start]!=col)
{
flag=1;
return 0;
}
if(c[start]==col)
return 0;
used[start]=1;
c[start]=col;
tot++;
for(int i=0;i<p[start].size();i++)
dfs(p[start][i],col^1);
}
int main()
{
cin>>n>>m;
for(int i=1;i<=m;i++)
{
int a,b;
cin>>a>>b;
p[a].push_back(b);
p[b].push_back(a);
}
memset(used,0,sizeof(used));
int ans=0;
for(int i=1;i<=n;i++){
tot=0;
memset(c,-1,sizeof(c));
if(used[i]==0)
{
dfs(i,0);
int sum=0;
for(int i=1;i<=n;i++)
{
if(c[i]==1)
sum+=c[i];
}
if(flag){
cout<<"Impossible";
return 0;
}
ans+=min(sum,tot-sum);
}
}
cout<<ans;
return 0;
}

大水比

dark♂水比