1246:: Tethered Dog

Odg: 1246:: Tethered Dog

by Deleted user -
Number of replies: 0

Moja rešitev :

 

#include<stdio.h>
#include<stdlib.h>
using namespace std;
int n;
int x[200005];
int y[200005];

int main(){
    scanf("%d",&n);
    for (int i=0;i<n;i++){
        scanf("%d %d",&x[i],&y[i]);
        }
    long long a=0;  
    for (int i=0;i<n;i++){
        a=a+(long long)x[i]*y[(i+1)%n]-(long long)x[(i+1)%n]*y[i];
        }
    if (a>0) printf("ccw\n"); else printf("cw\n");
    return 0;
    }