杭电ACM-LCY算法进阶培训班-专题训练08

杭电ACM-LCY算法进阶培训班-专题训练（04-08-12-16）

1004 Ignatius and the Princess II

#include <bits/stdc++.h>
#define inf 0x7fffffff
//#define ll long long
//#define int long long
//#define double long double
#define eps 1e-8
//#define mod 1e9+7
using namespace std;
const int mod=1e9+7;
const int M=1e5;
const int N=1e7+5;//空间最大限制 4e8
int n,m,a[N];
signed main()
{
//    ios::sync_with_stdio(false);
    while(cin>>n>>m)
    {
        int ans=0;
        for(int i=1;i<=n;i++)  a[i]=i;
        do
        {
            ans++;
            if(ans==m)  break;
        }while(next_permutation(a+1,a+n+1));
        printf("%d",a[1]);
        for(int i=2;i<=n;i++)  printf(" %d",a[i]);
        puts("");
    }
    return 0;
}

1005 sort

#include <bits/stdc++.h>
#define inf 0x7fffffff
//#define ll long long
//#define int long long
//#define double long double
#define re register int
#define void inline void
#define eps 1e-8
//#define mod 1e9+7
#define ls(p) p<<1
#define rs(p) p<<1|1
#define pi acos(-1.0)
#define pb push_back
using namespace std;
//const int mod=1e9+7;
const int M=5e6;
const int N=2*1e6+5;//?????????? 4e8
int n,m;
int a[N];
bool cmp(int x,int y)
{
    return x>y;
} 
void solve()
{
    while(cin>>n>>m)
    {
        for(re i=1;i<=n;i++)  scanf("%d",&a[i]);
        sort(a+1,a+n+1,cmp);
        cout<<a[1];
        for(re i=2;i<=m;i++)  printf(" %d",a[i]);
        puts("");
    }
}
signed main()
{
    int T=1;
//    cin>>T;
    for(int index=1;index<=T;index++)
    {
        solve();
//        puts("");
    }
    return 0;
}

1006 解方程

#include <bits/stdc++.h>
#define inf 0x7fffffff
//#define ll long long
#define int long long
//#define double long double
#define re register int
#define void inline void
#define eps 1e-8
//#define mod 1e9+7
#define ls(p) p<<1
#define rs(p) p<<1|1
#define pi acos(-1.0)
#define pb push_back
using namespace std;
//const int mod=1e9+7;
const int M=5e6;
const int N=2*1e6+5;//?????????? 4e8
unordered_map < int , int > mp;
int get(int a,int x1,int b,int x2)
{
	return a*x1*x1+b*x2*x2;
}
void solve()
{
	int a,b,c,d;
	while(cin>>a>>b>>c>>d)
	{
		int ans=0;
		if((a>0&&b>0&&c>0&&d>0)||(a<0&&b<0&&c<0&&d<0))
        {
            cout<<ans<<endl;
            continue;
        }
		c=0-c,d=0-d;
		for(re i=-100;i<=100;i++)  for(re j=-100;j<=100;j++)  if(i*j!=0)  mp[get(a,i,b,j)]++;
		for(re i=-100;i<=100;i++)  for(re j=-100;j<=100;j++)  if(i*j!=0)  ans+=mp[get(c,i,d,j)];
		for(re i=-100;i<=100;i++)  for(re j=-100;j<=100;j++)  if(i*j!=0)  mp[get(a,i,b,j)]=0;
		cout<<ans<<endl;
	}
}
signed main()
{
    int T=1;
//    cin>>T;
    for(int index=1;index<=T;index++)
    {
        solve();
//        puts("");
    }
    return 0;
}