結果

問題 No.648 　お　や　す　み　
コンテスト
ユーザー butsurizuki
提出日時 2018-03-16 16:40:58
言語 C90
(gcc 12.3.0)
結果
AC  
実行時間 1 ms / 2,000 ms
コード長 2,916 bytes
コンパイル時間 1,012 ms
コンパイル使用メモリ 23,680 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-09-13 21:17:36
合計ジャッジ時間 2,570 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 84
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.c:11:5: warning: conflicting types for built-in function ‘round’; expected ‘double(double)’ [-Wbuiltin-declaration-mismatch]
   11 | int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
      |     ^~~~~
main.c:4:1: note: ‘round’ is declared in header ‘<math.h>’
    3 | #include<stdlib.h>
  +++ |+#include <math.h>
    4 | #define inf 1072114514
main.c:12:5: warning: conflicting types for built-in function ‘ceil’; expected ‘double(double)’ [-Wbuiltin-declaration-mismatch]
   12 | int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}
      |     ^~~~
main.c:12:5: note: ‘ceil’ is declared in header ‘<math.h>’
main.c:17:5: warning: conflicting types for built-in function ‘pow’; expected ‘double(double,  double)’ [-Wbuiltin-declaration-mismatch]
   17 | int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
      |     ^~~
main.c:17:5: note: ‘pow’ is declared in header ‘<math.h>’
main.c:21:11: warning: conflicting types for built-in function ‘llround’; expected ‘long long int(double)’ [-Wbuiltin-declaration-mismatch]
   21 | long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
      |           ^~~~~~~
main.c:21:11: note: ‘llround’ is declared in header ‘<math.h>’
main.c: In function ‘main’:
main.c:47:34: warning: format ‘%lld’ expects argument of type ‘long long int’, but argument 2 has type ‘long int’ [-Wformat=]
   47 |         if(m==n){printf("YES\n%lld\n",t);return 0;}
      |                               ~~~^    ~
      |                                  |    |
      |                                  |    long int
      |                                  long long int
      |                               %ld
main.c:43:5: warning: ignoring return value of ‘scanf’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   43 |     scanf("%lld",&n);
      |     ^~~~~~~~~~~~~~~~

ソースコード

diff #
raw source code 

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define inf 1072114514
#define llinf 1145141919810364364
#define mod 1000000007

int max(int a,int b){if(a>b){return a;}return b;}
int min(int a,int b){if(a<b){return a;}return b;}
int zt(int a,int b){return max(a,b)-min(a,b);}
int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}
int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}
int lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}
int nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
int fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
long long llmax(long long a,long long b){if(a>b){return a;}return b;}
long long llmin(long long a,long long b){if(a<b){return a;}return b;}
long long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}
long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
long long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}
long long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}
long long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}
long long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
long long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
long long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
double dbmax(double a,double b){if(a>b){return a;}return b;}
double dbmin(double a,double b){if(a<b){return a;}return b;}
double dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}
int sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
int sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
int llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}
int llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}
int dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}
int dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}

long long sk(long long x){return ((x+1)*x)/2;}

int main(void){
    long long n;
    long m,t,st=1,fi=2500000000;
    scanf("%lld",&n);
    while(st<=fi){
        t = (st+fi)/2;
        m=sk(t);
        if(m==n){printf("YES\n%lld\n",t);return 0;}
        if(m<n){st=t+1;}
        if(m>n){fi=t-1;}
    }
    printf("NO\n");
    return 0;
}
0