Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int main()
- {
- cout << "Tetelek 2!" << endl;
- const int maxmeret=3;
- float h[maxmeret];
- int n;
- char c;
- do
- {
- //beolvasas*************************************************************************
- bool hiba, vege;
- string s;
- n=0;
- cout <<"Kerem az adatokat: a vegen uss egy betut!\n";
- do
- {
- do
- {
- cout <<n+1<<". adat:";
- cin >>h[n];
- vege=cin.fail();
- if(!vege)
- {
- hiba=h[n]<-30 || h[n]>20;
- if(hiba)
- {
- cout <<"-30 es 20 kozotti szamot varok!\n";
- }else
- hiba=false;
- }
- cin.clear();
- getline(cin,s);
- }while(hiba);
- if(!vege)
- {
- n++;
- if(n==maxmeret){
- cout <<"Nem dolgozhato fel tobb adat";
- vege=true;
- }
- }
- }while(!vege);
- //kiiras*****************************************
- for(int i=0; i<n; ++i){
- cout <<"Adatok\n";
- cout <<i+1<<". adat"<<h[i];}
- //feladatok
- int db=0;
- float sum=0, atlag;
- for(int i=0; i<n; ++i)
- {
- if(h[i]<0)
- {
- sum=sum+h[i];
- db++;
- }if(db==0)
- {
- cout <<"Nem volt fagyos nap\n";
- }else atlag=sum/db;
- cout <<db<<"Fagyos nap\n";
- cout <<"Fagyos napok atlaga\n"<<atlag;
- }
- int van;
- for(int i=2; i<n-1 && h[i-1]>0 && h[i]<0 && h[i+1]<0; ++i)
- {
- i=+1;
- van=(i<=n-1);
- if(van)
- cout <<i;
- }
- do
- {
- cout <<"Kivanja ujra futtatni?(i/n)\n";
- cin>>c;
- c=tolower(c);
- }while(c!='i' && c!='n');
- }while(c=='i');
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement