code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define eb ... | #include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
int64_t n, l;
cin >> n >> l;
vector<int64_t> a(n);
for (auto&& aa : a) {
cin >> aa;
}
for (auto i : ira... | 0 | 65,068,725 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
#include <set>
#include <map>
#include <unordered_map>
#include <cassert>
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define fast_io(); std::ios_bas... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | 0 | 5,944,298 |
#include <bits/stdc++.h>
using namespace std;
vector<int> d;
vector<int> f;
vector<bool> used;
vector< vector<int> > v;
int n;
int cnt = 0;
int main(void){
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
d = f = vector<int>(n, -1);
used = vector<bool>(n, false);
v = vector< vector<int> >(n, vector<int>(n... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int count = 0;
for(int i = 1;i <= n;i++){
count += i;
if(count >= n){
for(int j = 1;j <= i;j++){
if(count - n != j && j != i){
cout << j << " ";
}else if(j == i){
cout << j;
}
... | 0 | 25,433,872 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
string F[N];
string BK[N];
string BN[N];
string SK[N];
string SN[N];
for(int i=0;i<N;i++){
cin >> F[i];
BK[i] = F[i].at(0);
SK[i] = F[i].at(0);
BN[i] = F[i].at(1);
SN[i] = F[i].at(1);
}
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31,... | 0 | 56,586,512 |
#include <bits/stdc++.h>
#define rep2(i,m,n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i,n) rep2(i,0,n)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using ll = long long;
template <typename T>
T sq(T x){
return x * x;
}
signed main (){
ll A,B;
char op;
c... | #include<iostream>
#define M 1000003
#define f first
#define s second
using namespace std;
int n,c[256];
int f[M];
int stoi(string s){
int res=0;
for(int i=0;i<s.size();i++)res*=5,res+=c[s[i]];
return res;
}
int func1(int a){
return a%M;
}
int func2(int a){
return 1+a%(M-1);
}
int main(){
string mei,str;
... | 0 | 76,836,892 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void)
{
int n;
cin >> n;
vector <int> a;
for (int i = 1; i <= n; i++) {
int tmp;
cin >> tmp;
a.push_back(tmp);
}
std::sort(a.begin(), a.end());
int big = a.at(a.size()-1);
double half = big*0.5;
int down = a.at(0);
... | #include<bits/stdc++.h>
#include<cmath>
#define pb push_back
#define ld long double
#define mp make_pair
#define vl vector<ll>
#define vd vector<double>
#define vld vector<long double>
#define ll long long int
#define pl pair<ll, ll>
#define all(a) a.begin(), a.end()
#define forr(i, n) for(ll i=0; i<n; i++)
#define f... | 0 | 27,631,602 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
struct UnionFind {
vector<int> d;
UnionFind(int n) : d(n, -1) {}
int root(int x) {
if (d[x] < 0) return x;
return d[x] = root(d[x]);
}... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | 0 | 47,354,084 |
#include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
string s;
cin>>s;
string ans="No";
for(int i=0;i<3;i++)
{
if(s[i]!=s[0])
{
ans="Yes";
}
}
cout<<ans;
} | #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,d;cin>>n>>d;
vector<vector<int>> x(n,vector<int>(d));
rep(i,n){
rep(j,d)cin>>x[i][j];
}
int ans=0;
rep(i,n){
for(int j=i+1;j<n;j++){
i... | 0 | 89,559,213 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N[4];
for(int i=0;i<4;i++) cin>>N[i];
sort(N,N+4);
if((N[0]==1&&N[1]==4)&&(N[2]==7&&N[3]==9)) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
} | #include<bits
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int n, ans = 0; string s,t="810";
vector<char> c = { '0','1','2','3','4','5','6','7','8','9' };
void dfs(int i) {
if (i == 3) {
int id = 0;
rep(l, n) {
if (s[l] == t[id]) id++;
if (id > 2)... | 0 | 48,906,536 |
#include<iostream>
using namespace std;
struct Card{char suit,value;};
int main()
{
int n=0;cin>>n;
Card a[100]={0},b[100]={0};
for(int i=0;i<n;i++)
{
cin>>a[i].suit>>a[i].value;
b[i]=a[i];
}
int f=1;
for(int j=0;f==1;j++)
{
f=0;
for(int i=n-1;i>j;i--)
{
if(a[i].value<a[i-1].value)
{
swap(a[... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUM... | 0 | 22,326,102 |
#include <iostream>
#include <map>
using namespace std;
int main() {
int n, m; cin >>n >>m;
map<int, int> ab{};
for (int i = 0; i < n; i++) {
int k, v;
cin >>k >>v;
auto it = ab.find(k);
if (it != ab.end()) {
v += it->second;
ab.erase(k);
}
... | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> i) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPI(i, x) for (int i = 1; i <= x; i++)
#define FORI(i, m, n) for (int i = m; i <= n; i++)
#define REPR(i, n) for (int i = n; i ... | 0 | 6,603,258 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define repr(i, a, b) for (auto i = (a); i < (b); ++i)
#define itr(x) for (auto&& v : (x))
#define updatemax(t, v) ((t) = std::max((t), (v)))
#define updatemin(t, v) ((t) = std::min((t), (v)))
int m... | #include "bits/stdc++.h"
using namespace std;
char c1[] = { ' ', '.', ',', '!', '?', };
char c2[] = { 'c', 'a', 'b', };
char c3[] = { 'f', 'd', 'e', };
char c4[] = { 'i', 'g', 'h', };
char c5[] = { 'l', 'j', 'k', };
char c6[] = { 'o', 'm', 'n', };
char c7[] = { 's', 'p', 'q', 'r', };
char c8[] = { 'v', 't', 'u', };
cha... | 0 | 35,030,142 |
#include <algorithm>
#include <bits/stdc++.h>
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
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;
struct mat {
int row = -1;
... | #include <iostream>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <deque>
#include <cstring>
using namespace std;
#define X first
#define Y second
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define IOS ios::sync_with_stdio(0);cin.tie(0);
#define de(x,y) cout<<#x<<" :"<<x<<... | 0 | 72,474,278 |
#include <bits/stdc++.h>
#define REP(i, x) REPI(i, 0, x)
#define REPI(i, a, b) for (int i = int(a); i < int(b); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
string s, t;
cin >> N >> s >> t;
int ans = N;
R... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
int h,w;
cin >> h >> w;
vector<vector<char>>s(55,vector<char>(55));
for(int i=1;i<=h;i++){
for(int j=1;j<=w;j++){
cin >> s[i][j];
}
}
bool judge = true;
for(int ... | 0 | 58,625,363 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijkl... | 0 | 34,715,922 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <utility>
#include <set>
using namespace std;
typedef long long int ll;
typedef long double ld;
template<class T> inline b... | 0 | 41,674,687 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int64_t i = 0; i < n; i++)
#define REPR(i, n) for(int64_t i = n; i >= 0; i--)
#define FOR(i, m, n) for(int64_t i = m; i < n; i++)
#define FORR(i, m, n) for(int64_t i = m; i >= n; i--)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
template<typ... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <algorithm>
using namespace std;
bool check(stack<char>&st){
stack<bool> s;
int len=st.size();
if(st.empty()) return true;
for(int i=0 ; i<len;++i){
if(st.top()==')'){
s.push(true);
st.pop();
} else if(st.... | 0 | 100,013,134 |
#include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1000000000
#define LINF 1000000000000000000
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL<<(n))
using namespace std;
typedef pair<int, int> P;
typedef pair<long long, long long> LLP;
int main() {
int A, B, C, D;
cin >> A >> B >> C ... | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#inc... | 0 | 21,037,316 |
#include <bits/stdc++.h>
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define per(i, n, s) for (int i = (n-1); i >= (int)(s); i--)
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<x<<endl
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;
const ll LINF = LLONG_MAX;
const ... | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <vector>
#include <string>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#define reppl(i,n,m) for (int i = m; i < (n); ++i)
using namespace std;... | 0 | 20,359,971 |
#include <iomanip>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int64_t n, m, d;
cin >> n >> m >> d;
double answer;
if (d == 0) {
answer = (double)(m - 1) * (1.0 / (double)(double)n);
} else {
answer = (double)... | #include <iostream>
#include <string>
using namespace std;
int heap[2000000] = {0};
int size = 0;
int parent(int i) {
if(i % 2 == 1){
return (i - 1) / 2;
} else {
return (i - 2) / 2;
}
}
int left_child(int i){
return (i * 2) + 1;
}
int right_child(int i){
return (i * 2) + 2;
}
void push(int x){
int ... | 0 | 42,550,633 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
string s;
cin >> s;
if (s[0] == 'S') {
if (s[1] == 'S') {
... | 0 | 98,937,408 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
int n = s.size();
string t = "2019/04/30";
string ans = "_";
rep(i,n){
if(s[i] == t[i]) continue;
else if(s[i] > t[i]){
ans = "TBD";
... | #define _GLIBCXX_DEBUG
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
#define int long long
#define rep(i, n) for(long long i = 0; i < (n); i++)
#define sqrt(d) pow((long double) (d), 0.50)
const int INF = 2000000000;
const int large_P = 1000000007;
ll my_pow(ll N, ll a, l... | 0 | 91,343,985 |
#include <iostream>
using namespace std;
int main() {
int buf;
int counter = 1;
do {
cin >> buf;
if (!buf)break;
else {
cout << "Case " << counter << ": " << buf << endl;
counter++;
}
} while (1);
return 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> ;
const int INF = 1e9;
const int MOD = 1000000007;
int main(){
ll n,m,d;
cin >> n >> m >> d;
if(d >= n){
printf("%.10f",0.0);
return 0;
}if(d==0){
p... | 0 | 21,923,034 |
#include <stdio.h>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <tuple>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
using namespace std;
usi... | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=1e18;
int main(){
ll n,m;
cin >> n>> m;
ll s[n],t[m];
for(int i=0;i<n;i++)cin >> s[i] ;
for(int i=0;i<m;i++)cin >> t[i];
ll dp[n+1][m+1];
memset(dp,0,sizeof(dp));
ll l[n+1][m+1];
memset(l,0,size... | 0 | 9,442,672 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
#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 INF 1000000000000
#define ... | #include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do { cout << "\033[32;1m " << #x << " -> "; err(x); } while (0)
void err() { cout << "\033[39;0m" << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cout << v << ' ';... | 0 | 33,133,137 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator>>(istream &is, vecto... | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int maxn = 1e5 + 5;
int par[maxn], N, sub[maxn];
pair<ll, int> d[maxn];
ll f[maxn];
vector<int> adj[maxn];
int depth[m... | 0 | 46,490,230 |
#include <iostream>
#include <string>
#include <cctype>
#include <vector>
using namespace std;
int main() {
string temp;
int n[26] = {0};
char a[26] = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
vector<string> vStr;
while (getline(cin, temp) && !temp.e... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#define pp push
#define pb push_back
#define mp make_pair
#define xx first
#define yy second
using namespace std;
int cur[1005][12][22];
main()... | 0 | 96,022,835 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int main()
{
int n, k;
cin >> n >> k;
if(k == 1) cout << 0 << endl;
else cout << n - k << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 0 | 38,326,706 |
#include <bits/stdc++.h>
using namespace std;
typedef std::pair<int, int> ipair;
#define int long long
#define pb push_back
#define ff first
#define INF INT_MAX
#define ss second
#define fr(i, j, a) for (int i = j; i < a; i++)
#define cnt_ones(x) __builtin_popcount(x)
#define all(x) x.begin(), x.end()
#define sz size()... | #include<bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
#pragma GCC target("avx2")
#p... | 0 | 45,913,568 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,k; cin>>a>>b>>k;
vector<int> v;
for(int i=min(a,b); i>0; i--) if(!(a%i||b%i)) v.push_back(i);
cout<<v[k-1];
} | #include <bits/stdc++.h>
using namespace std;
#define loop(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define dump(a) cerr << #a << " = " << (a) << "(L:" << __LINE__ << ")" << endl
void solve(long long A, long long B, long long C, long long K) {
if (K <= A + B) {
... | 0 | 47,982,208 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define N 100010
#define INF 10000000000
typedef long long ll;
#define ALL(v) (v).begin(),(v).end()
#define SZ(x) int(x.size())
#define IN(a) cin>>(a)
#define OUT(a) cout<<(a)<<endl
typedef pair<int,int> P;
const int MAX = 1000000;
co... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define fin(ans) cout << (ans) << endl;
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long... | 0 | 98,343,849 |
#include<iostream>
using namespace std;
int main() {
int m, f, r;
while (1) {
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1)break;
int total = m + f;
if (m == -1 || f == -1) cout << 'F' << endl;
else {
if (total >= 80) cout << 'A' << endl;
else if (total < 80 && total >= 65) cout << 'B' << end... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int set=0;
int max=10;
vector<int> a(5);
for(int i=0;i<5;i++){
cin >> a[i];
if(max>a[i]%10 && a[i]%10!=0){
max=a[i]%10;
set=i;
}
}
int ans=0;
for(int i=0;i<5;i++){
if(i!=set && ... | 0 | 230,941 |
#include <iostream>
using namespace std;
const int MAX = 2000000;
int H = 0;
int A[MAX + 1];
int parent(int i) {return i/2;}
int left(int i) {return 2*i;}
int right(int i) {return 2*i+1;}
void maxHeapify(int i) {
int l = left(i), r = right(i);
int largest = i;
if(l <= H && A[largest] < A[l]) largest = l;
... | #include<stdio.h>
int main()
{
int x,y;
while(scanf("%d%d",&x,&y)!=EOF)
{
if(x==0 && y==0)
return 0;
else
{
if(x>y)
printf("%d %d\n",y,x);
else
printf("%d %d\n",x,y);
}
}
} | 0 | 36,234,442 |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
#define sp " "
#define endl "\n"
#define MAX 10e9
#define MAXN 100001
#define mod 1000000007
#define inf_int 2e9
#define inf_ll 2e18
#define e 1e-9
#define vi vector<int>
#define vl vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpl vector<pair<ll... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(a); i++)
typedef long long ll;
template<typename T>
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int... | 0 | 17,737,894 |
#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ll long long
static const int MAX = 10000;
static const ll INFTY = 1e12;
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,... | 0 | 59,971,967 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int>v[n+1], dp[n+1];
for(int i = 0; i < n; i++){
int a, b, c;
cin >> a >> b >> c;
v[i].push_back(a);
v[i].push_back(b);
v[i].push_back(c);
dp[i].push_back(0);
dp[i].push_back(0);
dp[i].push_back(0);
}
dp[0][0] = v[0... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define rep(i, f, n) for (int i = (f); i < (int)(n); i++)
#define repe(i, f, n) for (int i = (f); i <= (int)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int, int>;
const i... | 0 | 58,741,095 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int K,N;
cin>>K>>N;
vector<int> Ai(N);
for(int i=0;i<N;i++){
cin>>Ai[i];
}
int Asa;
int ma=K-Ai[N-1]+Ai[0];
for(int i=0;i<N-1;i++){
Asa=Ai[i+1]-Ai[i];
ma=max(ma,Asa);
}
cout<<K-ma;
} | #include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i = 0 ; i < n ;i++)
#define ll long long int
#define ld long double
int main()
{
ll mod = 998244353;
int n;
cin >> n;
int d[n];
forn(i,n)cin >> d[i];
if(d[0] != 0){cout<<0<<"\n";return 0;}
... | 0 | 40,709,258 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define cyes cout<<"YES"<<endl
#define cno cout<<"NO"<<endl
#define sp <<" "<<
#define cst(x) cout<<fixed<<setprecision(x)
#define pi 3.14159265359
#define mod 1000000007
using namespace std;
using ll = long long;
using ... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.begin(), t.end());
bool same = true;
if (s.size() < t.size()) {
for (size_t i=0; i<s.size(); ++i) {
if (s[i] != t[i]) {
... | 0 | 82,259,119 |
#include <iostream>
#include <ctime>
#include <cstdlib>
#include <sstream>
#include <string>
#include <queue>
using namespace std;
int parent(int i){
return i/2;
}
int left(int i){
return 2*i;
}
int right(int i){
return 2*i +1;
}
int maxheapify(vector <int> &X, int i){
int l, r;
l = left(i);
r = right(i);
if (r ... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define INF 1e16
typedef long long ll;
typedef pair<ll,ll> P;
int main(void){
ll ... | 0 | 35,122,513 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int a, b;
cin >> a >> b;
if (a == 1) {
a = 14;
}
if (b == 1) {
b = 14;
}
if (a == b) {
cout << "Draw" << '\n';
} else if (a > b) {
cout << "Alice" << '\n';
} else {
cout << "Bob" << '\n';
}
r... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define FALSE... | 0 | 38,009,310 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,a,b;
cin >> n >> a >> b;
if(n==1&&a<b)cout << 0;
else if(a>b)cout << 0;
else cout << (a+b*(n-1))+1-(b+a*(n-1));
} | #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 | 90,890,181 |
#include <iostream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <bitset>
#include <string>
#include <numeric>
#include <algorithm>
#include <functional>
#include <iterator>
#include <cstdio>
#include <c... | #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... | 0 | 82,672,657 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define pb push_back
const long double PI = acos(-1);
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm(ll a,ll b){return a / gcd(a,b) * b;}
ll GetDigit(ll num) {return log10(num)+1;}
int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, start, n) for (int i = (int)(start); i < (int)(n); ++i)
static const int INFTY = (1 << 30);
int H, W;
int func2(vector<vector<bool>> &a, vector<vector<bool>> &v)
{
int r[H][W] = {};
int ans;
queue<pair<int, int>> q;
rep(i... | 0 | 34,488,006 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <stack>
using namespace std;
int main()
{
while(true){
char line[105];
cin.getline(line, sizeof(line));
if(line[0] == '.'){break;}
else{
stack<char> s;
if( ( line[0] == '(' ) || ( line[0] == '[' )||( line[0] == ')' ) || ( line[0] == ']' ) ... | #include <bits/stdc++.h>
#define mn(a, b) (a < b ? a : b)
#define mx(a, b) (a > b ? a : b)
#define f first
#define s second
#define all(v) (v).begin(), (v).end()
#define base 331
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int const MAXn = (1 << 18) + 2;
int arr[MAXn];
struct par{
int... | 0 | 10,172,749 |
#include<bits/stdc++.h>
#include<string>
#include<vector>
using namespace std;
typedef pair<int, int>P;
typedef long long ll;
#define rep(i,n)for(ll i=0;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#de... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
int m... | 0 | 33,386,747 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
i... | #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=0;i<n;i++)
#define INF 1<<29
#define LINF LLONG_MAX/3
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(v) (v).begin(),(v).end()
#define all(v) ALL(v)
#define debug(x) cerr<<#x<<":"... | 0 | 81,834,153 |
#include <bits/stdc++.h>
using Int = long long;
using namespace std;
int main() {
Int n;
cin >> n;
Int ans = 0LL;
for (Int i = 1; i * i < n; i++) {
if (n % i == 0) {
auto j = n / i;
if (j - i >= 2) {
ans += j - 1;
}
}
}
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
int mn = b * 10;
while (true){
int c = mn * 0.08;
int d = mn * 0.1;
if((c == a) && (b == d)){
cout << mn << endl;
return 0;
}
mn++;
if(mn > 11000){
... | 0 | 52,572,422 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, d; cin >> n >> d;
vector<vector<int>> x(n,vector<int>(d));
for(int i = 0; i < n; i++) {
for(int j = 0; j < d; j++) {
cin >> x[i][j];
}
}
int count = 0;
for(int i = 0; i < n; i++) {
for(int j = i ... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <climits>
using namespace std;
const int MAX_V = 100;
const int INF = INT_MAX;
int v;
int g[MAX_V][MAX_V];
int d[MAX_V][MAX_V];
bool warshallfloyd()
{
copy(&g[0][0], &g[MAX_V][0], &d[0][0]);
for(int i = 0; i < v; i++)
d[i][i] = 0;
for(int k =... | 0 | 60,637,087 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int X,Y,Z,K;cin >> X >> Y >> Z >> K;
vector<ll> A(X);
vector<ll> B(Y);
vector<ll> 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.... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod=1e9+7;
int main(){
int A, B, K;
cin >> A >> B >> K;
for(int i=0; i<K; i++){
if(i%2==0){
if(A%2!=0){
A--;
A/=2;
B+=A;
}else{
A/=2;
... | 0 | 86,229,255 |
#include <bits/stdc++.h>
#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(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
string s;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD=1000000007;
int main() {
int R,G,B,N; cin>>R>>G>>B>>N;
int count=0;
for(int i=0;i<=N/R;i++){
for(int j=0;j<=(N-R*i)/G;j++){
int k=(N-(R*i+G*j))/B;
if(N==R*i+G*j+B*k)count++;
}
}
... | 0 | 44,325,154 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#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; cin >> n;
rep(i,25){
rep(y,14){
if(4*i+7*y==n){
cout << "Yes" << endl;
return 0;
}
}
}
cout << "N... | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define N 100005
#define ll long long
#define ull unsigned long long
#define loop1(i, j, k, step) for (int i=j; i<k; i+=step)
#define loop(i, j, k) for (int i=j; i<k; i++)
#define rloop1(i, j, k, step) for (int i=j; i>=k; i-=step)
#define rloop(i, j,... | 0 | 79,288,384 |
#include <bits/stdc++.h>
#define REP(i, x) REPI(i, 0, x)
#define REPI(i, a, b) for (int i = int(a); i < int(b); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, C;
cin >> A >> B >> C;
if (A <= C && C <= B) {
... | #include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#d... | 0 | 24,466,638 |
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
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) { a = b; return true; } ret... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll,ll> P;
#define pb push_back
#define ft first
#define sd second
#define mp make_pair
#define fr(i,n) for(int i=0;i<n;i++)
#define Fr(i,n) for(int i=0;i++<n;)
#define ifr(i,n) for(int i=n-1;i>=0;i--)
#define iFr(i,n) for... | 0 | 62,547,704 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a;
cin >> a;
vector<int> v(a);
for(int i=0;i<a;i++)cin >> v[i];
sort(v.begin(),v.end());
int x = v[a/2-1],y = v[a/2];
cout << y-x << endl;
} | #line 1 "/mnt/c/Users/leafc/dev/compro/lib/template.hpp"
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define ... | 0 | 84,514,216 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int ans = n * (n - 1) / 2 + m * (m - 1) / 2;
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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())
#de... | 0 | 99,513,335 |
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
#define ll long long
#define ld long double
#define ull unsigned long long
#define endl "\n"
ll google_itr = 1;
#define google(x) cout<<"Case #"<<x<<":"
#define pi 3.14159265358979323846264338327950L
const ll mod = 1e9+... | #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++)
typedef long long ll;
#define MAX 99999999999999
int main() {
int N, K; cin >> N >> K;
vector<int> a(N);
rep(i, N) cin >> a[i];
ll mx, cnt, cost, ... | 0 | 38,241,920 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = (int)(n)-1; 0 <= i; i--)
#define rrep1(i, n) for (int i = (int)(n); 1 <= i; i--)
#define each(it, c) \
for (__typ... | #include<iostream>
using namespace std;
int main(){
int index,jndex;
for(index = 1; index <= 9 ; index++){
for(jndex = 1 ; jndex <= 9 ; jndex++){
cout<<index<<"x"<<jndex<<"="<<index*jndex<<endl;
}
}
} | 0 | 100,735,577 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int k = s.size();
int win = 0;
for (char c: s) {
if (c == 'o') {
win++;
}
}
win += 15 - k;
if (win >= 8) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <algorithm>
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
pair<int, int> pd[10000];
void solve(int n, ll m) {
ll ans = 0;
for(int i = 0; i < n; i++) {
cin >> pd[i].second >> pd[i].first;
ans += pd[i].first * pd[i].second;
}
sort(pd, pd + n,
[](auto... | 0 | 71,143,819 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #include <iostream>
using namespace std;
int main(){
int a[6]={500,100,50,10,5,1},input,count,i;
while(1){
cin>>input;
if(input==0){
break;
}
input=1000-input;
for(i=0,count=0;i<6;i++){
if(input/a[i]>0){
count+=input/a[i];
}
input=input-(input/a[i])*a[i];
}
... | 0 | 59,294,060 |
#include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#de... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
ll mod=1e9+7;
using P=pair<int,int>;
struct op{int a,b,c,d;};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,h;cin>>n>>h;
vector<int> a(n),b(n);
rep(i,n)cin>>a[i]>>b[i];
in... | 0 | 53,196,031 |
#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
int gcd(int x,int y)
{ return x ? gcd(y%x,x) : y; }
int main()
{ int n,a,Max,k;
int i;
cin>>n>>a>>k;
int tmp=k;
Max=k;
... | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for(int i=0;i<(n);++i)
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RREP(i, n) for(int i=(int)(n);i>=0;--i)
#define RFOR(i, a, b) for(int i=(int)(a);i>=(int)(b);--i)
#define ALL(a) (a).begin(),(a).end()
#define DUMP(x... | 0 | 61,906,652 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N;
cin>>N;
vector<double> vec(N);
for(ll i=0;i<N;i++) {
cin>>vec[i];
}
sort(all(vec));
double ans=(vec[0]+vec[1])/2;
for(ll i=2;i<N;i++) {
ans=(ans+vec[i])/2;
}
cout<<fixed<<setprecisi... | #include<bits/stdc++.h>
#define INFTY 10000000000
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const int MOD=1000000007;
const int di[4] = {-1,0,1,0};
const int dj[4] = {0,-1,0,1};
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
void cnt(ll x,int n,ll pt){
ll a = pow(2,... | 0 | 52,435,455 |
#include <iostream>
int main(void)
{
char c;
std::cin >>c;
printf("%c",c+1);
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define rep2(i, s, n) for (int i = (s); i <... | 0 | 2,987,987 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int n, i, a[210];
cin >> n;
n *= 2;
for (i = 0; i < n; ++i) {
cin >> a[i];
}
sort(a, a + n);
int b = 0, c = 0;
for (i = 0; i < n; i += 2) {
b += a[i];
}
cout << b << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector< int >v(n);
vector< int >w(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
w[i] = i;
}
sort(w.begin(), w.end(), [&](int i, int j) {
return v[i] < v[j];
});
int ans = 0;
for (i... | 0 | 59,445,551 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int dx[] = { +1, -1, 0, 0 };
int dy[] = { 0, 0, +1, -1 };
const int N = 1e9 + 9;
ll h, w;
set< pair<int, int> > st, bl;
int n;
vector< pair<int, int> > v;
ll ans[11];
ll total = 0;
int isvalid(int x, int y)
{
if (x >= 1 && y >= 1 && x + ... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
string s;
cin >> s;
if (s[0] == 'S') {
if (s[1] == 'S') {
... | 0 | 12,141,905 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#include <numeric>
using namespace std;
int main()
{
long long a,b;
cin >> a >> b;
long long c = gcd(a,b);
cout << a * b / c;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n,m;
cin >> n >> m;
vector<int> a(m+2);
a[0]=0;
for(int i = 0; i < m; i++) {
cin >> a[i+1];
}
a[m+1]=n;
vector<ll> p(n+1);
p[0]=1;
p[1]=1;
for(int i = 2; i <= n; i++) {
p[i]=(... | 0 | 53,087,179 |
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | #include <iostream>
#include <cmath>
#include <queue>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define INF 0x7f7f7f7f
#define PI acos(-1.0)
#define L(x) (x) << 1
#define R(x) (x) << 1 | 1
#define lowbit(x) (x)&(-x)
#define Mid(l, r) (l + r) >> 1
#define Min(x, y) (x) < (y) ? (x) : (y)
#defi... | 0 | 78,606,473 |
#include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) fo... | #include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,s,e) for (int i=s;i<(e);i++)
#define ALL(v) (v).begin(),(v).end()
#define MP(a,b) make_pair(a,b)
using namespace std;
typedef long long llint;
typedef pair<int, int> P;
const int MOD = (int)1e9 + 7;
const int INF = 999999999;
int main(){
... | 0 | 4,901,094 |
#include <vector>
#include <stdio.h>
#include <iostream>
#include <unordered_map>
#include <algorithm>
#include <bitset>
#include <set>
#include <map>
#include <random>
#include <time.h>
#include <cassert>
#define prev askdnsajd
#define rank asasdmdnasd
#define next lsjndajbs
#define hash asmdklansd
using namespace std... | #include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
using namespace std;
#de... | 0 | 95,552,848 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int main()
{
int N;
cin>>N;
vector<int> A(N);
vector<int> B(N);
rep(i,N) cin>>A[i];
rep(i,N) cin>>B[i];
ll r=0;
rep(i,N)
{
if(A[i]<=B[i])
{
r+=(B[... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> divisor(ll n){
vector<ll> vec;
for(ll i=1;i*i<= n;i++){
if(n%i==0){
vec.push_back(i);
if(i*i!=n) vec.push_back(n/i);
}
}
return vec;
}
int main(void){
int n;
cin >> n;
ll ans... | 0 | 39,101,229 |
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
char tbl[100][100];
int main(){
long a,b;
cin >> a >> b;
for(int i=0; i<50; i++){
for(int j=0; j<100; j++){
tbl[i][j] = '.';
tbl[50+i][j] = '#';
}
}
int count=1;
for(int i=0; i<50... | #include<bits/stdc++.h>
#define ll long long
#define mp make_pair
#define F first
#define S second
#define db double
#define pb push_back
#define rep(i,a,b) for(ll i=a;i<=b;i++)
using namespace std;
ll mod=1e9 +7;
ll expo(ll base,ll exponent,ll mod){
ll ans=1;
while(exponent!=0){
if(exponent&1) ans=(1... | 0 | 69,898,607 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D, L, R;
cin >> A >> B >> C >> D;
L = A+B;
R = C+D;
if(L == R){
cout << "Balanced" << endl;
}
else if(L >= R){
cout << "Left" << endl;
}
else{
cout << "Right" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,counter,subcounter;
string strn,strm;
cin >> n;
subcounter = 0;
vector<string> vecn(0);
vector<string> vecm(0);
for (int i = 0; i < n; i++) {
cin >> strn;
vecn.push_back(strn);
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> strm;
... | 0 | 56,714,001 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define PI 3.141592653589793
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
template<class T> void chmax(T &a,T b) { if (a<b) a=b;}
template<class T> void chmin(T &a,T b) { if (a>b) a=b;}
int gcd(int a, int ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n,p;
string s;
cin>>n>>p>>s;
ll ans=0;
if(p==2){
for(int i=0;i<n;++i){
if((s[i]-'0')%2==0)ans+=i+1;
}
}
else if(p==5){
for(int i=0;i<n;++i){
if((s[i]-'0')%5==0)ans+=i+1;
}
}
else{
map<... | 0 | 67,878,823 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n,l,r,hantei,count;
string s;
while(1){
l = r = hantei = count = 0;
cin >> n;
if(n == 0)break;
for(int i = 0;i < n;i++){
cin >> s;
if(s == "lu"){
l = 1;
}
else if(s == "ru"){
r = 1;
}
else if(s == "ld"){
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(ll)n;++i)
using P = pair<ll,ll>;
const ll A = 1000005;
int main(){
ll n;cin >> n;
vector<ll> a(n);
vector<ll> c(A);
rep(i,n){
cin >> a.at(i);
c.at(a.at(i))++;
}
bool pairwise = true;
for(ll i=2;i<A;++... | 0 | 49,208,508 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include <stack>
#include<iomanip>
using namespace std;
#define rep(i,a,n) for(int i=(a);i<(... | #include<bits/stdc++.h>
using namespace std;
#define SCD(t) scanf("%d",&t)
#define SCLD(t) scanf("%ld",&t)
#define SCLLD(t) scanf("%lld",&t)
#define SCC(t) scanf("%c",&t)
#define SCS(t) scanf("%s",t)
#define SCF(t) scanf("%f",&t)
#define SCLF(t) scanf("%lf",&t)
#define MEM(a, b) memset(a, (b), sizeof(a))
#define FOR(i,... | 0 | 65,772,653 |
#include <iostream>
#include <limits>
using namespace std;
int main() {
int h, w;
while (cin >> h >> w)
{
if (h == 0 && w == 0)
break;
for (int y = 0; y < h; ++y)
{
for (int x = 0; x < w; ++x)
{
cout << '#';
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
const int lim = 1000000007;
int main(){
int N, H;
cin >> N >> H;
vector<int> a(N), b(N);
rep(i, N) cin >> a[i] >> b[i];
int mx_a = 0;
rep(i, N) mx_a = max(mx_a, a[i]);
int cnt = 0... | 0 | 46,660,364 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int i,n,mn,c=0;
cin >> n;
int a[n];
for(i=0; i<n; i++)
{
cin >> a[i];
}
mn=a[0];
for(i=0; i<n; i++)
{
if(mn>=a[i])
{
c++;
mn=a[i];
}
}
cout ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | 0 | 76,949,370 |
#include<bits/stdc++.h>
#include <stdlib.h>
#include <stdio.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define int long long
#define vec(a,n) vector<int> (a)((n));
#define Vec(a,n) vector<string> (a)((n));
#define twovec(a,n,m) vector<vector<int>> a(n,vector<... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | 0 | 83,511,282 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string a;
cin>>a;
int cnt=0,mxcnt=0;
for(unsigned int i=0;i<a.size();i++)
{
if(a[i]=='R')
cnt++;
else
{
mxcnt=max(mxcnt,cnt);
cnt=0;
}
}
mxcnt=max(mxcnt,cnt);
cout<<mxcnt;
return 0;
} | #include<iostream>
#include<bits/stdc++.h>
#define fl(k, n) for(int i = k; i < n; i++)
#define flr(k, n) for(int i = n - 1; i >= k; i--)
#define vi vector<int>
#define vp vector<pair<int, int>>
#define mp make_pair
#define ll long long
using namespace std;
int binary_search(vector<int> nums, int target_val){
int begi... | 0 | 52,195,465 |
#include <utility>
#include <iostream>
#include <algorithm>
using namespace std;
int v,A[100][100],u,k,w;
int main(){
cin >> v ;
for (int i=0; i<v; ++i){
cin >> u >> k;
for(int j=0; j<k; ++j){
cin >> w;
A[u-1][w-1] = 1;
}
}
for (int i=0; i<v; ++i){
... | #include<bits/stdc++.h>
using namespace std;
int main(void){
int h,n;
cin >> h >> n;
vector<int> dp(h+1,1e8);
dp[0]=0;
for (int i=0; i<n;++i) {
int a,b;
cin >> a >> b;
for (int idx=0; idx<h+1; idx++) {
if (dp[idx]!=1e8) {
dp[min(idx+a,h)]=min(dp[id... | 0 | 468,322 |
#include <stdio.h>
#include <iostream>
using namespace std;
int main()
{
int a = 0, b = 0, c = 0;
cin >> a >> b >> c;
if (a < b && b < c)
{
printf("Yes\n");
}
else
{
printf("No\n");
}
return 0;
} | #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... | 0 | 43,923,678 |
#include<bits/stdc++.h>
#define f(i,a,b) for(register int i=a;i<=b;++i)
#define ff(i,a,b) for(register int i=a;i>=b;--i)
#define debug(x) cerr << #x << " : " << x << " " << endl
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<st... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair< int, int > ii;
typedef vector< ii > vii;
void solve(){
int n; cin>>n;
vector< int > v(n);
for(int &i : v) cin >> i;
if(n&1){
cout<<1<<endl;
}else{
sort(v.begin(), v.end());
int mid = n >> 1;
cout<<v[mid] - v[mid - 1]<<endl;
}
... | 0 | 73,597,806 |
#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 n;
cin >> n;
vector<int> p(n);
vector<int> q(n);
rep(i,n) cin >> p[i];
rep(i,n) cin >> q[i];
vector<int> a(n);
rep(i,n){
a[i] = i+1;
}
int counts = 1;
... | #include <bits/stdc++.h>
using namespace std;
# define C continue;
# define R return
# define D double
# define I insert
# define ll long long
# define ld long double
# define ull unsigned long long
# define ui unsigned int
# define pb push_back
# define pf push_front
# define vi vector < int >
# define vc vector < cha... | 0 | 24,270,531 |
#include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | #include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
using namespace std;
#define fori(x) for (int i = 0; i < x; ++i)
#define forj(x) for (int j = 0; j < x; ++j)
typedef long long ll;
const int INF = 2e9 + 5;
const int alength=... | 0 | 52,793,390 |
#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
using namespace std;
int main()
{
int n,a;
int i,j;
int b[5005]={};
while(1){
priority_queue<int> pq;
cin>>n;
if(n==0)break;
for(i=1;i<=n;i++){
cin>>a;
... | #include<algorithm>
#include<iostream>
#include<stdio.h>
#include<utility>
using namespace std;
int main(){
pair<int,int> a[110];
pair<int,int> b[110];
int n,ans=0,i,j,min=(1<<29),k=-1;
scanf("%d\n",&n);
for(i=0;i<n;i++){
scanf("%d %d\n",&a[i].first,&a[i].second);
}
for(i=0;i<n;i++){
scanf("%d %d\... | 0 | 95,110,118 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N*2);
for (int i = 0; i < N*2; i++) cin >> L.at(i);
sort(L.begin(), L.end());
int ans = 0;
for (int i = 0; i < 2 * N - 1; i += 2) {
ans += min(L.at(i), L.at(i + 1));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fill fill_n
#define pf push_front
#define pb push_back
#define FOR(i,l,r) for(int i=l;i<r;i++)
#define ROF(i,r,l) for(int i=r;i>=l;i--)
#define comp(v) (v).begin(),(v).end()
#define ff first
#define ss second
#define infile freopen("input.txt", ... | 0 | 2,696,553 |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, n1; cin >> n >> n1;
bool arr[n];
memset(arr, false, sizeof(arr));
bool res = false;
for(int i=0;i<n1; i++){
int x, y; cin >> x >> y;
if(x == 1){
if(arr[y... | 0 | 69,763,594 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<queue>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
typedef pair<int, int> P;
int N;
string S;
string ans;
bool check() {
for (int i = 0; i... | #include <iostream>
#include <algorithm>
using namespace std;
void SelectionSort()
{
int N;
int a[100] = {0};
int count = 0;
int min;
int minIndex;
cin>>N;
for (int i = 0; i < N; i++)
{
cin>>a[i];
}
for (int i = 0; i < N - 1; i++)
{
min = a[i];
minIndex = i;
for (int j = i + 1; j < N; j++)
{
if... | 0 | 28,261,766 |
#include<bits/stdc++.h>
#define pi acos(-1)
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned un;
#define vi vector<int>
#define vl vector<ll>
#define sf scanf
#define si(a) sf("%d",&a)
#define sc(a) sf("%c",&a)
#define sii(a,b) sf("%d %d",&a,&b)
#define siii(a,b,... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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 / gcd(a, b)* b;
}
int kan_hyaku(int n){
... | 0 | 85,962,022 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b;
cin >> a >> b;
if (a == 1) a = 14;
if (b == 1) b = 14;
if (a > b) cout << "Alice" << "\n";
else if (a < b) cout << "Bob" << "\n";
else cout << "Draw" << "\n";
} | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 | 100,600,145 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define exf(x) for(auto&& tmp : x) { cout << tmp << endl; }
#define PI 3.14159265358979323846264338327950288
const int MOD{ int(1... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
const int INF = 1e9;
const int cost[] = {0,2,5,5,4,5,6,3,7,6};
bool comp(pair<int,string> a, pair<int,string> b){
return a.second > b.second;
}
int ma... | 0 | 79,651,406 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a... | 0 | 11,404,977 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
int main() {
int N;
cin >> N;
vector<int> h(N);
rep(i, N) cin >> h[i];
int res = 0;
int bar = 0;
rep(i, N) {
if (bar < h[i]) {
res... | #include <iostream>
using namespace std;
int func(int d){
int rectangle;
int n = d;
int total = 0;
while(n < 600){
rectangle = n*n*d;
total += rectangle;
n += d;
}
return total;
}
int main (int argc, char const* argv[]){
int n;
while((cin >> n)){
cout << ... | 0 | 65,387,517 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | #include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i... | 0 | 26,977,787 |
#include<stdio.h>
#include<string.h>
int main(){
char key[15];
scanf("%s", key);
char temp[15];
int len=strlen(key);
int newindex=0, index=0;
while(len--){
if(key[index]=='B'){
if(newindex>0){
newindex--;
}
temp[newindex]=' ';
index++;
}
else{
temp[newindex]=key[index];
index++;
new... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef vector<double> Vec;
typedef vector<Vec> Mat;
typedef pair<ll,ll> P;
typedef pair<double,ll> Pd;
typedef pair<double,double> PD;
typedef priority_queue<P,vector<P>,greater<P> >... | 0 | 87,390,572 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int INF = 1001001001;
int main(){
int n,k,r,s,p;
cin >> n >> k >> r >> s >> p;
string t;
cin >> t;
vector<char> d(n);
rep(i,n){
if(t.at(i) == 'r') d.at(i) = 'p';
... | #include <cctype>
#include <stdio.h>
using namespace std;
int main(){
char word;
while(true){
scanf("%c",&word);
if(islower(word)) printf("%c",toupper(word));
else printf("%c",tolower(word));
if(word == '\n') break;
}
... | 0 | 15,002,227 |
#include<iostream>
using namespace std;
int main()
{
int a[4]={-1000000000,0,0,0},b[4],c;
cin>>a[1]>>a[2]>>a[3];
for(int i=1;i<4;i++){
b[i]=a[i];
for(int j=i;j>0;j--){
if(b[j]<b[j-1]){
c=b[j-1];
b[j-1]=b[j];
b[j]=c;
}
}
}
cout<<b[1]<<' '<<b[2]<<' '<<b[3]<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,M; cin >> N >> M;
vector<int> H(N);
for(int i=0; i<N; i++){
cin >> H.at(i);
}
vector<int> maxh(N);
for(int i=0; i<M; i++){
int a,b;
cin >> a >> b;
maxh.at(a-1)=max(maxh.at(a-1),H.at(b-1));
ma... | 0 | 82,016,574 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
int main() {
int N;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; i++) cin >> v[i];
sort(v.begin(), v.end());
int R = N / 2, L = R - 1;
int ret =... | #include "bits/stdc++.h"
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(ll i=0;i<n;++i)
#define END(x) (*(x.end()-1))
#define INF (INT_MAX / 2)
using namespace std;
typedef long long ll;
template<typename T>
T gcd(T a, T b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
tem... | 0 | 18,203,409 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
typedef std::string str;
#define sei set<int>
#define sell set<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#de... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
int max_a = 0, next_max_a = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
a.at(i) = x;
if (x > max_a)
max_a = x;
else if (x <= max_a)
next... | 0 | 41,595,086 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a,b); }
using P = pair <int, int>;
template<class T>bool chmax(T &... | #include <iostream>
using namespace std;
int main(){
int n, m;
char c[256];
char a,b;
while( cin >> n && n ){
for( int i=0;i<256;i++ )
c[i] = '.';
while( n-- ){
cin >> a >> b;
c[(int)a] = b;
}
cin >> m;
while( m-- ){
cin >> a;
if( c[(int)a]!='.' ){
cout << c[(i... | 0 | 6,633,608 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.