Help please 😌

Question

Дано целое положительное число n. Требуется найти наименьшее целое положительное k, такое, что nn неделится на k.

Answer 1

int n;
cin >> n;

for(int k=2;k<=n;k++){
if(n%k==0){
cout << k;
break;}}

Answer 2

Help please

Given a positive integer n. It is required to find the smallest positive integer k such that nn is divisible by k.

(Translated by google translate)

Answer 3

😇😇😇😇😇 i don't understand your queston

Answer 4

Given a positive integer n. It is required to find the smallest positive integer k such that n is not divisible by k