D - Cut the Cake----（2015 summer training #11）

于 2015-08-14 13:31:04 发布
阅读量415 收藏
点赞数
分类专栏： 2015暑期集训
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/Han_kin/article/details/47660391
版权

D - Cut the Cake
时限:1000MS     内存:32768KB     64位IO格式:%I64d & %I64u

问题描述

MMM got a big big big cake, and invited all her M friends to eat the cake together. Surprisingly one of her friends HZ took some (N) strawberries which MMM likes very much to decorate the cake (of course they also eat strawberries, not just for decoration). HZ is in charge of the decoration, and he thinks that it's not a big deal that he put the strawberries on the cake randomly one by one. After that, MMM would cut the cake into M pieces of sector with equal size and shape (the last one came to the party will have no cake to eat), and choose one piece first. MMM wants to know the probability that she can get all N strawberries, can you help her? As the cake is so big, all strawberries on it could be treat as points. 
 

输入

First line is the integer T, which means there are T cases. 
For each case, two integers M, N indicate the number of her friends and the number of strawberry. 
(2 < M, N <= 20, T <= 400) 
 

输出

As the probability could be very small, you should output the probability in the form of a fraction in lowest terms. For each case, output the probability in a single line. Please see the sample for more details. 
 

样例输入

     
     

      
       2
3 3
3 4
 

样例输出

     
     

      
       1/3
4/27

分析：概率题，总的可能是每个草莓都有M种可能，即M的N次方。当想得到所有草莓时，先选择一个草莓，然后剩下的草莓跟第一个草莓放在同一块蛋糕上，则是N种可能，蛋糕分成M份，则总共N*M种可能，所以公式为N*M/（M^N)。因为计算的结果大，所以用到大数乘法，我分别用了java和北大大数模板。


CODE：（java）

import java.math.*;
import java.util.*;
public class Main{
	public static void main(String[] args) {
		Scanner read=new Scanner(System.in);
		int n,t;
		BigInteger m;
		t=read.nextInt();
		while(t-->0){
			m=read.nextBigInteger();
			n=read.nextInt();
			BigInteger p=m.pow(n-1);
			BigInteger q=BigInteger.valueOf(n);
			BigInteger tmp=p.gcd(q);
			System.out.println(q.divide(tmp)+"/"+p.divide(tmp));
		}
	}
}

CODE：（C++) 

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <cmath>
using namespace std;

#define DIGIT    4
#define DEPTH    10000
#define MAX     20
typedef int bignum_t[MAX+1];

int read(bignum_t a,istream& is=cin){
    char buf[MAX*DIGIT+1],ch;
    int i,j;
    memset((void*)a,0,sizeof(bignum_t));
    if (!(is>>buf))    return 0;
    for (a[0]=strlen(buf),i=a[0]/2-1;i>=0;i--)
        ch=buf[i],buf[i]=buf[a[0]-1-i],buf[a[0]-1-i]=ch;
    for (a[0]=(a[0]+DIGIT-1)/DIGIT,j=strlen(buf);j<a[0]*DIGIT;buf[j++]='0');
    for (i=1;i<=a[0];i++)
        for (a[i]=0,j=0;j<DIGIT;j++)
            a[i]=a[i]*10+buf[i*DIGIT-1-j]-'0';
    for (;!a[a[0]]&&a[0]>1;a[0]--);
    return 1;
}

void write(const bignum_t a,ostream& os=cout){
    int i,j;
    for (os<<a[i=a[0]],i--;i;i--)
        for (j=DEPTH/10;j;j/=10)
            os<<a[i]/j%10;
}

int comp(const bignum_t a,const bignum_t b){
    int i;
    if (a[0]!=b[0])
        return a[0]-b[0];
    for (i=a[0];i;i--)
        if (a[i]!=b[i])
            return a[i]-b[i];
    return 0;
}

int comp(const bignum_t a,const int b){
    int c[12]={1};
    for (c[1]=b;c[c[0]]>=DEPTH;c[c[0]+1]=c[c[0]]/DEPTH,c[c[0]]%=DEPTH,c[0]++);
    return comp(a,c);
}

