Submission #61789786

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
typedef pair<int,int>pii;
const int mod = 1e9+7;
int qpow(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1) res = res * a;
        a = a * a ;
        b >>= 1;
    }
    return res;
}
int mysqrt(int x) {
    int l=0,r=2e9;
    int ans=0;
        while(l<r){
          int mid=(l+r+1)/2;
            if((long long)mid*mid<=x)
                l=mid;
            else r=mid-1;
            }
        return l;
    }
// int C(int n,int x){
//     if(n==0&&x==0)return 1;
//     return M[n]*X[x]%mod*X[n-x]%mod;
// }

const int N=1e6+10;
//int X[100010],M[100010];
int a[N];
int h[N];
int dp[N];
//int g[N][N];
int n,m,q,k;
int d[N];
int pre[N];
int cnt[N],w[N];
string s;
pii master[N];
int vis[N];
vector<pii>servent[N];
vector<pii>g[N];
int sz[N];
int first[N];
int mark[N];
void solve()
{
   int x;
   cin>>x;
   int ans = 1;
   int cnt = 0;
   while(ans !=x)
   {
   	 ans *=++cnt;
		 
   }
   cout<<cnt;
    
}
signed main()
{	
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    //       M[0]=X[0]=1;
	//    for(int i=1;i<=100000;i++){
	//        M[i]=M[i-1]*i%mod;
	//        X[i]=X[i-1]*ksm(i,mod-2)%mod;
	//    } 
//	    int T;
//	    cin>>T;
//		while(T--)
    solve();
    return 0;
}

Submission Info

Compile Error

Main.cpp: In function ‘long long int mysqrt(long long int)’:
Main.cpp:18:9: warning: unused variable ‘ans’ [-Wunused-variable]
   18 |     int ans=0;
      |         ^~~

Judge Result