Count number of integral points in a polygon.
Its simple GCD problem.
#include<bits/stdc++.h> using namespace std; int main() { for (int i =0 ; i < n ;i ++) cout << i << " gsdgs " << " yo " << << endl; }
This gives gcd solution.
Login before adding your answer.