Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int Beolvas(int n)
- {
- do
- {
- cerr << "n=";
- cin >> n;
- }while (n < 0 || n > 366);
- return n;
- }
- int napok (int napoksz)
- {
- int db = 0;
- int vak = 0;
- for(int i = 0; i < napoksz; i++)
- {
- int nap;
- cin >> nap;
- switch (nap)
- {
- case 0: db += vak + 1 ;
- vak = 0;
- break;
- case 1: vak++;
- break;
- }
- if(vak == 7)
- return db;
- }
- }
- int main()
- {
- int n = Beolvas(n);
- cout<< endl
- << napok(n);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement