source_code stringlengths 26 62k | lang_cluster stringclasses 11
values | src_uid stringlengths 32 32 | code_uid stringlengths 32 32 | difficulty int32 -1 3.5k ⌀ | exec_outcome stringclasses 1
value |
|---|---|---|---|---|---|
#include<bits/stdc++.h>
#define int long long
using namespace std;
int a[1000000];
int D[1000000];
signed main(){
int z;
int n;
cin>>z;
for(int t=1;t<=z;t++){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
int ans=0;
int cur=a[1];
for(int i=2;i<=n;i++){
ans+=abs(a[i]-a[i-1]);
if(... | C++ | f54c1448a279e59f96847a158f993101 | 3be57befd42e7cecae8c33d85849950d | 1,700 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<unordered_map>
#include<queue>
#define moonoom std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define ll long long
#define endl '\n'
#define ull unsigned long long
#de... | C++ | f54c1448a279e59f96847a158f993101 | ffe034e5bbf55ead2159abc22804db68 | 1,700 | PASSED |
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
long long a[200005],i,j,n,T,ans,mins;
int main()
{
cin>>T;
for(i=1;i<=T;i++)
{
cin>>n;
ans=0;
mins=2147483647;
a[0]=0;
for(j=1;j<=n;j++)scanf("%lld",&a[j]);
for(j=0;j<=n;j++)a[j]=a[j]-a[j+1];
for(j=1;j<n;j++)
{
... | C++ | f54c1448a279e59f96847a158f993101 | dd42c2b5e1da6bd62ade12141c4744dd | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char c = getchar();
while(c < '0' || c > '9') {
if(c == '-') f = -1;
c = getchar();
}
while(c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
return x*f;
}
const int MAXN = 2e5+5;
int n, ... | C++ | f54c1448a279e59f96847a158f993101 | d8829fb2639fadef8ac826b763185df6 | 1,700 | PASSED |
#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int MAXN=1e6+100;
char ch[MAXN];
int dat[MAXN];
int main()
{
int a=0;
int T;scanf("%d",&T);
while(T--)
{
int n;scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&dat[i]);
LL pos=dat[1],delt=0,ans=0;
for(int i=2;i<=n... | C++ | f54c1448a279e59f96847a158f993101 | 80c50c5e89a0d1ecc4e4f42c4c9a8b27 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int a[200010];
long long ans,c,b;
int main()
{
int t,n;
scanf("%d",&t);
while(t--)
{
ans=0;
scanf("%d",&n);
for(int i=1;i<=n;++i)
{
scanf("%d",&a[i]);
}
c=a[1];
for(int i=2;i<=n;++i)
{
b=a[i-1]-a[i];
ans+=abs(b);
if(b>0)
... | C++ | f54c1448a279e59f96847a158f993101 | 970fa04889af947e5d3b6fc6737b8b74 | 1,700 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=(int)(2e5+5),inf=(int)(2e18);
int n,a[N],mx1[N],mx2[N],f1[N],f2[N],sum[N];
void solve() {
cin>>n; for(int i=1;i<=n;i++) cin>>a[i];
int res1=0,res2=0;
for(int i=2;i<=n;i++) {
int d=a[i]-a[i-1];
if(d<0) res1-=d; else res2+=... | C++ | f54c1448a279e59f96847a158f993101 | dc2843621552b4c676f26308d4c998f7 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+10;
int a[N];
int cha[N];
void solve(){
int n;
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
ll ans=0;
ll now=a[1];
ll tt=a[1];
for(int i=2;i<=n;i++){
if(now>=a[i]) {
ans+=(ll)now-a[i];
tt-=now-(ll)a... | C++ | f54c1448a279e59f96847a158f993101 | dd84db933945d7ca225429c4bc452854 | 1,700 | PASSED |
#include<stdio.h>
int main()
{
int c = 0, i = 0, n = 0, m = 0;
while (scanf("%d", &c) != EOF)
{
for (i = 1; i <= c; i++)
{
int t = 0, p = 0;
long long int add = 0;
scanf_s("%d %d", &m, &n);
for (t = 1; t <= n; t++)
{
add += t;
}
for (p = 2; p <= m; p++)
{
add += n * p;
}
pri... | C++ | 7d774a003d2e3e8ae6fe1912b3998c96 | 0c8bb44e807b91d93473634fa2ca965a | 800 | PASSED |
/*
⣿⣿⣿⣿⣿⣿⡷⣯⢿⣿⣷⣻⢯⣿⡽⣻⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣇⠸⣿⣿⣆⠹⣿⣿⢾⣟⣯⣿⣿⣿⣿⣿⣿⣽⣻⣿⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣻⣽⡿⣿⣎⠙⣿⣞⣷⡌⢻⣟⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣿⣿⣿⣿⣿⣿⡄⠹⣿⣿⡆⠻⣿⣟⣯⡿⣽⡿⣿⣿⣿⣿⣽⡷⣯⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣟⣷⣿⣿⣿⡀⠹⣟⣾⣟⣆⠹⣯⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇⢠⡘⣿⣿⡄⠉⢿⣿⣽⡷⣿⣻⣿⣿⣿⣿⡝⣷⣯⢿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣯⢿⣾⢿⣿⡄⢄⠘⢿⣞⡿⣧⡈⢷⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇⢸⣧⠘⣿⣷⠈⣦⠙⢿⣽⣷⣻⣽⣿⣿⣿⣿⣌⢿⣯⢿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣟⣯⣿⢿⣿⡆⢸⡷⡈⢻⡽⣷⡷⡄⠻⣽⣿⣿⡿⣿⣿⣿⣿⣿⣿⣷⣿⣿⣿⣿⣏⢰⣯⢷⠈⣿⡆⢹⢷⡌⠻⡾⢋⣱⣯⣿⣿⣿⣿⡆⢻⡿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⡎... | C++ | 7d774a003d2e3e8ae6fe1912b3998c96 | 85c4a44209031dea70f87fd317cbdca4 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n,m;
cin>>n>>m;
long long ans=0;
for(int i=1;i<=m;i++)
ans+=i;
for(long long i=m*2;i<=m*n;i+=m)
{
ans+=i;
}
cout<<ans<<endl;
}
return 0;
}
| C++ | 7d774a003d2e3e8ae6fe1912b3998c96 | 8a118724d4d062fe414f3cbcba51813e | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n,m;
cin>>n>>m;
long long ans=0;
int i=1,j=1;
for(j=1;j<=m;j++)
{
ans+=(i-1)*m+j;
}
j--;
for(i=1;i<=n;i++)
{
ans+=(i-1)*m+j;
}
i--;
cout<<ans-((1-1)*m+m)<<endl;
}
return 0;
... | C++ | 7d774a003d2e3e8ae6fe1912b3998c96 | 991a5d13a83b849b9f294d90e22867ae | 800 | PASSED |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
for(int i = 1; i <= t; i++)
{
long long n,m;
cin >> n >> m;
cout << (m-1)*m/2 + (n+1)*n/2*m << '\n';
}
return 0;
}
| C++ | 7d774a003d2e3e8ae6fe1912b3998c96 | 54faac2a81eca1748d3e5f205d257f37 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main ()
{
ll t;
cin >> t;
while(t-- ) {
ll n_1, m_1,ans;
cin >> n_1 >> m_1;
ans = (m_1*(m_1-1)) / 2;
ans += m_1* ((n_1* (n_1+1)) /2);
cout << ans << "\n";
}
return 0;
}
... | C++ | 7d774a003d2e3e8ae6fe1912b3998c96 | bbad1ba28877bace8fe5bf1dfe673f6e | 800 | PASSED |
/**
* @Author: Hideonbush
* @LastEditTime: 2022-08-12 09:14:26
* @Description: You guys, are the real heroes.
* @Copyright © 2022 Zhanbaoxin: All rights reserved.
*/
#include<bits/stdc++.h>
// #define int long long
#define endl '\n'
#define first ff
#define second ss
#define no puts("No")
#define yes... | C++ | 7d774a003d2e3e8ae6fe1912b3998c96 | 82da6d7a0423e06f00f7dcd7eb34f2ae | 800 | PASSED |
#include <iostream>
#include <cstdlib>
using namespace std;
int t; // < 1000
int n,m; // < 10000
int main() {
cin >> t;
for (int i = 0; i < t; i++) {
cin >> n >> m;
long long s = 0;
for (int j = 1; j <= m; ++j) {
s += j;
}
for (int j = 2; j <= n;... | C++ | 7d774a003d2e3e8ae6fe1912b3998c96 | 592917403687978ca7f6d7dbb0a624c9 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >> t;
while(t--){
long long m,n;
cin >> n >> m;
cout << (m*(m+1))/2 + m*((n*(n+1))/2) - m << endl;
}
return 0;
}
| C++ | 7d774a003d2e3e8ae6fe1912b3998c96 | 9601ab139cef7dec8a6a0a0b3dd054c2 | 800 | PASSED |
#include <stdio.h>
#include <stdlib.h>
int main()
{
int n,m;
int i,j;
long long int count = 0;
int k=0;
long long int sum = 0;
int sample;
long long int result[10000];
while (scanf("%d",&sample) != EOF)
{
for (k=0;k<sample;k++)
{
scanf("%d %d",&n,&m);
///int **cost = (int... | C++ | 7d774a003d2e3e8ae6fe1912b3998c96 | 0363a77f9a095cbff585a642999e6a95 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
bool palindrome(long long n)
{
string s = to_string(n);
for(int i = 0 ; i < s.size() / 2; i++)
{
if(s[i] != s[s.size()- i -1])return false;
}
return true;
}
int main()
{
ios_base::sync_with_stdio... | C++ | d3c3bc95605010040e2018e465eb9fab | 2ff79adeb63dba0301f41bd6fd0dc19c | 1,100 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
const double esp=1e-7;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int t;
cin>>t;
while(t--){
ll n;
cin>>n;
cin.ignore();
string y="9";
... | C++ | d3c3bc95605010040e2018e465eb9fab | 6bf6d79c2ae6a7ee53e6a2ca8507ef34 | 1,100 | PASSED |
#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
const int N = 100010;
int t, n;
char s[N];
int main()
{
cin >> t;
while (t--)
{
cin >> n >> s;
if (s[0] != '9')
{
for (int i = 0; i < n; i++)
s[i] = ('9' - s[i]) + '0';
}
//如果第一位为9，用n+1位的1来减
else
... | C++ | d3c3bc95605010040e2018e465eb9fab | 9aee122d75dc95eca2ae225945e9556e | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N = 100005;
char s[N];
void solve()
{
int n;
cin >> n >> s;
if (s[0] < '9')
for (int i = 0; i < n; i++)
s[i] = ('9' - s[i]) + '0';
else
{
int p=0;
for (int i = n-1; i >= 0; i--)
{
... | C++ | d3c3bc95605010040e2018e465eb9fab | 3eeec3cb2d079aad7ecbae6d3e8d5411 | 1,100 | PASSED |
#include <bits/stdc++.h>
#define fi first
#define se second
#define int long long
#define pb push_back
#define yes cout<<"YES"
#define no cout << "NO"
using namespace std;
void f(){
int n;
cin >> n;
vector<int>a(n + 1);
for(int i =1 ;i <= n;i++){
char t;
cin >> t;
... | C++ | d3c3bc95605010040e2018e465eb9fab | 362f25b734294aed4c74a3cc92108d22 | 1,100 | PASSED |
// Problem link: https://codeforces.com/problemset/problem/1700/B
// Author: Nada Mohammed
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while(t--) {
int length = 0;
string num;
cin ... | C++ | d3c3bc95605010040e2018e465eb9fab | 74042ea130ea3899a1438ac89f3fffda | 1,100 | PASSED |
// Problem link: https://codeforces.com/problemset/problem/1700/B
// Author: Nada Mohammed
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while(t--) {
int length = 0;
string num;
cin ... | C++ | d3c3bc95605010040e2018e465eb9fab | 8ffdd54a19bef12d2497bb9325af6798 | 1,100 | PASSED |
// Problem link: https://codeforces.com/problemset/problem/1700/B
// Author: Nada Mohammed
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while(t--) {
int length = 0;
string num;
cin ... | C++ | d3c3bc95605010040e2018e465eb9fab | 14d4a4cd3a8f6589c54a793e45257ba3 | 1,100 | PASSED |
// Problem link: https://codeforces.com/problemset/problem/1700/B
// Author: Nada Mohammed
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while(t--) {
int length = 0;
string num;
cin ... | C++ | d3c3bc95605010040e2018e465eb9fab | 9ffd92b04aa3141cea4ab692663e70b0 | 1,100 | PASSED |
#include <bits/stdc++.h>
#define USACO freopen("angry.in", "r", stdin); freopen("angry.out", "w+", stdout);
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
string dif(string s1, string s2)
{
string d = "";
bool c = 0;
while(s2.size() < s1.size())
{
s2.insert(s2... | C++ | d3c3bc95605010040e2018e465eb9fab | 8e9b93d6f6b773f658d7c843ed740854 | 1,100 | PASSED |
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
/*
__ __ _ _ ____ _
| \/ | ___ | |__ __ _ _ __ ___ ___ __| | | __ ) __ _| | ___ __
| |\/| |/ _ \| '_ \ / _` | '_ ` _ \ / _ \/ _` | | _ \... | C# | f9902b3fbf2fad9eb1b5969dd645c328 | 75e8a465c361181932b11688203f8003 | 2,600 | PASSED |
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
/*
__ __ _ _ ____ _
| \/ | ___ | |__ __ _ _ __ ___ ___ __| | | __ ) __ _| | ___ __
| |\/| |/ _ \| '_ \ / _` | '_ ` _ \ / _ \/ _` | | _ \... | C# | f9902b3fbf2fad9eb1b5969dd645c328 | cdce04dff65b10cfb503ca192749ce6c | 2,600 | PASSED |
#include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <bitset>
using namespace std;
bool Sgn(int x) {
if(x < 0)
return -1;
return 1;
}
void TestCase() {
int n; scanf("%d", &n);
vector<vector<vector<int>>>grid(2, vector<vector<int>>(... | C++ | f9902b3fbf2fad9eb1b5969dd645c328 | 32fbfd24e006691fab270b4155f8e221 | 2,600 | PASSED |
#include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <bitset>
using namespace std;
const long long inf = 1ll << 60;
int D(int a, int b) {
if(a % 2 == b % 2)
return abs(a / 2 - b / 2);
return abs(a / 2 - b / 2) + 1;
}
void TestCase() {
... | C++ | f9902b3fbf2fad9eb1b5969dd645c328 | af43e6606b936f24ce950eb0bfe3fcd3 | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MAX_N = 200000;
int n;
vector<int> a0(MAX_N), a1(MAX_N), b0(MAX_N), b1(MAX_N);
ll dp(int i) {
if (i >= n) return 0;
if (a0[i] + a1[i] < b0[i] + b1[i]) swap(a0, b0), swap(a1, b1);
ll ans = 0;
int one = 0, two = 0;
for (; i < n; ++... | C++ | f9902b3fbf2fad9eb1b5969dd645c328 | bfd893c25cd672b30be6be5d512c749d | 2,600 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
#define null_awe NULL
const int MAX_N = 200000;
int n;
vector<int> a0(MAX_N), a1(MAX_N), b0(MAX_N), b1(MAX_N);
ll dp(int i) {
if (i >= n) return 0;
if (a0[i] + a1[i] < b0[i] + b1[i]) swap(a0, b0), swap(a1, b1);
... | C++ | f9902b3fbf2fad9eb1b5969dd645c328 | 43fffe4cd62e4405b15edfc1a078950e | 2,600 | PASSED |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<numeric>
#include<vector>
#include<set>
#include<map>
#include<deque>
#include<iomanip>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;... | C++ | f9902b3fbf2fad9eb1b5969dd645c328 | 5c5e7da3ba73e541b861b136096375df | 2,600 | PASSED |
#include <locale.h>
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <iterator>
#include <sstream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <stack>
#include <random>
#include <ctime>
#include <queue>
#include <set>
using na... | C++ | f9902b3fbf2fad9eb1b5969dd645c328 | 4cf6f0a735ba61c2abc8d2e468d27f8f | 2,600 | PASSED |
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
long long a[3][200002],b[3][200002],n,pre[5][200002];
int main()
{
int suma=0,sumb=0;
scanf("%lld",&n);
for(int j=1;j<=2;j++)
for(int i=1;i<=n;i++)
scanf("%lld",&a[j][i]),suma+=a[j][i];
for(int j=1;j<=2;j++)
for(int i=1;i<=n;i++)
sca... | C++ | f9902b3fbf2fad9eb1b5969dd645c328 | 1869bdd5314dc1721ba01c0acebe081c | 2,600 | PASSED |
#include <iostream>
using namespace std;
const int maxN = 2e5;
long long ans, N, x[4][maxN], d1, d2;
int main(){
cin >> N;
for (int i = 0; i < 4; ++i)
for (int j = 0; j < N; ++j)
cin >> x[i][j];
ans = d1 = d2 = 0;
for (int i = 0; i < N; ++i) {
d1 += x[0][i] - x[2][i];
d2 += x[... | C++ | f9902b3fbf2fad9eb1b5969dd645c328 | e3a90073882e0733582ce4b8c4a3a550 | 2,600 | PASSED |
import sys
input = sys.stdin.readline
n = int(input())
vs = list(map(int, input().split(' ')))
vs2 = vs[:]
max_vs2 = vs2[0]
for i in range(1, n):
vs2[i] += vs2[i - 1]
max_vs2 = max(max_vs2, vs2[i] / (i + 1))
q = int(input())
for _ in range(q):
t = int(input())
if t < max_vs2:
print(... | Python | d7361a43bff124cea280ae8817b807ec | 6c8ed2db513763427ce12d51eb684574 | 1,900 | PASSED |
import sys
input = sys.stdin.readline
n = int(input())
vs = list(map(int, input().split()))
max_vs = vs[0]
for i in range(1, n):
vs[i] += vs[i - 1]
max_vs = max(max_vs, vs[i] / (i + 1))
q = int(input())
for _ in range(q):
t = int(input())
if t < max_vs:
print(-1)
else:
... | Python | d7361a43bff124cea280ae8817b807ec | dc3c7ab164478c2dec1b3b3ad5a1a61a | 1,900 | PASSED |
def binary_left_bound(lst,key):
l = -1
r = len(lst)
while r - l != 1:
m = (l+r) // 2
if key >= lst[m]:
r = m
else:
l = m
if r == len(lst):
return - 1
else:
return r + 1
n = int(input())
v = list(map(int,input().split()... | Python | d7361a43bff124cea280ae8817b807ec | e357c191bfc0adc6a45fb92a952b338e | 1,900 | PASSED |
import atexit,io,os,sys
ss=io.BytesIO()
_write=ss.write
ss.write=lambda s:_write(s.encode())
atexit.register(lambda:os.write(1,ss.getvalue()))
y_in=open(0).read().split("\n")
def y_inf():
for y_id in range(len(y_in)):
yield y_id
y_ino=y_inf()
input=lambda:y_in[next(y_ino)]
n = int(input())
a =... | Python | d7361a43bff124cea280ae8817b807ec | acecd5cf961cb53d1a30b8d7fd5820b9 | 1,900 | PASSED |
import sys
input=sys.stdin.readline
# input=lambda:sys.stdin.readline().rstrip("\r\n")
n = int(input())
a = [0] + list(map(int, input().split()))
for i in range(2, n + 1):
a[i] += a[i - 1]
f = [0] * int(1e6)
res = 0
for i in range(1, n + 1):
res = max(res, (a[i] + i - 1) // i)
f[i] = max(res, (... | Python | d7361a43bff124cea280ae8817b807ec | aebeb5016f774efaf6f5aeb8f7f1df18 | 1,900 | PASSED |
import os,sys
from io import BytesIO,IOBase
BUFSIZ=8192
class FastIO(IOBase):
newlines=0
def __init__(self,file):
self._fd=file.fileno()
self.buffer=BytesIO()
self.writable="n"in file.mode or "r" not in file.mode
self.write=self.buffer.write if self.writable else None
... | Python | d7361a43bff124cea280ae8817b807ec | fbb07f0be0e301bb02ac2392f4311714 | 1,900 | PASSED |
n = int(input())
a = [0] + list(map(int, input().split()))
for i in range(2, n + 1):
a[i] += a[i - 1]
f = [0] * int(1e6)
res = 0
for i in range(1, n + 1):
res = max(res, (a[i] + i - 1) // i)
f[i] = max(res, (a[n] + i - 1) // i)
for q in range(1, int(input()) + 1):
x = int(input())
left, r... | Python | d7361a43bff124cea280ae8817b807ec | b53d0f7832995fad6d00a1c70f772e7e | 1,900 | PASSED |
# ENTER YOUR CODE HERE -------------------->
# sys.setrecursionlimit(1000)
# ''' # 0.7 sec average INTEST - best for Codechef
import atexit,io,os,sys
ss=io.BytesIO()
_write=ss.write
ss.write=lambda s:_write(s.encode())
atexit.register(lambda:os.write(1,ss.getvalue()))
y_in=open(0).read().split("\n")
... | Python | d7361a43bff124cea280ae8817b807ec | 0674a3ab9d2a8d438f9a325fb456a0b8 | 1,900 | PASSED |
import sys
from array import array
input = lambda: sys.stdin.buffer.readline().decode().strip()
inp = lambda dtype: [dtype(x) for x in input().split()]
inp_2d = lambda dtype, n: [dtype(input()) for _ in range(n)]
inp_2ds = lambda dtype, n: [inp(dtype) for _ in range(n)]
ceil1 = lambda a, b: (a + b - 1) // b
de... | Python | d7361a43bff124cea280ae8817b807ec | d9ac0d078900cbd73ed02bb2a32ffaa0 | 1,900 | PASSED |
import sys
from array import array
input = lambda: sys.stdin.buffer.readline().decode().strip()
inp = lambda dtype: [dtype(x) for x in input().split()]
inp_2d = lambda dtype, n: [dtype(input()) for _ in range(n)]
inp_2ds = lambda dtype, n: [inp(dtype) for _ in range(n)]
ceil1 = lambda a, b: (a + b - 1) // b
de... | Python | d7361a43bff124cea280ae8817b807ec | 584ed3f91177b732412ec22111e4dcca | 1,900 | PASSED |
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef pair<int, int> PII;
const int N = 400010;
int n, m;
vector<vector<int>> g;
vector<vector<bool>> st;
vector<vector<bool>> bads;
PII pos[N];
int bad_cnt;
PII one;
set<pair<PII, PII>> cands;
int dx[] = {1, 0, -1, 0... | C++ | 4b527bc3d9ab781bfe829ebf69b5a9d9 | 2841fd589db52dc1e672e0a26f93137a | 2,600 | PASSED |
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef pair<int, int> PII;
const int N = 400010;
map<PII, int> mp;
int n, m;
PII pos[N];
PII err[N];
int cnt;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
vector<vector<int>> g;
bool check1(int x, int y)
{
... | C++ | 4b527bc3d9ab781bfe829ebf69b5a9d9 | 4c01f4db11e37b57e206a32d5e4834fe | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
#define int int_fast32_t
vector<vector<int>> v;
int n, m;
int f(int i, int j) {
if (i < 0 || j < 0 || i >= n || j >= m)
return inf;
return v[i][j];
}
bool good(int i, int j) {
if (i < 0 || j < 0 || i >= n || j... | C++ | 4b527bc3d9ab781bfe829ebf69b5a9d9 | 2680f89ab2da1ccdb04bfa93d53ec39f | 2,600 | PASSED |
#include <bits/stdc++.h>
#pragma GCC target("avx,avx2,sse3,ssse3,sse4.1,sse4.2,tune=native")
#pragma GCC optimize("Ofast")
using namespace std;
#define int int_fast32_t
const int inf = 1e9;
vector<vector<int>> v;
int n, m;
int f(int i, int j) {
if (i < 0 || j < 0 || i >= n || j >= m)
retur... | C++ | 4b527bc3d9ab781bfe829ebf69b5a9d9 | 44ce0ff6200bc599ad8334461324384a | 2,600 | PASSED |
#include <bits/stdc++.h>
#pragma GCC target("avx,avx2,sse3,ssse3,sse4.1,sse4.2,tune=native")
#pragma GCC optimize(3)
//#pragma GCC optimize("O3")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
... | C++ | 4b527bc3d9ab781bfe829ebf69b5a9d9 | 1c8349bb5e267f01f64c9e30d70f7be1 | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
vector<vector<int>> v;
int n, m;
int f(int i, int j) {
if (i < 0 || j < 0 || i >= n || j >= m)
return inf;
return v[i][j];
}
bool good(int i, int j) {
if (i < 0 || j < 0 || i >= n || j >= m)
return true;... | C++ | 4b527bc3d9ab781bfe829ebf69b5a9d9 | 709bc0b97d965838c0b6c9a40a5b04af | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
vector<vector<int>> v;
int n, m;
int f(int i, int j) {
if (i < 0 || j < 0 || i >= n || j >= m)
return inf;
return v[i][j];
}
bool good(int i, int j) {
if (i < 0 || j < 0 || i >= n || j >= m)
return true;... | C++ | 4b527bc3d9ab781bfe829ebf69b5a9d9 | c832252efb1dd99ff91ffb8a04ec65c9 | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
vector<vector<int>> v;
int n, m;
int f(int i, int j) {
if (i < 0 || j < 0 || i >= n || j >= m)
return inf;
return v[i][j];
}
bool good(int i, int j) {
if (i < 0 || j < 0 || i >= n || j >= m)
return true;... | C++ | 4b527bc3d9ab781bfe829ebf69b5a9d9 | dfa7147cebb79f8ff8ebed48a63df677 | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
vector<vector<int>> v;
int n, m;
int f(int i, int j) {
if (i < 0 || j < 0 || i >= n || j >= m)
return inf;
return v[i][j];
}
bool good(int i, int j) {
if (i < 0 || j < 0 || i >= n || j >= m)
return true;... | C++ | 4b527bc3d9ab781bfe829ebf69b5a9d9 | 2ae1187bb6f65e27e52d37cd79615cff | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
vector<vector<int>> v;
int n, m;
int f(int i, int j) {
if (i < 0 || j < 0 || i >= n || j >= m)
return inf;
return v[i][j];
}
bool good(int i, int j) {
if (i < 0 || j < 0 || i >= n || j >= m)
return true;... | C++ | 4b527bc3d9ab781bfe829ebf69b5a9d9 | 61e4ded05c8339286dbb1ca4eef1f34e | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool che(int k, vector <int> &a)
{
int n = a.size();
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < 3; j++)
{
int x = k - i - j;
if (x < 0)
continue;
bool c... | C++ | e48858b8f1260b6d371e406239752b37 | a4e27763e6d72f80882686b1c52df703 | 2,000 | PASSED |
#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>
#include<math.h>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <math.h>
#include <list>
#include <climits>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define f... | C++ | e48858b8f1260b6d371e406239752b37 | 8646a7329ae1967a735dc49dc4a83c85 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using PII = pair<int, int>;
const int mod = 7 + 1e9;
// const int mod = 998244353;
const int N = 3 + 1e5;
int n, a[N];
int main() {
int T;
cin >> T;
while (T--) {
cin >> n;
for (int i = 1; i <= n; ++i) {
... | C++ | e48858b8f1260b6d371e406239752b37 | d97ee4069acb2ce62a3795619e191ad0 | 2,000 | PASSED |
#include<bits/stdc++.h>
#define int long long
using namespace std;
//1egendCHL
signed main(){
ios::sync_with_stdio(false);cin.tie(0);
int t;
cin >> t;
while (t--){
int n;
cin >> n;
vector <int> a(n);
for (int i = 0; i < n; i++){
cin >> a[i];
}
sort(a.begin(),a.end());
int num = a[n-1], ans = 0;... | C++ | e48858b8f1260b6d371e406239752b37 | 6dd9cd3e1311e13fd8379c89a9877ea1 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int t, n, a[100];
int check(vector <vector <int>> g){
vector <int> ans, anw;
for(int i = 0; i < 3; ++i){
ans.push_back(0);
anw.push_back(0);
}
int cur = 0;
for(int i = 0; i < (int)g.size(); ++i){
if((int)g[i].size() == 0){
return 1e9;
}
ans... | C++ | e48858b8f1260b6d371e406239752b37 | a7bb2df536b59594fa9b8e3c562250d0 | 2,000 | PASSED |
//eternamente_giancarlo_lazzarini
#include<bits/stdc++.h>
#define N 1000010
#define ll long long
#define ull unsigned long long
#define pi pair<int, int>
#define pii pair<ll, ll>
#define fastio ios_base :: sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define point cout<<showpoint<<fixed<<setprecision(8)... | C++ | e48858b8f1260b6d371e406239752b37 | 1b1ba6c4a5b29f0b16152e33ef63a47c | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using namespace chrono;
typedef long long int ll;
ll ceil(ll r, ll d) { return (r / d) + (bool)(r % d); }
void inputAArray(int siz, vector<int> &arr)
{
for (int i = 0; i < siz; i++)
arr[i] = 1 + rand();
}
int main()
{
ios_base::sync_with_stdio(0)... | C++ | e48858b8f1260b6d371e406239752b37 | 3b3e7b0300b62d78be8d44da86be1ba8 | 2,000 | PASSED |
#include <bits/stdc++.h>
using i64 = long long;
void sol() {
int n;
std::cin >> n;
std::vector<int> a(n);
for(int i=0;i<n;++i) {
std::cin >> a[i];
}
int mx = *std::max_element(a.begin(),a.end());
int res = mx / 3 + 2;
const int INF = 0x3f3f3f3f;
auto chk = [... | C++ | e48858b8f1260b6d371e406239752b37 | 3c3464aa8b7f687c928ebc282ea8c64d | 2,000 | PASSED |
#include <bits/stdc++.h>
using i64 = long long;
void sol() {
int n;
std::cin >> n;
std::vector<int> a(n);
for(int i=0;i<n;++i) {
std::cin >> a[i];
}
int mx = *std::max_element(a.begin(),a.end());
int res = mx / 3 + 2;
int c3 = mx / 3 - 1, c2 = 2, c1 = 0;
i... | C++ | e48858b8f1260b6d371e406239752b37 | 5a1bb7c103655df2966fcaf8c823a943 | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define fast ios::sync_with_stdio(false);cin.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main(){
fast
... | C++ | e48858b8f1260b6d371e406239752b37 | f02cfc8db89b3c665ce5f93d4e02cefa | 2,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int NN=5e5+100;
int nxt[NN], head[NN], tail[NN];
int ans[NN];
int main(){
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
freopen("out.out", "w", stdout);
#endif
int T; cin>>T;
int cnt=0;
for(int i=1; i<NN; i++) head[i]=-1;
while(T--){
int t; scanf("%d", &... | C++ | cb86d0b26ee542fc75e274fcfe3f3660 | bc9387670325507222fb91dd4b909ba0 | 1,900 | PASSED |
#include<bits/stdc++.h>
#define INT long long
using namespace std;
const int NN = 5e5 + 10;
int A[NN],B[NN];
int head[NN],tail[NN],nxt[NN];
char str[NN];
int main(){
#ifndef ONLINE_JUDGE
freopen("in.in","r",stdin);
freopen("out.out","w",stdout);
#endif
const int mx= 5e5 + 10;
int q;
cin >> q;
int cnt = 0;
for(in... | C++ | cb86d0b26ee542fc75e274fcfe3f3660 | cd77dc40421abece5d84bd6461328ac0 | 1,900 | PASSED |
#include <bits/stdc++.h>
#define INT long long
using namespace std;
const int NN = 500100;
int hd[NN], tl[NN], nxt[NN], ans[NN];
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
freopen("out.out", "w", stdout);
#endif
int T, n = 0;
cin >> T;
for(int i = 1; i <= 500010; i ++) hd[i] = -1;
while(T --)... | C++ | cb86d0b26ee542fc75e274fcfe3f3660 | 75352ced28f2b5ab124071ac3ef463e4 | 1,900 | PASSED |
#include<bits/stdc++.h>
#define NN 500100
#define N 5e5
#define INT long long
using namespace std;
int head[NN],tail[NN],nxt[NN],ans[NN];
int main(){
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
#endif
int q;
cin >> q;
for(int i = 1; i <= N; i ++){
head[i] = -1;
tail[i] = -1;
nxt[i] = -1;
}
int cnt = ... | C++ | cb86d0b26ee542fc75e274fcfe3f3660 | 866e7d75c1186d376b406d85e0b0a8ae | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using INT = long long;
const int NN = 5e5 + 100;
int a[NN], head[NN], nxt[NN], tail[NN], ans[NN];
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
freopen("out.out", "w", stdout);
#endif
int q; cin >> q;
int id = 0;
for(int i = 1; i < NN; i ++) head[i] =... | C++ | cb86d0b26ee542fc75e274fcfe3f3660 | 9b8e8804559a71958a5cf789a71249ee | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int NN = 5e5 + 10;
int A[NN], head[NN], tail[NN], nxt[NN];
vector <int> vec[NN];
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
freopen("out.out", "w", stdout);
#endif
int q; cin >> q;
int n = 0;
memset(head, -1, sizeof(head));
memset(tail, -1,... | C++ | cb86d0b26ee542fc75e274fcfe3f3660 | a5c2593cf9596944024c15fc9a9839da | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int NN = 5e5 + 10;
int A[NN], head[NN], tail[NN], nxt[NN];
vector <int> vec[NN];
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
freopen("out.out", "w", stdout);
#endif
int q; cin >> q;
int n = 0;
memset(head, -1, sizeof(head));
memset(tail, -1,... | C++ | cb86d0b26ee542fc75e274fcfe3f3660 | 509ed937625762c8c048db8b1afaa250 | 1,900 | PASSED |
#include<bits/stdc++.h>
#define NN 500100
using namespace std;
using INT=long long;
int nxt[NN];
int t[NN], x[NN], y[NN], pos[NN];
int find_nxt(int u) {
if(nxt[u] == u) return u;
return nxt[u] = find_nxt(nxt[u]);
}
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
freopen("out.out", "w", stdout);
... | C++ | cb86d0b26ee542fc75e274fcfe3f3660 | 63bc2d3e56243606dcee82a6ccc91e11 | 1,900 | PASSED |
#pragma GCC optimize("O3")
/// Do the solution on the paper first
#include <bits/stdc++.h>
using namespace std;
//template <class T> inline bool minn(T &A,T B){return A > B ? (A = B,1) : 0;}
//template <class T> inline bool maxx(T &A,T B){return A < B ? (A = B,1) : 0;}
//#define int long long
//#define rep(i, n)... | C++ | cb86d0b26ee542fc75e274fcfe3f3660 | c71c1601fe827e2040dfd01f28215a28 | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5+5;
int q,f[2*maxn] = {},len = 0,cnt = 0,id[maxn] = {},fid[maxn] = {},a[maxn] = {};//fid[i]表示虚点i对应的值，id[i]表示当前值为i的点(可能虚)
int Find(int x){
return f[x] == x ? x : f[x] = Find(f[x]);
}
signed main(){
cin >> q;
for(int i = 1;i < maxn*2;i++){
... | C++ | cb86d0b26ee542fc75e274fcfe3f3660 | 289433fb1029b22f83e73094e2ed188c | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll c,d,e,f,h,w,i,j,k,l,m,n,t,x,y,p,q,r,mn,mx,cnt;
void solve(){
//string o,s;
cnt=f=0;c=d=1;
cin>>w>>h;
for(p=0;p<2;p++){
cin>>n;
ll a[n+2];
for(i=0;i<n;i++)cin>>a[i];
cnt=max(cnt,(a[n-1]-a[0])*h);
... | C++ | 2c67ee95eba7ffbbed99cb488abb5f3d | 26f8375611525ba510dc14d41e6fd83f | 1,000 | PASSED |
#include <bits/stdc++.h>
typedef long long LL;
using namespace std;
void solve();
int main()
{
#ifndef ONLINE_JUDGE
freopen("../in.txt", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1;
cin >> t;
while (t--)
{
solve();
}
return 0;
}
const int N = 20... | C++ | 2c67ee95eba7ffbbed99cb488abb5f3d | 88725218b666e8ea77e47c1928c89419 | 1,000 | PASSED |
#include<iostream>
#include<string.h>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<deque>
#include<map>
#include<unordered_map>
#include<stack>
#include<set>
#include<vector>
#pragma GCC optimize(2)
#define fi first
#define se second
#define endl "\n"... | C++ | 2c67ee95eba7ffbbed99cb488abb5f3d | 6e748d9c36e2b306736a23238944c978 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
void solution(){
long long w,h;
cin>>w>>h;
long long k1;
cin>>k1;
vector<long long> x(k1);
for(long long i=0;i<k1;i++){
cin>>x[i];
}
long long k2;
cin>>k2;
vector<long long> x1(k2);
for(long long i=0;i<k2;i++){
cin... | C++ | 2c67ee95eba7ffbbed99cb488abb5f3d | d59051be21837336f9a2b9302b0467ce | 1,000 | PASSED |
#include<iostream>
using namespace std;
long long res(int flag);
int main(){
int t;
cin >> t;
while(t--){
long a,b;
long long ans[4];
cin >> a >> b;
ans[0] = res(b);
ans[1] = res(b);
ans[2] = res(a);
ans[3] = res(a);
long long max = ans[0];
for(int i = 0;i < 3;i++){
if(ans[i+1] > max)max = ans[i... | C++ | 2c67ee95eba7ffbbed99cb488abb5f3d | c6dfb3157974ee7a278f63c75fd461e9 | 1,000 | PASSED |
#include<stdio.h>
const int maxm=2e5+5;
long long ans[4],y0[maxm],yh[maxm],x0[maxm],xw[maxm];
int main(){
long long t,i,kx0,kxw,ky0,kyh,w,h,result;
scanf("%lld",&t);
while(t--){
scanf("%lld%lld",&w,&h);
scanf("%lld",&ky0);
for(i=0;i<ky0;++i) scanf("%lld",&y0[i]);
scanf("%lld",&kyh);
for(i=0;i<kyh;++i) sc... | C++ | 2c67ee95eba7ffbbed99cb488abb5f3d | 263cc23b6fb5a00113cc70d8e8c02f98 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t,w,h,k;
int main()
{
cin >> t ;
while(t--)
{
cin >> w >> h;
int first,last;
long long Max = 0;
cin >> k >> first;
for(int i=2;i<=k;i++)cin >> last;
Max = max(Max,1LL*(last-first)*h);
cin >> k >> fi... | C++ | 2c67ee95eba7ffbbed99cb488abb5f3d | 9134e9b1949a4fac84effcc032661faa | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=200005,inf=1e9;
int a[4][N],v[4];
void sol()
{
int xl=inf,xr=0,yl=inf,yr=0;
int n,m,k;
long long ans=0;
scanf("%d%d",&n,&m);
for(int j=0;j<4;j++)
{
scanf("%d",&k);
for(int i=1;i<=k;i++)
scanf("%d",&a[j][i]);
v[j]=a[j][k]-a[j][1];
if(j<=1)
{
... | C++ | 2c67ee95eba7ffbbed99cb488abb5f3d | 16e8c3dc14935b8a6b5c4492926c83e6 | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
long long int w,h;
cin>>w>>h;
int k1;
cin>>k1;
int a[k1];
for(int i=0;i<k1;i++){
cin>>a[i];
}
... | C++ | 2c67ee95eba7ffbbed99cb488abb5f3d | 44fb8a7f4c421f2699b404a68f8ba801 | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
int w,h;
cin>>w>>h;
int k1;
cin>>k1;
long long int a[k1];
for(int i=0;i<k1;i++){
cin>>a[i];
}
... | C++ | 2c67ee95eba7ffbbed99cb488abb5f3d | d37a362e76e668dcb5414ec6dc6a6300 | 1,000 | PASSED |
// LUOGU_RID: 94328353
#include<iostream>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
using namespace std;
char a[60];
int main()
{
int t, n, i, j, cnt,len;
cin >> t;
while (t--) {
cin >> a;
len = strlen(a);
cnt = 0;
for (i = 0; i < len; i++) {
if (a[i] == 'N')cn... | C++ | e744184150bf55a30568060cca69de04 | 36180822ef489db0242ee13427e84009 | 800 | PASSED |
// LUOGU_RID: 94308351
#include<bits/stdc++.h>
using namespace std;
int main()
{
string ch;
int t;
cin>>t;
int i;
int cnt=0;
while(t--)
{ cnt=0;
ch="";
cin>>ch;
int n = ch.size();
for(i=0;i<n;i++)
{
if(ch[i]=='N')
{
cnt++;
}
}
if(cnt==1)
cout<<"NO... | C++ | e744184150bf55a30568060cca69de04 | 46f89c8f44fcb8dc6f5dfd83e0e308c2 | 800 | PASSED |
// LUOGU_RID: 94308023
#include<bits/stdc++.h>
using namespace std;
int main()
{
string ch;
int t;
cin>>t;
int i;
int cnt=0;
while(t--)
{ cnt=0;
cin>>ch;
int n = ch.size();
for(i=0;i<n;i++)
{
if(ch[i]=='N')
{
cnt++;
}
}
if(cnt==1)
cout<<"NO"<<endl... | C++ | e744184150bf55a30568060cca69de04 | d08655107ec528a831bc481073fb6d70 | 800 | PASSED |
// LUOGU_RID: 92854169
#include <stdio.h>
#include <string.h>
char s[200];
int main()
{
int t;
scanf("%d",&t);
while(t--){
scanf("%s",s);
int cnt=0,len=0;
len=strlen(s);
for(int i=0;i<len;i++){
if(s[i]=='N')
cnt++;
}
if(cnt==1){
printf("NO\n");
}els... | C++ | e744184150bf55a30568060cca69de04 | fe85d2b9d365bc3cbc483b9f015e737c | 800 | PASSED |
// LUOGU_RID: 92372127
#include <iostream>
#include <cstring>
using namespace std;
int t,cnt;
char s[60];
int main(){
for(cin>>t;t--;cnt=0){
cin>>s;
for(int i=0;i<strlen(s);i++)if(s[i]=='N')cnt++;
if(cnt==1)cout<<"NO"<<endl;
else cout<<"YES"<<endl;
}
}
| C++ | e744184150bf55a30568060cca69de04 | c00690a9778715f1827c6d7208d61287 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t,cnt;
char s[60];
int main()
{
for(cin>>t;t--;cnt=0)
{
cin>>s;
for(int i=0;i<strlen(s);i++)if(s[i]=='N')cnt++;
if(cnt==1)cout<<"NO"<<endl;
else cout<<"YES"<<endl;
}
} | C++ | e744184150bf55a30568060cca69de04 | 40e55e6415579638f3ecad365da5dadd | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
signed main(){
int t;
cin>>t;
while(t--){
string s;
cin>>s;
int sum=0;
for(int i=0;i<s.length();i++){
if(s[i]=='N'){
sum++;
}
}
if(sum==1){
cout<<"NO"<<endl;
}else{
cout<<"YES"<<endl;
}
}
} | C++ | e744184150bf55a30568060cca69de04 | 603f84d90d4594f286f0f0ceddef305e | 800 | PASSED |
#include <iostream>
#include <string>
using namespace std;
int main() {
int t;
cin >>t;
while(t--){
string s;
int cnt=0;
cin >>s;
for(int i=0;i<s.size();i++){
if(s[i]=='N'){
cnt++;
}
}
if(cnt==1){
cout <<"NO" <<endl;
}
else{//
cout <<"YES" <<endl;
}
}
return 0;
}
| C++ | e744184150bf55a30568060cca69de04 | 3b49c39ba6d66be4d30ca3ffd04fabf7 | 800 | PASSED |
#include <iostream>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
string s;
cin>>s;
int n=0;
for(int i=0;i<s.size();i++){
if(s[i]=='N'){
n++;
}
}
if(n==1){
cout<<"NO"<<endl;
}
else{
cout<<"YES"<<endl;
}
}
} | C++ | e744184150bf55a30568060cca69de04 | a0cc0b0f17a3419b8840601a400640d9 | 800 | PASSED |
#include <iostream>
using namespace std;
int a[100005];
int main(){
int t;
cin >> t;
while (t--){
string s;
cin >> s;
int cnt = 0;
for (int i=0;i<s.size();i++){
if (s[i] == 'N') {
cnt++;
}
}
if (cnt == 1) cout << "NO\n";
... | C++ | e744184150bf55a30568060cca69de04 | c8dcab68ed814d0ca96f3c73494d1d80 | 800 | PASSED |
#include <bits/stdc++.h>
#include <unordered_set>
#include <chrono>
using namespace std;
#define ll long long int
#define ull unsigned long long
#define vi vector<int>
#define vb vector<bool>
#define vs vector<string>
#define vll vector<long long int>
#define MOD 1000000007
ll gcd(ll a,ll b){
... | C++ | 32ed4995e557cfdcbef375e2b9edb1a6 | d0c64699ad5d1c6db44707dc81257d1b | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define qc ios::sync_with_stdio(0)
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define int ll
int a[20001];
int add[20001];
const int maxn=1e18;
signed main() {
qc,cin.tie(0);
int t;
cin>>t;
while(t--... | C++ | 32ed4995e557cfdcbef375e2b9edb1a6 | c42975a9c144c9f8bdfedd2d81c042be | 1,800 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.