山东省第八届ACM大学生程序设计竞赛

C 暂时还不对

 #include <iostream>
 #include <cstdio>
 #include <cmath>
 
 using namespace std;
 
 #define MOD 1000000007
 typedef long long ll;
 
 int jie[];
 
 void jiecheng1(){
     ll jiech=;
     for(ll i=;i<=;i++){
         jiech*=i;
         jiech%=MOD;
         jie[i]=jiech;
     }
 }
 
 ll jiecheng(ll aa){
     return  jie[aa];
 
 }
 
 ll cal(int T,int Y){
     if(T%==||Y%==){
         return ;
     }
     ll n,m;
     n=T;
     m=(T-Y)/;
     return (jiecheng(n)%MOD)/( ((jiecheng(m)%MOD)*(jiecheng(n-m)%MOD))%MOD );
 }
 
 int distan(int a,int b){
     if(a>b){
         return a-b;
     }else{
         return b-a;
     }
 }
 
 int main()
 {
     int n,T,w;
     int xi,ci;
     ll result=;
     jiecheng1();
     while(~scanf("%d %d %d",&n,&T,&w)){
         result=;
         for(int i=;i<n;i++){
             scanf("%d %d",&xi,&ci);
             if(T==distan(xi,w)){
                 result+=ci;
             }else if(T>(int)abs(xi-w)){
                 result+=cal(T,distan(xi,w))*ci%MOD;
             }
         }
         result%=MOD;
         printf("%lld\n",result);
 
     }
     return ;
 }

F 暂时不对

 #include <iostream>
 #include <cmath>
 
 using namespace std;
 
 int main()
 {
     double a,b,c;
     int n;
     double x,x1,x2;
     while(cin>>n){
         while(n--){
             cin>>a>>b>>c;
             if(a==&&b==){
                 if(c==)
                     cout<<"NO"<<endl;
                 else
                     cout<<"YES"<<endl;
                 continue;
             }
             if(a==){
                 x=(c*-1.0)/b;
                 if(x==(int)x)
                     cout<<"YES"<<endl;
                 else
                     cout<<"NO"<<endl;
                 continue;
             }
             x=(b*b-*a*c);
             if(x<){
                 cout<<"YES"<<endl;
                 continue;
             }
             x=sqrt(x);
             x1=(b*-+x)/2.0*a;
             x2=(b*--x)/2.0*a;
             if(x1==(int)x1||x2==(int)x2)
                 cout<<"YES"<<endl;
             else
                 cout<<"NO"<<endl;
         }
 
     }
     return ;
 }

G

 package G;
 
 import java.math.BigInteger;
 import java.util.Scanner;
 
 public class Main {
     public static void main(String[] args) {
         int n,m;
         int MOD=1000000007;
         Scanner sc=new Scanner(System.in);
         while(sc.hasNext()){
             BigInteger iii=new BigInteger("1");
             BigInteger eve=new BigInteger("0");
             BigInteger res=new BigInteger("0");
             n=sc.nextInt();
             m=sc.nextInt();
             for(int i=1;i<=n;i++){
                 iii=iii.valueOf(i);
                 eve=iii.pow(m).mod(BigInteger.valueOf(MOD));
                 res=res.add(eve);
                 res=res.mod(BigInteger.valueOf(MOD));
             }
             System.out.println(res.toString());
         }
 
     }
 }

J

 #include <iostream>
 #include <algorithm>
 
 using namespace std;
 
 struct Goods{
     int val,cnt;
 }a[];
 
 int cmp(Goods x,Goods y){
     return x.val<y.val;
 }
 
 int main()
 {
     int n, num, cnt;
     long long sum;
 
     while(cin>>n){
         for(int i=;i<n;i++){
             cin>>a[i].val;
         }
         for(int i=;i<n;i++){
             cin>>a[i].cnt;
         }
         sort(a,a+n,cmp);
 
         sum = num = ;
         while(a[num].val < ){
             num ++;
         }
         for(int i=num;i<n;i++){
             sum += a[i].val * a[i].cnt;
         }
         num--;
         cnt = ;
 
         while(a[num].val + sum >  && num >= ){
             if(cnt == ){
                 cnt = a[num].cnt - ;
             } else {
                 cnt--;
             }
             if(cnt == ){
                 num--;
             }
             sum += a[num].val;
         }
 
         if(cnt == ) num++;
         else a[num].cnt = cnt;
 
         sum = ;
         for(int i=; num < n; i++){
                 sum += a[num].val * i;
                 a[num].cnt--;
                 if(a[num].cnt == ) num++;
         }
 
         cout<<sum<<endl;
     }
 
     return ;
 }

K

#include <iostream>
#include <cstring>
#include <algorithm>
 
using namespace std;
 
long long f[];
 
struct node{
    int a,d,c;
    double f;
};
node sc[];
 
int cmp(node x,node y){
    return x.f>y.f;
}
int main()
{
    int n,T;
    while(cin>>n>>T){
        for(int i=;i<n;i++)
            cin>>sc[i].a;
        for(int i=;i<n;i++)
            cin>>sc[i].d;
        for(int i=;i<n;i++){
            cin>>sc[i].c;
            sc[i].f=(sc[i].d*1.0)/sc[i].c;
        }
        sort(sc,sc+n,cmp);
        memset(f,,sizeof(f));
        long long maxx=;
        for(int i=;i<n;i++){
            for(int j=T;j>=sc[i].c;j--){
                f[j]=max(f[j],f[j-sc[i].c]+max(sc[i].a-sc[i].d*j,));
                maxx=max(maxx,f[j]);
            }
        }
        cout<<maxx<<endl;
    }
    return ;
}