37 lines
565 B
C++
37 lines
565 B
C++
|
//G - <20>ĸﴺ<C4B8>紵<EFBFBD><E7B4B5><EFBFBD><EFBFBD>
|
|||
|
|
//https://vjudge.net/contest/508277#problem/G
|
|||
|
|
#include<iostream>
|
|||
|
|
#include<cstdio>
|
|||
|
|
#include<cmath>
|
|||
|
|
#include<algorithm>
|
|||
|
|
#include<cstring>
|
|||
|
|
using namespace std;
|
|||
|
|
const int N=101;
|
|||
|
|
double s;
|
|||
|
|
int n,i,j,tmp,e,m,t;
|
|||
|
|
struct dot
|
|||
|
|
{
|
|||
|
|
int x,y;//int->double
|
|||
|
|
} a[N];
|
|||
|
|
double cross(double x1,double y1,double x2,double y2)
|
|||
|
|
{
|
|||
|
|
// printf("(%d,%d)(%d,%d):%d\n",x1,y1,x2,y2,x1*y2-x2*y1) ;
|
|||
|
|
return x1*y2-x2*y1;
|
|||
|
|
}
|
|||
|
|
int gcd(int a,int b)
|
|||
|
|
{
|
|||
|
|
// if(a<b) swap(a,b);//0~
|
|||
|
|
while(b!=0)
|
|||
|
|
{
|
|||
|
|
tmp=a%b;
|
|||
|
|
a=b;
|
|||
|
|
b=tmp;
|
|||
|
|
}
|
|||
|
|
return a;
|
|||
|
|
}
|
|||
|
|
int main()
|
|||
|
|
{
|
|||
|
|
printf("%d",15556%0);
|
|||
|
|
return 0;
|
|||
|
|
}
|