牛客网NowCoder 2018年全国多校算法寒假训练营练习比赛（第三场）A.不凡的夫夫(斯特林公式) D.小牛vs小客 E.进击吧！阶乘(大数Java) G.大水题(数学)

 1 #include<iostream>
 2 #include<cstring>
 3 #include<cstdio>
 4 #include<cmath>
 5 #include<algorithm>
 6 #include<stack>
 7 #include<map>
 8 #include<vector>
 9 #include<queue>
10 #include<set>
11 using namespace std;
12 const int inf=1<<30;
13 const int maxn=1e5+10;
14 const double eps=1e-6;
15 const int mod=1e9+7;
16 typedef long long ll;
17 int main(){
18     int n;
19     while(~scanf("%d",&n)){
20         if(n==1||n==2)cout<<"XiaoNiu"<<endl;
21         else cout<<"XiaoKe"<<endl;
22     }
23     return 0;
24 }

 1 import java.math.BigInteger;
 2 import java.util.Scanner;
 3  
 4 public class Main {
 5     public static void main(String[]args) {
 6         Scanner cin=new Scanner(System.in);
 7         int n;
 8         while(cin.hasNext()) {
 9             BigInteger ans,temp;
10             n=cin.nextInt();
11             ans=BigInteger.valueOf(1);
12             if(n==0) {
13                 System.out.println(1);
14             }
15             else {
16                 for(int i=1;i<=n;i++) {
17                     temp=BigInteger.valueOf(i);
18                     ans=ans.multiply(temp);
19                 }
20                 System.out.println(ans);
21             }
22         }
23     }
24 }

 1 #include<iostream>
 2 #include<cstring>
 3 #include<cstdio>
 4 #include<cmath>
 5 #include<algorithm>
 6 #include<stack>
 7 #include<map>
 8 #include<vector>
 9 #include<queue>
10 #include<set>
11 using namespace std;
12 const int inf=1<<30;
13 const int maxn=1e5+10;
14 const double eps=1e-6;
15 const int mod=1e9+7;
16 typedef long long ll;
17 int a[maxn];
18 int main(){
19     int n;
20     ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
21     while(cin>>n){
22         memset(a,0,sizeof(a));
23         a[0]=1;
24         int h=1;
25         for(int i=1;i<=n;i++){
26             int res=0;
27             for(int j=0;j<h;j++){
28                 int temp=a[j]*i+res;
29                 a[j]=temp%10;
30                 res=temp/10;
31             }
32             while(res){
33                 a[h++]=res%10;
34                 res/=10;
35             }
36         }
37         for(int k=h-1;k>=0;k--)
38             cout<<a[k];
39         cout<<endl;
40     }
41     return 0;
42 }

 1 #include<iostream>
 2 #include<cstring>
 3 #include<cstdio>
 4 #include<cmath>
 5 #include<algorithm>
 6 #include<stack>
 7 #include<map>
 8 #include<vector>
 9 #include<queue>
10 #include<set>
11 using namespace std;
12 const int inf=1<<30;
13 const int maxn=1e5+10;
14 const double eps=1e-6;
15 const int mod=1e9+7;
16 typedef long long ll;
17 int main(){
18     ll n,ans;
19     while(~scanf("%lld",&n)){
20         ans=0;
21         ans+=n/2+n/5+n/11+n/13;
22         ans-=n/(2*5)+n/(2*11)+n/(2*13)+n/(5*11)+n/(5*13)+n/(11*13);
23         ans+=n/(2*5*11)+n/(2*5*13)+n/(2*11*13)+n/(5*11*13);
24         ans-=n/(2*5*11*13);
25         printf("%lld\n",n-ans);
26     }
27     return 0;
28 }