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 |
|---|---|---|---|---|---|
//#pragma GCC optimize("O0")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <li... | C++ | d8467d78c638a379fc9a6537064b1f22 | 8c4b1267053bebf9be3da862c2aba09d | 3,200 | PASSED |
//#pragma GCC optimize("O0")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <li... | C++ | d8467d78c638a379fc9a6537064b1f22 | 1fbc7e3c537c7690f5d4407a019df942 | 3,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
constexpr int MOD = 1e9 + 7;
int add(int a, int b) {
return a + b < MOD ? a + b : a + b - MOD;
}
int mul(int a, int b) {
return a * (long long) b % MOD;
}
int sub(int a, int b) {
return a >= b ? a - b : a - b + MOD;
}
struct Info {
int mx = -1, cntmx =... | C++ | d8467d78c638a379fc9a6537064b1f22 | e8b7bc7c0db974d22626f879fb3f0ab0 | 3,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 200001, mod = 1e9 + 7;
int fn[N], n, L[N], R[N], a[N], ord[N];
void add(int i, int x) {
for (; i < n; i |= (i + 1))
fn[i] = (fn[i] + x) % mod;
}
int get(int i) {
int ans = 0;
for (; i > -1; i = ((i + 1) & i) - 1)
ans = (ans + f... | C++ | d8467d78c638a379fc9a6537064b1f22 | c845079f88a925643442141c3852dabf | 3,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N = 200001, mod = 1e9 + 7;
int fn[N], n, L[N], R[N], a[N], ord[N];
void add(int i, int x) {
for (; i < n; i |= (i + 1))
fn[i] = (fn[i] + x) % mod;
}
int get(int i) {
int ans = 0;
for (; i > -1; i = ((i + 1) & i) - 1)
ans = (ans + f... | C++ | d8467d78c638a379fc9a6537064b1f22 | 79cb213075aa2f101ea974d9bd1c02cb | 3,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
namespace Ment {
template<typename T>
T inverse(T a, T m) {
T u = 0, v = 1;
while (a != 0) {
T t = m / a;
m -= t * a;
swap(a, m);
u -= t * v;
swap(u, v);
}
assert(m == 1);
... | C++ | d8467d78c638a379fc9a6537064b1f22 | 8f5ba23a04d60527c0ed47a4541a6518 | 3,200 | PASSED |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <unordered_set>
#include <cassert>
using namespace std;
// t1 t2 .. t26
// c1 c2 .. c26
// f1 f2 .. f26
// cost = f1 * min(c1/f1, t1) + min(c2, t2*f2) + ... + m... | C++ | 9b35ad00a59017df0f91fd83da17726d | a212281ccbd0e6c0aeb77efec28332e5 | 3,500 | PASSED |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <unordered_set>
#include <cassert>
using namespace std;
// t1 t2 .. t26
// c1 c2 .. c26
// f1 f2 .. f26
// cost = f1 * min(c1/f1, t1) + min(c2, t2*f2) + ... + m... | C++ | 9b35ad00a59017df0f91fd83da17726d | be810868ad4b78f71c310b2b6534d89c | 3,500 | PASSED |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <unordered_set>
using namespace std;
// t1 t2 .. t26
// c1 c2 .. c26
// f1 f2 .. f26
// cost = f1 * min(c1/f1, t1) + min(c2, t2*f2) + ... + min(c26, t26*f26)
s... | C++ | 9b35ad00a59017df0f91fd83da17726d | 8a1ffdc6a75e09826611ed75d4131cd5 | 3,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const ll INF = 1e18;
int n, k;
ll T;
vector<int> z;
vector<ll> pass, fine;
vector<vector<pair<int, ll>>> g;
vector<ll> ein, aus;
vector<vec... | C++ | 9b35ad00a59017df0f91fd83da17726d | a2eaf72fb79406ac615a1f56ec7f9e28 | 3,500 | PASSED |
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <climits>
using namespace std;
#define vec vector
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
struct zone_t{
ll fine;
ll pass;
};
struct edge_t{
edge_t(int x, ll w):w(w), x(x){}
ll w;
in... | C++ | 9b35ad00a59017df0f91fd83da17726d | 091d467e3e429e5e93c6da093326df4f | 3,500 | PASSED |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namesp... | C++ | 9b35ad00a59017df0f91fd83da17726d | e7526d948a4467aa6cf73ef1696800b5 | 3,500 | PASSED |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namesp... | C++ | 9b35ad00a59017df0f91fd83da17726d | 1cfe214de2d09b3668d1c6555f7f37d4 | 3,500 | PASSED |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namesp... | C++ | 9b35ad00a59017df0f91fd83da17726d | 7c0a446f099be9d53fe9c91b0db71b6c | 3,500 | PASSED |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namesp... | C++ | 9b35ad00a59017df0f91fd83da17726d | 919b0b82f757e2250f10c87f0c335381 | 3,500 | PASSED |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namesp... | C++ | 9b35ad00a59017df0f91fd83da17726d | 2cf42b0993758f4a5cedbd2aa2f6b4d0 | 3,500 | PASSED |
#include <iostream>
// #include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
string s;
for (int j = 0; j < n; j++)
{
cin >> s;
int count1 = 0;
int count0 = s.length() - 1;
for (int i = 0; i < s.length(); i++)
{
... | C++ | 0c9f2301629726870a0ab57299773fd6 | 5bffe3a131db3fdca331ff3d1483f8ae | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define dd double
#define sg string
#define modd 1000000007
#define en "\n"
#define sc(a) scanf("%lld",&a);
#define f(i,a,n) for(ll i=a;i<n;i++)
#define ps(a) printf("%lld ",a);
#define pn(a) printf("%lld\n",a);
int main()
{
//f... | C++ | 0c9f2301629726870a0ab57299773fd6 | 6938f119caff91c4fdc42ee8c50628f0 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define dd double
#define sg string
#define modd 1000000007
#define en "\n"
#define sc(a) scanf("%lld",&a);
#define f(i,a,n) for(ll i=a;i<n;i++)
#define ps(a) printf("%lld ",a);
#define pn(a) printf("%lld\n",a);
int main()
{
// f... | C++ | 0c9f2301629726870a0ab57299773fd6 | 0c219485f0efa135ac0793bc8bd42795 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
string s;
cin>>s;
int zero=0;
for(int i=0;i<s.length();i++)
{
if(s[i]=='0')
{
zero=i+1;
break... | C++ | 0c9f2301629726870a0ab57299773fd6 | 15c73c1e8e963720abf80cbc25d9994d | 1,100 | PASSED |
#include<iostream>
using namespace std;
int calculateThief(string &str, int index){
int thief=1, quesCount=0;
for(int j=index-1;j>=0;j--)
{
if(str[j]=='0')
{
thief++;
break;
}
else if(str[j]=='1')
{
thief++;
br... | C++ | 0c9f2301629726870a0ab57299773fd6 | 1308e85767623de6c449e084724816eb | 1,100 | PASSED |
#include<iostream>
using namespace std;
int sus(string a){
int one = 0;
int zero = 0;
bool one_found = false;
bool zero_found = false;
for(int i = 0; i < a.size(); i++){
if(a[i] == '1'){
one = i;
one_found = true;
}
if(a... | C++ | 0c9f2301629726870a0ab57299773fd6 | 20815b2028916f4e941e981818c24669 | 1,100 | PASSED |
/*████████████████████████████████████████████████████████████████████████████████████
██████████████████████████████████████████████████████████████████████████████████████
███████████████████████████▓▓▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓╬╬╬╬╬╬▓███████████████████████
███████████████████████████▓███████▓▓╬╬╬╬╬╬╬╬╬╬╬╬▓███▓▓▓... | C++ | 0c9f2301629726870a0ab57299773fd6 | 88774cf6aacebfbc25be87a06d4aa5e9 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define umap unordered_map
#define pi acos(-1)
#define ll long long
#define pb push_back
#define pf push_front
#define ins insert
#define ppb pop_back
#define ppf pop_front
#define sf(x) double x;scanf("%lf",&x);
#define sc(x) ll x;scanf("%lld",&x);
#define sn... | C++ | 0c9f2301629726870a0ab57299773fd6 | 731f3504b5f2f9b1494d0903079b1875 | 1,100 | PASSED |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
// template<class T> using pq =... | C++ | 0c9f2301629726870a0ab57299773fd6 | 4b533c13baf54100e17868785bfb5782 | 1,100 | PASSED |
/*
* Created in Windows XP
* Time 15 : 21
* Author : thrasherr.
*/
#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>
#include <list>
#include <set>
#incl... | C++ | 0c9f2301629726870a0ab57299773fd6 | 178e8261efb48cd391803fea724ceae3 | 1,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e6+1000;
#define endl '\n'
ll t,n,m;
ll vis[200050];
vector<ll>q[200050];
vector<ll>p[200050];
vector<ll>v[200050];
ll cnt;
void dfs(ll xb){
// cout<<xb<<"!!!!!"<<endl;
v[cnt].push_back(xb);
if(q[xb].size()==0){
// cout<<"!... | C++ | cd2a9169186c4ade98548c29bbdacdf0 | 8797f800017c95cb51fa044d98e58dc6 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e6+1000;
#define endl '\n'
ll t,n,m;
ll vis[200050];
vector<ll>q[200050];
vector<ll>p[200050];
vector<ll>v[200050];
ll cnt=0;
void dfs(ll xb){
// cout<<xb<<"!!!!!"<<endl;
v[cnt].push_back(xb);
if(q[xb].size()==0){
cnt++;
... | C++ | cd2a9169186c4ade98548c29bbdacdf0 | ce47740b2bc18965547766e3d55b63bd | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e6+1000;
#define endl '\n'
ll t,n,m;
ll vis[200050];
vector<ll>q[200050];
vector<ll>p[200050];
vector<ll>v[200050];
ll cnt=0;
void dfs(ll xb){
v[cnt].push_back(xb);//把该路径放入节点中
if(q[xb].size()==0){
cnt++;
return ;
}/... | C++ | cd2a9169186c4ade98548c29bbdacdf0 | 0c5bd4a895304a5dc8cbeaba54452957 | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e6+1000;
#define endl '\n'
ll t,n,m;
ll vis[200050];
vector<ll>q[200050];
vector<ll>p[200050];
vector<ll>v[200050];
ll cnt=0;
void dfs(ll xb){
v[cnt].push_back(xb);
if(q[xb].size()==0){
cnt++;
return ;
}
bool flag=... | C++ | cd2a9169186c4ade98548c29bbdacdf0 | b7475debc793bc1ea7d4b25da0859297 | 1,300 | PASSED |
#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
int n;
const int N=200005;
int h[N];
int e[N];
int ne[N];
int st[N];
int idx,len,root;
vector<int> ans[N];
void init(){
memset(h,-1,sizeof h);
memset(st,0,sizeof st);
for(int i=1;i<=n;i++){
ans[i].clear(... | C++ | cd2a9169186c4ade98548c29bbdacdf0 | 527b82424e2d28fb6b5262a006eefbbe | 1,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define all(a) a.begin(),a.end()
#define mod (ll)(10000007)
const int Mxs=200000 + 20;
vector<int>depth(Mxs), Vis(Mxs), revsA(Mxs);
int s=0;
int parent=1;
void dfs(int ind, vector<vector<int>> &A){
Vis[ind]=1;
for(int i=0;i<A[ind].size(... | C++ | cd2a9169186c4ade98548c29bbdacdf0 | 198582bba45af59c4d7319f600464e42 | 1,300 | PASSED |
// CF_1675D.
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>>v, paths;
vector<bool> vis, takenAsPath;
int t, n, x, root;
void reset(){
v = vector<vector<int>>(n+1, vector<int>());
paths = vector<vector<int>>();
vis = vector<bool>(n+1);
takenAsPath = vector<bool>(n+1);
}
... | C++ | cd2a9169186c4ade98548c29bbdacdf0 | 71aa44785cce930790d0f40cdbbf10d5 | 1,300 | PASSED |
// CF_1675D.
#include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5+1;
vector<int>v[MAX];
//map<int,bool>vis, takenAsPath;
bool vis[MAX];
bool takenAsPath[MAX];
vector<vector<int>>paths;
int t, n, x, root;
void reset(){
v[n+1];
vis[n+1];
takenAsPath[n+1];
for(int i=1; i<=n; ... | C++ | cd2a9169186c4ade98548c29bbdacdf0 | 94666af72c8114296ac60776013cffd5 | 1,300 | PASSED |
// CF_1675D.
#include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5+1;
vector<int>v[MAX];
//map<int,bool>vis, takenAsPath;
bool vis[MAX];
bool takenAsPath[MAX];
vector<vector<int>>paths;
int t, n, x, root;
void reset(){
v[n+1];
vis[n+1];
takenAsPath[n+1];
for(int i=1; i<=n; ... | C++ | cd2a9169186c4ade98548c29bbdacdf0 | 583f15f13e0cb91c49bd7c299e441ba3 | 1,300 | PASSED |
#include <bits/stdc++.h>
#define ll long long int
#define repn(i, m, n) for (int i = m; i < n; i++)
#define rep(i, n) repn(i, 0, n)
using namespace std;
vector<vector<int>> ans;
void dfs(int node, vector<int> tree[], vector<int>& path) {
path.push_back(node);
if((int)tree[node].size() == 0) {
... | C++ | cd2a9169186c4ade98548c29bbdacdf0 | 8a0d35c9b7e834b965855ac7bc86c7db | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define el << "\n"
#define no cout << "NO\n"
#define yes cout<<"YES\n"
#define all(arr) (arr).begin(), (arr).end()
#define rall(arr) (arr).rbegin(), (arr).rend()
#define cn(arr) for(auto& ele : arr) cin >> ele
#define co(arr) for(auto ele : ar... | C++ | e959e82b4bd4e7943a78bf5350a70c87 | db0fc536a7f6bdde36f86b583d145496 | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
void solve()
{
long long int t,n,i,count=0,flag=0;
cin>>t;
while(t--)
{
cin>>n;
long long int ar[n];
for(i=0; i<n; ++i)
cin>>ar[i];
if(n==1)
cout<<"0 \n";
else
{
... | C++ | e959e82b4bd4e7943a78bf5350a70c87 | 5599dd71e71e0dc591e4c3b048b6b9cb | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
void solve()
{
long long int t,n,i,count=0,flag=0;
cin>>t;
while(t--)
{
cin>>n;
long long int ar[n];
for(i=0; i<n; ++i)
cin>>ar[i];
if(n==1)
cout<<"0 \n";
else
{
... | C++ | e959e82b4bd4e7943a78bf5350a70c87 | 3c09ea123be3ffdd4199a3167c6d4263 | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
ll n;
cin>>n;
int a[n];
for(ll i=0;i<n;i++){
cin>>a[i];
}
ll h;
if(n==1){
cout<<0<<endl;return;
}else{
h=0;
for(ll i=n-2;i>=0;i--){
... | C++ | e959e82b4bd4e7943a78bf5350a70c87 | 1805201888e56dbff20b22150911eff1 | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
ll n;
cin>>n;
int a[n];
for(ll i=0;i<n;i++){
cin>>a[i];
}
ll h;
if(n==1){
cout<<0<<endl;return;
}else{
h=0;
for(ll i=n-2;i>=0;i--){
... | C++ | e959e82b4bd4e7943a78bf5350a70c87 | 08c22a08e26e1efda6d3b1f0cd8a97e2 | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
ll n;
cin>>n;
vector<ll> a(n);
for(ll i=0;i<n;i++){
cin>>a[i];
}
ll h;
if(n==1){
cout<<0<<endl;return;
}else{
h=0;
for(ll i=n-2;i>=0;i--){
... | C++ | e959e82b4bd4e7943a78bf5350a70c87 | 527288ce0edf676958a836f0907b496b | 900 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
ll n;
cin>>n;
vector<ll> a(n);
for(ll i=0;i<n;i++){
cin>>a[i];
}
ll h;
if(n==1){
cout<<0<<endl;return;
}else{
h=0;
for(ll i=n-1;i>0;i--){
... | C++ | e959e82b4bd4e7943a78bf5350a70c87 | 26a78e1a89ff0911d3cb8d5a149e3716 | 900 | PASSED |
/*Shaunak Mehta*/
#include <bits/stdc++.h>
using namespace std;
int prsieve[1000005] = {0};
vector<int> primelist;
void prime_sieve(int prsieve[])
{
for (int i = 3; i <= 1000000; i += 2)
{
prsieve[i] = 1;
}
for (long long int i = 3; i <= 1000000; i += 2)
{
if (prsieve[i] == 1)
... | C++ | e959e82b4bd4e7943a78bf5350a70c87 | 5f9b08ad750708ee0dd94f3fb08b8ba8 | 900 | PASSED |
#include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef long long ll;
ll a[50];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t,n;
cin>>t;
while(t--)
... | C++ | e959e82b4bd4e7943a78bf5350a70c87 | 1a7014d5b9026f68a76a53558ead8a41 | 900 | PASSED |
// JAI SHREE RAM !!
#include <bits/stdc++.h>
using namespace std;
#define code by Murari Pandey Infinite1400 from NITKKR
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define el cout << endl
#define br break
#define loop(i, n) for (int i = 0; i < n; i++)
#define loop1(i, n) for (int i = 1; ... | C++ | e959e82b4bd4e7943a78bf5350a70c87 | a76e4b603747a7994e1583a14790958b | 900 | PASSED |
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int a,b,c,x,y,t;
cin>>t;
while(t--)
{
cin>>a>>b>>c>>x>>y;
if(a+c>=x)
{
if(a>=x) c=c;
else c-=x-a;
if(b+c>=y)
cout<<"YES\n";
else
cout<<"NO\n";
}
else cout<<"NO\n";
}
}
... | C++ | 7ac27da2546a50d453f7bb6cacef1068 | 75424c48ca30d7b2ba2525bfa849a0ee | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,a,b,c,x,y;
cin>>n;
while(n--)
{
cin>>a>>b>>c>>x>>y;
if(a<x)c=c-(x-a);
if(b<y)c=c-(y-b);
if(c>=0)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
return 0;
}
| C++ | 7ac27da2546a50d453f7bb6cacef1068 | fd9e677dd7458cec0e0769c777a30e13 | 800 | PASSED |
#include<iostream>
#include<cstring>
#include<iomanip>
using namespace std;
int main()
{
int s,a,b,c,d,e,m,n;
cin>>s;
for(int i=1;i<=s;i++)
{
m=0;
n=0;
cin>>a>>b>>c>>d>>e;
if(a>=d) m=0;
else m=a-d;
if(b>=e) n=0;
else n=b-e;
if(c+m+n>=0) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
... | C++ | 7ac27da2546a50d453f7bb6cacef1068 | 6e8f7b7a37400d536b12ed6f39150495 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
long long t,a,b,x,y,c;
int main(){
cin>>t;
while(t--){
cin>>a>>b>>c>>x>>y;
x-=a;
y-=b;
if(x<0)x=0;
if(y<0)y=0;
if(x+y<=c)cout<<"YES\n";
else cout<<"NO\n";
}
return 0;
}
| C++ | 7ac27da2546a50d453f7bb6cacef1068 | 7578517d9c4a65d9d1879619ec1baa89 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int T;
int a,b,c,x,y;
int main()
{
cin>>T;
while(T--)
{
cin>>a>>b>>c>>x>>y;
if(a==b && b==c && c==x && x==y)
{
cout<<"YES"<<endl;
continue;
}
if(x-a<=0 && y-b<=0)
{
cout<<"YES"<<endl;
continue;
}
else if(x-a>0 && y-b<=0)
... | C++ | 7ac27da2546a50d453f7bb6cacef1068 | 5b58f67875ae56fa269c09a8116468a8 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t;
long long x,y,a,b,c;
int main(){
cin>>t;
while(t--){
scanf("%lld%lld%lld%lld%lld",&a,&b,&c,&x,&y);
x-=a;
if(x<0)x=0;
y-=b;
if(y<0)y=0;
if(x+y<=c)cout<<"YES\n";
else
cout<<"NO\n";
}
return 0;
}
| C++ | 7ac27da2546a50d453f7bb6cacef1068 | c456cf62c8b433959d1469640f1ed074 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long t;
cin>>t;
long a,b,c,x,y;
while(t--){
cin>>a>>b>>c>>x>>y;
if(a>=x){
if(b>=y){
cout<<"YES"<<endl;
continue;
}
else if(b<y){
long sum=y-b;
if(c>=sum){
cout<<"YES"<<endl;
... | C++ | 7ac27da2546a50d453f7bb6cacef1068 | 8798bfc9002a00aa5a81f0b23d774999 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int t;
long long a,b,x,y,c;
int main()
{
cin>>t;
while(t--)
{
scanf("%lld%lld%lld%lld%lld",&a,&b,&c,&x,&y);
x-=a;
y-=b;
if(x>0&&y>0)
{
if(c>=x+y)
{
printf("YES\n");
... | C++ | 7ac27da2546a50d453f7bb6cacef1068 | a8dfa015c1ad43333f5dc44ba908a816 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int T;
cin>>T;
while(T--)
{
long long a,b,c,x,y;
cin>>a>>b>>c>>x>>y;
x-=a,y-=b;
if(x>0&&y>0)
{
if(x+y<=c)puts("YES");
else puts("NO");
}
else if(x>0)
{
if(x<=c)puts("YES");
else puts("NO");
}
else if(y>0)
... | C++ | 7ac27da2546a50d453f7bb6cacef1068 | db8aea644d9e01284aa24701c3173f02 | 800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int t,mao,gou,a,b,c;
int main(){
cin>>t;
while(t--){
cin>>a>>b>>c;
cin>>mao>>gou;
if(a+c>=mao){
if(a<mao){
c-=mao-a;
}
if(c+b>=gou){
cout<<"YES\n";
}else{
cout<<"NO\n";
}
}else{
cout<<"NO\n";
}
}
}
... | C++ | 7ac27da2546a50d453f7bb6cacef1068 | adf4c6bb3094fa8c004578c1ded7c2a3 | 800 | PASSED |
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
using namespace __gnu_pbds;
#define _CRT_DISABLE_PERFCRIT_LOCKS
/* --------------- fast io --------------- */ // begin
namespace... | C++ | a688369a2b95a8e32d00541d54f3bec6 | d43557c869e0ee43ab1a2e5407c7ccb7 | 1,800 | PASSED |
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
using namespace __gnu_pbds;
#define _CRT_DISABLE_PERFCRIT_LOCKS
/* --------------- fast io --------------- */ // begin
namespace... | C++ | a688369a2b95a8e32d00541d54f3bec6 | 140d24d045accfa527776e538118f6de | 1,800 | PASSED |
#include <bits/stdc++.h>
#define int int64_t
using namespace std;
template<typename T>
class Vector {
private:
size_t sz = 0, pw = 0;
T* v = nullptr;
void merge_sort(size_t l, size_t r) {
if (l == r)
return;
size_t m = (l + r) >> 1;
merge_sort(l, m);
... | C++ | a688369a2b95a8e32d00541d54f3bec6 | 0183a7b1dba4221e799a2f472049f12a | 1,800 | PASSED |
#include <bits/stdc++.h>
#define int int64_t
using namespace std;
template<typename T>
class Vector {
private:
struct EmptyException {};
size_t sz, pw;
T* v = nullptr;
void merge_sort(size_t l, size_t r) {
if (l == r)
return;
size_t m = (l + r) >> 1;
... | C++ | a688369a2b95a8e32d00541d54f3bec6 | 04b8da69bd9b418def71d1f3f384f248 | 1,800 | PASSED |
#include <bits/stdc++.h>
#define int int64_t
using namespace std;
template<typename T>
class Vector {
private:
struct EmptyException {};
size_t sz = 0, pw = 0;
T* v = nullptr;
void merge_sort(size_t l, size_t r) {
if (l == r)
return;
size_t m = (l + r) >... | C++ | a688369a2b95a8e32d00541d54f3bec6 | 4192e4a8d789a571b3336ee12b4e6934 | 1,800 | PASSED |
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
using namespace __gnu_pbds;
#define _CRT_DISABLE_PERFCRIT_LOCKS
/* --------------- fast io --------------- */ // begin
namespace... | C++ | a688369a2b95a8e32d00541d54f3bec6 | db39c3706be9e89e1db361ac95abdc36 | 1,800 | PASSED |
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
using namespace __gnu_pbds;
#define _CRT_DISABLE_PERFCRIT_LOCKS//DAUNICH
/* --------------- fast io --------------- */ // begin
... | C++ | a688369a2b95a8e32d00541d54f3bec6 | fe9f93022e60e313f3b7628ba0c07733 | 1,800 | PASSED |
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
using namespace __gnu_pbds;
#define _CRT_DISABLE_PERFCRIT_LOCKS//DAUNICH
/* --------------- fast io --------------- */ // begin
... | C++ | a688369a2b95a8e32d00541d54f3bec6 | 350becf1472f7a2dcee389e255d48b9c | 1,800 | PASSED |
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
using namespace __gnu_pbds;
#define _CRT_DISABLE_PERFCRIT_LOCKS
/* --------------- fast io --------------- */ // begin
namespace... | C++ | a688369a2b95a8e32d00541d54f3bec6 | 7c05075fa9f403fcaa44d88e02a33efa | 1,800 | PASSED |
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
using namespace __gnu_pbds;
#define _CRT_DISABLE_PERFCRIT_LOCKS
/* --------------- fast io --------------- */ // begin
namespace... | C++ | a688369a2b95a8e32d00541d54f3bec6 | 28e7c3c2cb91c40e537b36a00c5bf8e0 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
template <class T>
bool ckmax(T &a, T b) { return a < b ? a = b, true : false; }
void solve()
{
int n, k;
string s;
cin >> n >> k;
cin >> s;
char mn = 'a';
for (int i = 0; i < n; i++)
{
if (s[i] > mn)
if (s[i] ... | C++ | b86c1533fdfe68fd4dea2bf99cd9e111 | 68546e0082c76854835b51c6accccdc7 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define sz(v) (int)v.size()
#define all(v) v.begin(),v.end()
#define eb emplace_back
template <class T> bool ckmax(T &a, T b) {return a<b ? a=b, true : false;}
void solve() {
int n,k; cin >> n >> k;
... | C++ | b86c1533fdfe68fd4dea2bf99cd9e111 | e72e696f22e450224ed39a79ce65e66d | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
vector<int>a[30];
int main(){
#ifdef lmj_debug
freopen("1.in","r",stdin);
#endif
int T;
cin>>T;
while(T--){
int n,k;
scanf("%d%d",&n,&k);
for (int i=0;i<26;i++) a[i].clear();
string s;
cin... | C++ | b86c1533fdfe68fd4dea2bf99cd9e111 | 89683a9081b5cb942ee90cccbc7180d3 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int n,k;
char s[1000010];
int main()
{
ios::sync_with_stdio(false);
int t;
cin>>t;
while(t--)
{
cin>>n>>k;
for(int i=1;i<=n;i++)
{
cin>>s[i];
}
if(k>=25)
{
for(int i=1;i<=n;i++)
{
cout<<'a';
}
cout<<endl;
continue... | C++ | b86c1533fdfe68fd4dea2bf99cd9e111 | cff947b12a2dc8c13eeab20488955182 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define sz(v) (int)v.size()
#define all(v) v.begin(),v.end()
#define eb emplace_back
template <class T> bool ckmax(T &a, T b) {return a<b ? a=b, true : false;}
void solve() {
int n,k; cin >> n >> k;
... | C++ | b86c1533fdfe68fd4dea2bf99cd9e111 | 128547d6e011282619752f04f6ba1b9c | 1,500 | PASSED |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n,k;
scanf("%d %d",&n,&k);
string s;
cin>>s;
int m=0;
int f1=-1,f2=-1;
for(int i=0;i<n;i++)
{
if(s[i]-'a'<=k){
m=max(m,s[i]-'a');... | C++ | b86c1533fdfe68fd4dea2bf99cd9e111 | 9c97409cb5967bec1dfe52b263d9f731 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int T;
cin>>T;
for(int t=0; t<T; t++)
{
int n,k;
cin>>n>>k;
string s;
cin>>s;
int mx=0;
/*将字符串通过操作变成字典序最小的字符串，
因此贪心的优先级为对坐标小的字母执行尽可能多又不浪费的操作*/
//在操作过程中，mx记录字符串中通过操作可以变... | C++ | b86c1533fdfe68fd4dea2bf99cd9e111 | ef420316025aa85f648f2f43abe27b78 | 1,500 | PASSED |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <utility>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <map>
using namespace std;
#define dd double
#define ll long long
#define ull unsigned long long
#de... | C++ | b86c1533fdfe68fd4dea2bf99cd9e111 | e5ba6ed94f846d9d21105088cda9457d | 1,500 | PASSED |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
#include <cmath>
using namespace std;
typedef long long ll;
const int maxn = 2e5+50;
ll R()
{
ll x = 0,f = 1;
char c = getchar();
while(c>'9' || c<'0')
{
if(c=='-')f=-1;
c = getchar();
... | C++ | b86c1533fdfe68fd4dea2bf99cd9e111 | 3caad0cfb8a2d7d25ccdfc37a137f3ce | 1,500 | PASSED |
#include <iostream>
#include <cstring>
using namespace std;
#define ll long long
inline int in(){
int x = 0;
bool f = 1;
char c = getchar();
while(c > '9' || c < '0'){
if(c == '-') f = 0;
c = getchar();
}
while(c <= '9' && c >= '0'){
x = (x << 3) + (x << 1) +... | C++ | b86c1533fdfe68fd4dea2bf99cd9e111 | f5a0089c7a87f3817b9218d938c17fd4 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using gg = long long;
#define rep(i, a, b, c) for (gg i = (a); i <= (b); i += (c))
#define rrep(i, a, b, c) for (gg i = (a); i >= (b); i -= (c))
#ifndef ONLINE_JUDGE
constexpr gg MAX = 25;
#endif
#ifdef ONLINE_JUDGE
constexpr gg MAX = 255;
#endif
constexpr gg mod... | C++ | 08272ecfdd6a79df5d0fe20efeb15861 | f86d0392682bfa2a07825218414aba10 | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using gg = long long;
#define rep(i, a, b, c) for (gg i = (a); i <= (b); i += (c))
#define rrep(i, a, b, c) for (gg i = (a); i >= (b); i -= (c))
#ifndef ONLINE_JUDGE
constexpr gg MAX = 25;
#endif
#ifdef ONLINE_JUDGE
constexpr gg MAX = 255;
#endif
constexpr gg mod... | C++ | 08272ecfdd6a79df5d0fe20efeb15861 | aecdc889741deecdeb6e0d8982f5ac0c | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using gg = long long;
#define rep(i, a, b, c) for (gg i = (a); i <= (b); i += (c))
#define rrep(i, a, b, c) for (gg i = (a); i >= (b); i -= (c))
#ifndef ONLINE_JUDGE
constexpr gg MAX = 25;
#endif
#ifdef ONLINE_JUDGE
constexpr gg MAX = 255;
#endif
constexpr gg mod... | C++ | 08272ecfdd6a79df5d0fe20efeb15861 | c57d6b6993e5cd5e551cb618f99628b1 | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using gg = long long;
#define rep(i, a, b, c) for (gg i = (a); i <= (b); i += (c))
#define rrep(i, a, b, c) for (gg i = (a); i >= (b); i -= (c))
#ifndef ONLINE_JUDGE
constexpr gg MAX = 25;
#endif
#ifdef ONLINE_JUDGE
constexpr gg MAX = 255;
#endif
constexpr gg mod... | C++ | 08272ecfdd6a79df5d0fe20efeb15861 | c5e2ca62dc061ca7db06c6b1469a8bf7 | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using gg = int;
#define rep(i, a, b, c) for (gg i = (a); i <= (b); i += (c))
#define rrep(i, a, b, c) for (gg i = (a); i >= (b); i -= (c))
#ifndef ONLINE_JUDGE
constexpr gg MAX = 25;
#endif
#ifdef ONLINE_JUDGE
constexpr gg MAX = 255;
#endif
constexpr gg mod = 1e9... | C++ | 08272ecfdd6a79df5d0fe20efeb15861 | a83960078e0f681c694a05274204ff3b | 2,300 | PASSED |
#include <bits/stdc++.h>
#define MAXN 200009
using namespace std;
typedef pair<int, int> PA;
int a[307], ss[307];
int n, k;
map<PA, int> rec[307];
int dfs(int i, int c, int r) {
if (i == 1) {
if (c + r == a[i] && c >=0 && c <= k) return abs(r);
else return MAXN;
}
if (ss[... | C++ | 08272ecfdd6a79df5d0fe20efeb15861 | be8485cd26f212b11c8f79bbb66a847c | 2,300 | PASSED |
#include <bits/stdc++.h>
#define MAXN 200009
using namespace std;
typedef pair<int, int> PA;
int a[307], ss[307];
int n, k;
map<PA, int> rec[307];
int dfs(int i, int c, int r) {
if (i == 1) {
if (c + r == a[i] && c >=0 && c <= k) return abs(r);
else return MAXN;
}
if (ss[... | C++ | 08272ecfdd6a79df5d0fe20efeb15861 | cd99e476aab2902994b9cd77ca3aa920 | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define all(c) c.begin(),c.end()
#define sz(x) int(x.size())
#define ar array
typedef long long ll;
typedef vector<int> vi;
const ll mod=1000000007;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll exp(ll x,ll y){
x%=mod;
ll res=1;... | C++ | 08272ecfdd6a79df5d0fe20efeb15861 | aeb956853ecebebadbf30cc9fb8c5438 | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define all(c) c.begin(),c.end()
#define sz(x) int(x.size())
#define ar array
typedef long long ll;
typedef vector<int> vi;
const ll mod=1000000007;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll exp(ll x,ll y){
x%=mod;
ll res=1;... | C++ | 08272ecfdd6a79df5d0fe20efeb15861 | 840693f18df1b77191e9d8841a8ecbe8 | 2,300 | PASSED |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <string>
#include <cmath>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <deque>
typedef int_fast64_t ll;
#define print(a) for (auto& _ : ... | C++ | 08272ecfdd6a79df5d0fe20efeb15861 | f0bd6d3ae1bd0045feac02202a07931a | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x,k,lol=720720,y;cin>>x>>k;
for(int i=0;i<x;i++){
for(int j=0;j<k;j++)
cin>>y,cout<<y*y*y*y*((i+j)&1)+lol<<" ";
cout<<"\n";
}
return 0;
} | C++ | 5f0b8e6175113142be15ac960e4e9c4c | b87d833dda6c2ebbc418fa3d3351de0f | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int f(int c){
return (c*c*c*c);
}
int main(){
int x,k,y,lol=720720,p;cin>>x>>k;
int a[x][k];
for(int i=0;i<x;i++)
for(int j=0;j<k;j++)
cin>>a[i][j];
for(int i=0;i<x;i++){
for(int j=0;j<k;j++)
cout<<((i+j)&1?f(a[i][j]):0)+lol<<" ";
... | C++ | 5f0b8e6175113142be15ac960e4e9c4c | 6da7897e40ac87d3ebd7ff5f928e8f92 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
bool func(int i){
int c=1;
while(c*c*c*c<i)c++;
return (c*c*c*c==i);
}
int main(){
int x,k,y,lol=1,p;cin>>x>>k;
int a[x][k];
for(int i=0;i<x;i++)
for(int j=0;j<k;j++)
cin>>a[i][j],lol=(lol*a[i][j])/__gcd(lol,a[i][j]);
for(int i=0;i<x;i++){
... | C++ | 5f0b8e6175113142be15ac960e4e9c4c | c54256d06a4ffe2a3e41a824ed1d1f12 | 2,200 | PASSED |
// LUOGU_RID: 91335565
#include<iostream>
using namespace std;
const int N=1e3+10;
int n,m,arr[N][N];
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cin>>arr[i][j];
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if((i+... | C++ | 5f0b8e6175113142be15ac960e4e9c4c | de9c331d3413e60ad31bc5050d666f6c | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define fel(i,x,y) for(int i=x;i<=y;i++)
#define feh(i,x,y) for(int i=x;i>=y;i--)
#define inf 0x7fffffff
#define int long long
#define pb push_back
#define endl "\n"
/*
*/
const int N=510;
int n,m;
i... | C++ | 5f0b8e6175113142be15ac960e4e9c4c | 3dedbd3f6eb2c83f1a27b4e854c924a4 | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,char> PII;
#define fel(i,x,y) for(int i=x;i<=y;i++)
#define fhl(i,x,y) for(int i=x;i>=y;i--)
#define pb push_back
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define inf 0x3fffffff
#define endl "\n"
#define ll long long
const ... | C++ | 5f0b8e6175113142be15ac960e4e9c4c | 067e0546fac39d4a47f2b95601ae2734 | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,char> PII;
#define fel(i,x,y) for(int i=x;i<=y;i++)
#define fhl(i,x,y) for(int i=x;i>=y;i--)
#define pb push_back
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define inf 0x3fffffff
#define endl "\n"
#define ll long long
#defin... | C++ | 5f0b8e6175113142be15ac960e4e9c4c | 397fc10ba45845e2d77ebbc2de9a6968 | 2,200 | PASSED |
//#pragma GCC optimize(2)
//#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define ll long long
#define int long long//
#define pll pair<ll,ll>
#define pii pair<int,int>
#define ull unsigned long long
#define nps fixed<<setprecision(... | C++ | 5f0b8e6175113142be15ac960e4e9c4c | d2f0ce757e17254d2d36e43c9066c5c3 | 2,200 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn=5e5;
void solve() {
int n,m;
scanf("%d %d",&n,&m);
int o=16*9*7*11*13*5;
for (int i=1;i<=n;i++) {
for (int j=1;j<=m;j++) {
int t;
cin>>t;
cout<<t*t*t*t*((i+j)&1)+o<<' ';
}
cout<<'\n';
}
}
int main() {
int T;
T... | C++ | 5f0b8e6175113142be15ac960e4e9c4c | 729d74d3cc0e4a03e36aa71b0334b3c4 | 2,200 | PASSED |
#include <bits/stdc++.h>
#define file_in(x) (freopen(#x".in","r",stdin))
#define file_out(x) (freopen(#x".out","w",stdout))
#define pb push_back
#define pr pair <int, int>
#define fi first
#define se second
#define mk make_pair
#define int long long
using namespace std;
char __c; bool __f; template <class T> void IN... | C++ | 5f0b8e6175113142be15ac960e4e9c4c | 0a33d0ddd03368c2e537074f2de89161 | 2,200 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(){
ll x,y;
cin>> x >> y;
ll res=0;
for(ll k=1;k*k<=x;k++)
res=res+max(0ll,min(y,x/k-1)-k);
printf("%lld\n",res);
}
int main(){
int t;
cin>> t;
while(t--) solve();
return 0;
}
| C++ | efdb966e414050c5e51e8beb7bb06b20 | c71f0d548f19b854e66f12bfd6c4dd1f | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
int SIZE(T (&t)){
return t.size();
}
template<typename T, size_t N>
int SIZE(T (&t)[N]){
return N;
}
string to_string(char t){
return "'" + string({t}) + "'";
}
string to_string(bool t){
return t ? "true" : "false";
}
string to_strin... | C++ | efdb966e414050c5e51e8beb7bb06b20 | 4e085a40aa36d8b8cff7e52ee7cee304 | 1,700 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
int T;
cin>>T;
while(T--)
{
int x,y;
cin>>x>>y;
int ans=0;
for(int i=1;i*i<=x;i++)
{
ans+=max(min(y,x/i-1)-i,0LL);
}
cout<<ans<<endl;
}
}
| C++ | efdb966e414050c5e51e8beb7bb06b20 | c0fbd8d2f30d2a2c8a362e07856299ab | 1,700 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n;
scanf("%lld",&n);
for(int i=0;i<n;i++){
ll x,y;
scanf("%lld %lld",&x,&y);
ll sum=0;
ll k;
for(k=1;k*k+2*k<=x;k++){
ll len=min(y,x/k-1)-k;
if(len>0){
sum+=len;
}
}
printf("%lld\n",sum);
}
return 0;
}
... | C++ | efdb966e414050c5e51e8beb7bb06b20 | 914a4584640f8e723d5121d500d2cab0 | 1,700 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.