int comp(const bignum_t a,const int c,const int d,const bignum_t b){
    int i,t=0,O=-DEPTH*2;
    if (b[0]-a[0]<d&&c)
        return 1;
    for (i=b[0];i>d;i--){
        t=t*DEPTH+a[i-d]*c-b[i];
        if (t>0) return 1;
        if (t<O) return 0;
    }
    for (i=d;i;i--){
        t=t*DEPTH-b[i];
        if (t>0) return 1;
        if (t<O) return 0;
    }
    return t>0;
}

void add(bignum_t a,const bignum_t b){
    int i;
    for (i=1;i<=b[0];i++)
        if ((a[i]+=b[i])>=DEPTH)
            a[i]-=DEPTH,a[i+1]++;
    if (b[0]>=a[0])
        a[0]=b[0];
    else
        for (;a[i]>=DEPTH&&i<a[0];a[i]-=DEPTH,i++,a[i]++);
    a[0]+=(a[a[0]+1]>0);
}

void add(bignum_t a,const int b){
    int i=1;
    for (a[1]+=b;a[i]>=DEPTH&&i<a[0];a[i+1]+=a[i]/DEPTH,a[i]%=DEPTH,i++);
    for (;a[a[0]]>=DEPTH;a[a[0]+1]=a[a[0]]/DEPTH,a[a[0]]%=DEPTH,a[0]++);
}

void sub(bignum_t a,const bignum_t b){
    int i;
    for (i=1;i<=b[0];i++)
        if ((a[i]-=b[i])<0)
            a[i+1]--,a[i]+=DEPTH;
    for (;a[i]<0;a[i]+=DEPTH,i++,a[i]--);
    for (;!a[a[0]]&&a[0]>1;a[0]--);
}

void sub(bignum_t a,const int b){
    int i=1;
    for (a[1]-=b;a[i]<0;a[i+1]+=(a[i]-DEPTH+1)/DEPTH,a[i]-=(a[i]-DEPTH+1)/DEPTH*DEPTH,i++);
    for (;!a[a[0]]&&a[0]>1;a[0]--);
}

void sub(bignum_t a,const bignum_t b,const int c,const int d){
    int i,O=b[0]+d;
    for (i=1+d;i<=O;i++)
        if ((a[i]-=b[i-d]*c)<0)
            a[i+1]+=(a[i]-DEPTH+1)/DEPTH,a[i]-=(a[i]-DEPTH+1)/DEPTH*DEPTH;
    for (;a[i]<0;a[i+1]+=(a[i]-DEPTH+1)/DEPTH,a[i]-=(a[i]-DEPTH+1)/DEPTH*DEPTH,i++);
    for (;!a[a[0]]&&a[0]>1;a[0]--);
}

void mul(bignum_t c,const bignum_t a,const bignum_t b){
    int i,j;
    memset((void*)c,0,sizeof(bignum_t));
    for (c[0]=a[0]+b[0]-1,i=1;i<=a[0];i++)
        for (j=1;j<=b[0];j++)
            if ((c[i+j-1]+=a[i]*b[j])>=DEPTH)
                c[i+j]+=c[i+j-1]/DEPTH,c[i+j-1]%=DEPTH;
    for (c[0]+=(c[c[0]+1]>0);!c[c[0]]&&c[0]>1;c[0]--);
}

void mul(bignum_t a,const int b){
    int i;
    for (a[1]*=b,i=2;i<=a[0];i++){
        a[i]*=b;
        if (a[i-1]>=DEPTH)
            a[i]+=a[i-1]/DEPTH,a[i-1]%=DEPTH;
    }
    for (;a[a[0]]>=DEPTH;a[a[0]+1]=a[a[0]]/DEPTH,a[a[0]]%=DEPTH,a[0]++);
    for (;!a[a[0]]&&a[0]>1;a[0]--);
}

void mul(bignum_t b,const bignum_t a,const int c,const int d){
    int i;
    memset((void*)b,0,sizeof(bignum_t));
    for (b[0]=a[0]+d,i=d+1;i<=b[0];i++)
        if ((b[i]+=a[i-d]*c)>=DEPTH)
            b[i+1]+=b[i]/DEPTH,b[i]%=DEPTH;
    for (;b[b[0]+1];b[0]++,b[b[0]+1]=b[b[0]]/DEPTH,b[b[0]]%=DEPTH);
    for (;!b[b[0]]&&b[0]>1;b[0]--);
}

