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 <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <cstring>
#include <stack>
#include <cmath>
#include <tuple>
#include <climits>
#include <fstream>
#include <sstream>
// #include <bits/stdc++.h>
using namespace std;
#ifdef ONLINE_JUDGE
... | C++ | 3035265a44fcc3bb6317bf1b9662fc76 | 60449051e29f8e82c09543ae2dd51543 | 1,900 | PASSED |
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <cstring>
#include <stack>
#include <cmath>
#include <tuple>
#include <climits>
#include <fstream>
#include <sstream>
// #include <bits/stdc++.h>
using namespace std;
#ifdef ONLINE_JUDGE
... | C++ | 3035265a44fcc3bb6317bf1b9662fc76 | ef1203c18bf503c9158aa3b7ef053c3e | 1,900 | PASSED |
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <cstring>
#include <stack>
#include <cmath>
#include <tuple>
#include <climits>
#include <fstream>
#include <sstream>
// #include <bits/stdc++.h>
using namespace std;
#ifdef ONLINE_JUDGE
... | C++ | 3035265a44fcc3bb6317bf1b9662fc76 | b5b3d819c2ace4e58893f1488db4a877 | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9+7;
int gcd(int a, int b, int& x, int& y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
int x1, y1;
int d = gcd(b, a % b, x1, y1);
x = y1;
y = x1 - y1 * (a / b);
r... | C++ | 3035265a44fcc3bb6317bf1b9662fc76 | 61ee4c8c6c4a39b952d4ab1ce7b0cc90 | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9+7;
int gcd(int a, int b, int& x, int& y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
int x1, y1;
int d = gcd(b, a % b, x1, y1);
x = y1;
y = x1 - y1 * (a / b);
r... | C++ | 3035265a44fcc3bb6317bf1b9662fc76 | 502bbe66b6d35a2b8282a08ecb202826 | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9+7;
int gcd(int a, int b, int& x, int& y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
int x1, y1;
int d = gcd(b, a % b, x1, y1);
x = y1;
y = x1 - y1 * (a / b);
r... | C++ | 3035265a44fcc3bb6317bf1b9662fc76 | 7d1ba1562905513b8d88ac6631a4836d | 1,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9+7;
int gcd(int a, int b, int& x, int& y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
int x1, y1;
int d = gcd(b, a % b, x1, y1);
x = y1;
y = x1 - y1 * (a / b);
r... | C++ | 3035265a44fcc3bb6317bf1b9662fc76 | 5eb545095dc697d9919c86f41442fd84 | 1,900 | PASSED |
#include "bits/stdc++.h"
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define cin1(a) cin >> (a);
#define cin2(a, b) cin >> (a) >> (b);
#define cin3(a, b, c) cin >> (a) >> (b) >> (c);
#define cin_vec(vec) for (auto& v: (vec)) cin >> v;
#d... | C++ | 3035265a44fcc3bb6317bf1b9662fc76 | ad1a65dbf605e70db0abfe92c2fabeb3 | 1,900 | PASSED |
#include<iostream>
#include <cstdio>
#include <algorithm>
#include<cmath>
#include <iterator>
#include <cstring>
#include <string>
#include <map>
#include <queue>
#include <vector>
#include <stack>
#include "set"
#include "sstream"
#include <bitset>
#define LL long long
using namespace std;
typedef pair... | C++ | 3035265a44fcc3bb6317bf1b9662fc76 | 4c41d21bcaf08392ce5478808734f924 | 1,900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
while (n--) {
string s;
cin >> s;
int a = s.length();
long long b = 0;
for (int i = 0; i < a; i++)b += ((s[i] - 'a') + 1);
if (a % 2 == 0) {
cout << "Alice" << ' ' << b << endl;
continue;
} else {
if (s[0] >= s[a - 1])... | C++ | 8f02891aa9d2fcd1963df3a4028aa5c0 | 3e0979f5f7adf91404f7d21ba01d4f35 | 800 | PASSED |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int data1[1000000];
int sum=0;
int main()
{
long long t;
cin>>t;
while (t>0)
{
string s;
cin>>s;
sum=0;
int length=s.size();
for(int i=0;i<length;i++)
{
data1[i]=0;... | C++ | 8f02891aa9d2fcd1963df3a4028aa5c0 | 6912f4acffb144540c89683ebcaa34bc | 800 | PASSED |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int data1[1000000];
int sum=0;
int main()
{
long long t;
cin>>t;
while (t>0)
{
string s;
cin>>s;
sum=0;
int length=s.size();
for(int i=0;i<length;i++)
{
data1[i]=0;... | C++ | 8f02891aa9d2fcd1963df3a4028aa5c0 | d0d6f4d9cacadca6bbc33aecf3f58b0a | 800 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
using namespace std;
int main()
{
int n;
cin >> n;
while (n--)
{
string s;
cin >> s;
if (s.size() % 2 == 0) {
int sa = 0;
for (int i = 0; i < s.size(); i++)
{
sa += s[i] - 'a'+1;
}
co... | C++ | 8f02891aa9d2fcd1963df3a4028aa5c0 | 413cb3eb9ee51c2f2019f9b8d4b4fa63 | 800 | PASSED |
#include <iostream>
typedef long long ll;
const int N = 2e5 + 10;
ll f(char c)
{
return c - 'a' + 1;
}
char s[N];
int main(void)
{
int t;
scanf("%d%*c", &t);
while (t--) {
char c;
ll cnt = 0;
while ((c = getchar()) != '\n')
s[++cnt] = c;
ll ans = 0;
if... | C++ | 8f02891aa9d2fcd1963df3a4028aa5c0 | a842db2eb55d8905ca06f2c9f238b64e | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int T;
cin >> T;
int t = (int)'a' - 1;
while(T--) {
string s;
cin >> s;
if(s.length() % 2 == 0) {
cout << "Alice ";
ll value = 0;
for(int i=0;i<s.length();i++) {
... | C++ | 8f02891aa9d2fcd1963df3a4028aa5c0 | 0b3442733fa6c4465bd4f8c1cede0c5b | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int T;
cin >> T;
int t = (int)'a' - 1;
while(T--) {
string s;
cin >> s;
if(s.length() % 2 == 0) {
cout << "Alice ";
ll value = 0;
for(int i=0;i<s.length();i++) {
... | C++ | 8f02891aa9d2fcd1963df3a4028aa5c0 | e9cd915196c95aac375e62422cd05088 | 800 | PASSED |
#include <bits/stdc++.h>
#include <string>
#define up(i, j, n, k) for (int i = j; i <= n; i += k)
#define dw(i, j, n, k) for (int i = j; i >= n; i -= k)
#define LL long long
using namespace std;
typedef pair<int, int> PII;
const int mn = 1e6 + 10;
LL t, w[mn], ans;
char ch[200010];
int main(){
scanf("%lld", &t)... | C++ | 8f02891aa9d2fcd1963df3a4028aa5c0 | 22267f399291ae1a5b7c4d64cca6c9e9 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int T;
cin >> T;
int t = (int)'a' - 1;
while(T--) {
string s;
cin >> s;
if(s.length() % 2 == 0) {
cout << "Alice ";
ll value = 0;
for(int i=0;i<s.length();i++) {
... | C++ | 8f02891aa9d2fcd1963df3a4028aa5c0 | 7065c556a1d83ee06853b79c5e3837ca | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int tc;
cin >> tc;
while(tc--)
{
string s;
cin >> s;
int n=s.length(),alice=0;
for(int i=0;i<n;i++)
alice += s[i]-'a'+1;
if(n%2==0)
cout << "Alice " << alice << '\n'... | C++ | 8f02891aa9d2fcd1963df3a4028aa5c0 | 2eb968ece008957ac2db5c41dbb51093 | 800 | PASSED |
/*input
3 1
3 1 2
*/
#include<iostream>
using namespace std;
typedef long long ll;
const int N=2e6+10;
const int MAX=1024*1024;
int c2[N],b[N],b2[N],st[N],ks[30],base;
ll pb[N],ans[N];
bool ca[30][N];
inline bool check(int l,int r)
{
if(r>l) return 0;
if(l==0) return 1;
if(r==0) return 0;
return !(... | C++ | 8ddccfaf362b19d50647bfb6ad421953 | 4b3af0acd1494cf8ef5607d35298f9b2 | 2,500 | PASSED |
/*input
3 1
3 1 2
*/
#include<iostream>
using namespace std;
typedef long long ll;
const int N=2e6+10;
const int MAX=1024*1024;
int c2[N],b[N],b2[N],st[N],ks[30],base;
ll pb[N],ans[N];
bool ca[30][N];
inline bool check(int l,int r)
{
if(r>l) return 0;
if(l==0) return 1;
if(r==0) return 0;
return !(... | C++ | 8ddccfaf362b19d50647bfb6ad421953 | d303cd439927383d03dd89d48279ff0e | 2,500 | PASSED |
/*input
3 1
3 1 2
*/
#include<iostream>
using namespace std;
typedef long long ll;
const int N=2e6+10;
const int MAX=1024*1024;
int c2[N],b[N],b2[N],ans[N],st[N],ks[30],base;
ll pb[N];
bool ca[30][N];
inline bool check(int l,int r)
{
if(r>l) return 0;
if(l==0) return 1;
if(r==0) return 0;
return !(... | C++ | 8ddccfaf362b19d50647bfb6ad421953 | 3c23a2a89285a1af57a5b3805a7033dd | 2,500 | PASSED |
/*input
3 0
3 1 2
*/
#include<iostream>
using namespace std;
typedef long long ll;
const int N=2e6+10;
const int MAX=1024*1024;
int c2[N],b[N],b2[N],ans[N],st[N],ks[30],base;
ll pb[N];
bool ca[30][N];
inline bool check(int l,int r)
{
if(r>l) return 0;
if(l==0) return 1;
if(r==0) return 0;
return !(... | C++ | 8ddccfaf362b19d50647bfb6ad421953 | e92327a291a99d31664202ff4cddbb81 | 2,500 | PASSED |
/*input
3 0
3 1 2
*/
#include<iostream>
using namespace std;
typedef long long ll;
const int N=2e6+10;
const int MAX=1024*1024;
int c2[N],b[N],b2[N],ans[N],st[N],ks[30];
ll pb[N];
inline bool check(int l,int r)
{
if(r>l) return 0;
if(l==0) return 1;
if(r==0) return 0;
return !(((l-1)&(r-1))^(r-1));
... | C++ | 8ddccfaf362b19d50647bfb6ad421953 | b037ceed8bef7de5ec6d6a092a7b663f | 2,500 | PASSED |
/*input
3 0
3 1 2
*/
#include<iostream>
using namespace std;
typedef long long ll;
const int N=2e6+10;
const int MAX=1024*1024;
int c2[N],b[N],b2[N],ans[N],st[N];
ll pb[N];
bool check(int l,int r)
{
if(r>l) return 0;
if(l==0) return 1;
if(r==0) return 0;
return !(((l-1)&(r-1))^(r-1));
}
int ksm(in... | C++ | 8ddccfaf362b19d50647bfb6ad421953 | 74c7ef5dbf53c6c957e5ba9fef31937c | 2,500 | PASSED |
/*input
3 0
3 1 2
*/
#include<iostream>
using namespace std;
typedef long long ll;
const int N=2e6+10;
const int MAX=1024*1024;
int c2[N],b[N],b2[N],ans[N],st[N];
ll pb[N];
bool check(int l,int r)
{
if(r>l) return 0;
if(l==0) return 1;
if(r==0) return 0;
return !(((l-1)&(r-1))^(r-1));
}
int ksm(in... | C++ | 8ddccfaf362b19d50647bfb6ad421953 | 49727b5d890a9b908554a283fcf7d1c2 | 2,500 | PASSED |
/*input
3 1
3 1 2
*/
#include<iostream>
using namespace std;
typedef long long ll;
const int N=2e6+10;
int c2[N],b[N],b2[N],ans[N],base;
ll pb[N];
bool check(int l,int r)
{
if(r>l) return 0;
if(l==0) return 1;
if(r==0) return 0;
return ((l-1)&(r-1))==(r-1);
}
int ksm(int x,int y)
{
int ans=1;
... | C++ | 8ddccfaf362b19d50647bfb6ad421953 | daa82566da39677d1e58d6e51aabc863 | 2,500 | PASSED |
/*input
3 1
3 1 2
*/
#include<iostream>
using namespace std;
typedef long long ll;
const int N=2e6+10;
int c2[N],b[N],b2[N],ans[N],base;
ll pb[N];
bool check(int l,int r)
{
if(r>l) return 0;
if(l==0) return 1;
if(r==0) return 0;
return !(((l-1)&(r-1))^(r-1));
}
int ksm(int x,int y)
{
int ans=1;
... | C++ | 8ddccfaf362b19d50647bfb6ad421953 | 0f6d00dc9e171d03f70019f856bd956d | 2,500 | PASSED |
/*input
3 1
3 1 2
*/
#include<iostream>
using namespace std;
typedef long long ll;
const int N=2e6+10;
int c2[N],b[N],b2[N],ans[N],base;
ll pb[N];
bool check(int l,int r)
{
if(r>l) return 0;
if(l==0) return 1;
if(r==0) return 0;
return !(((l-1)&(r-1))^(r-1));
}
int ksm(int x,int y)
{
int ans=1;
... | C++ | 8ddccfaf362b19d50647bfb6ad421953 | 8140aca7922543b688ffaba0c703addd | 2,500 | PASSED |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
char arr[99999],c;
int main()
{
int n,q,l,r=0,b[99999],a[99999];
cin>>n>>q;
for(int i=1;i<=n;i++)
{
cin>>c;
a[i]=(c-'a'+1);
}
for(int i=1;i<=n;i++)
{
b[i]=b[i-1]+a[i];
}
for(int i=0;i<q;i++)
{
cin>>l>>r; cout<<b[r]-b[l-1]<<endl;
}
}
... | C++ | 461378e9179c9de454674ea9dc49c56c | 71190eae1005f2fbc02fff72b1d2201b | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
// read input
int n, q;
cin >> n >> q;
string msg;
cin >> msg;
vector<int> psum(n + 1);
for (int idx = 1; idx < n + 1; ++idx){
psum.at(idx) = psum.at(idx - 1) + msg.at(idx - 1) - 'a' + 1;
}
// for (auto val : psum) cout << val... | C++ | 461378e9179c9de454674ea9dc49c56c | e02fbc0943b538af0f68ccdca53ab908 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long n,m,l,r;
char s[100005];
long long len[100005];
int main(){
cin>>n>>m;
scanf("%s",s+1);
for(int i=1;i<=n;i++){
len[i]=len[i-1]+(s[i]-'a'+1);
}
while(m--){
cin>>l>>r;
cout<<len[r]-len[l-1]<<endl;
}
getchar();
g... | C++ | 461378e9179c9de454674ea9dc49c56c | f27f53f8baa9156d5a03d73658d43acf | 800 | PASSED |
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
using namespace std;
int main(int argc, char const *argv[])
{
int n, q, l, r;
cin >> n;
cin >> q;
vector<int> accumulator;
char song[n];
scanf("%s", song);
accumulator.push_back(0);
for (int i = 1; i <= n; i... | C++ | 461378e9179c9de454674ea9dc49c56c | 0c6de424ab879fac1feb0f3ac00a6725 | 800 | PASSED |
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
ios::sync_with_stdio(false); cin.tie(nullptr);
int t;
int len;
cin>>len;
string s;
cin >> t;
cin>>s;
long long a[len+1]={0};
// cout<<"sum\n:";
for(int i=1;i<=len;i++)
{
a[i]=a[i-1]+s[i-1]-'a'+1;
}
// for(int i=1... | C++ | 461378e9179c9de454674ea9dc49c56c | d61aa5896592c13c7c5dcf00dbf86cc3 | 800 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define str string
#define pb push_back
#define loop(i, a, b) for (int i = a; i < b; i++)
#define kick(x) cout << x << "\n"
using namespace std;
int main()
{
ll n, q, l, r;
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> q;
... | C++ | 461378e9179c9de454674ea9dc49c56c | 3b458b323df79d7fd8256c8a553f1742 | 800 | PASSED |
#include <iostream>
using namespace std;
int maxn = 100005;
int main() {
int n,m;
cin>>n>>m;
char N[maxn];
int sum1[maxn];
sum1[0]=0;
for (int i = 1 ; i<=n;i++){
cin>>N[i];
sum1[i]=N[i]-'a'+1+sum1[i-1];
}
int b ,e;
for(int i =1;i<=m;i++){
cin>>b>>e;
... | C++ | 461378e9179c9de454674ea9dc49c56c | 2b2012ee2f953ed5ef8b54c6b75f1950 | 800 | PASSED |
#include<stdio.h>
#include<vector>
#include<string.h>
#include <iostream>
#include<algorithm>
#include<stdlib.h>
#include<math.h>
using namespace std;
using namespace std;
const int MAXN = 352;
int main() {
int n,q;
scanf("%d %d",&n,&q);
string s;
cin >> s;
vector<int> js;
int mid = 0;
fo... | C++ | 461378e9179c9de454674ea9dc49c56c | 90c1d439a4e9e264c03b3079f925241c | 800 | PASSED |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#include <bitset>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define endl '\n... | C++ | 461378e9179c9de454674ea9dc49c56c | 4bfb8d598c47e4b387c1ee1131156169 | 800 | PASSED |
#include <iostream>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int n,q;cin>>n>>q;
string s;cin>>s;
int arr[n];
for(int i=0;i<n;i++)
{
arr[i]=s[i]-96;
}
for(int i=1;i<n;i++)
{
arr[i]+=arr[i-1];
}
int l,r;
fo... | C++ | 461378e9179c9de454674ea9dc49c56c | b4817c4876b622fd4947d4bd5862af7e | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<int,int> &a,
const pair<int,int> &b)
{
return (a.second < b.second);
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
long long n,k,x;
cin>>n>>k>>x;
long long a[n];
for(int i=0;i<n;i++){
... | C++ | c6c07ef23cf2def9f99cbfb6076c9810 | 1fa652fad5d9b2f1cc623f08d60e2f32 | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[200003];
ll b[200003];
int main() {
int n;
ll k, x;
cin >> n >> k >> x;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
ll cnt = 0;
for (int i = 1; i < n; i++) {
if (a[i] - a[i - 1] > x) {
b[cnt] = (a[i] - a[i - 1] - 1) ... | C++ | c6c07ef23cf2def9f99cbfb6076c9810 | 864ce0e33eaec7509aff3ce98b94ac14 | 1,200 | PASSED |
#include <bits/stdc++.h>
//#pragma GCC optimize (2)
#define MOD 1000000007
#define NUM 100005
using namespace std;
typedef long long ll;
ll gcd(ll x,ll y) {
return y==0?x:gcd(y,x%y);
}
ll lcm(ll x,ll y) {
return x/gcd(x,y)*y;
}
template <class T> lowbit(T x) {
return x&(-x);
}
int read() {
int ans=0;
char c=getcha... | C++ | c6c07ef23cf2def9f99cbfb6076c9810 | 0b0638cd3ae78cb6257108a76efe70b8 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 2e5 + 10;
LL n, m, k;
LL a[N];
int main()
{
cin >> n >> m >> k;
for (int i = 0; i < n; i ++ ) cin >> a[i];
sort(a, a + n);
priority_queue<LL, vector<LL>, greater<LL>> heap;
for (int i = ... | C++ | c6c07ef23cf2def9f99cbfb6076c9810 | 0d79580872c962b9c421d08a2ac10894 | 1,200 | PASSED |
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<queue>
#include<cstring>
#include<algorithm>
#include<vector>
#include<map>
#include<stack>
#include<deque>
typedef long long LL;
using namespace std;
typedef pair<long long int, long long int>PII;
const int N = 2e5+10;
long long int a[N];
int main()
{
l... | C++ | c6c07ef23cf2def9f99cbfb6076c9810 | 2aeac2a733bc475ea6a4bfefdc8eba43 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define vb vector<bool>
#define ... | C++ | c6c07ef23cf2def9f99cbfb6076c9810 | 910d19c6d7b94711dbd08bd3e3d4ddcc | 1,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long arr[200000];
priority_queue<long long, vector<long long>, greater<long long>> pq;
int main() {
int n;
long long k, x;
cin >> n >> k >> x;
for(int i = 0; i < n; i++) {
scanf("%lld", arr + i);
}
sort(arr, arr + n);
int s = 0;
for(int i = 1; i < n; i++) {
... | C++ | c6c07ef23cf2def9f99cbfb6076c9810 | 701fd86e843081ede4be8fa51efe82fd | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 201000;
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
freopen("out.out", "w", stdout);
#endif
ios::sync_with_stdio(false);
// -------------------------------- -
ll n,m,x;cin >> n >> m >> x;
v... | C++ | c6c07ef23cf2def9f99cbfb6076c9810 | e0d3073b001ef5e416fa54940db928df | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define FINDSUB(x, y) x.find(x) == string::npos
#define COMPARESORT // sort (v.begin () , v.end () , comapre);
#define BITSET bitset<32> b
int main()
{
ll n, k, x;
cin >> n >> k >> x;
vector<ll> nw, v;
for (int i = 0; i < n; ++i)... | C++ | c6c07ef23cf2def9f99cbfb6076c9810 | 552bc7fd19b36e832b82c33127adbd9e | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// int t;
// cin>>t;
// while(t--)
// {
int n,k,x;
cin>>n>>k>>x;
vector<int>v;
int arr[n];
for(int i=0... | C++ | c6c07ef23cf2def9f99cbfb6076c9810 | b94e47ce4f7916b78ce3330980bb0275 | 1,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<pair<ll,ll>>v;
int n;
ll a,b;
int main()
{
//freopen("input.c","r",stdin);
//freopen("output.c","w",stdout);
cin>>n;
ll sum=0;
for(int i=0;i<n;i++){
cin>>a>>b;
v.push_back(pair<ll,ll>(b,a));
... | C++ | 6e8cabaee588f53faae5feb2d1950c58 | 6c60dfa8044a4b4836e91fbe277ff771 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define N 100003
#define LL long long
#define INF 0x3f3f3f3f
#define PLL pair<LL,LL>
#define b first
#define a second
int n;
PLL h[N];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i)
scanf("%lld%lld",&h[i].a,&h[i].b);
sort(h+1,h+n+1);
LL ans=0,cnt=0;
int l=1,r=n;
... | C++ | 6e8cabaee588f53faae5feb2d1950c58 | 3e7bc5118b5191b2516b190b9f3d9e35 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define LL long long
int main()
{
int n; cin >> n;
LL a,b, sum = 0,Ans = 0, s = 0, e = 0, TotalItems = 0;
map<LL,LL> mp;
for (int i = 0; i < n; sum += a, mp[b] += a, i++)
cin >> a >> b;
TotalItems = sum;
if (mp.begin()->first < sum)
... | C++ | 6e8cabaee588f53faae5feb2d1950c58 | beb8f1319ff5602721c851df298e9f18 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N=2e5+10;
long long n,a,b,arr[N];
int solve() {
cin>>n;
deque<pair<long long,long long>>dq;
for(int i=0;i<n;i++)
{
cin>>a>>b;
dq.push_back({b,a});
}
sort(dq.begin(),dq.end());
long long cnt=0, cost=0;
while(dq.size... | C++ | 6e8cabaee588f53faae5feb2d1950c58 | 905af91ea2020d09fbe46b8876106254 | 1,600 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define el '\n'
#define ld long double
#define pi 3.1415926536
#define Covid ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
const long long N=2e6;
long long a[N],b[N];
/*void solve(ll x){
if(x>2e10)return;
if(x!=0)v.push_back(x);
solve(... | C++ | 6e8cabaee588f53faae5feb2d1950c58 | 9fe2038cbd9d0b6d59467461e4250079 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define maxN (ll)4e5
#define inf (ll)2e18
#define pb push_back
#define vec vector
#define forn(i,a,b) for (ll i=a; i<b; i++)
#define rforn(i,a,b) for (ll i=a-1; i>=b; i--)
#define sz(a) a.size()
#define all(a) a.begin(), a.end()... | C++ | 6e8cabaee588f53faae5feb2d1950c58 | 04ce17f51cea44a8f9d20ae27a2b5608 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,price=0,pur=0;
cin>>n;
vector<pair<ll,ll>> things;
for(int i=0;i<n;i++){
ll x,y;
cin>>x>>y;
things.push_back(make_pair(y,x));
}
sort(things.begin(),things.end());
ll lo=0,... | C++ | 6e8cabaee588f53faae5feb2d1950c58 | be50aacdc57093af4502b9c05a37a888 | 1,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool comp (const pair<ll,ll>&par1, const pair<ll,ll>&par2){
return par1.second > par2.second;
}
int main (){
int n;
cin>>n;
vector<pair<ll,ll>>vec(n);
for (int i =0 ; i<n;i++){
pair<ll,ll> par;
cin>>par.first;
cin>>par.second;
vec... | C++ | 6e8cabaee588f53faae5feb2d1950c58 | f2e1f48bfff1630d53ae53c04ef5af9f | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
bool cmpvec(pair<ll,ll> &a,pair<ll,ll> &b)
{
return a.first>b.first;
}
void solve(){
int n;
cin>>n;
vector<pair<ll,ll> >v;
ll a;
ll b;
for(int i=0;i<n;++i){
cin>>a;cin>>b;
v.push_back(make_pair(b,a));
}... | C++ | 6e8cabaee588f53faae5feb2d1950c58 | fc7ee3c48571daaa43d979ba89b2057b | 1,600 | PASSED |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, c, d, ans;
pair <int, int> a[111111];
main(){
cin >> n;
for(int i = 0; i < n; i++){
cin >> a[i].second >> a[i].first;
c += a[i].second;
}
sort(a, a+n);
int l = 0, r = n-1;
while(c != d){
for(int i = r; i >= l; i--){
if(d + a[i].... | C++ | 6e8cabaee588f53faae5feb2d1950c58 | 994c16d32a5b9b6c9d0941dafda9786e | 1,600 | PASSED |
#include<iostream>
#include<iomanip>
#include<stdio.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int k ;
cin>>k;
for(int i=0;i<k;i++){
long long n=0,x=0,t=0;
cin>>n>>x>>t;
long long total=0;
total=(t/x-1)*(t/x)/2;
if(n<t/x)
cout<<n*(n-1)/2<<endl;
... | C++ | 4df38c9b42b0f0963a121829080d3571 | db92dfaebf79ef22d0ecdb30b5b96983 | 1,000 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename K, typename V, typename Comp = std::less<K>>
using ordered_map = tree<K, V, Comp, rb_tree_tag, tree_order_statistics_node_update>;
template <typen... | C++ | 4df38c9b42b0f0963a121829080d3571 | dc094cd699f00315e084aa39a2776262 | 1,000 | PASSED |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define ll long long int
#define mod 1000007
#define N 1000005
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cou... | C++ | 4df38c9b42b0f0963a121829080d3571 | f483549bfe7325c2c0f934bb525300ee | 1,000 | PASSED |
/// ******************************************
/// Author: Fahim Montasir Turza
/// Department of CSE
/// BSMRSTU
/// ******************************************
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define m... | C++ | 4df38c9b42b0f0963a121829080d3571 | 2a29be85836cb6057bbd8156ac8bc78c | 1,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int k;cin>>k;
while(k--){
ll n,x,t;
scanf("%lld%lld%lld",&n,&x,&t);
if(t<x) {cout<<0<<endl;continue;}
ll tmp=t/x;
if(tmp+1>=n){
cout<<(n-1)*n/2<<endl;
}
else{
... | C++ | 4df38c9b42b0f0963a121829080d3571 | 5603f40380dadde188e73da8baba12ce | 1,000 | PASSED |
#include<iostream>
using namespace std;
int main(){
int k;
cin >> k;
while(k--){
unsigned long long n,x,t;
cin >> n >> x >> t;
unsigned long long temp=t/x;
if(temp >= n) cout << (n-1)*n/2 << endl;
else {
cout << temp * (n-temp-1) + temp * (temp+1) / 2 << endl;
}
}
return 0;
}
... | C++ | 4df38c9b42b0f0963a121829080d3571 | 48740f2f1c6fcf87c488db1e8558e8e2 | 1,000 | PASSED |
//
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
cin.tie(nullptr)->sync_with_stdio(false);
int t; cin>>t;
while(t--){
int n, x, t;
cin>>n>>x>>t;
int cover = t/x;
int ans = (max((int)0, n- t/x) * (min(n, t/x)) ) + (((min(n... | C++ | 4df38c9b42b0f0963a121829080d3571 | c26fdd75c777386640d196d94373a378 | 1,000 | PASSED |
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long LL;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
LL n,t,x;
scanf("%lld%lld%lld",&n,&x,&t);LL l;
if((t/x+1)>=n)
{
l=(n-1)*n/2;
}
else
{
l=(n-t/x)*(t/x)+(t/x-1)*(t/x)/2;
}
printf("%lld\n",l);
}
}
... | C++ | 4df38c9b42b0f0963a121829080d3571 | 44ef5d5a73e96d57eb50678625b68b0a | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define bug cout << "----\n"
#define inf 0x3f3f3f3f
#define PI acos(-1)
#define eps 1e-10
#define llinf 0x3f3f3f3f3f3f3f3f
#define endl '\n'
#define IO ios::sync_with_stdio(false),cin.tie(0)
typedef long long ll;
ll Mod = 1e9 + 7;
const int N = 1e3 + 10;
const int M = 10010;... | C++ | 4df38c9b42b0f0963a121829080d3571 | 601a9a6ebb88a1047f8ff19fa41d9bd8 | 1,000 | PASSED |
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <stack>
#include <cstdio>
#include <queue>
#include <set>
#include<sstream>
#include <cstring>
#include <cmath>
#include <bitset>
//#pragma GCC optimize(2);
#define IOS ios::sync_with_stdio(false) ,cin.tie(0), cout.tie(0);
#define mm(a,... | C++ | 4df38c9b42b0f0963a121829080d3571 | 671bb407885c7e61fa57cfac891c98c1 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=100005;
int n,m,a[N],l[N][2],r[N][2],L[2],R[2],mn[2],pr[N][2];
bool tmp[2],nw[2],fl;
int read(){
int x=0,op=1;
char c=getchar();
while(!isdigit(c)){
if(c=='-')op=-1;
c=getchar();
}
while(isdigit(c)){
x=(x<<1)+(x<<3)+(c^48);
c=getchar(... | C++ | 9826775301204c45799ad6bf07c89cb2 | 4e6f9a5a61b0b4fbbeb7269e0cec245b | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int N=100005;
int n,m,a[N],l[N][2],r[N][2],L[2],R[2],mn[2],pr[N][2];
bool tmp[2],nw[2],fl;
int read(){
int x=0,op=1;
char c=getchar();
while(!isdigit(c)){
if(c=='-')op=-1;
c=getchar();
}
while(isdigit(c)){
x=(x<<1)+(x<<3)+(c^48);
c=getchar(... | C++ | 9826775301204c45799ad6bf07c89cb2 | df7b0d206e492604e24d447beac3e11c | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define N 100005
int n,m,mn[2],L1[2],R1[2],a[N],L[N][2],R[N][2],pr[N][2];bool fl,nw[2],tmp[2];
int main()
{
scanf("%d %d",&n,&m);
for(int i=1;i<=n;++i)
scanf("%d %d %d %d %d",&a[i],&L[i][0],&R[i][0],&L[i][1],&R[i][1]);
mn[0]=mn[1]=n+1;nw[0]=nw[1]=1;L1[0]=L1[1]... | C++ | 9826775301204c45799ad6bf07c89cb2 | c57249bfe3df531dbec87fef9a45afb3 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define N 100005
int n,m,mn[2],L1[2],R1[2],a[N],L[N][2],R[N][2],pr[N][2];bool fl,nw[2],tmp[2];
int main()
{
scanf("%d %d",&n,&m);
for(int i=1;i<=n;++i)
scanf("%d %d %d %d %d",&a[i],&L[i][0],&R[i][0],&L[i][1],&R[i][1]);
mn[0]=mn[1]=n+1;nw[0]=nw[1]=1;L1[0]=L1[1]... | C++ | 9826775301204c45799ad6bf07c89cb2 | a7fdea8e80911c98a3b5c306a89e83e5 | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define N 100005
int n,m,mn[2],L1[2],R1[2],a[N],L[N][2],R[N][2],pr[N][2];bool fl,nw[2],tmp[2];
int main()
{
scanf("%d %d",&n,&m);
mn[0]=mn[1]=n+1;nw[0]=nw[1]=1;L1[0]=L1[1]=0;R1[0]=R1[1]=m;
for(int i=1;i<=n;++i)
scanf("%d %d %d %d %d",&a[i],&L[i][0],&R[i][0],&... | C++ | 9826775301204c45799ad6bf07c89cb2 | 9a05ce36670ab6077e3f17d985ddc9ae | 2,500 | PASSED |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define x first
#define y second
#define sz(u) (int)(u.size())
#define ld long double
#define all(u) u.begin(),u.end()
using namespace std;
const int MAXN = 2e5;
vector<vector<vector<int>>> mxL(2,vector<vector<int>>(20,vecto... | C++ | 9826775301204c45799ad6bf07c89cb2 | a4c98c8dda1c1577f27735556e632220 | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define reg register
#define int long long
#define pb push_back
#define mp make_pair
#define Down(i,a,b) for(reg int i=a;i>=b;--i)
#define rep(i,a,b) for(reg int i=a;i<=b;++i)
template<typename T>inline void ckmin(T &x,T y){x=x<y?x:y; return ;}
template<typename T>inline v... | C++ | 9826775301204c45799ad6bf07c89cb2 | ac097c4ffffffd2a16b7a8adf44deca0 | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define reg register
#define int long long
#define pb push_back
#define mp make_pair
#define Down(i,a,b) for(reg int i=a;i>=b;--i)
#define rep(i,a,b) for(reg int i=a;i<=b;++i)
template<typename T>inline void ckmin(T &x,T y){x=x<y?x:y; return ;}
template<typename T... | C++ | 9826775301204c45799ad6bf07c89cb2 | 340efc9218d706754ef7dbfb59b8f7ec | 2,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
//FILE *fi = freopen("1.txt", "r", stdin);
typedef pair<int, int> ii;
const long long Mod = 1e9 + 7;
const int Maxn = 1e5 + 10;
ii a[Maxn];
ii b[Maxn];
int k[Maxn];
bool f[Maxn][10];
int trace[Maxn][10];
int n, m;
ii RMQ[Maxn][2][20];
ii operator+(ii a, ii b)
... | C++ | 9826775301204c45799ad6bf07c89cb2 | d5e21a3889b4e68f5fa64bb122d0dcec | 2,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define LD long double
const int N = 100010;
int inf = 1e9;
int mod = 1e9 + 7;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typenam... | C++ | 9826775301204c45799ad6bf07c89cb2 | 4c6e0c76ebc7bc1747077c914a82582d | 2,500 | PASSED |
#include <cstdio>
#include <vector>
#include <algorithm>
#define For(i,x,y) for (int i=x;i<=(int)(y);i++)
#define Dwn(i,x,y) for (int i=x;i>=(int)(y);i--)
using namespace std;
const int N=4e5+5;
int n,m,a[N],Ans[N];
vector<int> v[N];
inline int Read() {
int x=0,f=1;
char ch=getchar();
while (... | C++ | 959f4b0f795688bc3fccc45686e7b41c | 98dce91482ec0b2316949f3be1664eb9 | 2,600 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
... | C++ | 959f4b0f795688bc3fccc45686e7b41c | f9e476c5353e2e871d082be65e32fcf4 | 2,600 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
... | C++ | 959f4b0f795688bc3fccc45686e7b41c | efdc91935a0caaa85b5c208301ab2c4b | 2,600 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
... | C++ | 959f4b0f795688bc3fccc45686e7b41c | 79c0ba11de8e370d3baebea9416a8536 | 2,600 | PASSED |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
... | C++ | 959f4b0f795688bc3fccc45686e7b41c | d6ba3bcfb684233f7d71c9edc0819bb6 | 2,600 | PASSED |
#include<bits/stdc++.h>
using namespace std;
vector<int> vec[200001];
int ans[200001],arr[200001];
struct data
{
int l,r,mini,maxi,d;
};
data tree[1000001];
void pushup(int x)
{
tree[x].maxi=max(tree[x<<1].maxi,tree[(x<<1)+1].maxi);
tree[x].mini=min(tree[x<<1].mini,tree[(x<<1)+1].mini);
return... | C++ | 959f4b0f795688bc3fccc45686e7b41c | 4f2b2db073e7b42483e84a9e26af3104 | 2,600 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
#define ll long long int
#define N 200005
struct node{
int val,id;
bool operator<(node tmp){
return val<tmp.val;
}
}e[N];
int n;
int res[N];
struct tree{
int sum;
int lsum,rsum;
int tl,tr,ts;
}... | C++ | 959f4b0f795688bc3fccc45686e7b41c | 4ca3a3b0920051189b8aa5b6514d3d32 | 2,600 | PASSED |
#include <bits/stdc++.h>
#define BPhuong "main"
#define maxn 200005
#define fi(i, a, b) for(int i = a; i <= b; i++)
#define fid(i, a, b) for(int i = a; i >= b; i--)
#define ll long long
#define bit(i, j) ((i >> j) & 1)
#define pii pair<int, int>
#define f first
#define se second
#define pb push_back
using ... | C++ | 959f4b0f795688bc3fccc45686e7b41c | 7e1cb28ffba815c729ffca51710378f1 | 2,600 | PASSED |
#include <bits/stdc++.h>
#define BPhuong "main"
#define maxn 200005
#define fi(i, a, b) for(int i = a; i <= b; i++)
#define fid(i, a, b) for(int i = a; i >= b; i--)
#define ll long long
#define bit(i, j) ((i >> j) & 1)
#define pii pair<int, int>
#define f first
#define se second
#define pb push_back
using ... | C++ | 959f4b0f795688bc3fccc45686e7b41c | 8b2b45f7026c0f721f1dd93f449c26b4 | 2,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#ifdef Adrian
#include "debug.h"
#else
#define debug(...) 9999
#endif
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef complex<int> point;
#define F first
#define S second
#define ii pair<ll,ll>
struct node {
/... | C++ | 959f4b0f795688bc3fccc45686e7b41c | 5883c84be4636acb4ec4c18e7ec1e70a | 2,600 | PASSED |
using System;
using System.Linq;
class D2
{
static int[] Read() => Array.ConvertAll(Console.ReadLine().Split(), int.Parse);
static (int, int, int) Read3() { var a = Read(); return (a[0], a[1], a[2]); }
static void Main() => Console.WriteLine(string.Join("\n", new int[int.Parse(Console.ReadLine())].Select(_ ... | C# | a2d4f0182456cedbe85dff97ec0f477e | 6cb343744afb917b28b1b09838c6353f | 1,500 | PASSED |
using System;
using System.Linq;
class D
{
static int[] Read() => Array.ConvertAll(Console.ReadLine().Split(), int.Parse);
static (int, int) Read2() { var a = Read(); return (a[0], a[1]); }
static (int, int, int) Read3() { var a = Read(); return (a[0], a[1], a[2]); }
static long[] ReadL() => Array.Convert... | C# | a2d4f0182456cedbe85dff97ec0f477e | 72062efd51b298027d35023da37c9f36 | 1,500 | PASSED |
using System;
using System.Collections.Generic;
using System.Collections;
using System.Collections.Specialized;
using System.Linq;
using System.Text;
using System.IO;
using System.Reflection;
using static System.Math;
using System.Numerics;
using System.Threading;
using System.Runtime.CompilerServices;
usi... | C# | a2d4f0182456cedbe85dff97ec0f477e | f463ae53f9b751deff7e2224a6252703 | 1,500 | PASSED |
using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using System.Text.RegularExpressions;
using System.Threading.Tasks;
using static System.Math;
public static class P
{
public ... | C# | a2d4f0182456cedbe85dff97ec0f477e | 27556e55dae54b6ac4e874f77e51c020 | 1,500 | PASSED |
using System;
using System.Collections.Generic;
using System.Diagnostics.CodeAnalysis;
using System.Globalization;
using System.IO;
using System.Linq;
using System.Text;
namespace Hacking
{
#if ONLINE_JUDGE
#else
//using Library;
#endif
public class Algo
{
private StreamWri... | C# | a2d4f0182456cedbe85dff97ec0f477e | 708239bd15c38facb131587049501b56 | 1,500 | PASSED |
using System;
using System.Collections.Generic;
using System.Text;
namespace Debugger
{
public class Program
{
static void Main(string[] args)
{
// SingleTestCase();
MultipleTestCases();
}
public static void Process(int test)
{
... | C# | a2d4f0182456cedbe85dff97ec0f477e | d208087c0eea613be755024e00f443d2 | 1,500 | PASSED |
using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.Linq;
using System.Numerics;
using static System.Math;
namespace CompetitiveProgramming
{
class Program
{
public static void Main()
{
var cases = int.Parse(Console.ReadLine());
var sols = new int[cases];
... | C# | a2d4f0182456cedbe85dff97ec0f477e | 044d3c8ecd9bdffd2da2d9d95ff4fe48 | 1,500 | PASSED |
using System;
using System.Collections.Generic;
using System.Globalization;
using System.IO;
using System.Linq;
using System.Runtime.CompilerServices;
using System.Text;
using System.Threading;
// (づ°ω°)づﾐe★゜・。。・゜゜・。。・゜☆゜・。。・゜゜・。。・゜
public class Solution
{
public void Solve()
{
for (int ... | C# | a2d4f0182456cedbe85dff97ec0f477e | 885989b72104abbaefe314ab362934e3 | 1,500 | PASSED |
using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using static System.Math;
using System.Text;
using System.Threading;
using System.Globalization;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
using Library;
namespace Program
{
public s... | C# | a2d4f0182456cedbe85dff97ec0f477e | 8c4cbfd0f04486cd08aa97c11229dbb6 | 1,500 | PASSED |
using System;
using System.IO;
using System.Collections.Generic;
using System.Linq;
using System.Numerics;
using System.Runtime.CompilerServices;
using System.Text;
using System.Globalization;
using System.Threading;
using static System.Math;
namespace FertiLib.Contest.D
{
public class Solver
{
Sc... | C# | a2d4f0182456cedbe85dff97ec0f477e | 8d681f7b500ddf050159cd0513de8cea | 1,500 | PASSED |
from bisect import insort
for _ in range(int(input())):
N,M,X = map(int,input().split())
blocks_heights = map(int,input().split())
if N<M:print("NO");continue
print("YES")
towers = {}
heights = []
smallest_height = 0
smallest_towers = list(range(1,M+1))
s = ""
for block_heigh... | Python | 57df7947bb90328f543b984833a78e64 | fc437deed1098f4703a05378848b42aa | 1,400 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.