noip2012 mass factor decomposition (enumeration)

P2067 [NOIP2012P1] mass factor decomposition time: 1000ms/Space: 131072kib/java class name: Main background NOIP2012
describes a known positive integer n is the product of two different prime numbers, trying to find the larger prime number.
Input format input has only one row and contains a positive integer n.
output format output has only one row, containing a positive integer p, which is the larger prime number.
Test Sample 1 input output 7 Memo "data range"
For 60% of data 6≤n≤1000
For the 100% data 6≤n≤2*10^9 code:

#include <cstdio>
using namespace std;

int main ()
{
  int i,j,k,n;
  scanf ("%d", &n);
  for (i=2;i<n;i++)
    if (n%i==0) {printf ("%d\n", n/i);
  return 0;
}