code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
int a[100005];
int n;
int ans;
inline void read(int &x)
{
int f;char c;
for (f=1,c=getchar();c<'0'||c>'9';c=getchar()) if(c=='-') f=-1;
for (x=0;c<='9'&&c>='0';c=getchar()) x=x*10+(c&... | #include <iostream>
#include <map>
int reduce_3to1(int x)
{
if(x <= 2) {
return x;
} else {
return x%2 == 0 ? 2 : 1;
}
}
int main()
{
int N;
std::cin >> N;
std::map<int, int> cards;
for(int i=0; i<N; i++) {
int a;
std::cin >> a;
cards[a]++;
}
int num_doubles = 0;
for(auto &c: car... | 1 | 15,273,923 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define ALL(a) (a).begin(),(a).end()
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define ll long long
#define ull unsigned long long
int dx[4] = {1, 0, -1, 0};
int... | #include <iostream>
#include <cstdio>
using namespace std;
int mtoi(string s){
int sum=0;
int co=1;
for(int i=0;i<s.length();i++){
if('1'<=s[i] && s[i]<='9'){co=s[i]-'0';}
else if(s[i]=='m'){sum+=1000*co;co=1;}
else if(s[i]=='c'){sum+= 100*co;co=1;}
else if(s[i]=='x'){sum+= 10*co;co=1;}
else if(s[i]=='i')... | 1 | 25,419,263 |
#include <bits/stdc++.h>
#define long long long int
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
long res = 0;
for (int x = k; x <= n + 1; x++) {
long minsum = (long)x * (x - 1) / 2;
long maxsum = (long)n * x - minsum;
res += (max... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD 1000000007
int main()
{
ll n, k;
cin >> n >> k;
ll ans = 0;
for (ll i = k; i <= n + 1; i++)
{
ll min, max;
min = i * (i - 1) / 2;
max = (i * (2... | 1 | 29,042,333 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ios ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
typedef long long ll;
const int INF=0x3f3f3f3f;
const int MAXN=2e5+100;
int a[110],b[110];
int main(){
ios;
int n;
cin>>n;
ll sum=0;
for(int i=1;(n-1)>=i;i++){... | 1 | 42,843,296 |
#ifdef DAIJOBU
#include "/home/v-o_o-v/deb.h"
#define deb(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#include <bits/stdc++.h>
#define deb(x...)
#endif
using namespace std;
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#... | #include <bits/stdc++.h>
#include <vector>
#include <queue>
using namespace std;
int main(){
string O, E;
cin >> O >> E;
int j=0;
int k=0;
for(int i=0; i<O.size()+E.size(); i++){
if((i+1)%2==0){
cout << E[j];
j++;
}else{
cout << O[k];
k... | 1 | 40,778,650 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << endl;
template<clas... | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
ll N, ans=0, tmp=0;
vector<ll> A;
string S, T="";
signed main(){
cin >> S;
for(int i=0;i<S.size();i++) {
if(S[i]!='x') {
T = T+S[i];
A.push_back(tmp);
tmp... | 1 | 50,288,487 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int N, ans;
cin >> N;
ans=0;
vector<int> a(N);
for (int i=0; i<N; i++) {
cin >> a[i];
}
for (int j=0; j<N; j++) {
if (a[a[j]-1]==j+1) {
ans=ans+1;
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9+7;
int main() {
int n; cin >> n;
V<int> v(n);
for(int i = 0; i < n; i++){
int a; cin >> a;
a--;
v[i] = a;
... | 1 | 29,045,798 |
#include <algorithm>
#include <iostream>
#include <list>
#include <string>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
list<int> l;
string s;
int x;
while (n--)
{
cin >> s;
if (s == "deleteFirst") { l.pop_front(); continue; }
else if (s == "deleteLast") { l.pop... | /*http:
#include <list>
#include <algorithm>
#include <iostream>
using namespace std;
int main(){
int n;
list<int> data;
string command;
int value;
list<int>::iterator it;
cin.tie(0);
ios::sync_with_stdio(false);
cin>>n;
for(int i=0;i<n;i++){
cin>>command;
if(command=... | 1 | 10,235,211 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n,a,b;
cin>>n>>a>>b;
int64_t sum_all=0;
for(int i=1;i<=n;i++){
string swk = to_string(i);
int64_t sum=0;
for(int j=0;j<swk.size();j++){
char cwk = swk.at(j);
sum+=(cwk-'0');
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int n,a,b;
cin >> n >> a >> b;
int ans = 0;
for(int i=1; i<=n; i++){
int now = 0;
string s;
s = to_string(i);
rep(j,int(s.size())) now += s[j]-'0';
... | 1 | 90,255,053 |
#include<iostream>
using namespace std;
int main(int argc, char const *argv[])
{
int n;
cin >> n;
int F[50];
F[0] = F[1] = 1;
for(int i=2; i<=n; i++) F[i] = F[i-1] + F[i-2];
cout << F[n] << endl;
return 0;
} | #include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloa... | 1 | 76,184,713 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ull unsigned long long
#define si set <ll>
#define vi vector <ll>
#define popcount(x) __builtin_popcountll(x)
#define mii map <ll,ll>
#define vpi vector <pair <ll,ll> >
#define sz(c) (int)c.size()
#define fr first
#define ... | #include<bits/stdc++.h>
using namespace std;
#define optimize() ios::sync_with_stdio(false);cin.tie(0);
#define endl '\n'
int main()
{
int a,b,c,k;
cin>>a>>b>>c>>k;
int ans=(min(k,a)*1);
k-=a;
if(k>0)
{
ans+=min(k,b)*0;
}
k-=b;
if(k>0)
{
ans+=(min(k,c)*-1);
}
... | 1 | 97,405,139 |
#include <stdio.h>
#include <string.h>
int main(){
char S [30]; char T [30]; char N [30];
int a, b;
scanf("%s %s", &S, &T);
scanf("%d %d", &a, &b);
scanf("%s", &N);
if (strcmp(S, N)==0) {
printf("%d %d", a-1,b);
}
else if (strcmp(T,N)==0) {
printf("%d %d", a,b-1);
}
return 0;
} | #include <bits/stdc++.h>
#include <map>
#include <algorithm>
#include <vector>
#include <string.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <chrono>
#include <thread>
#include <iomanip>
#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(in... | 1 | 2,364,310 |
#include <stdio.h>
int main() {
int n, k;
scanf("%d%d", &n,&k);
int jwb = 1;
for (int i=0; i<n; i++){
if (jwb*2 < jwb+k){
jwb*=2;
}
else{
jwb+=k;
}
}
printf("%d\n", jwb);
return 0;
} | #include<stdio.h>
int main(){
int n,add;
int angka=1;
scanf("%d%d",&n,&add);
for(int i = 1;i<=n;i++){
if(angka<=add) angka*=2;
else angka+=add;
}
printf("%d\n",angka);
return 0;
} | 1 | 15,171,904 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int T , X;
cin >> T >> X;
cout << fixed << setprecision(10) << 1.0 * T / X << endl;
} | #include <stdlib.h>
#include <iostream>
#include <string>
using namespace std;
int main(void)
{
int T;
int X;
cin >> T;
cin >> X;
if (T > 0 &&
T <= 100 &&
T > 0 &&
T <= 100)
{
float time = float(T)/float(X)
;
cout << time << endl;
}
cin >> T;
return 0;
} | 1 | 15,796,076 |
#include<bits/stdc++.h>
using namespace std;
typedef long long lli;
int main()
{
lli a, b; cin >> a >> b;
lli arr[a + 50], mx = 1;
for(int i=0; i<a; i++)
{
cin >> arr[i];
if(i)
{
if(arr[i] + arr[i - 1] > arr[mx] + arr[mx - 1])
{
mx = i;
}
}
}
if(arr[mx] + arr[mx - 1] < b)
{
cout << "Imposs... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main()
{
int n; ll L;
cin >> n >> L;
vector<ll> a(n);
rep(i,n) cin >> a[i];
int start = -1;
rep(i,n-1) {
if(a[i]+a[i+1] >= L) {
start = i;
break;... | 1 | 60,814,056 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
const int maxn = 105 + 5;
ll a[maxn];
int main()
{
ios::sync_with_stdio(false);
int n ; cin >> n;
for (int i = 1 ; i <= n ; i++){
cin >> a[i];
}
sort(a + 1 , ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin>>N;
vector<int>X(N);
for (int i = 0; i < N; i++)
{
cin>>X[i];
}
priority_queue<int,vector<int>,greater<int>>Sum;
for (int P = 1; P < 101; ++P)
{
int cash=0;
for(int i=0;i<N;++i)
{
... | 1 | 7,653,064 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using iii = pair<ii, int>;
#define vt vector
#define pq priority_queue
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define __lcm(a, b) a * b / __gcd(a, b)
const int MOD =... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 1 | 47,947,171 |
#include<iostream>
using namespace std;
int p[10010];
void init(int n)
{
for(int i=0;i<=n;i++)
p[i]=i;
};
int root(int a)
{
if(p[a]==a)
return a;
return (p[a]=root(p[a]));
};
bool is_same_set(int a,int b)
{
return root(a)==root(b);
};
void unite(int a,int b)
{
p[root(a)]=root(b);
};
... | #include<bits/stdc++.h>
using namespace std;
struct union_find2_2{
vector<int> par;
union_find2_2(int sz){
par.resize(sz);
for(int i=0;i<sz;++i) par[i]=i;
}
int find(int a){
if(par[a]==a) return a;
else return par[a] = find(par[a]);
}
void unite(int a,int b){
... | 1 | 64,474,845 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int solve(vector<int>& v, int k) {
int n = v.size();
vector<int> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = 1; j <= k; ++j) {
if (i - j >= 0) {
dp[i] = min(dp[i], dp[i - j] + abs(v[i] - v[i - j]));
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> h(N);
for(int i = 0; i<N; ++i) cin >> h.at(i);
vector<int> dp(N,1001001000);
dp.at(0) = 0;
for(int i = 0; i<N; ++i){
if(i>0){
dp.at(i) = min(dp.at(i),
dp.at(i-1)+abs(h.at(i-1)-h.at(i))
... | 1 | 66,996,756 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n,a,b,c,x,y;
while (cin>>n>>a>>b>>c>>x) {
if (n==0&&a==0&&b==0&&c==0&&x==0) {
break;
} else {
std::deque<int> deq;
for (int i=0;i<n;i++) {
cin>>y;
deq.emplace_bac... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b,c,x,x2;
while(1){
cin>>n>>a>>b>>c>>x; if(n==0)break;
int ans=0;
vector<int> y(n);
for(int i=0;i<n;i++){
cin>>y[i];
}
int pos=0;
while(1){
if(x==y[pos]){
pos++;
}
if(pos>=n)break;
x=(a*x +b)%c;
ans++;
if(ans>10000... | 1 | 19,425,627 |
#include <bits/stdc++.h>
using namespace std;
const int SIZE_LIMIT = 2e5+5;
int arr[SIZE_LIMIT];
int main() {
memset(arr, 0, sizeof(arr));
int n = 0;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", arr+i);
}
long long ans = 0, maxA = arr[0];
for (int i = 0; i < n; ++i) {
if (arr[i] < ma... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long N;
cin >> N;
vector<long long> A(N);
for (long long i = 0; i < N; i++){
cin >> A[i];
}
long long ans = 0;
for (long long i = 0; i < N - 1; i++){
if (A[i] > A[i + 1]){
ans += A[i] - A[i + 1];
A[i + 1] = A[i];
}
}
... | 1 | 50,375,100 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, seisu) for(int i = 0; i < (int)(seisu); i++)
typedef long long ll;
int main(){
string s, t;
cin >> s >> t;
int check = 0, same = 0;
int ls = s.length(), lt = t.length();
rep(i, ls){
rep(j, lt){
int ns = s[i] - '0', nt = t[j] - '0';
i... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | 1 | 82,203,610 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ull unsigned long long
#define __ ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
const int maxn = 1e5 + 10;
int n, a[maxn];
set<int> s;
map<int, int> mp;
vector<int> v1, v2;
int main() {
__;
cin >> n;
for (int ... | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll 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 MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<bool>
... | 1 | 4,877,725 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define repo(i,N) for(int i = 1; i < (N); i++)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define pi acos(-1.0)
int main() {
int a,b;
cin >>a>>b;
if(a+... | 1 | 72,139,267 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<int, int>
#define all(a) a.begin(),a.end()
template <typename T>
inline T gcd(T a, T b) { while (b != 0) swap(b, a %= b); return a; }
int main(){
int n;
cin >> n;
vector<int>... | #include <iostream>
#include <utility>
#include <algorithm>
#include <vector>
#include <iterator>
using namespace std;
int main(void){
int N;
cin >> N;
vector<vector<char>> ss;
string str = "abcdefghijklmnopqrstuvwxyz";
vector<char> uniques(str.begin(), str.end());
for(int i =0; i < N; i++){
... | 1 | 87,153,709 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
using dd = double;
using vdd = std::vector<dd>;
using vvdd = std::vector<vdd>;
using vvvdd = std::vector<vvdd>;
constexpr ll INF = 1LL << 60;
constexpr dd EPS ... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
using namespace std;
using ll = long long int;
const int N_MAX = 305;
ll H[N_MAX];
int n, k;
ll dp[N_MAX][N_MAX];
const ll INF = 1E+15;
int main(){
cin >> n >> k;
H[0] = 0;
for(int i = 1; i <= n; i++){
cin >> H[i];
}
f... | 1 | 65,192,490 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
template<class T>void chmin(T... | #include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<cstring>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<climits>
#include<fstream>
#define MOD (1000000007)
using namespace std;
typedef long long ... | 1 | 62,037,004 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL)
#define endl "\n"
#define pb push_back
#define mod 1000000007
int dx[]={1,-1,0,0};
int dy[]={0,0,1,-1};
int dx8[]={1,-1,0,0,1,1,-1,-1};
int dy8[]={0,0,1,-1,1,-1,1,-1};
ll binexp(ll a, ll b, ll m... | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | 1 | 79,725,157 |
#include<iostream>
#include<cmath>
#include<cstdio>
#include<vector>
using namespace std;
int main(void){
long n;
int a;
while(scanf("%d", &n) != EOF){
vector<bool>p;
for(int i = 0; i <= n; i++) p.push_back(true);
p[0] = false;
p[1] = false;
for(int i = 2; i < sqrt(n)+1; i++){
if(p[i]){
for(int j = ... | #include <iostream>
#include <cstring>
#include <cmath>
#define Rep(i, b, e)\
for (int i = (int)b; i < (int)e; i++)
using namespace std;
const int MAXN = 999999;
bool isPrime[MAXN];
int countPrime(int n) {
memset(isPrime, true, sizeof isPrime);
Rep(i, 0, 1000)
isPrime[i] = true;
isPrime[0] = fal... | 1 | 43,268,247 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
int main() {
string o,e;
cin>>o>>e;
string ans;
if(o.length()-e.lengt... | #define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
string o, e;
cin >> o >> e;
string ans;
rep(i, o.length()) {
ans.push_ba... | 1 | 88,817,565 |
#include <bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) (c).begin(),(c).end()
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define MINF(a) memset(a,0x3f,sizeof(a))
#define POW(n) (1... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MA... | 1 | 7,654,205 |
#include "bits/stdc++.h"
#include <unordered_set>
#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define REP2(i, x, n) for(decltype(x) i = (x); i < (n); i++)
#define REP3(i, x, n) for(decltype(x) i = (x); i <= (n); i++)
#define RREP(i, n) for (decltype(n) i = (n) - 1; i >= 0; i--)
#define ALL(a) (a).begin(),(a)... | #include<stdio.h>
#define MAX 250
typedef struct Node {
int key;
Node *parent, *left, *right;
} Node;
Node *NIL, T[MAX];
void print(int n) {
int i;
Node *N;
for (i=1; i<=n; i++) {
N = &T[i];
printf("node %d: key = %d, ", i, N->key);
if (N->parent!=NIL) printf("parent key = %d... | 1 | 51,686,615 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>
#include <cmath>
#include<cctype>
#include<string>
#include<set>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinf... | #include <bits/stdc++.h>
#define rep(i,n,m) for(int i=n;i<(int)(m);i++)
#define rrep(i,n,m) for(int i=((int)(n)-1);i>=m;i--)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using namespace std;
int main(){
int n;
cin>>n;
vector<ll>... | 1 | 32,855,559 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const int INF = 1e9 + 7;
int h[MAXN];
int dp[MAXN];
int N,K;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N >> K;
for (int i = 0; i < N; ++i) cin >> h[i];
fill(dp, dp + MAXN, INF);
dp[0] = 0;
for (int i = 0; i < N; +... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define loop(i,a,b) for(ll i=a;i<b;i++)
#define loope(i,a,b) for(ll i=a;i<=b;i++)
#define test() ull t;cin>>t;while(t--)
#define pll pair<ll,ll>
#defin... | 1 | 12,148,202 |
#include <bits/stdc++.h>
using namespace std;
#define f(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) f(i,0,n)
#define fd(i,a,b) for(ll i=a;i>=b;i--)
#define Max(a,b,c) max(a,max(b,c))
#define Min(a,b,c) min(a,min(b,c))
#define pb push_back
#define mp make_pair
#define vi vector< int >
#define pc(x) __builtin_popcount (... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define DEBUG fprintf(stderr,"Running on Line %d in Function %s\n",__LINE__,__FUNCTION__)
#define fir first
#define sec second
#define mod 998244353
#define ll long... | 1 | 508,977 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define rep2(i,j,n) for(int j=i;j<n;j++)
#define rep3(i,j,n) for(int j=i;j<=n;j++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define sp(n) cout << fixed << setprecision(n)
typedef long long ll;
using namespa... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int H, W, D;
cin >> H >> W >> D;
vector<pair<int, int>> pos(H * W + 1);
rep(i, H) rep(j, W)
{
int A;
cin >> A;
pos[A] = make_pair(i + 1, j + 1);
}
vector<in... | 1 | 1,667,286 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int n,m;
cin >> n >> m;
int sum=m*1900+(n-m)*100;
int luck=pow(2,m);
int ans=sum*luck;
cout << ans << endl;
} | 1 | 88,013,093 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0)->sync_with_stdio(false);
int k; cin >> k;
queue<ll> q;
REP(i, 9) q.push(i + 1);
ll num = 0;
REP(i, k) {
num = q.front();
ll rem = num % 10;
q.pop();
if (rem != 0)
... | #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>;
int main() {
int k;
cin >> k;
if (k <= 9) {
cout << k << endl;
return 0;
}
queue<ll> q;
for (int i = 1; i <= 9; i++) q.push(i);
ll x;
while (k != 0) {
... | 1 | 90,286,308 |
#include <iostream>
#include <math.h>
#include <cstdio>
using namespace std;
int p[2000000];
int id,q;
int k;
int parent(int i){
if(i%2==0){
return i/2;
}else{
return (i-1)/2;
}
}
int left(int i){
return 2*i;
}
int right(int i){
return 2*i+1;
}
int inside(int i){
if(i > id || i <... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<vector>
using namespace std;
#define MAX_H 2000000
const int INV = -1;
int parent(int i);
int leftNode(int i);
int rightNode(int i);
void buildPriorityQueue(int queue[], int size, int add... | 1 | 17,638,860 |
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define MOD7 1000000007
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a)... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
ll n;
cin >> n;
ll a[n + 1];
ll b[n];
for(ll i = ... | 1 | 99,775,463 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve(ll a, ll b){
if(a == b) return a;
if(b > a) return solve(b, a);
ll k = ((a-1) / b);
return solve(a - k * b, b) + 2 * k * b;
}
int main(){
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
ll n, x;
cin >> n >> x;
ll ans = solve(x, ... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
#define i_7 (long long)(1e9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)re... | 1 | 80,391,110 |
#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 <string>
#include <bitset>
#include <cfloat>
#include <random>
#include <iomanip>... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
rep(i, n) cin >> a[i];
int g = a[0];
rep(i, n) { g = __gcd(g, a[i]); }
if (k <= *max_element(a, a + n) && k % g == 0)
cout... | 1 | 17,229,272 |
#include <cstdlib>
#include <string>
#include <iostream>
int main() {
std::string str;
getline(std::cin, str);
char r;
for (auto c: str) {
if (isupper(c)) {
r = tolower(c);
} else {
r = toupper(c);
}
std::cout << r;
}
std::cout << std::end... | #include<iostream>
#include<string>
#include<ctype.h>
using namespace std;
int main(){
string a;
char check;
getline(cin,a);
for(int i=0;i<a.size();i++){
if(isalpha(a[i])!=0){
check=a[i];
a[i]=tolower(a[i]);
if(check==a[i])
a[i]=toupper(a[i]);
}
cout<<a[i];
}
cout<<endl;
return 0;
} | 1 | 17,767,151 |
#include <iostream>
using namespace std;
int main(){
int zero;
while(1){
int N;
int* score;
int S = 0;
int max = 0;
int min = 0;
cin >> N;
if(N == 0){
return 0;
}
score = new int[N];
for(int i=0; i<N; ++i){
cin >> score[i];
S += score[i];
if( i == 0 ){
max = min = score[i];
}
... | #include <iostream>
using namespace std;
int main(){
int n,i,t,a,ma,mi;
while(cin>>n,n){
t=ma=0,mi=1000;
for(i=0;i<n;i++)cin>>a,t+=a,ma=max(ma,a),mi=min(mi,a);
cout<<(t-ma-mi)/(n-2)<<endl;
}
} | 1 | 6,186,199 |
#include<bits/stdc++.h>
#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
int a[100],b[100],n,f[100],c[100];
int lowbit(int x)
{
return x&(-x);
}
void add(int x)
{
while(x<=n)
{
c[x]+=1;
x+=lowbit(x);
}
}
int pre(int x)
{
int sum=0;
while(x)
{
sum+=c[x];
x-=lowbit(x);
}... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7;
int a[10], b[10], per[10];
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n;
cin >> n;
for(int i = 0; i < n; i++){
per[i] = i + 1;
}
for(int i = 0; i < n; i++){
... | 1 | 9,463,518 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
string O, E;
cin >> O >> E;
for (int i = 0; i < O.size(); i++)
{
cout << O.at(i);
if (O.size() - E.size() == 1 && i == O.size() - 1) break... | #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>;
int main() {
string o, e;
cin >> o >> e;
string res = "";
for (int i = 0; i < o.size(); i++) {
res.push_back(o.at(i));
if (i < e.size()) {
res.push_back(e.a... | 1 | 65,424,205 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i,n) for(ll i=0; i<n; i++)
#define loop(i, j, n) for(ll i=j; i<n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f3f;
const long long mod=1e9+7;
const long dou... | 1 | 8,600,360 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int a,b,c,d;
c = 0;
d = 0;
cin >> N;
for (int i=0;i < N;i++){
cin >> a >> b;
c = b - a + 1;
d += c;
}
cout << d << endl;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstream>
#include <numeric>
using namespac... | 1 | 28,894,129 |
#include <iostream>
using namespace std;
long long fibodp(int n){
long long fibodp[200]={0};
fibodp[0]=1;
fibodp[1]=1;
for(int i=2; i<=n; i++){
fibodp[i]=fibodp[i-1]+fibodp[i-2];
}
return fibodp[n];
}
int main(void){
int n;
cin>>n;
cout<<fibodp(n)<<endl;
return 0;
} | #include<iostream>
using namespace std;
int n[44];
int fib(int x) {
n[0] = 1;
n[1] = 1;
for (int i = 2; i <= x; i++) {
n[i] = n[i - 1] + n[i - 2];
}
return n[x];
}
int main() {
int n;
cin >> n;
cout << fib(n) << endl;
return 0;
} | 1 | 40,045,342 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(2 * n,0);
for(int i=0;i<2*n;i++)
{
cin >> l.at(i);
}
sort(l.begin(),l.end());
int sm = 0;
for(int i=0;i<2*n;i++)
{
if(i % 2 == 0)
{
sm += l.at(i);
}
}
cout << sm << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <time.h>
#define ll ... | 1 | 12,915,847 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
int ma... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
vector<int>v1,v2;
for(int i=a+1;i<=b;i++)v1.push_back(i);
for(int i=c+1;i<=d;i++)v2.push_back(i);
int l1=v1.size();
int count=0;
int l2=v2.size();
for(int i=0;i<l1;i++){
... | 1 | 52,156,925 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main(){
int R;
cin >> R;
if(R < 1200) cout << "ABC" << endl;
else if(R < 2800) cout << "ARC" << endl;
else cout << "AGC" << endl;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define PI 3.141592653589793238
#define INF 1050000000
using vi = vector<int>;
int ma... | 1 | 91,914,435 |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using ll = long long ;
int main(){
int n; cin >> n;
vi a(n),b,b1,b2;
for(int ix=0;ix<n;ix++){
cin >> a.at(ix);
}
for(int ix=0;ix<n;ix++){
if(ix%2 == 0) b1.push_back(a.at(ix));
... | #include <bits/stdc++.h>
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];
}
int start = n / 2, dist = 0;
vector<int> ans(n);
if (n % 2 == 0) {
for (int i = 0; i... | 1 | 77,604,780 |
#include <iostream>
#include <cstdio>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
int fun(int x){
return x*x;
}
int main(){
int d;
while(cin >> d){
int n = 600/d;
int sum = 0;
for(int i=0; i<n; i++){
sum += fun(d*i)*d;
}
cout << sum << en... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <complex>
#include <iterator>
using namespace std;
typedef pa... | 1 | 14,620,977 |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
typedef long long ll;
int main(){
string s;
char b[26]={};
int a[26]={};
int j;
for(int l=0; l<26; l++){
b[l]='a'+l;
}
while(getline(cin, s)){
for(int i=0; i<s.size(); i++){
if(s[i]>='A'&&s[i]<='Z'){
s[i]=s[i... | #include <iostream>
#include <string>
#include <cstdio>
#include <cctype>
using namespace std;
int alphas[26];
int main(void) {
string line;
while (getline(cin, line)) {
for (int i = 0; i < line.size(); ++i) {
char ch = line[i];
if (isalpha(ch)) {
++alphas[toupper... | 1 | 597,793 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <queue>
#include <stack>
#include <unordered_map>
using namespace std;
typedef long long int ll;
typedef pair<int, int> Pii;
const ll mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int... | #include <bits/stdc++.h>
using namespace std;
#define Maxn 100007
#define modp 1000000007
int n;
char s[Maxn];
int cnt[27];
int main()
{
scanf("%d",&n);
scanf("%s",s+1);
for (int i=1;i<=n;i++)
++cnt[s[i]-'a'+1];
int ans=1;
for (int i=1;i<=26;i++)
ans=(1LL*ans*(cnt[i]+1))%modp;
an... | 1 | 24,969,679 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void){
int n,m,R;
cin>>n>>m>>R;
vector<int> v;
for(int i=0;i<R;i++){
int r;
cin>>r;
v.push_back(r);
}
ll d[201][201]={};
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 200;
const ll INF = 9223372036854775807;
int N, M, R;
ll d[MAX][MAX];
void Warshall_Floyd() {
for (int k=0; k<N; k++) {
for (int i=0; i<N; i++) {
if (d[i][k] == INF) continue;
for (int j=0; j<N; j++) {
if (d[k][j] == INF) ... | 1 | 100,295,038 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n;i++)
int main()
{
int A, B, C;
cin >> A >> B >> C;
cout << (A == B ? C : ((A == C) ? B : A)) << endl;
} | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl
#define YORN(f) cout<<((f)?"YES":"NO")<<endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define println(x) cout << x << endl
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
if (a == b)... | 1 | 19,359,822 |
#include <bits/stdc++.h>
#include <string.h>
#define MAX 10000
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define rep(i,a,n) for(int i=a; i<n; i++)
#define r0 return 0
#define INF (int)1e15
int main(){
long long n;
cin>>n;
int a[n];
for(i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<int, int>
#define INF 0x3f3f3f3f
#define fi first
#define se second
#define f(n) for(int i = 0; i < n; i++)
#define f2(n) for(int i = 1; i <= n; i++)
#define t cout << "TESTE" << endl
#define debug(x) if(on)cout << x << endl
#defin... | 1 | 12,920,889 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
string s;
cin >> s;
bool ret = s[0] == 'A';
int count = 0;
for (int i = 2; i < s.size() - 1; i++) {
if (s[i] == 'C')count++;
}
if (count != 1)ret = false;
count = 0;
for (int i = 0; i... | 1 | 56,866,015 |
#include <iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
cout << b+(b-a)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double r,g;
cin>>r>>g;
g=2*g-r;
cout << g<<endl;
} | 1 | 17,307,251 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#... | #include <iostream>
using namespace std;
int main() {
int K, S;
cin >> K >> S;
int ans = 0;
for (int x = 0; x <= K; ++x) {
for (int y = 0; y <= K; ++y) {
int z = S - x - y;
if (0 <= z && z <= K) ++ans;
}
}
cout << ans << endl;
return 0;
} | 1 | 25,845,141 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
vector<string> numbers;
for(int i = 0; i < 1000; i++) {
string x = to_string(i);
if(x.size() == 1) {
x = "00" + x;
}
else if(x.size() == 2) {
x = '0' + x... | #include <iostream>
using namespace std;
int main() {
int N;
string s;
cin >> N >> s;
int ans = 0;
for (int i = 0; i < 1000; i++) {
int dig[3] = {i/100, i/10%10, i%10};
int flag = 0;
for (int j = 0; j < N; j++) {
if (dig[flag] + '0' == s[j]) flag++;
if... | 1 | 60,921,321 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define contains(v, t) (find(v.begin(), v.end(), t) != v.end())
#define MOD 1000000007
typedef long long ll;
typedef unsigned long long ull;
int main() {
ull n,a,b;
cin>>n>>a>>b;
if (n == 1) {
if (a == b) {
cou... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long ... | 1 | 91,552,343 |
#include<bits/stdc++.h>
using ll = long long;
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;cin >> n;
int m;cin >> m;
ll x;cin >> x;
vector<ll> c = vector<ll>(n,0);
vector<vector<ll>> a(n,vector<ll>(m,0));
for(int i = 0; i < n; i++){
cin >> c[i];
for(int j = 0; j < m; j++){... | #include<iostream>
#include<vector>
using namespace std;
int main() {
int N,M,X,i,j,k;
cin>>N>>M>>X;
vector<int> C(N);
vector<vector<int> > A(N, vector<int>(M));
for (i=0;i<N;i++) {
cin>>C[i];
for (j=0;j<M;j++) {
cin>>A[i][j];
}
}
int ans=12e5+1,SC;
vector<int> SA;
for (i=0;i<(1<<N... | 1 | 14,018,843 |
#include <iostream>
#include <string>
#include <algorithm>
#define INPUT_FROM_FILE (0)
#if INPUT_FROM_FILE
#include <fstream>
#endif
int main(int argc, char **argv){
#if INPUT_FROM_FILE
std::ifstream ifs("test.txt");
#endif
int n = 0;
std::string str0;
std::string str1;
int score0 = 0;
int score1 = 0;
#if INPUT_F... | #include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
string s1,s2;
int p1=0,p2=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>s1>>s2;
if(s1==s2){
p1++;
p2++;
}
else if(s1>s2) p1+=3;
else if(s1<s2) p2+=3;
}
cout<<p1<<" "<<p2<<endl;
return 0;
} | 1 | 1,503,092 |
#include<cstdio>
using namespace std;
const int N=100100;
int i,j,k,n,ch,ff,x,y,En;
int f[N],h[N];
struct edge { int s,n;} E[N<<1];
void R(int &x) {
ff=x=0;ch=getchar();
while (ch<'0' || '9'<ch) { if (ch=='-') ff=1;ch=getchar();}
while ('0'<=ch && ch<='9') x=x*10+ch-'0',ch=getchar();
if (ff) x=-x;
}
void E_add(int ... | #include <bits/stdc++.h>
using namespace std;
const int maxN = 1e5 + 10;
struct Node
{
int to, next;
}edge[maxN * 2 + 1];
int n;
int tot, head[maxN + 1];
int f[maxN + 1][2];
inline int read()
{
int num = 0, f = 1;
char ch = getchar();
while( !isdigit( ch ) ) { if(ch == '-') f = -1; ch = getchar(); }
while( isdigit... | 1 | 84,652,186 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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; }
const ll INF = 1LL << 60;
vector<ll> cnt(10000);
int main() {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPi(i, a, b) for(int i=int(a); i<int(b); i++)
#define MEMS(a,b) memset(a,b,sizeof(a))
#define mp make_pair
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b;... | 1 | 36,066,525 |
#include <string>
#include <iostream>
using namespace std;
int compare(string s, string t){
int result = 0;
for(int i = 0; i < s.size(); i++){
if(s[i] != t[i]) result++;
}
return result;
}
int main(){
string s,t;
cin >> s >> t;
int n = s.size();
int m = t.size();
int ans = 20... | #include <bits/stdc++.h>
using namespace std;
int main() {
string T, S;
cin >> S >> T;
int ls = S.size();
int lt = T.size();
int m = INT_MAX;
for(int i = 0; i < ls - lt + 1; i++) {
int res = 0;
for(int j = 0; j < lt; j++) {
... | 1 | 12,445,134 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double PI = acos(-1);
const int inf = 2e9;
const long long INF = 2e18;
const long long MOD = 1e9+7;
#define sx(s) (s).size()
#define pb push_back
#define fi first
#define se second
#define REP(i,n) for (int i = 0; i... | #include <iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int n;
int cnt = 10000000;
while (cin >> n, n != 0) {
vector <int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
for (int j = 0; j < n-1; j++) {
cnt = min(cnt, vec.at... | 1 | 23,052,513 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
const int mod = 1e9 + 7;
bool checked[1000010];
int main(){
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
int n;
int a[1000001];
int inp[200001];
void solve(){
cin >> n;
for (int i = 0; i < 1000001; i++)
{
a[i] = 0;
}
int tmp;
for (int i = 0; i < n; i++)
{
cin >> inp[i];
}
sort(inp, inp+n)... | 1 | 93,550,959 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int a, p;
cin >> a >> p;
p += a * 3;
cout << p / 2;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
solve();
return 0;
} | #include <stdio.h>
int main(){
int A, P, S;
scanf("%d %d", &A, &P);
S = A*3;
printf("%d\n", (S + P)/2);
return 0;
} | 1 | 33,339,976 |
#include<cstdio>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<set>
#include<cstring>
#include<map>
using namespace std;
#define int long long int
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#define... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
long long a[x], b[y], c[z];
for ( int i = 0; i < x; i++ ) { cin >> a[i]; }
for ( int i = 0; i < y; i++ ) { cin >> b[i]; }
for ( int i = 0; i < z; i++ ) { cin >> c[i]; }
sort(a, a+x, greater<long long>());
... | 1 | 32,409,063 |
#include <iostream>
#include <cstdio>
using namespace std;
const int inf = 1001001001;
int n, a, dp[100000];
int main() {
scanf("%d",&n);
fill(dp, dp+n, inf);
for (int i = 0; i < n; i++) {
scanf("%d",&a);
*lower_bound(dp, dp+n, a) = a;
}
printf("%d\n", (int)(lower_bound(dp, dp+n, inf)-dp));
} | #include <vector>
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <climits>
using namespace std;
int DP[100001];
int A[100001];
#define INF (1000000001)
void LCS(int n){
for (int i = 0; i < n; i++){
*lower_bound(DP, DP + 100001, A[i]) = A[i];
}
}
int main(){
int ... | 1 | 70,353,002 |
#include<bits/stdc++.h>
#include<cmath>
#define SZ(x) ((int)x.size())
#include<vector>
#include<set>
#include<map>
#define ll long long
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define pb push_back
#include<string>
#include<cctype>
#include<queue>
#define ii pair<int,int>
#include <sstream>
#define lli long long int
#def... | #include<bits/stdc++.h>
#define ll long long int
#define vll vector<ll>
using namespace std;
int main(){
ios_base::sync_with_stdio(true);
cin.tie(NULL);
ll x;
cin >> x;
double y;
cin >> y;
ll y1 = 100*y + 0.5;
x *= y1;
x = x/100;
cout << x << endl;
} | 1 | 10,446,079 |
#include <bits/stdc++.h>
#define INF 1e7
#define dsec 86400
using namespace std;
typedef long long int ll;
typedef tuple<int,int,int> tii;
typedef tuple<long long int,long long int,long long int> tll;
typedef tuple<double,double,double> tdd;
ll gcd(ll a, ll b)
{
if(b == 0) return a;
return gcd(b,a%b);
}
ll lcm(... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include <bits/stdc++.h>
using namespace std;
long long f(long int x,long int y){
if (x<y) swap(x,y);
if (y==0) return x;
x=x%y;
return f(x,y);
}
int main(){
long int N,M;
cin>>N>>M;
long int a[N];
cin>>a[0];
i... | 1 | 84,692,822 |
#include <iostream>
#include <map>
#include <algorithm>
using namespace std;
int main(){
int n;
while(cin >> n && n){
multimap<int,bool> m;
int ret=0,hh,mm,ss,tmp;
for(int i=0;i<n;i++){
for(int j=0;j<2;j++){
cin >> hh;
cin.ignore();
... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int N;
string In[10000], Out[10000];
int main() {
while (cin >> N && N > 0) {
for (int i=0; i<N; ++i) {
cin >> Out[i] >> In[i];
}
sort(In, In+N);
sort(Out, Out+N);
int p=0, taiki=0, train=0;
for (int i=0;... | 1 | 5,150,290 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t A, B, C, D;
cin >> A >> B >> C >> D;
int64_t ans;
ans = max(A*C, max(A*D, max(B*C, B*D)));
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ff(i,s,n) for(int i=s;i<n;i++)
#define fr(i,s,n) for(int i=n-1;i>=s;i--)
#define llu long long int
const int mod=1000000007;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a,b,c,d;
cin>>a>>b>>c>>d;
llu p=max((llu)a*c,max((llu)a*d,max((llu)b*c... | 1 | 91,510,746 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int a,b;
cin >> a >> b;
if((a+b)%2==0)
cout << (a+b)/2 << endl;
else cout << (a+b)/2 + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main()
{
int a, b;
cin >> a ... | 1 | 95,313,947 |
#include <bits/stdc++.h>
#include <climits>
using namespace std;
int main(){
int A,B,M;
cin >> A >> B >> M;
int a[A];
int mina = INT_MAX;
for(int i = 0; i < A;i++){
cin >> a[i];
mina = min(a[i],mina);
}
int b[B];
int minb = INT_MAX;
for(int i = 0; i < B;i++){
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,M;
int ans;
int mf = 300000,mr = 300000;
cin >> A >> B >> M;
vector<int> fr(A);
vector<int> ra(B);
for(int i=0;i<A;++i){
cin >> fr.at(i);
if(fr.at(i) < mf) mf = fr.at(i);
}
for(int i=0;i<B;++i){
cin >> ra.at(i);
if(ra.a... | 1 | 98,880,975 |
bool DBG = false;
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i=(a);i<((a)+(b));++i)
#define IRPT(i,a,b) for(int i=((a)+(b)-1);i>=(a);--i)
#define ALL(x... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi first
#def... | 1 | 29,561,743 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char c;
cin >> c;
if(c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u'){
cout << "vowel" << endl;
} else {
cout << "consonant" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin >> c;
if (c=='a' || c=='i'){
cout << "vowel" << endl;
}
else if(c=='u' || c=='e'){
cout << "vowel" << endl;
}
else if(c=='o'){
cout << "vowel" << endl;
}
else
cout << "consonant" << endl;
} | 1 | 48,429,554 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
template<class T> using vc = vector<T>;
template<c... | #include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <list>
#include <unordered_set>
#include <tuple>
#include <cmath>
#include <limits>
#include <type_traits>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <que... | 1 | 43,888,384 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setprecision(32);
int n, k;
cin>>n>>k;
vector<int> v(n);
for(int i = 0; i < n; i++){
cin>>v[i];
}
int ans ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007
int main(){
ll N, K;
cin >> N >> K;
vector<ll> V(N);
rep(i, N) cin >> V[i];
ll ans = 0;
for(ll l = 0; l <= min(K, N); l++) {
for(ll r = 0; r <= min(K - l, N - l); r++) ... | 1 | 47,359,958 |
#include <vector>
#include <set>
#include <map>
#include <array>
#include <iostream>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <cstdio>
#include <cstdint>
#include <cmath>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
inline void yes(b... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vector<int> obs(n);
vector<int> adj[n];
vector<int> score(n, 0);
for (int i = 0; i < n; i++) {
cin >>... | 1 | 90,657,932 |
#include <bits/stdc++.h>
using namespace std;
#define iota(i,n,b,s) for(int i=int(b);i!=int((b)+(s)*(n));i+=(s))
#define range(i,n,m) iota(i,(((n)>(m))?((n)-(m)):((m)-(n))),(n),((n)>(m)?-1:1))
#define rep(i,n) iota(i,(n),0,1)
#define loop for(;;)
#define INF (1e9)
#define EPS (1e-9)
#define cons(a,b) (make_pair(a,b))
#... | #include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;
int v[5];
int main(void) {
for(int i = 0; i < 5; i++) {
cin >> v[i];
}
sort(v, v + 5);
reverse(v, v + 5);
printf("%d %d %d %d %d\n", v[0], v[1], v[2], v[3], v[4]);
return 0;
} | 1 | 948,315 |
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i,n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(obj) (obj).begin(), (obj).end()
#define bit(n) (1LL << (n))
using namespace std;
typedef long long ll;
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... | 1 | 30,330,360 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const long long INF = 1e15;
ll gcd(ll x,ll y){
if(x > y) swap(x,y);
if(x == 0) return y;
return gcd(x,y%x);
};
int main(){
int n,x;
cin >> n >> x;
vector<int> a(n);
for(int i = 0; i < n; i++){
c... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
ll n,x;cin >>n>>x;
ll ans=0;
for (int i = 0; i < n; ++i) {
ll a;cin >>... | 1 | 49,567,018 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N; cin >> N;
vector<int> A(N);
int top1 = 0;
int top2 = 0;
int top1num = -1;
rep(i, N){
cin >> A[i];
if(A[i] >= top1){
... | #include <bits/stdc++.h>
using namespace std;
using vi=vector<int>;
int main() {
int N;
cin>>N;
vi A(N);
for (int i = 0; i < N; i++)cin>>A[i];
vi B=A;
sort(B.begin(),B.end());
int first=B[N-1],second=B[N-2];
for (int i = 0; i < N; i++){
if(A[i]==first)cout<<second<<endl;
... | 1 | 52,304,501 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
const int mod=1000000007;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n;cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a.at(i);
l... | 1 | 67,236,201 |
#include <bits/stdc++.h>
using namespace std;
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 (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ... | #include <bits/stdc++.h>
using namespace std;
#define fr(i,n) _back
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define fi first
#define se second
#define endl '\n'
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<ii> vii;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
con... | 1 | 98,691,954 |
#include <iostream>
using namespace std;
int main()
{
int a,b,c;
cin >> a >> b;
c = a - b;
if(c == 0){
cout << "a == b"<< endl;
} else if(c > 0){
cout << "a > b" << endl;
} else if(c < 0){
cout << "a < b" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
int a, b;
cin >> a >> b;
if (a < b) {
cout << "a < b\n";
} else if (a > b) {
cout << "a > b\n";
} else {
cout << "a == b\n";
}
return 0;
} | 1 | 26,383,888 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0;
for (int i = 0; i < 100; i++) {
for (int j = 0; j < 100; j++) {
if (i * 4 + j * 7 == N) {
count++;
}
}
}
if (count > 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 7;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
vector<int> vec;
for (int i=0; i<=25; i++)
for (int j=0; j<=14; j++)
vec.push_back(4*i+7*j);
vector<int>::iterat... | 1 | 45,906,837 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = LONG_LONG_MAX / 2;
const ll mod = 1000000000 + 7;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int n;
cin >> n;
vector<int> vodd(100001, 0), veven(100001, 0);
for (int i = 0; i < n; i++) {
in... | #include <bits/stdc++.h>
using namespace std;
int xyecoc (int i, int j, vector < pair < int, int > > &a, vector < pair < int, int > > &b) {
if (i >= 0 && j >= 0) {
if (a[i].second != b[j].second)
return a[i].first + b[j].first;
return 0;
}
return 0;
}
signed main () {
int n;
... | 1 | 97,699,175 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, a, b; cin >> n >> a >> b;
ll l = a * (n-1) + b;
ll r = b * (n-1) + a;
ll ans = r - l + 1;
if (ans ... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | 1 | 26,134,098 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main()
{
int t,n,i,j,k,l=0,d,q,m,r,x,y,x1,y1;
cin>>n>>m>>d;
map<int,pair<int,int> > m1;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
cin>>l;
m1[l]={i,j};
}
}
int a[n*m+1];
memset(a,0,sizeof(a))... | #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <string>
#include <cmath>
#include <map>
#include <tuple>
using namespace std;
typedef long long ll;
int H, W, D, Q;
vector<tuple<int, int, int>> A;
vector<ll> cum_mp;
bool compare(tuple<int, int, int> &lhs, tuple<int, int, int> &... | 1 | 97,528,944 |
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<set>
using namespace std;
typedef pair<int, int> pii;
typedef double lf;
typedef long long ll;
const int i... | #include<bits/stdc++.h>
using namespace std;
int N,L,T;
int X[100005];
int rnk;
int main(){
scanf("%d%d%d",&N,&L,&T);
for(int i=0;i<N;i++){
int w;scanf("%d%d",&X[i],&w);
if(w==1) X[i]+=T;else X[i]-=T;
rnk+=X[i]/L;
rnk-=(X[i]%L<0);
X[i]=(X[i]%L+L)%L;
}
rnk=(rnk%N+N)%N;
sort(X,X+N);
for(int i=0;i<N;i++)
... | 1 | 59,713,483 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll X,Y,A,B,C;
void solve(){
cin>>X>>Y>>A>>B>>C;
ll a[A] , b[B] , c[C];
vector<ll> values;
ll sum = 0;
for(ll i = 0 ; i<A ; i++)
cin>>a[i];
for(ll i = 0 ; i<B ; i++)
cin>>b[i];
for(ll i = 0 ; i<C ; i++)
ci... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int x,y,a,b,c;
cin>>x>>y>>a>>b>>c;
priority_queue<int>r;
priority_queue<int>g;
priority_queue<int>C;
for(int i=0;i<a;i++)
{
int X;
cin>>X;
r.push(X);
}
for(int i=0;i<b;i++)
{
int X;
cin>>X;
g.pus... | 1 | 1,011,952 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
ll ans... | #include<iostream>
#include<vector>
#include<algorithm>
#include<iterator>
#include<cmath>
#include<functional>
using namespace std;
int main(){
long N, H;
cin >> N >> H;
vector<long> A(N);
vector<long> B(N);
for(long i=0; i<N; i++){
cin >> A.at(i) >> B.at(i);
}
auto amax = max_eleme... | 1 | 341,096 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int h, a[300];
cin >> h;
for(int i = 1;i <= h;i++) cin >> a[i];
for(int i = 1;i <= h;i++){
cout << "node " << i << ": ";
cout << "key = " << a[i] << ", ";
if(i / 2 != 0) cout << "parent key = " << a[i / 2] << ", ";
if(2 * i... | #include <iostream>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
typedef long long lli;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<vector<lli> > mat... | 1 | 71,976,112 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.