kingofworls's blog

By kingofworls, history, 4 months ago, In English

https://codeforces.net/problemset/problem/749/A i did understood the question that we need to find the sum of primes that is equal to n and count of those primes but am not able to get the logic how to do it can anyone help me .. with the logic part

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

By kingofworls, history, 4 months ago, In English

link to the problem https://codeforces.net/contest/1915/problem/E

my code

include <bits/stdc++.h>

using namespace std;

define int long long

signed main() { int t; cin >> t; while (t--) { int n; cin >> n; std::vector a(n+1);

unordered_map<int, int> sum_map;
    sum_map[0] = 1;  
    bool flag=false;
    int sum=0;

    for(int i = 1; i <= n; i++){
      cin >> a[i];
      if(i%2==0){
          a[i]=-a[i];
      }
      sum=sum+a[i];
      sum_map[sum]++;
      if(sum_map[sum]>1){
        flag =true;
        break;
      }
    }

    if(flag){
        cout << "YES\n";
    } else {
        cout << "NO\n";
    }
}

} why is tle coming in this and one more question when i am using the break in ok=true there as its been done why is still false coming ???? please help me

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

By kingofworls, history, 5 months ago, In English

as i have seen when ever the matrix or pattern problems comes i am able to understand it but i am not able to apply or think of any logic can anyone suggest me what should i do.... or if i can learn things please do recommand me.....

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it