Codeforces Round #387 (Div. 2)A. Display Size（简单数学）

A. Display Size
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
A big company decided to launch a new series of rectangular displays, and decided that the display must have exactly n pixels.

Your task is to determine the size of the rectangular display — the number of lines (rows) of pixels a and the number of columns of pixels b, so that:

there are exactly n pixels on the display;
the number of rows does not exceed the number of columns, it means a ≤ b;
the difference b - a is as small as possible.
Input
The first line contains the positive integer n (1 ≤ n ≤ 106) — the number of pixels display should have.

Output
Print two integers — the number of rows and columns on the display.

Examples
input
8
output
2 4
input
64
output
8 8
input
5
output
1 5
input
999999
output
999 1001
Note
In the first example the minimum possible difference equals 2, so on the display should be 2 rows of 4 pixels.

In the second example the minimum possible difference equals 0, so on the display should be 8 rows of 8 pixels.

In the third example the minimum possible difference equals 4, so on the display should be 1 row of 5 pixels.

题意：给定一个N找出a,b满足a*b=N&&a<=b且b-a最小。

思路：对N开根号并向下取整得到a，不停的减少a枚举出b即可。

代码

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<string.h>
#include<string>
using namespace std;
const int maxn=1000005;
int main()
{
    long long int N;
    scanf("%I64d",&N);
    long long int a=(int)sqrt(N);
    for(long long int i=0; i<maxn; i++)
    {
        if(N%(a-i)==0)
        {
            printf("%I64d %I64d\n",a-i,N/(a-i));
            return 0;
        }
    }
    return 0;
}