Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #include <fstream>
- using namespace std;
- ifstream in("cercuri.in");
- //team 1 problema algoritm clasic + alg probabilist+alg de aproximare+ algoritm aprox pt problema detet cercului in care sa se afle un punct din n puncte date
- // 2 acelasi dr pt problema detet pct nemo
- // provocare scrietii functii pt sin cos tg ctg log radical exponent(ca alg de aproximare) si masurati eficienta
- //sugestii formula lui taylor
- //tibisicadu@gmail.com
- // @yahoo.com
- int n,k;
- struct punct
- {
- int x,y;
- }p[100];
- void citire(punct p[100],int &n,int &k)
- {
- in>>n>>k;
- for(int i=1;i<=n;i++)
- {
- in>>p.x;
- in>>p.y;
- }
- }
- void rezolvare(int )
- int main()
- {
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement