Submission #1733567


Source Code Expand

#include<cstdio>
#include<algorithm>
#define fo(i,a,b) for(i=a;i<=b;i++)
using namespace std;
typedef long long ll;
typedef double db;
const int maxn=200+10,mo=998244353;
const db eps=1e-6;
int two[maxn],x[maxn],y[maxn];
int i,j,k,l,t,n,m,ans;
bool check(int i,int j,int k){
	if ((y[j]-y[i])*(x[k]-x[i])==(y[k]-y[i])*(x[j]-x[i])) return 1;else return 0;
}
int main(){
	scanf("%d",&n);
	two[0]=1;
	fo(i,1,n) two[i]=(ll)two[i-1]*2%mo;
	fo(i,1,n) scanf("%d%d",&x[i],&y[i]);
	ans=(two[n]-n-1)%mo;
	fo(i,1,n-1)
		fo(j,i+1,n){
			t=0;
			fo(k,j+1,n)
				if (check(i,j,k)) t++;
			(ans-=two[t])%=mo;
		}
	(ans+=mo)%=mo;
	printf("%d\n",ans);
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:15:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:18:37: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  fo(i,1,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 0 ms 128 KB
1_003.txt AC 1 ms 128 KB
1_004.txt AC 0 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