Submission #1689848


Source Code Expand

#include <stdio.h>
#define MAX_N 201
#define MOD 998244353

int x[MAX_N], y[MAX_N], p[MAX_N];

int main(void)
{
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
        scanf("%d%d", &x[i], &y[i]);
    p[0] = 1;
    for (int i = 0; i < n; i++)
        p[i + 1] = (p[i] << 1) % MOD;
    int ans = p[n] - n - 1;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < i; j++) {
            int cnt = 0;
            for (int k = 0; k < j; k++) {
                if ((x[i] - x[j]) * (y[i] - y[k]) == (x[i] - x[k]) * (y[i] - y[j]))
                    cnt++;
            }
            ans -= p[cnt];
            ans += MOD;
            ans %= MOD;
        }
    }
    printf("%d\n", ans);
    return 0;
}

Submission Info

Submission Time
Task E - ConvexScore
User SiuGinHung
Language C++14 (GCC 5.4.1)
Score 700
Code Size 752 Byte
Status AC
Exec Time 3 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:10:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
./Main.cpp:12:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &x[i], &y[i]);
                                    ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 3
AC × 36
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt, 1_026.txt, 1_027.txt, 1_028.txt, 1_029.txt, 1_030.txt, 1_031.txt, 1_032.txt, 1_033.txt, 1_034.txt, 1_035.txt
Case Name Status Exec Time Memory
0_000.txt AC 1 ms 128 KB
0_001.txt AC 1 ms 128 KB
0_002.txt AC 1 ms 128 KB
1_003.txt AC 1 ms 128 KB
1_004.txt AC 1 ms 128 KB
1_005.txt AC 1 ms 128 KB
1_006.txt AC 1 ms 128 KB
1_007.txt AC 2 ms 128 KB
1_008.txt AC 1 ms 128 KB
1_009.txt AC 1 ms 128 KB
1_010.txt AC 1 ms 128 KB
1_011.txt AC 1 ms 128 KB
1_012.txt AC 2 ms 128 KB
1_013.txt AC 1 ms 128 KB
1_014.txt AC 1 ms 128 KB
1_015.txt AC 2 ms 128 KB
1_016.txt AC 1 ms 128 KB
1_017.txt AC 3 ms 128 KB
1_018.txt AC 3 ms 128 KB
1_019.txt AC 3 ms 128 KB
1_020.txt AC 3 ms 128 KB
1_021.txt AC 3 ms 128 KB
1_022.txt AC 3 ms 128 KB
1_023.txt AC 3 ms 128 KB
1_024.txt AC 3 ms 128 KB
1_025.txt AC 3 ms 128 KB
1_026.txt AC 3 ms 128 KB
1_027.txt AC 3 ms 128 KB
1_028.txt AC 3 ms 128 KB
1_029.txt AC 3 ms 128 KB
1_030.txt AC 3 ms 128 KB
1_031.txt AC 3 ms 128 KB
1_032.txt AC 3 ms 128 KB
1_033.txt AC 3 ms 128 KB
1_034.txt AC 3 ms 128 KB
1_035.txt AC 3 ms 128 KB