結果
問題 | No.648 お や す み |
ユーザー |
![]() |
提出日時 | 2018-02-09 23:18:00 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 1 ms / 2,000 ms |
コード長 | 1,698 bytes |
コンパイル時間 | 402 ms |
コンパイル使用メモリ | 33,280 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-13 21:03:07 |
合計ジャッジ時間 | 2,256 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 84 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:76:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 76 | scanf("%lld", &n); | ~~~~~^~~~~~~~~~~~
ソースコード
#include <stdio.h>#include <stdlib.h>#include <string.h>#include <math.h>int descending_compare(const void *a, const void *b){if (*(long long*)a > *(long long*)b){return -1;}else if (*(long long*)a == *(long long*)b){return 0;}else{return 1;}}int ascending_compare(const void *a, const void *b){if (*(int*)a < *(int*)b){return -1;}else if (*(int*)a == *(int*)b){return 0;}else{return 1;}}int lower_bound(int *a, int n, int key){int left, mid, right;left = 0, right = n;mid = (left + right)/2;while ((left+1 != mid || mid+1 != right) && mid != left){if (key > a[mid]){left = mid;}else{right = mid+1;}mid = (left + right)/2;}if (a[left] >= key)return left;if (a[mid] >= key)return mid;if (a[right] >= key)return right;return n;}//greatest common divisorunsigned long gcd(unsigned long x, unsigned long y){if (y == 0){return x;}else if (x > y){return gcd(y, x % y);}else{return gcd(x, y % x);}}long long factorial(int x){long long rtn = 1;int i;for (i = x; i > 1; i--){rtn = (rtn*i);}return rtn;}/*int struct_ascending_compare(const void *p, const void *q) {return ((struct_name*)p)->member_name - ((struct_name*)q)->member_name;}*/int main(void){long long n;scanf("%lld", &n);n *= 2;long long root = (long long)sqrtl((long double)n);if (root * (root+1) == n){printf("YES\n%lld\n", root);}else{printf("NO\n");}return 0;}