Record Detail

#	Status	Time Cost	Memory Cost
#1	Accepted	1ms	328.0 KiB
#2	Accepted	1ms	516.0 KiB
#3	Accepted	1ms	356.0 KiB
#4	Accepted	1ms	284.0 KiB
#5	Accepted	1ms	404.0 KiB
#6	Accepted	1ms	284.0 KiB
#7	Accepted	1ms	312.0 KiB
#8	Accepted	1ms	348.0 KiB
#9	Accepted	1ms	348.0 KiB
#10	Accepted	1ms	284.0 KiB
#11	Accepted	1ms	340.0 KiB
#12	Accepted	1ms	428.0 KiB
#13	Accepted	1ms	392.0 KiB
#14	Accepted	1ms	328.0 KiB
#15	Accepted	1ms	328.0 KiB

#include <stdio.h>

int main() {
    int n;
    scanf("%d", &n);

    int ways = 0; 

    for (int i = 1; i * i <= n; i++) {
        if (n % i == 0) {
            ways++;

            
            if (i != n / i) {
                ways++;
            }
        }
    }

    printf("%d\n",ways);
    return 0;
}

Submit By: Tushi ([email protected]) LV 4
Type: Submission
Problem: P1037 Generous CR
Contest: Brain booster #2
Language: C99 (GCC 13.2.0)
Submit At: 2024-03-06 15:16:13
Judged At: 2024-11-11 03:41:42
Judged By: judge

Score: 100
Total Time: 1ms
Peak Memory: 516.0 KiB

Accepted

Code

Information

Status

Development

Support

Record Detail

Accepted

Code

Information

Status

Development

Support

Don't have an account?

SIGN IN