Leetifyby Algorhythmicass
auto_awesomev0.1.3 · Submitted for review

Codeforces, redefined

Codeforces with a real editor built in

Install for Chromearrow_forwardSee it live

Analytics, notes, and coaching-style next steps.

Open the analytics panel for streaks, activity trends, and difficulty insights — plus suggested next difficulty, readiness, and topic depth. My Notes adds search, pins, and tag filters.

  • search

    My Notes search

    Find notes by text, problem name, contest ID, rating, or tag — in the sidebar or extension popup.

  • push_pin

    Pinned notes

    Star important notes so they stay at the top of your collection.

  • sell

    Tag filters & sorting

    Filter by topic tag and sort pinned-first, newest, oldest, or recently updated.

  • local_fire_department

    Solve streaks

    Track current and best streaks with a 28-day solve calendar plus weekly and monthly activity counts.

  • grid_on

    Activity heatmap

    GitHub-style solve density, weekly solve charts, per-week rating trends, tag activity, and activity insights.

  • bar_chart

    Difficulty distribution

    Rated-solve histogram with average rating and peak difficulty, plus comfort, growth, and stretch zones.

  • track_changes

    Suggested Next Difficulty

    Rating readiness and training plan, practice vs contest drift, coach summary, recommended problems, and topic depth by band.

Toggle Original vs Leetify — try the guided hints

format_align_leftClick Format to tidy messy code

A. Positive Sum

Newbie
800implementationmath
time limit per test: 2 secondsmemory limit per test: 256 megabytes

You are given t test cases. Each test case consists of an integer n, followed by n integers a₁, a₂, …, aₙ.

Determine whether the sum of all elements is strictly positive.

Input

The first line contains a single integer t (1 ≤ t ≤ 100) — the number of test cases.

Each test case consists of two lines. The first line contains an integer n (1 ≤ n ≤ 100). The second line contains n integers aᵢ (1 ≤ aᵢ ≤ 100).

Output

For each test case, print "Yes" if the sum of all elements is positive, and "No" otherwise. You can print each letter in any case.

Example 1
Input:
1
3
1 2 3
Output:
Yes
Example 2
Input:
1
1
5
Output:
Yes

Constraints

  • 1 ≤ t ≤ 100
  • 1 ≤ n ≤ 100
  • 1 ≤ aᵢ ≤ 100
#include<iostream>
using namespace std;
void solve(){
int n;cin>>n;
// messy spacing on purpose
cout<<"Yes"<<"
";
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;cin>>t;
while(t--)solve();
return 0;
}
221 chars · 15 linespowered by Leetify
INPUT
1
3
1 2 3

Benefits

Everything you need on one page

Built for contest flow — fewer tabs, less friction, faster submits.

view_sidebar

Split-pane flow

Statement and editor side by side — context never leaves the screen.

format_align_left

Format in one click

Tidy messy code before submit, client-side.

play_circle

Run samples inline

Hit Run, flip to results — no page reload dance.

palette

Themes that read well

Dark and light modes tuned for long contest nights.

Workflow

From install to AC in three steps

  1. 01

    Install

    Add Leetify from the Chrome Web Store — one click on any Codeforces problem.

  2. 02

    Open a problem

    The extension reshapes the page into a focused workspace automatically.

  3. 03

    Code, test, submit

    Format, run cases, add custom tests, and submit without leaving the pane.

Explore the interactive demosouth
#include<iostream>
using namespace std;
void solve(){
int n;cin>>n;
// messy spacing on purpose
cout<<"Yes"<<"
";
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;cin>>t;
while(t--)solve();
return 0;
}
221 chars · 15 linespowered by Leetify
INPUT
1
3
1 2 3

Ready to upgrade Codeforces?

Free Chrome extension. Works on problem pages — install once, compete with less friction.

Add to Chrome