void div(bignum_t c,bignum_t a,const bignum_t b){
    int h,l,m,i;
    memset((void*)c,0,sizeof(bignum_t));
    c[0]=(b[0]<a[0]+1)?(a[0]-b[0]+2):1;
    for (i=c[0];i;sub(a,b,c[i]=m,i-1),i--)
        for (h=DEPTH-1,l=0,m=(h+l+1)>>1;h>l;m=(h+l+1)>>1)
            if (comp(b,m,i-1,a)) h=m-1;
            else l=m;
            for (;!c[c[0]]&&c[0]>1;c[0]--);
            c[0]=c[0]>1?c[0]:1;
}

void div(bignum_t a,const int b,int& c){
    int i;
    int tt=0;
    for (tt=0,i=a[0];i;tt=tt*DEPTH+a[i],a[i]=tt/b,tt%=b,i--);
    c=tt;
    for (;!a[a[0]]&&a[0]>1;a[0]--);
}

void sqrt(bignum_t b,bignum_t a){
    int h,l,m,i;
    memset((void*)b,0,sizeof(bignum_t));
    for (i=b[0]=(a[0]+1)>>1;i;sub(a,b,m,i-1),b[i]+=m,i--)
        for (h=DEPTH-1,l=0,b[i]=m=(h+l+1)>>1;h>l;b[i]=m=(h+l+1)>>1)
            if (comp(b,m,i-1,a)) h=m-1;
            else l=m;
            for (;!b[b[0]]&&b[0]>1;b[0]--);
            for (i=1;i<=b[0];b[i++]>>=1);
}

int length(const bignum_t a){
    int t,ret;
    for (ret=(a[0]-1)*DIGIT,t=a[a[0]];t;t/=10,ret++);
    return ret>0?ret:1;
}

int digit(const bignum_t a,const int b){
    int i,ret;
    for (ret=a[(b-1)/DIGIT+1],i=(b-1)%DIGIT;i;ret/=10,i--);
    return ret%10;
}

int zeronum(const bignum_t a){
    int ret,t;
    for (ret=0;!a[ret+1];ret++);
    for (t=a[ret+1],ret*=DIGIT;!(t%10);t/=10,ret++);
    return ret;
}

void comp(int* a,const int l,const int h,const int d){
    int i,j,t;
    for (i=l;i<=h;i++)
        for (t=i,j=2;t>1;j++)
            while (!(t%j))
                a[j]+=d,t/=j;
}

void convert(int* a,const int h,bignum_t b){
    int i,j,t=1;
    memset(b,0,sizeof(bignum_t));
    for (b[0]=b[1]=1,i=2;i<=h;i++)
        if (a[i])
            for (j=a[i];j;t*=i,j--)
                if (t*i>DEPTH)
                    mul(b,t),t=1;
    mul(b,t);
}

void combination(bignum_t a,int m,int n){
    int* t=new int[m+1];
    memset((void*)t,0,sizeof(int)*(m+1));
    comp(t,n+1,m,1);
    comp(t,2,m-n,-1);
    convert(t,m,a);
    delete []t;
}

void permutation(bignum_t a,int m,int n){
    int i,t=1;
    memset(a,0,sizeof(bignum_t));
    a[0]=a[1]=1;
    for (i=m-n+1;i<=m;t*=i++)
        if (t*i>DEPTH)
            mul(a,t),t=1;
    mul(a,t);
}

#define SGN(x) ((x)>0?1:((x)<0?-1:0))
#define ABS(x) ((x)>0?(x):-(x))

int read(bignum_t a,int &sgn,istream& is=cin){
    char str[MAX*DIGIT+2],ch,*buf;
    int i,j;
    memset((void*)a,0,sizeof(bignum_t));
    if (!(is>>str)) return 0;
    buf=str,sgn=1;
    if (*buf=='-') sgn=-1,buf++;
    for (a[0]=strlen(buf),i=a[0]/2-1;i>=0;i--)
        ch=buf[i],buf[i]=buf[a[0]-1-i],buf[a[0]-1-i]=ch;
    for (a[0]=(a[0]+DIGIT-1)/DIGIT,j=strlen(buf);j<a[0]*DIGIT;buf[j++]='0');
    for (i=1;i<=a[0];i++)
        for (a[i]=0,j=0;j<DIGIT;j++)
            a[i]=a[i]*10+buf[i*DIGIT-1-j]-'0';
    for (;!a[a[0]]&&a[0]>1;a[0]--);
    if (a[0]==1&&!a[1]) sgn=0;
    return 1;
}

