Why getting wa?

general
1

(EQUINOX Problem - CodeChef)
(CodeChef: Practical coding for everyone)

2

You are submitting the code for a different question. Please check the question before submitting bro. :joy:

1 Like
3

WTF! :laughing: this code is for diffrent question :joy: :joy: :joy: :rofl: :rofl: :rofl:

4

sorry wrong question added in hurry

5

anyone help where i am wrong?

6

The problem is after traversing every string you have to make the flag false again you should declare the flag inside the first loop or make the flag false again inside both are same.

Correct code` #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
//using namespace __gnu_pbds;

#define ll long long int
#define boost ios::sync_with_stdio(false); cin.tie(0)
#define f(i,a,b) for(int i=a;i<b;i++)
#define fd(i,a,b) for(i=a-1;i>=b;i–)
#define rep(i,n) f(i,0,n)
#define pb push_back
#define mp make_pair
#define vi vector< int >
#define vl vector< ll >
#define ss second
#define ff first
#define pii pair< int,int >
#define pll pair< ll,ll >
#define sz(a) a.size()
#define inf (100010001000+5)
#define all(a) a.begin(),a.end()
#define tri pair<int,pii>
#define tri2 pair<pii,int>
#define vii vector
#define vll vector
#define viii vector
#define viii2 vector
#define umapi unordered_map<int,int>
#define mapi map<int,int>
#define useti unordered_set
#define seti set
#define pqueue priority_queue< int >
#define pdqueue priority_queue< int,vi ,greater< int > >
#define coutp(i) cout << fixed << setprecision(i)
#define ordered_set tree<int, null_type,less, rb_tree_tag,tree_order_statistics_node_update>
#define endl “\n”
void solve(){
string s;
string s1=“EQUINOX”;
ll n,p1,p2;
cin>>n>>p1>>p2;
ll cnt1 = 0,cnt2 = 0;
for(int i = 0;i<n;i++)
{
cin>>s;
bool flag = false;

    for(int j = 0;j<s1.length();j++)
    {
      if(s[0]==s1[j]){
        //   cout<<s[0]<<s[j]<<endl;
          cnt1+=p1;
          flag = true;
          break;
      }
    }
    if(!flag){
      cnt2+=p2; 
      flag = false;
    } 
}
// cout<<cnt1<<" "<<cnt2<<endl;
if(cnt1>cnt2) cout<<"SARTHAK"<<endl;
else if(cnt1<cnt2) cout<<"ANURADHA"<<endl;
else cout<<"DRAW"<<endl;

}
main()
{
ll t;
cin>>t;
while(t–)
{
solve();
}
}`