Submission #1754462


Source Code Expand

//set many funcs template
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define inf 1072114514
#define llinf 4154118101919364364
#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;}

int main(void){
    int n,a[131072],i,j,c;
    double r=0,e;
    scanf("%d",&n);
    for(i=1;i<=n;i++){scanf("%d",&a[i]);}
    for(i=1;i<=n;i++){
        c=1;
        for(j=1;j<=n;j++){
            if(i==j){continue;}
            if(j%i==0){c++;}
        }
        e=(ceil(c,2));e/=c;r+=e;
    }
    printf("%.12lf\n",r);
    return 0;
}

Submission Info

Submission Time
Task C - コイン
User physics0523
Language C (GCC 5.4.1)
Score 0
Code Size 2994 Byte
Status WA
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.c:12:5: warning: conflicting types for built-in function ‘round’
 int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
     ^
./Main.c:13:5: warning: conflicting types for built-in function ‘ceil’
 int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}
     ^
./Main.c:18:5: warning: conflicting types for built-in function ‘pow’
 int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
     ^
./Main.c:22:11: warning: conflicting types for built-in function ‘llround’
 long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
           ^
./Main.c: In function ‘main’:
./Main.c:42:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ^
./Main.c:43:23: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
     for(i=1;i<=n;i++){scanf("%d",&a[i]);}
                       ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 99 0 / 1
Status
WA × 3
AC × 1
WA × 19
AC × 1
WA × 39
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 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, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt
Subtask2 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, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt
Case Name Status Exec Time Memory
sample_01.txt WA 1 ms 128 KB
sample_02.txt WA 1 ms 128 KB
sample_03.txt WA 1 ms 128 KB
subtask1_01.txt AC 1 ms 128 KB
subtask1_02.txt WA 1 ms 128 KB
subtask1_03.txt WA 1 ms 128 KB
subtask1_04.txt WA 1 ms 128 KB
subtask1_05.txt WA 1 ms 128 KB
subtask1_06.txt WA 1 ms 128 KB
subtask1_07.txt WA 1 ms 128 KB
subtask1_08.txt WA 1 ms 128 KB
subtask1_09.txt WA 1 ms 128 KB
subtask1_10.txt WA 1 ms 128 KB
subtask1_11.txt WA 1 ms 128 KB
subtask1_12.txt WA 1 ms 128 KB
subtask1_13.txt WA 1 ms 128 KB
subtask1_14.txt WA 1 ms 128 KB
subtask1_15.txt WA 1 ms 128 KB
subtask1_16.txt WA 1 ms 128 KB
subtask1_17.txt WA 1 ms 128 KB
subtask1_18.txt WA 1 ms 128 KB
subtask1_19.txt WA 1 ms 128 KB
subtask1_20.txt WA 1 ms 128 KB
subtask2_01.txt WA 1 ms 128 KB
subtask2_02.txt WA 1 ms 128 KB
subtask2_03.txt WA 1 ms 128 KB
subtask2_04.txt WA 1 ms 128 KB
subtask2_05.txt WA 1 ms 128 KB
subtask2_06.txt WA 1 ms 128 KB
subtask2_07.txt WA 1 ms 128 KB
subtask2_08.txt WA 1 ms 128 KB
subtask2_09.txt WA 1 ms 128 KB
subtask2_10.txt WA 1 ms 128 KB
subtask2_11.txt WA 1 ms 128 KB
subtask2_12.txt WA 1 ms 128 KB
subtask2_13.txt WA 1 ms 128 KB
subtask2_14.txt WA 1 ms 128 KB
subtask2_15.txt WA 1 ms 128 KB
subtask2_16.txt WA 1 ms 128 KB
subtask2_17.txt WA 1 ms 128 KB
subtask2_18.txt WA 1 ms 128 KB
subtask2_19.txt WA 1 ms 128 KB
subtask2_20.txt WA 1 ms 128 KB