struct bignum{
    bignum_t num;
    int sgn;
public:
    inline bignum(){memset(num,0,sizeof(bignum_t));num[0]=1;sgn=0;}
    inline int operator!(){return num[0]==1&&!num[1];}
    inline bignum& operator=(const bignum& a){memcpy(num,a.num,sizeof(bignum_t));sgn=a.sgn;return *this;}
    inline bignum& operator=(const int a){memset(num,0,sizeof(bignum_t));num[0]=1;sgn=SGN(a);add(num,sgn*a);return *this;};
    inline bignum& operator+=(const bignum& a){if(sgn==a.sgn)add(num,a.num);else if(sgn&&a.sgn){int ret=comp(num,a.num);if(ret>0)sub(num,a.num);else if(ret<0){bignum_t t;
    memcpy(t,num,sizeof(bignum_t));memcpy(num,a.num,sizeof(bignum_t));sub(num,t);sgn=a.sgn;}else memset(num,0,sizeof(bignum_t)),num[0]=1,sgn=0;}else if(!sgn)memcpy(num,a.num,sizeof(bignum_t)),sgn=a.sgn;return *this;}
    inline bignum& operator+=(const int a){if(sgn*a>0)add(num,ABS(a));else if(sgn&&a){int ret=comp(num,ABS(a));if(ret>0)sub(num,ABS(a));else if(ret<0){bignum_t t;
    memcpy(t,num,sizeof(bignum_t));memset(num,0,sizeof(bignum_t));num[0]=1;add(num,ABS(a));sgn=-sgn;sub(num,t);}else memset(num,0,sizeof(bignum_t)),num[0]=1,sgn=0;}else if(!sgn)sgn=SGN(a),add(num,ABS(a));return *this;}
    inline bignum operator+(const bignum& a){bignum ret;memcpy(ret.num,num,sizeof(bignum_t));ret.sgn=sgn;ret+=a;return ret;}
    inline bignum operator+(const int a){bignum ret;memcpy(ret.num,num,sizeof(bignum_t));ret.sgn=sgn;ret+=a;return ret;}
    inline bignum& operator-=(const bignum& a){if(sgn*a.sgn<0)add(num,a.num);else if(sgn&&a.sgn){int ret=comp(num,a.num);if(ret>0)sub(num,a.num);else if(ret<0){bignum_t t;
    memcpy(t,num,sizeof(bignum_t));memcpy(num,a.num,sizeof(bignum_t));sub(num,t);sgn=-sgn;}else memset(num,0,sizeof(bignum_t)),num[0]=1,sgn=0;}else if(!sgn)add(num,a.num),sgn=-a.sgn;return *this;}
    inline bignum& operator-=(const int a){if(sgn*a<0)add(num,ABS(a));else if(sgn&&a){int ret=comp(num,ABS(a));if(ret>0)sub(num,ABS(a));else if(ret<0){bignum_t t;
    memcpy(t,num,sizeof(bignum_t));memset(num,0,sizeof(bignum_t));num[0]=1;add(num,ABS(a));sub(num,t);sgn=-sgn;}else memset(num,0,sizeof(bignum_t)),num[0]=1,sgn=0;}else if(!sgn)sgn=-SGN(a),add(num,ABS(a));return *this;}
    inline bignum operator-(const bignum& a){bignum ret;memcpy(ret.num,num,sizeof(bignum_t));ret.sgn=sgn;ret-=a;return ret;}
    inline bignum operator-(const int a){bignum ret;memcpy(ret.num,num,sizeof(bignum_t));ret.sgn=sgn;ret-=a;return ret;}
    inline bignum& operator*=(const bignum& a){bignum_t t;mul(t,num,a.num);memcpy(num,t,sizeof(bignum_t));sgn*=a.sgn;return *this;}
    inline bignum& operator*=(const int a){mul(num,ABS(a));sgn*=SGN(a);return *this;}
    inline bignum operator*(const bignum& a){bignum ret;mul(ret.num,num,a.num);ret.sgn=sgn*a.sgn;return ret;}
    inline bignum operator*(const int a){bignum ret;memcpy(ret.num,num,sizeof(bignum_t));mul(ret.num,ABS(a));ret.sgn=sgn*SGN(a);return ret;}
    inline bignum& operator/=(const bignum& a){bignum_t t;div(t,num,a.num);memcpy(num,t,sizeof(bignum_t));sgn=(num[0]==1&&!num[1])?0:sgn*a.sgn;return *this;}
    inline bignum& operator/=(const int a){int t;div(num,ABS(a),t);sgn=(num[0]==1&&!num[1])?0:sgn*SGN(a);return *this;}
    inline bignum operator/(const bignum& a){bignum ret;bignum_t t;memcpy(t,num,sizeof(bignum_t));div(ret.num,t,a.num);ret.sgn=(ret.num[0]==1&&!ret.num[1])?0:sgn*a.sgn;return ret;}
    inline bignum operator/(const int a){bignum ret;int t;memcpy(ret.num,num,sizeof(bignum_t));div(ret.num,ABS(a),t);ret.sgn=(ret.num[0]==1&&!ret.num[1])?0:sgn*SGN(a);return ret;}
    inline bignum& operator%=(const bignum& a){bignum_t t;div(t,num,a.num);if (num[0]==1&&!num[1])sgn=0;return *this;}
    inline int operator%=(const int a){int t;div(num,ABS(a),t);memset(num,0,sizeof(bignum_t));num[0]=1;add(num,t);return t;}
    inline bignum operator%(const bignum& a){bignum ret;bignum_t t;memcpy(ret.num,num,sizeof(bignum_t));div(t,ret.num,a.num);ret.sgn=(ret.num[0]==1&&!ret.num[1])?0:sgn;return ret;}
    inline int operator%(const int a){bignum ret;int t;memcpy(ret.num,num,sizeof(bignum_t));div(ret.num,ABS(a),t);memset(ret.num,0,sizeof(bignum_t));ret.num[0]=1;add(ret.num,t);return t;}
    inline bignum& operator++(){*this+=1;return *this;}
    inline bignum& operator--(){*this-=1;return *this;};
    inline int operator>(const bignum& a){return sgn>0?(a.sgn>0?comp(num,a.num)>0:1):(sgn<0?(a.sgn<0?comp(num,a.num)<0:0):a.sgn<0);}
    inline int operator>(const int a){return sgn>0?(a>0?comp(num,a)>0:1):(sgn<0?(a<0?comp(num,-a)<0:0):a<0);}
    inline int operator>=(const bignum& a){return sgn>0?(a.sgn>0?comp(num,a.num)>=0:1):(sgn<0?(a.sgn<0?comp(num,a.num)<=0:0):a.sgn<=0);}
    inline int operator>=(const int a){return sgn>0?(a>0?comp(num,a)>=0:1):(sgn<0?(a<0?comp(num,-a)<=0:0):a<=0);}
    inline bool operator<(const bignum& a)const{return sgn<0?(a.sgn<0?comp(num,a.num)>0:1):(sgn>0?(a.sgn>0?comp(num,a.num)<0:0):a.sgn>0);}
    inline int operator<(const int a){return sgn<0?(a<0?comp(num,-a)>0:1):(sgn>0?(a>0?comp(num,a)<0:0):a>0);}
    inline int operator<=(const bignum& a){return sgn<0?(a.sgn<0?comp(num,a.num)>=0:1):(sgn>0?(a.sgn>0?comp(num,a.num)<=0:0):a.sgn>=0);}
    inline int operator<=(const int a){return sgn<0?(a<0?comp(num,-a)>=0:1):(sgn>0?(a>0?comp(num,a)<=0:0):a>=0);}
    inline int operator==(const bignum& a){return (sgn==a.sgn)?!comp(num,a.num):0;}
    inline int operator==(const int a){return (sgn*a>=0)?!comp(num,ABS(a)):0;}
    inline int operator!=(const bignum& a){return (sgn==a.sgn)?comp(num,a.num):1;}
    inline int operator!=(const int a){return (sgn*a>=0)?comp(num,ABS(a)):1;}
    inline int operator[](const int a){return digit(num,a);}
    friend inline istream& operator>>(istream& is,bignum& a){read(a.num,a.sgn,is);return is;}
    friend inline ostream& operator<<(ostream& os,const bignum& a){if(a.sgn<0)os<<'-';write(a.num,os);return os;}
    friend inline bignum sqrt(const bignum& a){bignum ret;bignum_t t;memcpy(t,a.num,sizeof(bignum_t));sqrt(ret.num,t);ret.sgn=ret.num[0]!=1||ret.num[1];return ret;}
    friend inline bignum sqrt(const bignum& a,bignum& b){bignum ret;memcpy(b.num,a.num,sizeof(bignum_t));sqrt(ret.num,b.num);ret.sgn=ret.num[0]!=1||ret.num[1];b.sgn=b.num[0]!=1||ret.num[1];return ret;}
    inline int length(){return ::length(num);}
    inline int zeronum(){return ::zeronum(num);}
    inline bignum C(const int m,const int n){combination(num,m,n);sgn=1;return *this;}
    inline bignum P(const int m,const int n){permutation(num,m,n);sgn=1;return *this;}
};

