eolymp
bolt
Try our new interface for solving problems
Problems

Smallest divisor

published at 1/2/24, 9:07:54 pm

include <bits/stdc++.h>

using namespace std; int main() { int n; cin>>n; for(int i=2;i*i<=n;i++) { if(n%i==0) { cout<<i; return 0; } } cout<<n; }

published at 2/3/24, 7:11:37 pm

include <bits/stdc++.h>

using namespace std; int main() { int n; cin>>n; for(int i=2;i*i<=n;i++) { if(n%i==0) { cout<<i; return 0; }

} 
cout<<n;
}
published at 2/3/24, 7:11:39 pm

include <bits/stdc++.h>

using namespace std; int main() { int n; cin>>n; for(int i=2;i*i<=n;i++) { if(n%i==0) { cout<<i; return 0; }

} 
cout<<n;
}
published at 2/8/24, 8:01:49 pm

n=int(input()) k=2 o=0 while k*k<=n: if n%k==0: print(k) o+=1 break else: k+=1 if o==0: print(n)