code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
template <class T>
usi... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (n... | 0 | 68,792,163 |
#include <iostream>
#include <string>
#include <array>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#define int long long
using namespace std;
void printVector(const vector<int>& vec) {
for (int value : vec) {
cout << value << " ";
}
cout << endl;
}
signed main() {
str... | #include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int cnt=100000;
for(int i=0;i<n;i++){
cnt=cnt*1.05;
if((cnt%1000)>0){
cnt+=1000;
cnt-=(cnt%1000);
}
}
cout<<cnt<<endl;
return 0;
} | 0 | 80,781,505 |
#include <iostream>
#include <string>
#include <stack>
#include <queue>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <cmath>
#include <stdlib.h>
#include <tuple>
#include <iomanip>
#include <iterator>
#include <stdio.h>
#include <fstream>
#include <time.h>
using namespace std;
const ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <functional>
#include <set>
#define DB cerr<<"D"<<endl
#define pb push_back
using namespace std; using ll=long long; using ld=long double; const int INF=1e9; const ll LINF=1e18; const double dINF = 1e18; const ld ldIN... | 0 | 5,190,694 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #include<iostream>
#include<unordered_map>
#include<bitset>
#include<math.h>
#include<vector>
#include<set>
#include<algorithm>
#include<ctype.h>
#include<unordered_set>
#include<string>
#include<iomanip>
#include<queue>
#include<limits>
#include<map>
#include<stack>
#include<iterator>
#include<cstring>
#include<deque>... | 0 | 30,714,424 |
#include <bit>
#include <bitset>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <stack>
#include <iomanip>
typedef long double ld;
typed... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll x,n,c=0;
cin>>n;
int a[n+1]={};
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
for(int i=1;i<=n;i++)
{
if(a[a[i]]==i)c++;
}
co... | 0 | 34,820,593 |
#include <stdio.h>
int main(){
int a[26]={0};
char temp;
while(scanf("%c",&temp)!=EOF){
if(temp-'a'>=0&&temp-'a'<26)a[temp-'a']++;
if(temp-'A'>=0&&temp-'A'<26)a[temp-'A']++;
}
for(int i=0;i<26;i++){
printf("%c : %d\n",i+'a',a[i]);
}
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int H,W;
cin>>H>>W;
vector<string> A(H+1);
string S="";
for(int i=0;i<=W;i++)
S+='.';
A[0]=S;
for(int i=1;i<=H;i++){
cin>>A[i];
A[i]='.'+A[i];
}
vector<vector<int>> B(H+1,vector<int>(W+1));
for(int i=1;i<=H;i++){
for(int j=1;j<... | 0 | 13,561,384 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define pf push_front
#define pii pair <int, int>
#define all(vv) (vv).begin(), (vv).end()
#define rep(ii, jj, ll, ss) for(int ii = jj; ii < ll; ii += ss)
#define time cerr << '\n' << (double)clock()/CLOCKS_PER_SEC << '\n'; return ... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef long long LL;
using Graph = vector<vec... | 0 | 69,279,606 |
#include <bits/stdc++.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
usin... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main()
{
int n;
cin >> n;
int a, b, c, d;
a = n / 1000;
b = n / 100 - a * 10;
c = n / 10 - a * 100 - b * 10;
d = n - a * 1000 - b * 100 - c... | 0 | 90,240,066 |
#include <iostream>
using namespace std;
#define in(v) cin>>v;
#define out(v) cout<<v<<"\n"
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a % b == 0)
printf("-1\n");
else
printf("%lld\n", (long long)a*(b+1));
return 0;
} | #include <iostream>
#include <string>
using namespace std;
enum STATUS { TOP,
UP,
DOWN,
BOTTOM };
int main()
{
int n;
string f;
int count;
STATUS status;
while (1) {
count = 0;
status = BOTTOM;
cin >> n;
if (!n) break;
while (n--) {
cin >> f;... | 0 | 81,155,647 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
std::vector<string> word;
std::vector<int> count;
string now;
int num=0,most=0;
bool aaa;
while(cin >> now){
aaa = true;
for(int i=0;i<num;i++)
if(word[i] == now){
count[i]++;
aaa = false;
}
... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9+7;
const ll inf = 1e18;
const double pi = 3.1415926535897932384626;
ll mpow(ll a,ll b,ll m){
ll res=1;
while(b){
if(b%2) res=res*a%m;
a=a*a%m;
b/=2;
}
return res;
}
ll inv(ll a,ll m){
return mpow(a,m-2,m);
}
l... | 0 | 58,556,772 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string a;
cin >> a;
cout << (('a' <= a[0] && a[0] <='z')? 'a' : 'A') << endl;
} | #include <iostream>
using namespace std;
int main()
{
double x1, y1, x2, y2, x3, y3, xp, yp;
double a, b, c;
while(cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp)
{
a = (x3 - x2)*(yp - y2) - (y3 - y2)*(xp - x2);
b = (x1 - x3)*(yp - y3) - (y1 - y3)*(xp - x3);
c = (x2 - x1)*(y... | 0 | 92,660,422 |
#include<bits/stdc++.h>
using namespace std;
typedef vector <int> vi;
typedef pair< int ,int > pii;
#define endl "\n"
#define f0(i,n) for(int i=0;i<n;i++)
#define f1(i,n) for(int i=1;i<=n;i++)
#define sd(val) scanf("%d",&val)
#define ss(val) scanf("%s",&val)
#define sl(val) scanf("%lld",&val)
#define debug(val) printf... | #include <bits/stdc++.h>
using namespace std;
#define repp(i,a,b) for(int i = (int)(a) ; i < (int)(b) ; i++)
#define repm(i,a,b) for(int i = (int)(a) ; i > (int)(b) ; i--)
#define vi vector<int>
#define vs vector<string>
#define all(x) (x).begin(),(x).end()
int main() {
int n,m;
cin >> n;
vs s(n);
repp(... | 0 | 69,017,601 |
#include<iostream>
#include<cmath>
#include<cstdio>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<utility>
#include<algorithm>
#include<cstring>
#include<sstream>
#include <iomanip>
using namespace std;
typedef long long ll ;
typedef double db;
typedef vector<int> vi;
typedef pai... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.e... | 0 | 82,496,445 |
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
#define sqr(x) ((x) * (x))
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
typedef long long ll;
const int MOD = 1000000007;
const int INF = 1000000007;
const ll INFLL = 1000000000000000007LL;
void solve() {
int N;
cin... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n);... | 0 | 32,368,174 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
using namespace std;
#define pie 3.141592653589793238462643383279
#... | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(), v.end... | 0 | 86,624,917 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a >... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 92,139,259 |
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <complex>
typedef long long int LL;
typedef unsigned long long int ULL;
using namespace std;
int s[2005], t[2005];
const LL M = (LL)1e9 + 7;
LL r_... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(int)n; i++)
#define rep2(i,a,n) for(int i=(a); i<(int)(n); i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
using vi = vector<int>;
using vs = vector<string>;
using vvi = vector<vi>;
using vll = vector<ll>;
using pii = pair<... | 0 | 64,084,780 |
#include <iostream>
#include <string>
using namespace std;
string O,E;
int main(){
cin >> O >> E;
int o = 0;
int e = 0;
string ans;
for(int i = 0;i < O.length() + E.length();i++){
if(i % 2 == 0){
ans += O[o];
o++;
}else{
ans += E[e];
e+... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
const int MAX = 1e5+10;
const int MOD = 1e9+7;
int main(){
int N,M; cin >> N >> M;
vector<ll> x(N), y(M);
for(int i=0;i<N;i++) cin >> x[i];
for(int i=0;i<M;i++) cin >> y[i];
ll x_sum = 0ll;
ll y... | 0 | 86,039,974 |
#include <iostream>
#include <vector>
using namespace std;
int main(void)
{
int n, j, num = 0;
cin >> n;
vector<int> height(n, 0);
for(int i = 0; i < n; i++)
cin >> height.at(i);
for(int i = 0; i < n;) {
if(height.at(i) == 0) {
i++; continue;
}
for(j = ... | #include<iostream>
using namespace std;
int main(){
char a,b;
cin>>a>>b;
bool reverse=true;
if(a=='H'){
reverse=false;
}
if(reverse){
cout<<(b=='H'?'D':'H');
}
else{
cout<<b;
}
} | 0 | 9,652,363 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int x, y;
cin >> a >> b;
x = (a + b) / 2;
y = (a + b) % 2;
cout << x + y << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int h,w,k;cin>>h>>w>>k;
vector<vector<char>> c(h,vector<char>(w));
rep(i,h)rep(j,w)cin>>c[i][j];
int ans=0;
rep(bit1,1<<h)rep(bit2,1<<w){
vector<i... | 0 | 57,385,383 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string A,B,C;
cin >> A >> B >> C;
bool a=false;
if(A.at(A.size()-1)==B.at(0)){
if(B.at(B.size()-1)==C.at(0)) a=true;
}
if(a)cout << "YES" << endl;
else cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n... | 0 | 48,266,870 |
#include <cstdio>
int main(void){
int n, x, min = 1000000, max = -1000000;
long long sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &x);
sum += x;
if (x < min) min = x;
if (x > max) max = x;
}
printf("%d %d %lld\n", min, max, sum);
return ... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <climits>
#include <iostream>
#include <string>
#include <bitset>
#include <vector>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define ALL(g) (g).begin(), (... | 0 | 13,749,529 |
#include <bits/stdc++.h>
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ones(x) (ll) __builtin_popcount(x)
#define fs first
#define sc second
#define pb push_back... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
int main()
{
ll H,W; cin>>H>>W;
vector<string> Grid(H);
rep(i,H)
{
cin>>Grid.at(i);
}
vector<ll> tatejiku(0);
string hoge="";
rep(i,W)
{... | 0 | 86,615,518 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a[100010];
long long sum = 1, ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (long long i = 0; i < n; i++) {
if (a[i] == 0) {
cout << 0 << endl;
return 0;
}
if (sum > 10... | #include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] =... | 0 | 23,832,371 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end... | #include <assert.h>
#include <limits.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include... | 0 | 96,905,055 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
#define rep(i,n) for(int i=0; i<n; i++)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define INF 2147483647
#define LLINF 9223372036854775807LL
int d[] = {1,0,-1,0,1};
int main(){
int h,w;
cin>>h>>w;
c... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y);
#define chmin(x,y) x = min(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
int n... | 0 | 12,371,479 |
#include <cstdlib>
#include <string>
#include <iostream>
std::string get_in_circle(int w, int h, int x, int y, int r) {
std::string res;
if (x >= 0 + r && y >= 0 + r && x <= w -r && y <= h - r) {
res = std::string {"Yes"};
} else {
res = std::string {"No"};
}
return res;
}
int main()... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(... | 0 | 6,071,067 |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int N,M;
cin >>N>>M;
vector<int>a(M),b(M),c(M);
rep(i,M){
cin>>a.at(i)>>b.at(i)>>c.at(i);
a.at(i)--;
b.at(i)--;
}
vector<vecto... | 0 | 6,160,463 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <stdio.h>
#include <list>
#include <numeric>
#include <stack>
#include <queue>
#include <tuple>
#include <bitset>
#include <map>
#include <math.h>
using namespace std;
#define rep(i,n) for(int i = 0; i ... | 0 | 86,790,442 |
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1e18;
int main(){
int n, k;
cin >> n >> k;
vector<int> h(n+1);
for(int i=1; i<=n; i++){
cin >> h[i];
}
vector<vector<long long int>> dp(n-k+1, vector<long long int>(n+1, INF));
dp[0][0] = 0;
for(int i=1; i<=n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define rep(i,n) for(int (i) = 0; (i) < (int)(n); (i)++)
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e... | 0 | 26,875,039 |
#include<bits/stdc++.h>
using namespace std;
#define N 100010
#define ll long long
int main()
{
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll ans = max(max(max(a*c,a*d),b*c),b*d);
cout<<ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define F first
#define S second
#define umap unordered_map
#define uset unordered_set
#define test ll cases; cin>>cases; for(ll testCase = 1; testCase <= cases; testCase++)
#define fill(name, val) memset(name, val, sizeof(name));
#def... | 0 | 42,283,432 |
#include <functional>
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <queue>
#include <string>
#include <cstring>
#include <math.h>
using namespace std;
int main() {
int n,m,l;
cin >> n >> m >> l;
int a[n];
for(int i = 0;i<n;i++){
cin >> a[i];
}
int ans = 0;
for... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int>v(n);
for(int i=0;i<n;i++)
{
cin>>v[i];
}
sort(v.begin(),v.end());
int sum=0;
for(int i=v.size()-1;i>=n-k;i--)
{
sum+=v[i];
}
cout<<sum;... | 0 | 22,549,104 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
if( N >= 2){
vector<unsigned> f;
f.push_back(1);
f.push_back(1);
for(int i = 2; i <= N; i++){
int temp = f.at(i-1) + f.at(i-2);
f.push_back(temp);
}
cout << f.at(N) << endl;;
}else{
cout << 1 << endl;
}
re... | #include <bits/stdc++.h>
typedef long long ll;
#define fr(i,a,b) for(ll i=a; i<b; i++)
#define rf(i,a,b) for(ll i=a; i>=b; i--)
typedef std::vector<long long > vi ;
#define F first
#define S second
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define mod 1000000007
#define PB push_back
#define MP... | 0 | 71,068,698 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include <ext/rope>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define fi first
#define se second
#define mp make_pair
#define pb p... | #include <bits/stdc++.h>
#define rep(i, a, b) for(ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for(ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(ve... | 0 | 59,680,422 |
#include<iostream>
using namespace std;
typedef long long li;
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts)) cout << " "; print(ts...); }
string q[]... | #include<cstdio>
int main(void){
int n, u, k, v;
scanf("%d", &n);
int a[n+1][n+1];
for (int row = 1; row <= n; ++row) {
for (int column = 1; column <= n; ++column)
a[row][column] = 0;
}
for (int vertexi = 0; vertexi < n; ++vertexi) {
scanf("%d %d", &u, &k);
for (int outi = 0; outi < k; ++outi) {
scanf... | 0 | 89,667,625 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int r, g;
cin >> r >> g;
cout << r * r - g << endl;
} | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];... | 0 | 79,508,424 |
#include <bits/stdc++.h>
using namespace std;
long long gcm(long long a, long long b){
if(a % b == 0) return b;
a = a % b;
return gcm(b, a);
}
long long lcm(long long a, long long b){
return a / gcm(a, b) * b;
}
int main() {
int n;
cin >> n;
long long ans = 1;
for(int i = 0; i < n; i++){
long long k... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | 0 | 93,784,889 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, K, ans;
cin >> N >> K;
ans=0;
vector<int> l(N);
for (int i=0; i<N; i++) {
cin >> l[i];
}
sort(l.begin(),l.end());
reverse(l.begin(),l.end());
for (int j=0; j<K; j++) {
a... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
template <class T> using vvvt = vector<vector<vector<T>>>;
using ml = boost::multiprecision::... | 0 | 84,257,395 |
#include <bits/stdc++.h>
#define REP(i, n) for(ll i = 0; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define MSG(x) cout << x << endl;
#define YN(x) x ? cout << "YES" << endl : cout << "NO" << endl;
#define Yn(x) x ? cout << "Yes" << endl : cout << "No" << endl;
#define yn(x) x ? cout << "yes" << endl : cout << "n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#define COUT(x) cout << #... | 0 | 60,067,761 |
#include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug" << x << endl;
using namespace std;
int main(){
int x,y;
while(cin >> x >> y){
if(x == y && x == 0) break;
if(x <= y) cout << x << ' ' << y << endl;
e... | #include<stdio.h>
int main(){
int H[10000], W[10000];
int length;
int i=0, j, k;
do{
scanf("%d %d", &H[i], &W[i]);
i += 1;
}while(H[i-1]!=0 || W[i-1]!=0);
length = i;
for(i=0; i<length-1; i++){
for(j=0; j<H[i]; j++){
for(k=0; k<W[i]; k++){
... | 0 | 69,230,268 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> VI;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
ll x = 1e9 + 7;
const int INF = 1001001001;
int main() {
vector<vector<int>> a(3, vector<int>(3));
rep(i,3)rep(j,3) {
cin >> a[i][j];
}
int n;
cin >> n;
vector<boo... | 0 | 89,551,425 |
#include<stdio.h>
int main(){
int a,b;
scanf("%d%d",&a,&b);
printf("a %s b\n",a>b?">":a<b?"<":"==");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
vector<int> T(3);
cin >> N >> T[0] >> T[1] >> T[2];
vector<int> L(N);
for(int i=0; i<N; i++) cin >> L[i];
vector<int> Ltemp(4);
int result=1e9;
for(int i=0; i<(1<<(2*N)); i++){
int mp=0;
for(int l=0; l<4; l++){
Ltemp[l]=0;
... | 0 | 56,772,572 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
vector<int> W(26, 0);
string s = "";
string s0;
while(cin >> s0){
s += s0;
}
for(int i = 0; i < s.size(); i++){
char c = s.at(i);
if('A' <= c && c <= 'Z'){
c = c - 'A' + 'a';
}
if('a' <... | #include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<vector<ll> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a ... | 0 | 16,395,225 |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using namespace std;
using ll=long long;
using pii=pair<int, int>;
using vi=vector<int>;
using vii=vector<vector<int>>;
const ll LINF=1LL<<60;
const int INF=1<<29;
const ll MOD=1e9+7;
int main(){
double a, b, x;
cin >> a >> b >>... | #include<bits/stdc++.h>
using namespace std;
#define maxn 600020
#define rep(i,l,r) for(register int i = l ; i <= r ; i++)
#define repd(i,r,l) for(register int i = r ; i >= l ; i--)
#define rvc(i,S) for(register int i = 0 ; i < (int)S.size() ; i++)
#define rvcd(i,S) for(register int i = ((int)S.size()) - 1 ; i >= 0 ; i... | 0 | 21,887,201 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD 1000000007
int main (){
int N,M;
long long ans=0;
cin>>N>>M;
vector<pair<long long,long long>>energy(N);
rep(i,N){
long long a,b;
cin>>a>>b;
energy[i]=make_pair(a,b);
}
sort(energy.be... | #include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#include<algorithm>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, ... | 0 | 46,133,756 |
#include<cstdio>
#include<iostream>
#include<vector>
#include<set>
using namespace std;
int main(void) {
int N, M;
scanf("%d%d", &N, &M);
int H[100010];
for (int i = 0; i < N; i++) {
scanf("%d", &H[i]);
}
int A[100010], B[100010];
set<int> badTowers;
for (int i = 0; i < M; i++) {
scanf("%d%d", &A[i], &B[i])... | #include <iostream>
const int MOD = 1000000007;
int main(){
int N;
std::cin >> N;
std::string S;
std::cin >> S;
long long ans = 1;
long long left = 0;
for(int i=0; i<N*2; ++i){
if(left%2==1) S[i] = (S[i]=='B' ? 'W' : 'B');
if(S[i]=='B') ++left;
else ans = ans * (left--) % MOD;
... | 0 | 71,020,409 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define rrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
using ll... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#... | 0 | 19,278,760 |
#include <bits/stdc++.h>
using namespace std;
int strongness(int n) {
return (n + 11) % 13;
}
int main() {
int a, b;
cin >> a >> b;
int sa = strongness(a);
int sb = strongness(b);
string ans;
if (sa > sb) {
ans = "Alice";
} else if (sa == sb) {
ans = "Draw";
} else {
ans = "Bob";
}
cou... | #include "bits/stdc++.h"
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
using namespace std;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#de... | 0 | 58,667,989 |
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
const double PI = acos(-1);
#define EPS 1e-14
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
inline int inputi(){ int x; scan... | #include <bits/stdc++.h>
using namespace std;
const double pi = 2 * acos(0.0);
const double eps = 1e-8;
#define REP(i,a,b) for(int i=(a); i<(b);++i)
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int Cost;
struct Edge {
... | 0 | 83,830,790 |
#include <bits/stdc++.h>
const int N = 1e3+5;
int n, m, a, b, s[N][N];
int main()
{
scanf("%d%d%d%d", &n, &m, &a, &b);
for(int i = 1; i <= b; ++i) for(int j = 1; j <= a; ++j) s[i][j] = 1;
for(int i = b+1; i <= n; ++i) for(int j = a+1; j <= m; ++j) s[i][j] = 1;
for(int i = 1; i <= n; puts(""), ++i) for(i... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 78,113,050 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vstr;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ub upper_boun... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
int main(){
string s;
cin >> s;
ll k;
cin >> k;
ll n = s.size()-1;
ll ans = 0;
bool same = true;
ll now = 1;
vector<ll> can;
bool all = true;
for(ll i = 0; i < n; i++){
if(s[... | 0 | 74,031,464 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main(){
int n;
cin>>n;
int ans=1;
int m=n;
while(1){
if(m%360==0){
cout<<ans<<endl;
return 0;
}
ans++;
m+=n;
m%=360;... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define pii pair<int, int>
#define pll pair<long long, long long>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define DEBUG 1
#define cerr if (DEBUG) cerr
#define test cerr << "hi\n";
mt19937_64 rng(c... | 0 | 1,938,345 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,k;cin>>n>>k;
vector<pair<long long, long long > >nos(n);
long long a,b;
for(int i=0;i<n;i++){
cin>>a>>b;
nos[i]=make_pair(a,b);
}
sort(nos.begin(),nos.end());
int i=0;
while(k!=0){
if(k<=nos[i].s... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push... | 0 | 40,711,032 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i... | 0 | 36,493,459 |
#include <bits/stdc++.h>
#define FOR(i, l, r) for(ll i = l; i < r; i++)
#define rep(i, N) FOR(i, 0, N)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<ll> vl;
const ll MOD = round(1e9+7);
int main() {
int N; cin >> N;
vector<string> S(N); rep(i,N) cin >... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
#define DEBUG
#ifdef DEBUG
templ... | 0 | 88,213,527 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define MOD 1000000007
#define oo 1000000000000000000
#define forr(i,n) for(ll i=0;i<n;i++)
#define fastio ios_base::sync_with_stdio(false); cin.tie(0) ; cout.tie(0);
#define all(x) x.begin()... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using Order_Set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define PI acos(-1.0)
#define O_O ... | 0 | 22,423,113 |
#include<iostream>
#include<cmath>
int main(void){
int n, d, ans = 0;
std::cin >> n >> d;
int x[n][d];
for(int i = 0; i < n; i++){
for(int j = 0; j < d; j++){
std::cin >> x[i][j];
}
}
for(int i = 0; i < n; i++){
for(int j = i+1; j < n; j++){
int di... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
string s;
cin>>s;
char c=s[0];
int ans=1;
for(int i=1;i<4;++i){
if(s[i]==c) ++ans;
else{
... | 0 | 54,385,122 |
#include<bits/stdc++.h>
#define ll long long
#define debug(x) cout<<x<<"DE"<<endl;
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,m,s=0;
cin>>n;
ll l1[n+1];
for(int i=1;i<=n;i++){
cin>>l1[i];
if(i==1)m=l1[i];
else m=__gcd(m,l1[i]);... | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using ll = unsigned long long int;
using namespace std;
int main() {
fastIO;
int n, a, b;
cin >> n >> a >> b;
int sum... | 0 | 89,788,493 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class Abel> struct UnionFind {
vector<int> par;
vector<int> rank;
vector<Abel> diff_weight;
UnionFind(int n = 1, Abel SUM_UNITY = 0) {
init(n, SUM_UNITY);
}
void init(int n = 1, Abel SUM_UNITY = 0) {
par.... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | 0 | 27,977,910 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,ans=0; cin>>n>>m;
int k[11],bulb[11][11],p[11];
for(int i=0;i<m;i++){
cin>>k[i];
for(int j=0;j<k[i];j++) cin>>bulb[i][j],bulb[i][j]--;
}
for(int i=0;i<m;i++) cin>>p[i];
for(int ptn=0;ptn<1<<n;ptn++){
int sum[11]={0};
bool lig... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll,ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll,ll>>>
... | 0 | 1,396,272 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
int main() {
fast_io;
string s;
int k;
cin>>k>>s;
if(s.size()<=k) {
cout<<s<<endl;
}
else {
cout<<s.substr(0,k)<<"..."<<endl;
}
... | #include <algorithm>
#include <bits/stdc++.h>
#include<iostream>
#include<string>
using namespace std;
#define rep(i, n) for (int i = 0; i <(int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
const ll MOD=1000000007;
const ll INF=1<<27;
int n,a,b,c;
vector<int> l(10);
int ans=INF;
void dfs(int dep... | 0 | 38,961,310 |
#include <iostream>
using namespace std;
int main()
{int a,b,x;
cin>>a>>b>>x;
if(a>x){
cout<<"NO";
}
else if((a+b)<x){
cout<<"NO";
}
else if((a+b)>x &&a<=x){
cout<<"YES";
}
return 0;
} | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef long double lld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
#define MOD 1000000007
int main() {
in... | 0 | 50,879,501 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int t=1;
while(t--)
{
string s;
cin>>s;
string ans;
for(int i=... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>
#include <math.h>
#include <map>
#include <iomanip>
#include <stdio.h>
#include <bitset>
typedef long long LL;
constexpr long long INFLL = 1e18;
using namespace std;
LL solve(LL temp)
{
LL ans;
LL count;
LL x = 0;
count = tem... | 0 | 57,890,944 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=na... | #include <iostream>
#include <vector>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N; cin >> N;
vector<int> A(N);
for(int i = 0; i < N; ++i){
cin >> A[i];
A[i]--;
}
int ret = 0;
for(int i = 0; i < N; ++i){
if(A[A[i]] == i) ret++;
... | 0 | 80,234,248 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
int main() {
ll a, b, c, d;
cin >> a >> b >> c... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<map>
#include<iomanip>
#include<queue>
#include<stack>
#include<time.h>
#define rep(i,n)for(int i=0;i<n;i++)
#define int long long
#define ggr getchar();getchar();return 0;
#define prique priority_queue
constexpr auto mod ... | 0 | 39,604,492 |
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define LOCAL 1
#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define dbg(...) cout<<#__VA_ARGS__ ": ["; for(auto e: __VA_ARGS__){cout<<e<<", ";} cout<<"]\n"
#define dbg1(...) cout<<#__VA_ARGS__ " "<< __VA_ARGS__
#else
#define dbg... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vec... | 0 | 81,564,028 |
#include <bits/stdc++.h>
using namespace std;
#define DUMP(x) cerr << #x << "=" << x << endl
#define DUMP2(x, y) cerr<<"("<<#x<<", "<<#y<<") = ("<<x<<", "<<y<<")"<< endl
#define BINARY(x) static_cast<bitset<16> >(x)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for (int i=m;i<(int)(n);i++)
#define in_... | #include <stdio.h>
int selectionSort(int arr[], int n) {
int i, j, tmp, count = 0, min;
for (i = 0; i < n - 1; i++) {
min = i;
for (j = i; j < n; j++) {
if (arr[j] < arr[min]) {
min = j;
}
}
tmp = arr[i];
arr[i] = arr[min];
... | 0 | 12,957,633 |
#include<cstdio>
#include<cstring>
using namespace std;
const int MAXN=3000;
typedef unsigned long long ull;
const int maxn=1e5+5;
typedef long long ll;
int ans[200][200];
int main(){
memset(ans,0,sizeof(ans));
int a,b;
scanf("%d%d",&a,&b);
printf("100 100\n");
int i,j;
for (i=0;i<100;i++){
... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <complex>
#include <string>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <function... | 0 | 6,888,413 |
#include <iostream>
int main(){
int n,count=0;
std::cin >> n;
for(int i=1; i<=n; i++){
count += i;
}
std::cout << count << std::endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair< int, int > pii;
typedef vector<pii>vip;
typedef pair< pii, int > ppi;
#define fill(a,b) memset(a,b,sizeof(a))
#define all(v) (v).begin(),(v).end()
#define sp(k) cout<<setprecision(k)<<fixed;... | 0 | 76,837,769 |
#include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1e6;
int V,E;
vector<vector<long long int>> d;
int main(){
cin >> V >> E;
d.assign(V, vector<long long int>(V, INF));
for (int i=0; i<V; i++){
d[i][i] = 0;
}
vector<int> a(E), b(E), c(E);
for (int i=0; i<E; i++){
... | 0 | 55,516,854 |
#include<bits/stdc++.h>
using namespace std;
int main() {
string s,c;
cin>>s;
cin>>c;
c.erase(c.begin()+s.length(),c.end());
if(c==s) cout<<"Yes\n";
else cout<<"No\n";
return 0;
} | #include <iostream>
#include <vector>
#include <bitset>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int N, M;
cin >> N >> M;
vector<vector<int>> s(M, vector<int>(N));
rep(i, M){
int k;
cin >> k;
s.at(i).resize(k);
rep(j, k){
cin >> s.at(i).at(j);
... | 0 | 47,532,371 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define countof(a) (sizeof(a)/sizeof((a)[0]))
#define rep(i, n) for(int i = 0; i < (n); i++)
#define SP << " " <<
signed main()
{
cin.tie(0); ios::sync_with_stdio(false);
ll AB[2], K; cin >> AB[0] >> AB[1] >> K;
rep(i, K) {
AB[i%2] ... | #include <bits/stdc++.h>
using namespace std;
long long arr[100005];
int main(){
long long n;
scanf("%lld",&n);
long long sum=0;
for (int x = 0; x<n; x++){
scanf("%lld",&arr[x]);
sum += arr[x];
}
if (sum%((n*(n+1LL))/2LL)!=0LL){
printf("NO");
return 0;
}
long long t = sum/((n*(n+1))/2);
for (int x = 0; ... | 0 | 24,094,553 |
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
using namespace std;
using ll=long long;
using vi=vector<int>;
using vvi=vector<vi>;
using pii=pair<int,int>;
using vll=vector<ll>;
using vvll=vector<vll>;
using vpii=vector<pii>;
#define ... | #include <bits/stdc++.h>
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#... | 0 | 28,137,551 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
int start;
if ((int)(S.length()) % 2 == 1){
start = (int)(S.length()) - 1;
}
else{
start = (int)(S.length()) - 2;
}
for (int i = start; i > 0; i -= 2){
int num = 1;
while (num <= i / 2){
if (S.at(num - 1)... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 200005;
int a[N];
int main()
{
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
LL ans = 0, tot = 0;
for (int i = 1, j = 1; i <= n; i++)
{
for (; (a[j] ^ tot) == (a[j] + tot)... | 0 | 16,279,169 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double r = 0.0;
double g = 0.0;
cin >> r;
cin >> g;
cout << 2 * g -r << endl;
} | #include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
int n;
cin>>n;
int a[n];
int count = 0;
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
int minj = i;
for(int j=i;j<n;j++){
if(a[j]<a[minj]){
minj =... | 0 | 39,962,307 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> pll;
const int INF=1e9;
const ll MOD=1e9+7;
ll gcd(ll x,ll y){
if(y==0) return 0;
ret... | #include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e13;
const int mod ... | 0 | 33,232,903 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long N, ans = 1000000007;
cin >> N;
vector<long long> W(N), W_sum(N+1,0);
rep(i, N){
cin >> W[i];
}
rep(i,N) {
W_sum[i+1] = W_sum[i] + W[i];
}
for(int i = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
const ll MOD = 1000000007;
int main(){
int n,m;
cin >> n >> m;
vector<int> a(m+2);
for(int i=1;... | 0 | 37,703,401 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long L,R; cin >> L >> R;
long long ans = 9999999999;
for(long long i = L; i <= R - 1; i++){
for(long long j = i + 1; j <= R; j++){
if( ((i % 2019) * (j % 2019) % 2019) == 0){
cout << 0 <<endl;
return 0;
}
else if((... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N,b_num=0,ans=0,i=0;
cin >> N;
int data[N];
for(int i=0;i<N;i++) cin >> data[i];
for(int i=0;i<N;i++) data[i]--;
while(1){
ans++;
if(data[b_num] == 1) break;
int next = data[b_num];
if(i > 1... | 0 | 77,869,763 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include <ext/rope>
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
using namespace __gnu_pbds;
us... | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void){
int i,IMAX=0,num[100]={0},a,ans=0,max=0;
while(cin >> a){
num[a-1]++;
IMAX++;
}
for(i=0;i<IMAX;i++){
if(max<num[i]){
max=num[i];
ans=i+1;
}
}
c... | 0 | 15,359,326 |
#include <iostream>
using namespace std;
int main(){
int n;
float x1,x2,x3,x4,y1,y2,y3,y4;
cin >> n;
for(int i=0;i<n;i++) {
cin>>x1>>y1>>x2>>y2>>x3>>y3>>x4>>y4;
if( (y2-y1)/(x2-x1) == (y4-y3)/(x4-x3) )
cout<<"YES\n";
else
cout<<"NO\n";
}
return 0;
} | #include<stdio.h>
#include<vector>
#include<algorithm>
using lint = long long;
using std::pair;
using std::vector;
using pll = pair<lint, lint>;
int main() {
int n, k;
scanf("%d%d", &n, &k);
vector<pll> vec;
for (int i = 0; i < n; i++) {
lint a, b;
scanf("%lld%lld", &a, &b);
vec.push_back({ a,b });
}
lint a... | 0 | 20,119,211 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define copy(from, to) copy(from.begin(), from.end(), back_inserter(to))
#define sort(a) sort(a.begin(), a.end())
#define reverse(s) reverse(s.begin(), s.end())
#define p(s) cout << (s) << endl
typedef long long ll;
using namespace std;
templa... | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout... | 0 | 24,838,573 |
#include<bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF= 1e+18+1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll> >vvl;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> T;
const ll MOD=1000000007LL;
string abc="abc... | #include <bits/stdc++.h>
#include <math.h>
#include <algorithm>
using namespace std;
int main(){
int n;cin >> n;
int arr[n];
for(int i=0;i<n;i++){
cin >> arr[i];
}
sort(arr,arr+n);
int mid1 = arr[n/2-1];
int mid2 = arr[n/2];
int ans = 0;
if(mid1 < mid2){
for(int i=mid... | 0 | 88,537,824 |
#include <stdio.h>
#include <string.h>
int main(){
char S[100];
scanf("%s",&S);
if (strcmp(S, "AAA")==0 || strcmp(S,"BBB")==0){
printf("No\n");
}
else {
printf("Yes\n");
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
int n = s.size();
vector<vector<ll>> dp(n, ... | 0 | 47,580,856 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
long long a,b,c,d;
cin>>a>>b>>c>>d;
long long s1=min(a,b);
long long s2=min(c,d);
cout<<s1+s2<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define ALL(... | 0 | 73,723,644 |
#include <bits/stdc++.h>
using namespace std;
int num_of_div(int n) {
int res = 0;
for (int i = 1; i * i <= n; i++) {
if (i * i == n) {
res++;
continue;
}
if (n % i == 0) res += 2;
}
return res;
}
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i <= N; i += 2) {
if... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define pll pair<ll,ll>
#define v vector<ll>
#define st stack<ll>
#define pq priority_queue <int>
#define q queue<ll>
#define mod 1000000005
using namespace std;
int solve(int arr[],int n){
int res=0;
for (i... | 0 | 3,481,124 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int64;
typedef vector<int> vec;
typedef vector<int64> vec64;
#define db(x) cout << "> " << #x << ": " << x << "\n";
#define ss cout << " ";
#define ct(x) cout << x;
#define nn cout << "\n";
#define cts(x) cout << x << " ";
#define ctn(x) cout << x << "\n";... | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(const T& value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(const T& value, const Ts&... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { ... | 0 | 17,974,893 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> B(n-1);
for(int i = 0; i < n-1; i++) cin >> B[i];
vector<int> A(n);
A[0] = B[0];
A[n-1] = B[n-2];
for (int i = 1; i < n - 1; i++) {
A[i] = min(B[i], B[i - 1]);
}
cout << accumulate(A.be... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
map<pair<int,int>,int> mp;
int dy[9] = {0,1,1,0,-1,-1,-1,0,1};
int dx[9] = {0,0,1,1,1,0,-1,-1,-1};
vector<ll> ans(10);
int main(){
ll h, w, n;
cin >> h >> w >> n;
for (int i = 0; i < n; i++) {
ll a, b;
cin >> a >> ... | 0 | 11,546,090 |
#include <iostream>
#include <vector>
#include <map>
using namespace std;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n) { for (int i = 0; i < n; ++i) par[i] = i; }
void init(int n) { par.resize(n); for (int i = 0; i < n; ++i) par[i] = i; }
int root(int x) {
if (par[x] == x) retu... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
const int A = 2e5 + 5;
const int mod = 1e9 + 7;
int add(int x, int y) {
return ((x + y) % mod + mod) % mod;
}
int mul(int x, int y) {
return (1LL * x * y) % mod;
}
int fp (int x, int y) {
... | 0 | 58,718,578 |
#include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1e18
using namespace std;
ll ans = INF;
ll n;
ll a, b, c;
vector<ll> l;
void dfs(int x, int y, int z, int u){
if (u == n){
if (x == 0 || y == 0 || z == 0)
return;
ll A = 0, B = 0, C = 0;
ll t = 0;
for (int i = 0... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 83,922,356 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n, m, d;
cin >> n >> m >> d;
ll cnt = 0;
for(int i=1; i<=n; ++i){
if(d == 0){ ++cnt; continue;}
if(i-d >=1) ++cnt;
if(i+d <=n) ++cnt;
}
cnt *= m-1;
double ans = (double)cnt /n /n;
printf("%.10f", ans);
} | #include <bits/stdc++.h>
using namespace std;
int main(){
long long h, w;
cin >> h >> w;
long long ans = h*w;
vector<long long> area(3);
for (int i = 0; i < 2; i++){
for (long long t = 1; t < h; t++){
area[0] = t * w;
area[1] = (h-t)*(w/2);
area[2] = h*w -... | 0 | 22,937,997 |
#include<iostream>
using namespace std;
int main(){
string str,str2;
cin >> str;
int n = str.size();
for(int i = 0;i < n;i++){
str2.push_back(str[n-i-1]);
}
cout << str2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fastio {\
ios::sync_with_stdio(0);\
cin.tie(0);\
}
#define file {\
freopen("io\\in.txt", "r", stdin);\
freopen("io\\out.txt", "w", stdout);\
freopen("io\\err.txt", "w", stderr);\
}
#ifdef LOCAL
#define debug(args...) {\
string _s(#args);\
... | 0 | 82,686,739 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int X[3][3];
for(int i=0; i<3; i++) {
for(int j=0; j<3; j++) {
cin >> X[i][j];
}
}
int n;
cin >> n;
for(int b=0; b<n; b++) {
int y;
cin >> y;
for(int i=0; i<3; i++) {
for(int j=0; j<3; j++) {
... | #include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
K = min(K, 50);
vector<int> A(N);
REP(i, N) cin >> A[i];
while ... | 0 | 77,873,686 |
#include<iostream>
#define rep(i,n) for(int i=0; i<(n); ++i)
int main(){
int n,m; std::cin >> n >> m;
int a, total=0;
rep(i,m){
std::cin >> a;
total += a;
}
std::cout << (total > n ? -1 : n-total) << std::endl;
return 0;
} | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const stati... | 0 | 94,491,151 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
priority_queue<pair<ll,pair<ll,ll>>> que;
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
const int ... | 0 | 84,558,321 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
ll gcd(ll a,ll b){
if(b>a) swap(a,b);
if(b==0) return a;
return gcd(b,a%b);... | #include <bits/stdc++.h>
using namespace std;
int INF = 100000;
vector<int> dx = {0, 1, 0, -1};
vector<int> dy = {1, 0, -1, 0};
int main(){
int H, W;
cin >> H >> W;
vector<string> A(H);
for (int i = 0; i < H; i++){
cin >> A[i];
}
vector<vector<int>> d(H, vector<int>(W, INF));
queue<pair<int, int>> Q;
... | 0 | 36,348,242 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){i... | #include<bits/stdc++.h>
using namespace std;
const bool DBG = 1;
#define TRACE(x) x
#define WATCH(x) TRACE(cout << #x" = " << x << endl)
#define WATCHR(a,b) TRACE(for(auto it=a; it!=b;) cout<<*(it++)<<" ";cout<<endl)
#define WATCHC(V) TRACE({cout << #V" = "; WATCHR(V.begin(), V.end());})
#define all(x) (x).begi... | 0 | 92,905,244 |
#include <iostream>
#include <cstring>
#include <queue>
using namespace std;
int main(){
priority_queue<int> priorityqueue;
char loader[8];
int loadnum;
while (1){
cin >> loader;
if (strcmp(loader, "insert") == 0){
cin >> loadnum;
priorityqueue.push(loadnum);
}
if (strcmp(loader, "extract") == 0){
... | #include<iostream>
#include<queue>
#include<limits>
#include<algorithm>
#include<vector>
#include<cmath>
#include<math.h>
#include<iomanip>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#define ll long long
#define tc(t) wh... | 0 | 57,753,764 |
#include<bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <=... | #include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <queue>
using namespace std;
const int nmax = 1e9 + 7;
typedef long long ll;
int main(){
int N; cin >> N;
vector <ll> T(N), A(N);
for (int i = 0; i < N; i++)... | 0 | 7,639,138 |
#include<iostream>
#include<vector>
using namespace std;
int main()
{
int n, m = 0;
cin >> n >> m;
vector<int>duck;
for (int i = 0; i < m; i++)
{
int a = 0;
cin >> a;
duck.push_back(a);
}
for (int i = 0; i < m; i++)
{
n -= duck[i];
}
if (n < 0)n = -1;
cout << n;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, char> P;
int n = 0;
int encode(string a){
vector<int> l;
for(int i = 0; i < a.size(); i++){
switch(a[i]){
case 'm':
l.push_back(1000);
break;
case 'c':
l.push_back(100);
break;
case 'x':
l.push_back(10);
... | 0 | 3,480,355 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N, M;
cin >> N >> M;
ll A[N], B[N];
for (int i = 0; i < N; i++) cin >> A[i] >> B[i];
vector<vector<ll>> G(M+1);
for (int i = 0; i < N; i++){
if (A[i] <= M) G[A[i]].push_back(B[i]);
}
ll ans = 0;
priority_queue<ll> ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES... | 0 | 1,388,169 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.