bignum GCD(bignum a, bignum b)
{
       //cout<<a<<' '<<b<<endl;
       bignum c;
       while(b>0)
       {
         c=a%b;
         a=b; b=c;
       }
       return a;
}

pair<bignum, bignum> add(pair<bignum, bignum> a, pair<bignum, bignum> b)
{
    pair<bignum, bignum> ret;
    ret.second = a.second * b.second;
    ret.first = a.first * b.second + a.second * b.first;
    bignum g = GCD(ret.second, ret.first);
    ret.second /= g;
    ret.first /= g;
    return ret;
}

pair<bignum, bignum> mul(pair<bignum, bignum> a, pair<bignum, bignum> b)
{
    pair<bignum, bignum> ret;
    ret.second = a.second * b.second;
    ret.first = a.first * b.first;
    bignum g = GCD(ret.second, ret.first);
    ret.second /= g;
    ret.first /= g;
    return ret;
}

bignum x;

int main()
{
    //freopen("F.out","w",stdout);
    int T;
    scanf("%d",&T);
    for(int i=1;i<=T;i++)
    {
        int m,n;
        cin>>m>>n;
//        x=pow(m,n-1);
        x=1;
        for(int i=1;i<n;i++)
            x=x*m;
        bignum nn;
        nn=n;
        bignum p=GCD(x,nn);
        cout<<nn/p<<'/'<<x/p<<endl;
    }
    return 0;
}




