Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- bool prost(int n)
- {
- for (int i=2; i<n; i++)
- if (n%i==0)
- return false;
- return true;
- }
- int koji_prosti(int n)
- {
- int s = 4;
- for (int i=6; i<n; i++)
- if (prost(i)==true)
- s++;
- return s;
- }
- main()
- {
- int n, k[1000], m[1000], ivica=0, haso=0;
- cin >> n;
- for (int i=0; i<n; i++)
- {
- cin >> k[i] >> m[i];
- if (koji_prosti(m[i])==k[i])
- ivica++;
- }
- for (int i=0; i<n; i++)
- {
- cin >> k[i] >> m[i];
- if (koji_prosti(m[i])==k[i])
- haso++;
- }
- // cout << ivica << ":" << haso << endl;
- if (ivica>haso)
- cout << "Ivica";
- else if (haso>ivica)
- cout << "Haso";
- else
- cout << "Nerijeseno";
- cout << endl;
- system("PAUSE");
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement