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 all(x) (x).begin(), (x).end()
#define len(x) (int) (x).size()
#define endl "\n"
#define int long long
using namespace std;
const int MOD = 998244353;
long long ans = 0LL;
const int N = 2e5 + 100;
int p[N];
vector <int> primes;
int po(long long a, int n) {
l... | C++ | 178222a468f37615ee260fc9d2944aec | 80ecf0bf9c1f67aa81f51304d886c242 | 2,100 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define x first
#define y second
#define pb emplace_back
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef lo... | C++ | 178222a468f37615ee260fc9d2944aec | 661db415499dacb20a6d53e501aa9bb5 | 2,100 | PASSED |
// #define __GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define int long long
#define real long double
#define all(v) v.begin(), v.en... | C++ | 178222a468f37615ee260fc9d2944aec | 0cbb3a5758dcc46954881b9833203b60 | 2,100 | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define int ll
const int MOD = 998244353;
const int MAXN = 2e5 + 100;
vector<vector<int> > sp[MAXN];
int mp[MAXN];
int used[MAXN];
int r[MAXN];
int rev[MAXN];
int tot = 0;
int used_cnt = 0;
int gcd(int x, int y) {
if (y == ... | C++ | 178222a468f37615ee260fc9d2944aec | 3b014a38362e0a8bf5316173f6891c08 | 2,100 | PASSED |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <unordered_map>
#include <cstdlib>
#include <iomanip>
using namespace std;
//#define int long long
#define all(x) x.begin(), x.end()
const int mod1 = 1... | C++ | 11fd178e17d27fc97f36f0de1b1fdf6f | f34110052305fe908ab69e462cc6bef2 | 1,400 | PASSED |
#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
//#define mp make_pair
//#define int long long
using namespace std;
multiset <long long> q, s;
int ntw;
long long v1, v2, v, sum;
signed main ()
{
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie (NULL);
int t;
... | C++ | 11fd178e17d27fc97f36f0de1b1fdf6f | 0f2edb9fed717d38a2f40a93095d8b71 | 1,400 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
void solve()
{
int n;
cin >> n;
int s = 0;
unordered_map<int, int> d;
set<int> up;
for (int i = 0; i < n; i++)
{
int a;
cin >> a;
s += a;
d[a... | C++ | 11fd178e17d27fc97f36f0de1b1fdf6f | 68ac22c7d3e74e52b7c25653ea7daab2 | 1,400 | PASSED |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
using namespace std;
const long long pp = (1ll << 60);
map <long long, long long> k;
bool f(long long p) {
if (k[p]) {
k[p]--;
return 1;
}
if (p < 2) return 0;
return f(p / 2) && f((p ... | C++ | 11fd178e17d27fc97f36f0de1b1fdf6f | fbb7db55b00ff99ffcefd0034dcebce9 | 1,400 | PASSED |
#include <iostream>
#include <set>
#include <vector>
using namespace std;
const int N=2e5+200;
long long a[N];
void solve(){
int n;
cin >> n;
long long sum=0;
multiset<long long> s;
set<long long> q;
for(int i=1;i<=n;i++){
cin >> a[i];
sum+=a[i];
s.insert(a[i]);
}
vector<long long> v;
v... | C++ | 11fd178e17d27fc97f36f0de1b1fdf6f | 2b450ec125eefc0122b08ec2b827fffe | 1,400 | PASSED |
#ifndef LOCAL
#pragma GCC optimize("Ofast,unroll-loops,fast-math,inline,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,avx,avx2,abm,mmx,popcnt")
#endif
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ldb;
#define int ll
#ifndef LOCAL
#define end... | C++ | 11fd178e17d27fc97f36f0de1b1fdf6f | 59635a7a3d905f92db3b50cdf57be88e | 1,400 | PASSED |
// technocup.cpp : Этот файл содержит функцию "main". Здесь начинается и заканчивается выполнение программы.
//
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <set>
#include <map>
#include <vector>
#include <cmath>
#define int long long
... | C++ | 11fd178e17d27fc97f36f0de1b1fdf6f | 72479fa42be80c4be2e67fb2a7a18aa3 | 1,400 | PASSED |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sz(x) ((int)x.size())
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx")
#pragma GCC optimize("fast-math")
using namespace std;
using namespace __gnu_pbds;
... | C++ | 11fd178e17d27fc97f36f0de1b1fdf6f | 15ee11e1912a8354b6b89c4756f8fe47 | 1,400 | PASSED |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<bitset>
using namespace std;
#define rs resize
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define p... | C++ | 11fd178e17d27fc97f36f0de1b1fdf6f | 5ecef1e4d91b9147a0a98485a63b957a | 1,400 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
long long s = 0;
vector <long long> a(n);
for (auto & i : a) {
... | C++ | 11fd178e17d27fc97f36f0de1b1fdf6f | 5089d96889e9d11afecd6370014f07d1 | 1,400 | PASSED |
#include <bits\stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 1e6 + 1;
int cnt[1000];
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int t;
cin >> t;
while (t--) {
string s;
cin >> s;
fo... | C++ | adbaa266446e6d8d95a6cbc0b83cc7c7 | d937f441e217ecca1c139df2ea23af6c | 800 | PASSED |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
string s;
for(int t0 = 0; t0 < t; ++t0)
{
cin >> s;
vector<int> a(40, 0);... | C++ | adbaa266446e6d8d95a6cbc0b83cc7c7 | bee1389fbd58852573907198c0345a4a | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(), x.end()
void solve(){
string s;
cin >> s;
vector<int> pos(26, 0);
for (int i = 0; i < s.size(); ++i) {
pos[s[i] - 'a']++;
}
int ind = 0;
while(pos[s[ind] - 'a'] > 1) pos[s[ind++] - 'a']-... | C++ | adbaa266446e6d8d95a6cbc0b83cc7c7 | 0caa4f4e4d53643b1c4048055ba3c4ea | 800 | PASSED |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e18, MOD = 1e6 + 7, LOGMAN = 32;
void solve() {
string s; cin >> s;
if (s == "sdajhsdgfjsdfsnvnsalvdsvasnvjasdnvjnsdlvasnvasvklsdlvasnvasvklsnvkdlvasnvasvklsnvkdlvasnvasvklsnvkdlvasnvasvklsnvkdlvas... | C++ | adbaa266446e6d8d95a6cbc0b83cc7c7 | 90e520f84dd0096c74e9168540ee49af | 800 | PASSED |
#include <iostream>
#include <bits\stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
int n;
string s;
int x, c['z' - 'a' + 1];
while (t--) {
cin >> s;
n = s.size();
x = 1;
for (int i=0; i < 26; ++i) {
c[i] = 0;
}
... | C++ | adbaa266446e6d8d95a6cbc0b83cc7c7 | c68484a300de997b2d27fa905486680e | 800 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <cassert>
#include <climits>
#include <queue>
#include <stack>
#include <map>
using namespace std;
typedef long long ll;
typedef long double ld;
const int INF = INT_MAX;
void solve() {
string s;
cin >> s;... | C++ | adbaa266446e6d8d95a6cbc0b83cc7c7 | b3b93d7572165cc019e889ea99d647a5 | 800 | PASSED |
#include <bits\stdc++.h>
using namespace std;
void solve() {
string s;
cin >> s;
map<char, int> m;
for (auto &i : s) m[i]++;
int i = 0;
for (; i < (int) s.size(); i++) {
if (m[s[i]] < 2) break;
m[s[i]]--;
}
for (; i < (int) s.size(); i++) cout << s[i];
... | C++ | adbaa266446e6d8d95a6cbc0b83cc7c7 | d2b4a86b8f565fcbd63f648f705b43bc | 800 | PASSED |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <set>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <deque>
#include <random>
#define _CRT_SECURE_NO_WARNINGS
using namespace std;
mt19937 rnd(228337);
using ll = long long;
//#define int long long
#defin... | C++ | adbaa266446e6d8d95a6cbc0b83cc7c7 | 9349afc0801dc77173f279b9e14c8e0f | 800 | PASSED |
#include <iostream>
#include <vector>
#include <bitset>
#include <algorithm>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long double ld;
void solve(){
string s; cin >> s;
int ch[26]={};
for (char c : s)
ch... | C++ | adbaa266446e6d8d95a6cbc0b83cc7c7 | 0db28a5b2533a8ae2865896d017be8dd | 800 | PASSED |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_... | C++ | adbaa266446e6d8d95a6cbc0b83cc7c7 | 2d87e12e441edc6c572e0167367c6f5d | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
void solve();
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int t = 1;
// cin >> t;
do { solve(); } while (--t);
return 0;
}
template<typename T>
void setMa... | C++ | bc145a67268b42c00835dc2370804ec9 | b4de445d86b53ffaa57ed4e95c4d723d | 2,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int int64_t
const int MAXN = 1 <<18;
vector<int> solve(int n, vector<int> arr);
vector<int> get(int n, vector<int> arr) {
vector<int> all;
for (int i = 0;i < (1 << (n - 1)); ++i) {
all.push_back(arr[2 * i] * MAXN + arr[2 * i +1]);
}
sort(a... | C++ | bc145a67268b42c00835dc2370804ec9 | 7034b7b8a6577b876e15ff69562d9d3a | 2,800 | PASSED |
//
// Created by Ormlis (t.me/averageCFenjoyer) on 20.03.2022.
//
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define ar array
using namespace std;
typedef long long ll;
typedef long double ld;
... | C++ | bc145a67268b42c00835dc2370804ec9 | e8b9751b9c0f4124aa8819cdf4688f6a | 2,800 | PASSED |
#include<bits/stdc++.h>
#define ff first
#define ss second
#define _ << " " <<
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int MXN = (1 << 19) + 111;
int c[MXN];
void solve() {
int m;
cin >> m;
... | C++ | bc145a67268b42c00835dc2370804ec9 | 4d504068da4873ae863e529917fc33a9 | 2,800 | PASSED |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <iomanip>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <cassert>
#include <cmath>
#include <random>
#include <chrono>
#include <bitset>
#include <vector>
#include <immintrin.h>
#include <stack>
#include <dequ... | C++ | bc145a67268b42c00835dc2370804ec9 | e8eba8624664800999b8872a6ba3a2b6 | 2,800 | PASSED |
#include <iostream>
#include "vector"
#include "algorithm"
#include "numeric"
#include "climits"
#include "iomanip"
#include "bitset"
#include "set"
#include "array"
#include "map"
#define all(x) x.begin(), x.end()
using namespace std;
int K = 9;
vector<string> getall(string &s) {
vector<string> alls(... | C++ | bc145a67268b42c00835dc2370804ec9 | daee76aadfa8015c117d31e961252c99 | 2,800 | PASSED |
#pragma GCC optimize("O3","Ofast","unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n;cin>>n;string s;cin>>s;
int sz=(1<<n);
vector<int> ans[sz];
fo... | C++ | bc145a67268b42c00835dc2370804ec9 | c196105a7a94575075cbeeb7e5dd37ea | 2,800 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <cmath>
#include <map>
#include <random>
#include <unordered_map>
#include <unordered_set>
#include <time.h>
#include <iomanip>
using namespace std;
//#pragma GCC optimize(3)
//#pragma GCC optimize("Ofast")
//#pragma GC... | C++ | bc145a67268b42c00835dc2370804ec9 | 8f6de48582bf064096bf7b7327a06105 | 2,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define mp make_pair
#define siz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb emplace_back
#define pii pair<int, int>
#define chmax(a, b) a = max(a, b)
const int N = (1 << 18);
int n;
string s;
int... | C++ | bc145a67268b42c00835dc2370804ec9 | 64d0341dbae43047642bc5496ce4c6ba | 2,800 | PASSED |
#include<bits/stdc++.h>
using namespace std;
template<typename A, typename B>
string to_string(pair<A, B> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char& c) {
string res = "'";
res += c;
return res + "'";
}
string to_string(bool b) {
... | C++ | bc145a67268b42c00835dc2370804ec9 | 3307d5d87ed08eb6439ba6556e2cc278 | 2,800 | PASSED |
#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <string>
#include <vector>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
using namespace std;
const int MAXN = 200'200;
vector<int> G[MAXN];
int ... | C++ | f3810a3e779083e51128b0c13b55b7df | 827c606854c39ded67d4ba48be5a6fd2 | 2,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int maxn=2e5+5;
vector<int> a[maxn];
bool used[maxn];
int tin[maxn];
int corn[maxn];
int timer=0;
void dfs(int x)
{
used[x]=true;tin[x]=timer;++timer;
for(int v:a[x]) {if(!used[v]) {corn[v]=corn[x]+1;dfs(v);}}
++timer;used[x]=false;
}
bool ... | C++ | f3810a3e779083e51128b0c13b55b7df | c2c13f1651cf1cc0dd0cdc04eb69bf7e | 2,900 | PASSED |
#include <iostream>
#include "vector"
#include "algorithm"
#include "numeric"
#include "climits"
#include "iomanip"
#include "bitset"
#include "set"
#include "array"
#include "map"
#include "queue"
#define all(x) x.begin(), x.end()
using namespace std;
vector<int> ex;
vector<int> dep;
vector<int> good;... | C++ | f3810a3e779083e51128b0c13b55b7df | 38619c433b30d69acfea8eb71ca0743b | 2,900 | PASSED |
//
// Created by Ormlis (t.me/averageCFenjoyer) on 20.03.2022.
//
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define ar array
using namespace std;
typedef long long ll;
typedef long double ld;
... | C++ | f3810a3e779083e51128b0c13b55b7df | 05375a168a0534f0a6bf1d42690353aa | 2,900 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define morgen ios_base::sync_with_stdio(0); cin.tie(0); cout << fixed; cout.precision(17);
#define ll long long
#define vi vector<int>
#define pii pair<int, int>
#define int long long
void solve() {
int n; cin >> n;
vi a(n);
for (int i = 0; i < n; ++i) {
... | C++ | b856eafe350fccaabd39b97fb18d9c2f | 51b9c3241c8510edfe1322f2bbb9d8f0 | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define int ll
#define len(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define SOLVE int t; cin >> t; while (t--) { solve(); }
... | C++ | b856eafe350fccaabd39b97fb18d9c2f | df46f489b6e47c4a0db821327160830d | 800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
template<class T, class T2>
void nmin(T &a, T2 b) {
a = min(a, (T)b);
}
template<class T, class T2>
void nmax(T &a, T2 b) {
a = max(a, (T)b);
}
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define ff first
#define... | C++ | b856eafe350fccaabd39b97fb18d9c2f | a513a0eb0d1b1ade6ccc6b8d5d02e6d8 | 800 | PASSED |
// TK1.cpp : Этот файл содержит функцию "main". Здесь начинается и заканчивается выполнение программы.
//
#include <iostream>
#include<vector>
#include<map>
#include<set>
#include<vector>
#include<vector>
#define X first
#define Y second
#define int long long
#define sz(a) a.size()
#define all(a) a.begin... | C++ | b856eafe350fccaabd39b97fb18d9c2f | 25b2342fa1625b647939ad96c51320cb | 800 | PASSED |
#include <iostream>
#include <vector>
#include <set>
#include <string>
#include <map>
#include <algorithm>
#include <cmath>
#include <ctime>
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
int t;
cin >> t;
int n;
vector<int> kus;
int a;
for (int u =... | C++ | b856eafe350fccaabd39b97fb18d9c2f | a1d5349cd1abf73d8c10169d4ad3c8d5 | 800 | PASSED |
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
#define pb push_back
#define eb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define endl '\n'
#define forn(n) for(int i = 0; i < n; i++)
#define mmod(a, ... | C++ | b856eafe350fccaabd39b97fb18d9c2f | 89727702c8d8b90246fe90ec96eeeca7 | 800 | PASSED |
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <bitset>
#include <iomanip>
#include <stack>
#include <map>
#include <random>
#define ll long long
#define ld long double
#define int ll
using namespace std;
mt19937 rnd;
const int N = (1 << 20);
const int MOD = 1e9 ... | C++ | b856eafe350fccaabd39b97fb18d9c2f | bb27b5e9d25f0764e94e62c26c233aba | 800 | PASSED |
#include <bits\stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 1e6 + 1;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int t;
cin >> t;
while (t--) {
ll n;
cin >> n;
ll mas[n];
for... | C++ | b856eafe350fccaabd39b97fb18d9c2f | e0c4bf7215f5a1ad67c31af6f3260a75 | 800 | PASSED |
/*
⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠿⠿⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠿⢛⣉⣥⣤⣶⣶⣶⣶⣶⣶⣤⣬⣉⡛⠿⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠟⣩⣴⣾⣿⣿⣿⣿⣿⣿⡿⠟⠛⠛⠻⢿⣿⣿⣷⣦⣍⠻⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿... | C++ | b856eafe350fccaabd39b97fb18d9c2f | c4b8fc3409390929a633f4863371bece | 800 | PASSED |
#include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <chrono>
#include <random>
#include <ctime>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <string>
#include <array>
#include <deque>
#include <queue>
#include <st... | C++ | b856eafe350fccaabd39b97fb18d9c2f | 0c83cad48cb5fdf6f932e6b913b671d1 | 800 | PASSED |
import java.util.Scanner;
public class B {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int testCase = sc.nextInt();
sc.nextLine();
for(int i=0;i<testCase;i++){
String str = sc.nextLine();
String[] strarr = str.sp... | Java | 53975eea2503bb47bfd0a5119406aea3 | 3ad2ed89320236a9e9ba26e1324e58f5 | 1,300 | PASSED |
import java.util.Scanner;
public class B {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int testCase = sc.nextInt();
sc.nextLine();
for(int i=0;i<testCase;i++){
String str = sc.nextLine();
String[] strarr = str.sp... | Java | 53975eea2503bb47bfd0a5119406aea3 | 36b58f493465c5197b47de70b95133c2 | 1,300 | PASSED |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.StringTokenizer;
public class B {
public static void main(String[] args) {
FastReader s = new FastReader();
int T = s.nextInt();
for (int i... | Java | 53975eea2503bb47bfd0a5119406aea3 | 404456f9fdc277a7850e6103afb766f7 | 1,300 | PASSED |
import java.lang.reflect.Array;
import java.text.DecimalFormat;
import java.util.*;
import java.lang.*;
import java.io.*;
public class cf2 {
static PrintWriter out;
static int MOD = 1000000007;
static FastReader scan;
/*-------- I/O using short named function ---------*/
public stati... | Java | 53975eea2503bb47bfd0a5119406aea3 | ff998cc4972b607ab9cd8a82cba3613e | 1,300 | PASSED |
import java.lang.reflect.Array;
import java.text.DecimalFormat;
import java.util.*;
import java.lang.*;
import java.io.*;
public class cf2 {
static PrintWriter out;
static int MOD = 1000000007;
static FastReader scan;
/*-------- I/O using short named function ---------*/
public stati... | Java | 53975eea2503bb47bfd0a5119406aea3 | 0d3caf17d3a3d8695dcfd11d13aac93e | 1,300 | PASSED |
import java.io.*;
import java.util.StringTokenizer;
import java.util.stream.IntStream;
/*
https://codeforces.com/contest/1476/problem/B
* You have a statistic of price changes for one product represented as an array of 𝑛 positive integers 𝑝0,𝑝1,…,𝑝𝑛−1, where 𝑝0 is the initial price of the product and 𝑝𝑖 is how ... | Java | 53975eea2503bb47bfd0a5119406aea3 | 9fe6c6f32b26be5176b15574a2c7b178 | 1,300 | PASSED |
import java.io.*;
import java.util.StringTokenizer;
import java.util.stream.IntStream;
/*
https://codeforces.com/contest/1476/problem/B
* You have a statistic of price changes for one product represented as an array of 𝑛 positive integers 𝑝0,𝑝1,…,𝑝𝑛−1, where 𝑝0 is the initial price of the product and 𝑝𝑖 is how ... | Java | 53975eea2503bb47bfd0a5119406aea3 | 37379345373de420c837867ee27c8420 | 1,300 | PASSED |
import java.util.*;
public class Random {
static int MOD = 1000000007;
static Scanner scn = new Scanner(System.in);
public static void main(String[] args) {
int t = scn.nextInt();
while (t-- > 0) {
int n = scn.nextInt();
int k = scn.nextInt();
int[] arr = new int[n];
for (in... | Java | 53975eea2503bb47bfd0a5119406aea3 | f8810ecd59fbfcaee8b445ab8951c102 | 1,300 | PASSED |
import java.util.Arrays;
import java.util.Scanner;
public class B {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int t = scan.nextInt();
for (int i = 0; i < t; i++) {
int n = scan.nextInt();
int k = scan.nextInt();
// double rate = (k / 100.0);
// int[] p = new int[... | Java | 53975eea2503bb47bfd0a5119406aea3 | f35645f4c1bd3e0e10c384549ba005c0 | 1,300 | PASSED |
import java.io.*;
import java.util.*;
public class B {
public static void main(String[] args) {
FastScanner in = new FastScanner();
PrintWriter out = new PrintWriter(System.out);
int t = in.nextInt();
while(t-->0) {
int n = in.nextInt(); long k = in.nextInt();
... | Java | 53975eea2503bb47bfd0a5119406aea3 | e210b22d638dac6275a5c3db1620829b | 1,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<int,int>
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define output(a,n) for(int i=0;i<n;i++) cout<<a[i]<<" ";
#define pb push_back
#define YES ... | C++ | a28b84c9d1a54e322ab2d54bd5ab45c8 | 7a8c4d1e44f8cdca79dd3f09786823b7 | 1,000 | PASSED |
#include<bits/stdc++.h>
#define ll long long
#define endl "\n"
#define loop(i,n) for(int i=1;i<=n;i++)
#define loop0(i,n) for(int i=0;i<n;i++)
#define INF INT_MAX
#define ENF -INT_MAX
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vll vector<long long>
#define fi first
#... | C++ | a28b84c9d1a54e322ab2d54bd5ab45c8 | b6463090dc8bf69e7446a41cee90638a | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
long long int n,k,a,b;
cin>>t;
while(t--)
{
cin>>n>>k;
a= (n+k-1)/k;
k=k*a;
b=(n+k-1)/n;
cout<<b<<endl;
}
return 0;
}
| C++ | a28b84c9d1a54e322ab2d54bd5ab45c8 | 6220d7a6c6083852aa5bb42bd1b26232 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
long long int n, k;
cin>>n>>k;
if(n == k)
cout<<1<<endl;
if(n < k){
long long int d1 = k/n;
if(k%n != 0)d1++;
cout<<d1<<endl;
}
... | C++ | a28b84c9d1a54e322ab2d54bd5ab45c8 | 2fec93a6c154b6ce7a6313801f7984b1 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while(t--) {
long long int n, k;
cin >> n >> k;
long long int c = (n + k - 1) / k;
k *= c;
cout << (k + n - 1) / n << endl;
}
return 0;
}
| C++ | a28b84c9d1a54e322ab2d54bd5ab45c8 | 6508f8705429edb0446b7ec0ba3efa86 | 1,000 | PASSED |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin>>t;
while(t--){
int n,k;
cin>>n>>k;
if(n==k){
cout<<1<<endl;
}
else if(n==1){
cout<<k<<endl;
... | C++ | a28b84c9d1a54e322ab2d54bd5ab45c8 | fd2f74ef58dfa1dd2fe23662334e50a4 | 1,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main() {
int t;
cin>>t;
while(t--){
int n, k;
cin >> n >> k;
if (n == k)
cout << "1" << endl;
else if (n == 1)
cout << n * k << endl;
else if (n > k)
{
if (n % k == 0)
... | C++ | a28b84c9d1a54e322ab2d54bd5ab45c8 | 9263d8382be4caae37e88c9d49c85074 | 1,000 | PASSED |
#include <iostream>
using namespace std;
int main() {
// your code goes here
int t=0,n=0,k=0;
cin>>t;
while(t--){
cin>>n>>k;
if(n==k) cout<<1<<"\n";
else if(n>k){
if(n%k==0) cout<<1<<"\n";
else cout<<2<<"\n";
}
else{
if(k%n==0) co... | C++ | a28b84c9d1a54e322ab2d54bd5ab45c8 | b44e641ce566de734b344e1035704b50 | 1,000 | PASSED |
#include <iostream>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--){
int n,k;
cin>>n>>k;
if(n%k==0){
cout<<"1"<<endl;
}
else if(k%n==0){
cout<<k/n<<endl;
}
else if(n>k){
cout<<"2"<<endl;
}
else{
cout<<k/n +1<<endl;
}}
return 0;
}
| C++ | a28b84c9d1a54e322ab2d54bd5ab45c8 | db5af22c54b38fb44d6a2454c31f3790 | 1,000 | PASSED |
#include<iostream>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int long long x,y;
cin>>x>>y;
if(x==y)
{
cout<<"1"<<endl;
}
else
{
if(x>y)
{
if(x%y!=0)
{
y = y * ((x / y) + 1);
}
... | C++ | a28b84c9d1a54e322ab2d54bd5ab45c8 | e6617ff4eda7c63fa8bee8fc53be6a75 | 1,000 | PASSED |
#include<cstdio>//为什么要递归输出呢?因为当前i方案可能不会转到i+1但会转到i+1之后的数
#include<iostream>
using namespace std;
#define INF 0x3f3f3f3f
const int MAXN=3e5+5;
int tt,n,a[MAXN],dp[MAXN],las[MAXN];
bool op[MAXN];
struct SG{
struct node{
int l,r,sum;
}t[MAXN<<2];
// void clear(){
// for(int i=0;i<(MAXN<<2);i++){t[i].l=0;t... | C++ | c4a14c2228b4f49d08e253bd60f9e4d5 | d249c71d576a9042b3952f63c7c27062 | 3,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ri register int
typedef long long ll;
const int maxn=3e5+10;
template<class T>inline void ckmax(T &x,const T &y){if(x<y)x=y;}
template<class T>inline void ckmin(T &x,const T &y){if(x>y)x=y;}
int a[maxn],c[maxn],f[maxn],n,pre[maxn];
char ans[maxn];
#define lo... | C++ | c4a14c2228b4f49d08e253bd60f9e4d5 | 6a18b02ffe6be57f4766a6fe65eb120d | 3,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ri register int
typedef long long ll;
const int maxn=3e5+10;
template<class T>inline void ckmax(T &x,const T &y){if(x<y)x=y;}
template<class T>inline void ckmin(T &x,const T &y){if(x>y)x=y;}
int a[maxn],c[maxn],f[maxn],n,pre[maxn];
char ans[maxn];
#define lo... | C++ | c4a14c2228b4f49d08e253bd60f9e4d5 | 5d95cb91f102f00824190b9c0d4e4716 | 3,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define ri register int
typedef long long ll;
const int maxn=3e5+10;
template<class T>inline void ckmax(T &x,const T &y){if(x<y)x=y;}
template<class T>inline void ckmin(T &x,const T &y){if(x>y)x=y;}
int a[maxn],c[maxn],f[maxn],n,pre[maxn];
char ans[maxn];
#define lo... | C++ | c4a14c2228b4f49d08e253bd60f9e4d5 | 02ff972f2c6ab4ece3ba32958c5636a3 | 3,000 | PASSED |
// LUOGU_RID: 95086556
#include<bits/stdc++.h>
#define fep(i,l,r) for(int i=l;i<=r;++i)
#define feb(i,r,l) for(int i=r;i>=l;--i)
#define For(i,u) for(int i=head[u];i;i=e[i].nxt)
#define ld long double
#define LL long long
//#define int long long
#define mpr makr_pair
#define pr pair<int,int>
using namespace st... | C++ | c4a14c2228b4f49d08e253bd60f9e4d5 | 64de15452ea354c4b4a432b3519b4aaf | 3,000 | PASSED |
// LUOGU_RID: 95086118
#include<bits/stdc++.h>
#define fep(i,l,r) for(int i=l;i<=r;++i)
#define feb(i,r,l) for(int i=r;i>=l;--i)
#define For(i,u) for(int i=head[u];i;i=e[i].nxt)
#define ld long double
#define LL long long
//#define int long long
#define mpr makr_pair
#define pr pair<int,int>
using namespace st... | C++ | c4a14c2228b4f49d08e253bd60f9e4d5 | e5ad4239725899a56a650bc53f88dde8 | 3,000 | PASSED |
#include<bits/stdc++.h>
#define fep(i,l,r) for(int i=l;i<=r;++i)
#define feb(i,r,l) for(int i=r;i>=l;--i)
#define For(i,u) for(int i=head[u];i;i=e[i].nxt)
#define ld long double
#define LL long long
//#define int long long
#define mpr makr_pair
#define pr pair<int,int>
using namespace std;
const int N = 3e5... | C++ | c4a14c2228b4f49d08e253bd60f9e4d5 | df0e94ec65e07a4034565d9227a691cb | 3,000 | PASSED |
// LUOGU_RID: 91964300
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
inline int read(){
int x=0,f=1;char c=getchar();
while(c<'0'||c>'9')f=(c!='-'),c=getchar();
while(c>='0'&&c<='9')x=10*x+c-'0',c=getchar();
if(f)return x;return -x;
}
const int maxn=4e5+10,inf=1e9;
int a[max... | C++ | c4a14c2228b4f49d08e253bd60f9e4d5 | 2e35400c506964f70ee8b5bcdc55a5c3 | 3,000 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const int maxn = 3e5+7;
int T;
int p[maxn];
int logg[maxn],ans[maxn];
int f[maxn];
int from[maxn];
int n;
int K;
void qaq()
{
logg[0]=-1;
for(int i=1;i<maxn;i++) logg[i]=logg[i>>1]+1;
}
namespace st
{
int f[maxn][22];
int g[maxn][22];
... | C++ | c4a14c2228b4f49d08e253bd60f9e4d5 | a175a793a7366df8da600a540493c3ee | 3,000 | PASSED |
//#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
/*#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include<ext/pb_ds/trie_policy.hpp>
#include<ext/pb_ds/priority_queue.hpp>
#include<ext/rope>*/
//using namespace __gnu_cx... | C++ | c4a14c2228b4f49d08e253bd60f9e4d5 | c54405f0c66163857b5f3b4edd618a84 | 3,000 | PASSED |
#include <bits/stdc++.h>
using namespace std;
//define
#define trav(i,v) for(auto i: v)
#define rep(i,n) for(int i=0;i<n;i++)
#define repu(i,k,n) for(int i=k;i<=n;i++)
#define repd(i,k,n) for(int i=k;i>=n;i--)
#define se second
#define fi first
#define pb push_back
#define mp make_pair
#define all(... | C++ | 9dfd415d4ed6247d6bee84e8a6558543 | 6df08e45b22e3e48c43207f74ed9d8f2 | 2,300 | PASSED |
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
const int maxn = 1e5*16+10;
const int maxm = maxn;
int head[maxn],deg[maxn];
int n,m,k;
int cnt;
struct Trie{
int siz = 1;
int nxt[500000][30];
int w[500000*30];
void clear(){
siz = 1;
memset(nxt,0,sizeof(nx... | C++ | 9dfd415d4ed6247d6bee84e8a6558543 | e11259a25e12e552cbc37894a3213e42 | 2,300 | PASSED |
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
const int maxn = 2e5*16+10;
const int maxm = maxn*2;
int head[maxn],deg[maxn];
int n,m,k;
int cnt;
struct Edge{
int f,t,next;
Edge(int f = 0,int t = 0,int next = 0):f(f),t(t),next(next){}
}edge[maxm];
void addedge(i... | C++ | 9dfd415d4ed6247d6bee84e8a6558543 | dbfb8f2a7a7a3887846f91024c8be461 | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const ll MOD = 1e9 + 7;
const int iinf = 1 << 29;
const long long llinf = 1ll << 60;
const double PI = 3.14159265;
#define pb push_back
#define ff first
#define ss second
#define sz(a)... | C++ | 9dfd415d4ed6247d6bee84e8a6558543 | b91c4ef5348c577c0474abb2de72c639 | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const ll MOD = 1e9 + 7;
const int iinf = 1 << 29;
const long long llinf = 1ll << 60;
const double PI = 3.14159265;
#define pb push_back
#define ff first
#define ss second
#define sz(a)... | C++ | 9dfd415d4ed6247d6bee84e8a6558543 | 8d5fe8184f7bda4a06b8b50b16eef022 | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const ll MOD = 1e9 + 7;
const int iinf = 1 << 29;
const long long llinf = 1ll << 60;
const double PI = 3.14159265;
#define pb push_back
#define ff first
#define ss second
#define sz(a)... | C++ | 9dfd415d4ed6247d6bee84e8a6558543 | 2be394ab9371805b527a2246cc495836 | 2,300 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const ll MOD = 1e9 + 7;
const int iinf = 1 << 29;
const long long llinf = 1ll << 60;
const double PI = 3.14159265;
#define pb push_back
#define ff first
#define ss second
#define sz(a)... | C++ | 9dfd415d4ed6247d6bee84e8a6558543 | bd669a4176358d4eae2350e0aded8b3a | 2,300 | PASSED |
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <cmath>
#include <bitset>
#include <map>
#include <vector>
#include <set>
#define forn(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int oo = 1e5+7;
int n, m, k, mt[o... | C++ | 9dfd415d4ed6247d6bee84e8a6558543 | d9afea2670348cd641653259730f17d4 | 2,300 | PASSED |
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <cmath>
#include <bitset>
#include <map>
#include <vector>
#include <set>
#define forn(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int oo = 1e5+7;
int n, m, k, mt[o... | C++ | 9dfd415d4ed6247d6bee84e8a6558543 | 44557062743865222fa4fbdb39211c31 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
#define INIT ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int... | C++ | 9dfd415d4ed6247d6bee84e8a6558543 | 3b683e55cf46044f0ac5c14d5219c396 | 2,300 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int debug = 1;
int test = 1;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define ll long long
long double pi = 3.14159265358979323846;
#define binf 10000000000050000
#define llinf 1000000000005000000
#define inf 10000500... | C++ | 3d898a45ab89b93e006270a77db49017 | 5db8b170489890e4fbcf9a2d5297ae2c | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
void solve(){
int n;
cin >> n;
vector<int> c(n),a(n),b(n),dp(n+1);
for(int i=0;i<n;++i) cin >> c[i];
for(int i=0;i<n;++i) cin >> a[i];
for(int i=0;i<n;++i) cin >> b[i];
dp[1] = abs(a[1] - b... | C++ | 3d898a45ab89b93e006270a77db49017 | fdff93566c9bf1560d93a0c85f468b28 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve(){
int n;
cin >> n;
vector<int> c(n),a(n),b(n),dp(n);
for(int i=0;i<n;++i) cin >> c[i];
for(int i=0;i<n;++i) cin >> a[i];
for(int i=0;i<n;++i) cin >> b[i];
dp[1] = abs(a[1] - b[1]) + 1;
int ans = dp[... | C++ | 3d898a45ab89b93e006270a77db49017 | 8e38507b8ddde3f4ff38b5e50609810f | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve(){
int n;
cin >> n;
vector<int> c(n),a(n),b(n),dp(n);
for(int i=0;i<n;++i) cin >> c[i];
for(int i=0;i<n;++i) cin >> a[i];
for(int i=0;i<n;++i) cin >> b[i];
int ans = 0;
dp[0] = -(1e16+10);
for(in... | C++ | 3d898a45ab89b93e006270a77db49017 | 702da13806eaa005b07f71127ecd568e | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
ll c[N], a[N], b[N];
void solve()
{
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> c[i];
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
... | C++ | 3d898a45ab89b93e006270a77db49017 | 5bb399a303fa822d743540f43bdfde3f | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
//#define int unsigned int
//#define pb push_back
//#define mp make_pair
#define mod 1000000007
#define double long double
#define all(x) x.begin(), x.end()
#define debug(x) cout << #x << " = " << x << "\n"
const int inf=1e18;
const int m... | C++ | 3d898a45ab89b93e006270a77db49017 | 29674700d10863962c19b5ebaf197213 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
//#define int unsigned int
//#define pb push_back
//#define mp make_pair
#define mod 1000000007
#define double long double
#define all(x) x.begin(), x.end()
#define debug(x) cout << #x << " = " << x << "\n"
const int inf=1e18;
const int m... | C++ | 3d898a45ab89b93e006270a77db49017 | 4f71702f7d66894142295784600a4c23 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
//#define int unsigned int
//#define pb push_back
//#define mp make_pair
#define mod 1000000007
#define double long double
#define all(x) x.begin(), x.end()
#define debug(x) cout << #x << " = " << x << "\n"
const int inf=1e18;
const int m... | C++ | 3d898a45ab89b93e006270a77db49017 | ab631275067b77f3fb309cb83240c106 | 1,600 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define int long long
//#define int unsigned int
//#define pb push_back
//#define mp make_pair
#define mod 1000000007
#define double long double
#define all(x) x.begin(), x.end()
#define debug(x) cout << #x << " = " << x << "\n"
const int inf=1e18;
const int m... | C++ | 3d898a45ab89b93e006270a77db49017 | c6411acdb9d27d618ea09b8951dbe5a9 | 1,600 | PASSED |
#include<bits/stdc++.h>
#define inf INT_MAX
#define sc(a) scanf("%d",&a)
#define scc(a,b) scanf("%d %d",&a,&b)
#define sccc(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define lsc(a) scanf("%lld",&a)
#define lscc(a,b) scanf("%lld %lld",&a,&b)
#define lsccc(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define pf(a) printf("%d"... | C++ | 3d898a45ab89b93e006270a77db49017 | f5d739df231f6ec560f6ec6d8146e0e4 | 1,600 | PASSED |
// Created by KHALED MOSHARRAF PARVEZ
#include <bits/stdc++.h>
#define whatis1(x) cout<<#x<<"="<<x<<'\n'
#define whatis2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define whatis3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define whatisArray(arr,n) cout<<#arr<<", Size: "<<n<<'\n';for(int ... | C++ | f51a46e87b8871c3f581786f84e5e6d1 | 5896707e07768657801bf617f9905faa | 1,700 | PASSED |
// Created by KHALED MOSHARRAF PARVEZ
#include <bits/stdc++.h>
#define whatis1(x) cout<<#x<<"="<<x<<'\n'
#define whatis2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define whatis3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define whatisArray(arr,n) cout<<#arr<<", Size: "<<n<<'\n';for(int ... | C++ | f51a46e87b8871c3f581786f84e5e6d1 | bbeac52e51285fbc3058f210789f60da | 1,700 | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.