Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Example program
- #include <iostream>
- #include <string>
- #include <stdint.h> //DO ZADANIA 3 int8_t
- #include <cmath>
- #define FLT_EPSILON 1.19209290E-07F // do 9zadania
- using namespace std;
- int main()
- {
- /*
- //zad 1
- double a,b;
- cin>>a>>b;
- cout<<"a= wartosc_"<<a<<" b= wartosc_"<<b;
- double pom=a;
- a=b;
- b=pom;
- cout<<"\na= wartosc_"<<a<<" b= wartosc_"<<b;
- //zad2
- const int a;
- //zad3
- int8_t a,b;
- cin>>a>>b;
- cout<<a<<b;
- //zad4
- double a,b;
- cin>>a>>b;
- double iloraz;
- iloraz=a/b;
- cout<<endl<<iloraz<<endl;
- //zad 5
- int a,b;
- cin>>a>>b;
- double c = sqrt(pow(a,2)+pow(b,2));
- cout<<c;
- //zad6
- int a;
- cin>>a;
- double pole = 6*(pow(a,2)*sqrt(3))/4;
- cout<<pole;
- //zad 7
- int n; //ilosc wierzcholkow
- cin>>n;
- double x[n];
- double y[n];
- double d=0;
- for(int i=0;i<n;i++){
- cin>>x[i]>>y[i];
- }
- for(int i=0;i<n-1;i++){
- d=d+(sqrt(pow(x[i+1]-x[i],2)+pow(y[i+1]-y[i],2)));
- cout<<d<<endl;
- }
- d=d+(sqrt(pow(x[n]-x[0],2)+pow(y[n]-y[0],2)));
- cout<<d<<endl;
- //zad 8
- int a,b;
- cin>>a>>b;
- a++;
- b++;
- cout<<a*b-1;
- //zad 10
- bool a = false;
- bool b = false;
- if( (a+b) == true){
- cout<<true;
- }else{
- cout<<false;
- }
- //zad 9
- float a,b,c,d,e;
- double pierwsza, druga;
- char x;
- cin>>a>>x>>b;
- pierwsza = a/b;
- cin>>c>>x>>d>>x>>e;
- druga = c-(d/e);
- cout<<pierwsza<<endl;
- cout<<druga<<endl;
- // printf("%d\n",&pierwsza);
- // printf("%d\n",&druga);
- if(abs(pierwsza-druga) < FLT_EPSILON ){
- cout<<"Sa takie same"<<endl;
- }else{
- cout<<"Nie sa"<<endl;
- }
- //zad 10 i 11
- bool a = false;
- bool b = false;
- if( (a+b) == true){
- cout<<"true";
- }else{
- cout<<"false";
- }
- (a+b)? (ture) : (false);
- */
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement