Submission #1958288


Source Code Expand

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <ctime>

#define Rep(i, n) for (int i = 1; i <= n; i ++)
#define Rep0(i, n) for (int i = 0; i <= n; i ++)
#define RepG(i, x) for (int i = head[x]; i; i = edge[i].next)
#define v edge[i].to
#define mp(a, b) make_pair(a, b)

using namespace std;

typedef long long LL;
const int N = 210;
const int mod = 998244353;

int x[N], y[N];
bool vis[N];

LL qpow(LL a, LL b)
{
	LL ret = 1, base = a;
	while (b) {
		if (b & 1) ret = ret * base % mod;
		base = base * base % mod, b >>= 1;
	}
	return ret;
}

int main()
{
	int n;
	scanf("%d", &n);
	Rep(i, n)scanf("%d%d", &x[i], &y[i]);
	
	LL ans = qpow(2, n);
	Rep(i, n) Rep(j, n) if (i != j){
		int cnt = 2;
		Rep(k, n) if (k != i && k != j)
			if ((y[j] - y[i]) * (x[k] - x[i]) == (y[k] - y[i]) * (x[j] - x[i])) cnt ++;
		LL tmp = (qpow(2, cnt) - 1 - cnt + mod) % mod;
		ans = (ans - tmp * qpow(cnt * (cnt - 1), mod - 2) % mod + mod) % mod;
		//printf("%lld %d\n", tmp, cnt * (cnt - 1));
	}
	
	ans = (ans - n - 1 + mod) % mod;
	printf("%lld\n", ans);
	
	
	return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:34:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:35:38: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  Rep(i, n)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 8 ms 128 KB
1_006.txt AC 1 ms 128 KB
1_007.txt AC 14 ms 128 KB
1_008.txt AC 10 ms 128 KB
1_009.txt AC 11 ms 128 KB
1_010.txt AC 3 ms 128 KB
1_011.txt AC 12 ms 128 KB
1_012.txt AC 14 ms 128 KB
1_013.txt AC 9 ms 128 KB
1_014.txt AC 1 ms 128 KB
1_015.txt AC 15 ms 128 KB
1_016.txt AC 6 ms 128 KB
1_017.txt AC 25 ms 128 KB
1_018.txt AC 25 ms 128 KB
1_019.txt AC 26 ms 128 KB
1_020.txt AC 26 ms 128 KB
1_021.txt AC 26 ms 128 KB
1_022.txt AC 25 ms 128 KB
1_023.txt AC 25 ms 128 KB
1_024.txt AC 25 ms 128 KB
1_025.txt AC 25 ms 128 KB
1_026.txt AC 25 ms 128 KB
1_027.txt AC 26 ms 128 KB
1_028.txt AC 26 ms 128 KB
1_029.txt AC 25 ms 128 KB
1_030.txt AC 26 ms 128 KB
1_031.txt AC 26 ms 128 KB
1_032.txt AC 25 ms 128 KB
1_033.txt AC 25 ms 128 KB
1_034.txt AC 25 ms 128 KB
1_035.txt AC 26 ms 128 KB