#244674 (C90) No.648 お や す み

• 問題: No.648 お や す み
• ユーザー: butsurizuki
• 提出日時: 2018-03-16 16:40:58
• 言語: C90 (gcc 11.4.0)
• 結果: AC
• 実行時間: 1 ms / 2,000 ms
• コード長: 2,916 bytes
• コンパイル時間: 1,190 ms
• コンパイル使用メモリ: 26,928 KB
• 実行使用メモリ: 4,376 KB
• 最終ジャッジ日時: 2023-10-11 22:28:03
• 合計ジャッジ時間: 3,885 ms
• ジャッジサーバーID （参考情報）: judge13 / judge11

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	0 ms; 4,352 KB
testcase_01	AC	0 ms; 4,348 KB
testcase_02	AC	1 ms; 4,352 KB
testcase_03	AC	1 ms; 4,352 KB
testcase_04	AC	1 ms; 4,352 KB
testcase_05	AC	0 ms; 4,356 KB
testcase_06	AC	1 ms; 4,368 KB
testcase_07	AC	1 ms; 4,348 KB
testcase_08	AC	1 ms; 4,352 KB
testcase_09	AC	1 ms; 4,348 KB
testcase_10	AC	0 ms; 4,352 KB
testcase_11	AC	1 ms; 4,352 KB
testcase_12	AC	1 ms; 4,348 KB
testcase_13	AC	0 ms; 4,352 KB
testcase_14	AC	1 ms; 4,348 KB
testcase_15	AC	1 ms; 4,356 KB
testcase_16	AC	1 ms; 4,348 KB
testcase_17	AC	0 ms; 4,348 KB
testcase_18	AC	0 ms; 4,352 KB
testcase_19	AC	1 ms; 4,356 KB
testcase_20	AC	1 ms; 4,348 KB
testcase_21	AC	1 ms; 4,348 KB
testcase_22	AC	1 ms; 4,356 KB
testcase_23	AC	1 ms; 4,352 KB
testcase_24	AC	1 ms; 4,356 KB
testcase_25	AC	1 ms; 4,352 KB
testcase_26	AC	0 ms; 4,348 KB
testcase_27	AC	1 ms; 4,356 KB
testcase_28	AC	1 ms; 4,352 KB
testcase_29	AC	1 ms; 4,348 KB
testcase_30	AC	1 ms; 4,376 KB
testcase_31	AC	1 ms; 4,356 KB
testcase_32	AC	1 ms; 4,348 KB
testcase_33	AC	0 ms; 4,348 KB
testcase_34	AC	1 ms; 4,348 KB
testcase_35	AC	0 ms; 4,352 KB
testcase_36	AC	1 ms; 4,352 KB
testcase_37	AC	1 ms; 4,352 KB
testcase_38	AC	1 ms; 4,372 KB
testcase_39	AC	1 ms; 4,348 KB
testcase_40	AC	1 ms; 4,352 KB
testcase_41	AC	1 ms; 4,352 KB
testcase_42	AC	1 ms; 4,348 KB
testcase_43	AC	1 ms; 4,348 KB
testcase_44	AC	1 ms; 4,348 KB
testcase_45	AC	1 ms; 4,352 KB
testcase_46	AC	0 ms; 4,352 KB
testcase_47	AC	1 ms; 4,348 KB
testcase_48	AC	1 ms; 4,348 KB
testcase_49	AC	1 ms; 4,352 KB
testcase_50	AC	1 ms; 4,352 KB
testcase_51	AC	0 ms; 4,352 KB
testcase_52	AC	1 ms; 4,352 KB
testcase_53	AC	1 ms; 4,348 KB
testcase_54	AC	0 ms; 4,348 KB
testcase_55	AC	0 ms; 4,348 KB
testcase_56	AC	1 ms; 4,348 KB
testcase_57	AC	1 ms; 4,352 KB
testcase_58	AC	0 ms; 4,348 KB
testcase_59	AC	0 ms; 4,352 KB
testcase_60	AC	0 ms; 4,348 KB
testcase_61	AC	0 ms; 4,352 KB
testcase_62	AC	0 ms; 4,352 KB
testcase_63	AC	0 ms; 4,348 KB
testcase_64	AC	1 ms; 4,348 KB
testcase_65	AC	1 ms; 4,348 KB
testcase_66	AC	1 ms; 4,352 KB
testcase_67	AC	1 ms; 4,348 KB
testcase_68	AC	0 ms; 4,352 KB
testcase_69	AC	0 ms; 4,348 KB
testcase_70	AC	1 ms; 4,352 KB
testcase_71	AC	1 ms; 4,352 KB
testcase_72	AC	0 ms; 4,356 KB
testcase_73	AC	1 ms; 4,356 KB
testcase_74	AC	1 ms; 4,348 KB
testcase_75	AC	1 ms; 4,348 KB
testcase_76	AC	1 ms; 4,352 KB
testcase_77	AC	1 ms; 4,352 KB
testcase_78	AC	0 ms; 4,352 KB
testcase_79	AC	0 ms; 4,352 KB
testcase_80	AC	0 ms; 4,348 KB
testcase_81	AC	1 ms; 4,348 KB
testcase_82	AC	0 ms; 4,356 KB
testcase_83	AC	1 ms; 4,348 KB

コンパイルメッセージ

main.c:11:5: warning: conflicting types for built-in function ‘round’ [-Wbuiltin-declaration-mismatch]
 int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
     ^~~~~
main.c:12:5: warning: conflicting types for built-in function ‘ceil’ [-Wbuiltin-declaration-mismatch]
 int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}
     ^~~~
main.c:17:5: warning: conflicting types for built-in function ‘pow’ [-Wbuiltin-declaration-mismatch]
 int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
     ^~~
main.c:21:11: warning: conflicting types for built-in function ‘llround’ [-Wbuiltin-declaration-mismatch]
 long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
           ^~~~~~~

ソースコード

#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;
}