Han_Kin
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
智能剥离技术（Smart-cut）
12-09
Smart-cut技术是一种注入氢离子然后进行剥离的技术，即在键合的一片晶片上注入氢离子，然后和另一硅片在一定温度下键合。键合热处理温度在大约500℃时，氢离子注入处会形成连续的空腔，从而自动剥离形成SOI结构。键...
[概率]Cut the Cake
wu_yihao的专栏
10-12 872
Cut the Cake Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 558    Accepted Submission(s): 274 Problem Description MMM got a big big b
one-cut-withseed代码实现
11-10
《人工种子点设置的One-cut算法实现详解》 在计算机视觉和图像处理领域，图割（Graph Cut）算法是一种常用且高效的方法，用于图像分割、目标检测等任务。One-cut算法是图割的一种变体，它以寻找最小割的方式来进行...
图割算法graph-cut
09-14
图割算法实现，直接可用，python实现，graph-cut，多幅图像同时处理
基于Graph-cut的图像深度信息提取matlab仿真+代码操作视频
06-02
1.领域：matlab，Graph-cut的图像深度信息提取算法 2.内容：基于Graph-cut的图像深度信息提取matlab仿真+代码操作视频 3.用处：用于Graph-cut的图像深度信息提取算法 编程学习 4.指向人群：本硕博等教研学习使用...
AngularJS基础 ng-cut 指令介绍及简单示例
10-21
本文主要介绍AngularJS ng-cut 指令,这里对ng-cut指令的基础资料进行了整理,和详细介绍,并附上代码示例和实现效果图,学习AngularJS 指令的朋友可以参考下
B - Build The Electric System --- （fisrt qualifying)
Han_kin的专栏
07-27 1157
B - Build The Electric System 时限:2000MS     内存:65536KB     64位IO格式:%lld & %llu 问题描述 In last winter, there was a big snow storm in South China. The electric system was damaged seriously. Lot
2015西电暑期集训第一场（锘爷系列）
Han_kin的专栏
08-13 1067
1079: 锘爷与数列 时间限制: 1 Sec  内存限制: 128 MB 题目描述 锘爷拿到了一个长度为n的数列，数列中每个数ai都满足1 2 2 输入 多组数据，第一行为数据组数T（1 输出 输出格式  每组数据输出一个数，即最大的差值。 样例输入 2 10 2 1 1 2 2 1 2 1 1 1 1 10 3 2
NEUQ 1229: 密码截获
Han_kin的专栏
08-08 954
1229: 密码截获 时间限制: 1 Sec  内存限制: 128 MB 题目描述 Catcher是MCA国的情报员，他工作时发现敌国会用一些对称的密码 进行通信，比如像这些ABBA，ABA，A，123321，但是他们有时会在开始或结束时加入一些无关的字符以防止别国破解。比如进行下列变化 ABBA->12ABBA,ABA->ABAKK,123321->51233214　。
E - A very hard mathematic problem----（2015 summer training #3）
Han_kin的专栏
08-05 870
E - A very hard mathematic problem 时限:1000MS     内存:32768KB     64位IO格式:%I64d & %I64u 问题描述 　　Haoren is very good at solving mathematic problems. Today he is working a problem like this:  　
J - A Bit Fun-----（2015 summer training #9）
Han_kin的专栏
08-14 844
J - A Bit Fun 时限:2500MS     内存:32768KB     64位IO格式:%I64d & %I64u 问题描述 There are n numbers in a array, as a 0, a 1 ... , a n-1, and another number m. We define a function f(i, j) = a i|a i
H - Hurdles of 110m----(2015 summer training #4 (Qualifying))
Han_kin的专栏
08-07 767
H - Hurdles of 110m 时限:2000MS     内存:65536KB     64位IO格式:%lld & %llu 问题描述 In the year 2008, the 29th Olympic Games will be held in Beijing. This will signify the prosperity of China and Bei
C - We Love MOE Girls---（2015 summer training #9）
Han_kin的专栏
08-05 739
C - We Love MOE Girls 时限:500MS     内存:32768KB     64位IO格式:%I64d & %I64u 问题描述 Chikami Nanako is a girl living in many different parallel worlds. In this problem we talk about one of them. 
K - Kinds of Fuwas----（2015 summer training #4 (Qualifying)）
Han_kin的专栏
08-07 630
K - Kinds of Fuwas 时限:2000MS     内存:65536KB     64位IO格式:%lld & %llu 问题描述 In the year 2008, the 29th Olympic Games will be held in Beijing. This will signify the prosperity of China as well
C - We Love MOE Girls-----(2015 summer training #9)
Han_kin的专栏
08-14 610
C - We Love MOE Girls 时限:500MS     内存:32768KB     64位IO格式:%I64d & %I64u 问题描述 Chikami Nanako is a girl living in many different parallel worlds. In this problem we talk about one of them. 
G - Give Me the Number --- (first qualifying)
Han_kin的专栏
07-27 598
G - Give Me the Number 时限:2000MS     内存:65536KB     64位IO格式:%lld & %llu 问题描述 Numbers in English are written down in the following way (only numbers less than 109 are considered). Number a
A - Accurately Say "CocaCola"! --- （first qualifying)
Han_kin的专栏
07-27 585
A - Accurately Say "CocaCola"! 时限:2000MS     内存:65536KB     64位IO格式:%lld & %llu 提交 状态 练习 ZOJ 2965 问题描述 In a party held by CocaCola company, several students stand in a circle and play
J - Intelligent IME---（2015 summer training #3）
Han_kin的专栏
08-05 549
J - Intelligent IME 时限:1000MS     内存:32768KB     64位IO格式:%I64d & %I64u 问题描述 　　We all use cell phone today. And we must be familiar with the intelligent English input method on the cell phon
A - Decoding Baby Boos---(2015 NEUQ_ACM summer training #1)
Han_kin的专栏
08-05 545
题目链接：http://7xjob4.com1.z0.glb.clouddn.com/bf4e186f3e033bf65549cd29766985f6 分析：题意是给一个字符串，然后给出一些修改操作，每次有两个字符A和B,意思用A代替B，以此来更新字符串。如果每一次根据操作更新，绝对超时。我们可以先用26个字母来用操作进行更新，得到每个字母在所有操作完成后，最终得到的字符是什么，最后一次性遍历字
e-cut运动控制卡V1.2详尽使用指南与特性介绍
e-Cut运动控制卡使用手册V1.2详细介绍了e-Cut这一专业级运动控制卡，它旨在为各种机床设备提供高效、稳定的运动控制解决方案。该卡具有以下显著特点： 1. 兼容性广泛：e-Cut支持Mach3的所有版本，包括Mach3R3.042....
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值