Submission #1752884
Source Code Expand
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define forE(i,x) for(int i=head[x];i!=-1;i=ne[i])
using namespace std;
typedef long long i64;
typedef unsigned long long u64;
typedef unsigned u32;
typedef pair<int,int> pin;
#define mk(a,b) make_pair(a,b)
#define lowbit(x) ((x)&(-(x)))
#define sqr(a) ((a)*(a))
#define clr(a) (memset((a),0,sizeof(a)))
#define ls ((x)<<1)
#define rs (((x)<<1)|1)
#define mid (((l)+(r))>>1)
#define pb push_back
#define w1 first
#define w2 second
inline void read(int &x){
x=0;int f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
x*=f;
}
inline void judge(){
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
}
/*******************************head*******************************/
const int maxn=205;
struct Point{
int x,y;
inline Point(int _x,int _y){x=_x;y=_y;}
inline Point(){}
inline void init(){
read(x);read(y);
}
}p[maxn];
inline Point operator + (const Point &a,const Point &b){
return Point(a.x+b.x,a.y+b.y);
}
inline Point operator - (const Point &a,const Point &b){
return Point(a.x-b.x,a.y-b.y);
}
inline int cross(const Point &a,const Point &b){
return a.x*b.y-a.y*b.x;
}
int n;
const int mod=998244353;
int main(){
read(n);
rep(i,1,n)p[i].init();
i64 ans=1;
rep(i,1,n)ans=2ll*ans%mod;
ans=(ans-n+mod)%mod;
ans=(ans-1+mod)%mod;
rep(i,1,n)rep(j,1,i-1){
int sub=1;
rep(k,1,j-1){
if(cross(p[k]-p[i],p[j]-p[i])==0)sub=2*sub%mod;
}
ans=(ans-sub+mod)%mod;
}
printf("%d\n",ans);
return 0;
}
Submission Info
Submission Time
2017-11-08 16:04:27+0900
Task
E - ConvexScore
User
Scape
Language
C++14 (GCC 5.4.1)
Score
700
Code Size
1688 Byte
Status
AC
Exec Time
7 ms
Memory
256 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:65:19: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘i64 {aka long long int}’ [-Wformat=]
printf("%d\n",ans);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
700 / 700
Status
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
256 KB
0_001.txt
AC
1 ms
256 KB
0_002.txt
AC
1 ms
256 KB
1_003.txt
AC
1 ms
256 KB
1_004.txt
AC
1 ms
256 KB
1_005.txt
AC
2 ms
256 KB
1_006.txt
AC
1 ms
256 KB
1_007.txt
AC
2 ms
256 KB
1_008.txt
AC
2 ms
256 KB
1_009.txt
AC
2 ms
256 KB
1_010.txt
AC
1 ms
256 KB
1_011.txt
AC
2 ms
256 KB
1_012.txt
AC
2 ms
256 KB
1_013.txt
AC
2 ms
256 KB
1_014.txt
AC
1 ms
256 KB
1_015.txt
AC
4 ms
256 KB
1_016.txt
AC
2 ms
256 KB
1_017.txt
AC
3 ms
256 KB
1_018.txt
AC
3 ms
256 KB
1_019.txt
AC
3 ms
256 KB
1_020.txt
AC
3 ms
256 KB
1_021.txt
AC
3 ms
256 KB
1_022.txt
AC
3 ms
256 KB
1_023.txt
AC
3 ms
256 KB
1_024.txt
AC
3 ms
256 KB
1_025.txt
AC
3 ms
256 KB
1_026.txt
AC
3 ms
256 KB
1_027.txt
AC
7 ms
256 KB
1_028.txt
AC
7 ms
256 KB
1_029.txt
AC
3 ms
256 KB
1_030.txt
AC
3 ms
256 KB
1_031.txt
AC
3 ms
256 KB
1_032.txt
AC
3 ms
256 KB
1_033.txt
AC
3 ms
256 KB
1_034.txt
AC
3 ms
256 KB
1_035.txt
AC
3 ms
256 KB