Submission #771537

Source Code Expand

#define rep(i,n) FOR(i,0,n)
#define FOR(i,s,n) for(int (i)=(s);(i)<(n);(i)++)
#define SCAN(k) scanf("%d",&k)
#define PI 3.14159265359
#define INF (ll)(2e18+100)
#define MOD (int)(1e9+7)
#define MAX 10000
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#include <math.h>
#include<algorithm>
#include<stdio.h>
#include <set>
#include <map>
#include <numeric>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;

int main(){
	int n,imin=INF;
	cin>>n;
	rep(i,n+1){
		for(int j=sqrt((double)n-i);j>=1;j--){
			if((n-i)%j==0){
				imin=min(imin,abs(j-(n-i)/j)+i);
				break;
			}
		}
	}
	cout<<imin<<endl;
	return 0;
}

Submission Info

Submission Time
Task B - □□□□□
User luan273
Language C++14 (Clang 3.8.0)
Score 100
Code Size 715 Byte
Status AC
Exec Time 113 ms
Memory 888 KiB

Compile Error

./Main.cpp:24:13: warning: implicit conversion from 'll' (aka 'long long') to 'int' changes value from 2000000000000000000 to 1321730048 [-Wconstant-conversion]
        int n,imin=INF;
              ~~~~ ^~~
./Main.cpp:5:13: note: expanded from macro 'INF'
#define INF (ll)(2e18+100)
            ^~~~~~~~~~~~~~
1 warning generated.

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 15
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt
Case Name Status Exec Time Memory
sample_01.txt AC 9 ms 888 KiB
sample_02.txt AC 4 ms 256 KiB
sample_03.txt AC 113 ms 256 KiB
subtask1_01.txt AC 4 ms 256 KiB
subtask1_02.txt AC 4 ms 256 KiB
subtask1_03.txt AC 4 ms 256 KiB
subtask1_04.txt AC 113 ms 256 KiB
subtask1_05.txt AC 113 ms 256 KiB
subtask1_06.txt AC 107 ms 256 KiB
subtask1_07.txt AC 64 ms 256 KiB
subtask1_08.txt AC 112 ms 256 KiB
subtask1_09.txt AC 72 ms 256 KiB
subtask1_10.txt AC 4 ms 256 KiB
subtask1_11.txt AC 55 ms 256 KiB
subtask1_12.txt AC 39 ms 256 KiB