Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define forn(l, r) for(int i = l; i < (r); ++i)
- #define forj(l, r) for(int j = l; j < (r); ++j)
- #define TAM 1000100
- #define SYNC ios::sync_with_stdio(0);
- #define $ << ' ' <<
- #define F first
- #define S second
- #define endl '\n'
- using namespace std;
- using ll = long long int;
- using ii = pair<int, int>;
- using vii = vector<ii>;
- using vi = vector<int>;
- using graph = vector<vi>;
- const int INF = 0x3f3f3f3f;
- const int MAXN = 112345;
- const ll mod = 1000000007;
- int main() {
- //SYNC
- string s;
- int total;
- vector<char> pts;
- vector<string> ans;
- stack<char> pilha;
- while(cin >> s) {
- total = 0;
- pts.clear();
- for (auto i : s) {
- if (i == '(' || i == ')') {
- pts.push_back(i);
- }
- }
- for (auto i : pts) {
- if (i == ')') total--;
- else total++;
- if (total < 0) break;
- }
- if (!total) ans.push_back("correct");
- else ans.push_back("incorrect");
- }
- for (auto i : ans) {
- cout << i << endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment