code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<bits/stdc++.h>
#define lln long long int
#define llu unsigned lln
#define sc(n) scanf("%d",&n);
#define scl(n) scanf("%lld",&n);
#define scd(n) scanf("%lf",&n);
#define pf(res) printf("%d\n",res);
#define pfl(res) printf("%lld\n",res);
#define pfd(res) printf("%lf\n",res);
#define pb(n) push_back(n);
#define m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
template <typename T,typename U>
std::pair<T,U> operator+(const std::pai... | 0 | 68,584,642 |
#include <bits/stdc++.h>
#include <math.h>
#define ALL(a) a.begin(), a.end()
#define rep(i, K, N) for(long long int i = K; i < N; i++)
#define ll long long int
using namespace std;
int main() {
ll N, M;cin >> N >> M;
vector<ll> A(M);
vector<ll> B(N + 1);
rep(i, 0, M)cin >> A[i];
B[0] = 1;ll a = 0;
if(M == 0)A.push... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple> ... | 0 | 51,293,790 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> G(N);
for (int i = 0, a, b; cin >> a >> b; i++) {
G.at(--a).push_back(--b);
G.at(b).push_back(a);
}
for (int i = 1; i < N - 1; i++) {
int a = 0, b = 0;
for (auto g : G.at(i)) {
if (g... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,a,b) for(ll i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
int main(void){
ll n;
cin >> n;
ll p[n];
ll c[n];
rep(i, 0,... | 0 | 1,556,554 |
#include <iostream>
#include <cmath>
#include <cstdlib>
#include <cstdio>
#include <cstring>
using namespace std;
int main(int argc, char* argv[])
{
int W, H, x, y, r;
cin >> W >> H >> x >> y >> r;
if ((x - r) < 0 || (y - r) < 0 || (x + r) > W || (y + r) > H) {
cout << "No" << endl;
} else {
... | #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... | 0 | 82,174,652 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); ++i)
using ll = long long;
int main(){
int d; cin >> d;
if(d==25) cout << "Christmas" << endl;
else if(d==24) cout << "Christmas Eve" << endl;
else if(d==23) cout << "Christmas Eve Eve" << endl;
else cout << "Christmas... | #include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxm=3e5+5;
pair<int,int>p[maxm];
int r[maxm],c[maxm];
int n,m,k;
signed main(){
cin>>n>>m>>k;
for(int i=1;i<=k;i++){
int x,y;cin>>x>>y;
p[i]={x,y};
r[x]++,c[y]++;
}
int ma1=-1,num1=0;
for(int i=1;i<... | 0 | 54,738,486 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <istream>
#include <sstream>
#include <iomanip>
using namespace std;
typedef ostringstream oss;
typedef istringstrea... | #include <cstdio>
#include <cstdint>
#include <vector>
#include <algorithm>
#include <string>
int main() {
size_t N;
scanf("%zu", &N);
if (N == 1) return puts("Yes\n2\n1 1\n1 1"), 0;
if (N == 2) return puts("No"), 0;
if (N == 3) return puts("Yes\n3\n2 1 2\n2 3 1\n2 2 3"), 0;
if (N == 4) return puts("No"), 0... | 0 | 75,808,600 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
int N=s.size();
int zero=0,one=0;
for(int i=0;i<N;i++){
if(s.at(i)=='0')
zero++;
else
one++;
}
int ans=N-abs(zero-one);
cout<<ans<<endl;
} | #include <iostream>
#include <iomanip>
#include <string>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for(ll i=init;i<(n);i++)
int main() {
string s;
cin >> s;
if (s == "zyxwvutsrqponmlkjihgfedcba") {
cout << -1 << endl;
retu... | 0 | 5,997,930 |
#include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
const ll INF = 1001001001;
int main()
{
int n;
cin >> n;
string ans = "Yes";
int xx = 0;
int... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll a, b, c, k;
int main() {
scanf("%lld %lld %lld %lld", &a, &b, &c, &k);
ll cnt = 0;
while(cnt < k && b <= a) {
b *= 2;
cnt++;
}
while(cnt < k && c <= b) {
c *= 2;
cnt++;
}
if(a < b && b ... | 0 | 42,145,062 |
#include <bits/stdc++.h>
#define int long long
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
const unsigned int M = 1e9 + 7;
int32_t main() {
fastio;
int n, k;
cin >> n >> k;
int a[n];
for(int i = 0; i < n; ++i) cin >> a[i];
sort(a, a + n);
int ans = 0;
if(k > n) k = n;
f... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
int n;
cin >> n;
int l = -1;
int r = n;
int idx;
int male = 0;
int female = 0;
rep(i, 20) {
if ( i == 0 ) {
idx = 0;
}
... | 0 | 69,897,385 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9+7,MAX = 1e5;
int main()
{
int h,w,a,b;
cin >> h >> w >> a >> b;
vector<string> s(h);
for(int i =0;i<h;i++)
{
for(int j =0;j<w;j++)
{
s[i].push_back('0');
}
}
for(int i = 0;i<b;i++)
{
for(int j = 0;j<a;j++)
{
... | #include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ \
<< ": " << #x << " = " \
<< (x) << '\n')
typedef long long ll;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int INF = ... | 0 | 23,209,608 |
#include <bits/stdc++.h>
#include <math.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;
const int MOD = 1000000007;
const int INF_32 = 1LL << 30;
const int64_t INF_64 = 1LL << 60;
int main()
{
int N, K;
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
int N, M;
vector<int> V(10);
int ans;
signed main()
{
cin >> N >> M;
for(int i = 0; i < N; i++)
{
int a;
cin >> a;
ans += a;
int tmp = 1;
for(int j = 0; j < 50; j++)
{
V.push_back(a... | 0 | 12,519,894 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <utility>
#include <tuple>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (n); i++)
using ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
ll gcd(ll a, ll b) {
if (b == 0) return a;
else return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll x = a / gcd(a, b);
return x * b;
... | 0 | 19,386,034 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
string solve() {
size_t k; cin >> k;
string s; cin >> s;
if (s.size() > k) {
return s.substr(0, k) + "...";
}
return s;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout << solv... | #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 printVector(v) rep(i, v.size()) cout << v[i] << endl;
int main()
{
int H, W;
cin >> H >> W;... | 0 | 76,681,705 |
#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 ... | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
void solve();
int m... | 0 | 67,007,887 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(long long N, long long L, long long T, std::vector<long long> X, std::vector<long long> W){
ll count = 0;
for (int i=1;i<N;i++){
ll init_pos;
if (W[0] ==1 && W[i] == 2){
init_pos = X[i]-X[0];
... | #include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
cer... | 0 | 75,886,906 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)n; i++)
#define PI 3.14159265358979323846
#define vll vector<long long>
#define vvll vector<vector<long long>>
#define pll pair<long long, long long>
#define cld complex<long double>
using namespace std;... | #include <bits/stdc++.h>
using namespace std;
#define itn int
#define nibu(K,x) binary_search(K.begin(),K.end(),x)
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) x.begin(),x.end()
#define sz(x) x.size()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define out(x) cout<<x<<endl
#define... | 0 | 95,956,773 |
#include <iostream>
using namespace std;
int x, y, z;
int main() {
x>=1 && x<=3 && y>=1 && y<=3;
cin >> x >> y;
z = 6 - (x+y);
cout << z << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(void){
int N=0, M=0;
cin >> N;
vector<string> s(N);
for(int i=0;i<N;i++){
cin >> s.at(i);
}
cin >> M;
vector<string> t(M);
for(int i=0;i<M;i++){
cin >> t.at(i);
}
vector<int> sum(N);
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
... | 0 | 12,213,761 |
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int d = a / b;
int r = a % b;
double f = (double)a / (double)b;
printf("%d %d %.8lf\n", d, r, f);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep2(i, n) for (int i = 0; i <= (int)(n); i++)
int main(void){
int A,B,C,K;
cin >> A >> B >> C >> K;
bool flag = false;
rep2(i,K){
rep2(j,K){
rep2(k,K){
int AA = A * (1 << i);
... | 0 | 38,061,430 |
#include<cstdio>
#include<cstring>
#include<functional>
#include<algorithm>
#include<iostream>
#define rep1(i,a) for(i=1;i<=a;i++)
#define rep2(j,a) for(j=i+1;j<=n;j++)
#define rep3(k,a) for(k=j+1;k<=n;k++)
using namespace std;
int main(void)
{
int n,x,sum;
int i,j,k;
while(1){
cin>>n>>x;
if(n==0... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a[n+5]={0};
for(int i=1;i<=n;i++){
cin>>a[i];
}
long long ans=1000;
for(int i=1;i<n;i++){
if(a[i]<a[i+1]){
ans+=(ans/a[i])*(a[i+1]-a[i]);
}
}
cout<<ans<<endl;
} | 0 | 9,391,428 |
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <uno... | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef lon... | 0 | 82,443,223 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (1e9)
#define INFL (1e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template<class ... | 0 | 37,249,234 |
#include<iostream>
#include<vector>
#include<cmath>
#include<string>
#include<map>
#include<list>
using namespace std;
vector<int> split(string s,char c){
vector<int> v;string tmp;
for(int i=0;i<s.size();i++){
if(s[i]==c){
v.push_back(stoi(tmp));
tmp ="";
}
else tmp += s[i];
}
if(tmp!="")v.push_back(sto... | #include <iostream>
#include <map>
#include <string>
using namespace std;
int main()
{
map<string, int> counter;
string longest;
{
string input;
while(cin >> input)
{
if(longest.length() < input.length())
longest = input;
if(counter.find(input) == counter.end())
counter[input] = 0;
else
co... | 0 | 50,444,118 |
#include<iostream>
#include<string>
using namespace std;
int main() {
string s,p;
cin >> s >> p;
s += s;
cout << (s.find(p) != string::npos ? "Yes":"No") << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n... | 0 | 59,042,523 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> v(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> v.at(i);
}
int next = 1;
int ans = 0;
bool can = false;
for (int i = 0; i < n; i++) {
next = v.at(next);
ans++;
if (next == 2... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<(n);++i)
#define rep2(i,a,b) for (ll i=(a);i<(b);++i)
#define debug(x) cout << #x << '=' << x << endl
#define all(v) (v).begin(),(v).end()
const ll MOD=1e9+7;
const ll I... | 0 | 40,557,739 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void){
int n;
vector<int> N;
for(int i=0;i<3;i++){
cin >> n;
N.push_back(n);
}
sort(N.begin(),N.end());
for(int i=0;i<3;i++){
cout << N.at(i);
if(i!=2) cout << " ";
else cout << endl;
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
int mod = (int) 1e9 + 7;
int main(){
int x, n;
cin >> x >> n;
if(n == 0){
cout << x << "\n";
return 0;
}
... | 0 | 43,283,329 |
#include <iostream>
#include <cstdlib>
#include <vector>
#include <string>
#include <sstream>
using namespace std;
vector<string> split(const string &str, char sep) {
vector<string> v;
stringstream ss(str);
string buffer;
while( getline(ss, buffer, sep) ) {
v.push_back(buffer);
}
return ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll N, M;
cin >> N >> M;
vector<vector<ll>> d(N+1, vector<ll>(N+1, 1e18));
vector<pair<ll,ll>> edge(M);
vector<ll> cost(M);
rep(i, 0, M){
... | 0 | 62,823,161 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using P = pair<int,int>;
using ll = long long;
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n) {
rep(i, n... | #include <bits/stdc++.h>
int main(void)
{
std::string s;
std::cin >> s;
std::list<int> ans;
int cnt = 0;
while (cnt < s.size()) {
if (s[cnt] == '0') {
ans.push_back(0);
}
else if (s[cnt] == '1') {
ans.push_back(1);
}
else {
if (!ans.empty()) {
ans.pop_back();
... | 0 | 80,912,306 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int n,k;
cin>>n>>k;
vector<int> a(n),dp(n);
for(int i=0;i<n;i++){
cin>>a[i];
}
dp[0] = 0;
for(int i=1;i<n;i++){
int val = INT_MAX;
for(int j=1;j<=k;j++){
if(i-j < 0){
... | #include "bits/stdc++.h"
using namespace std;
long long d[100010];
#define endl '\n'
typedef pair <long long, int> pii;
int sub[100010];
int par[100010];
int dis[100010];
vector <int> g[100010];
void dfs(int x, int par) {
for(auto i : g[x]) {
if(i - par) {
dis[i] = 1 + dis[x];
dfs(i, x);
}
}
}
int main(int... | 0 | 50,811,977 |
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9+7;
int MAX_INT = 1e9;
long long gcd(long long a, long long b){
if(b == 0) return a;
return gcd(b, a % b);
}
int main(void){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N;
cin >> N;
vector<int> h(N);
for(int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
... | 0 | 23,030,346 |
#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 mod 1000000007
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> flowers(n);
rep(i, n) cin >> flowers[i];
int cnt = 0;
for(int i=1; i<=100; i++){
bool s =... | #include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <utility>
#include <iomanip>
#include <set>
using namespace std;
using ll = long long;
#define rep(i,a,b) for(ll i=(a); i<(b); i++)
#define YES cout << "YES" << endl;
#define NO cout... | 0 | 85,173,184 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector< int > a(n);
for (auto& e:a)cin >> e;
ll curr = 1000;
for (int i=0;i+1<n;i++) {
ll s = 0;
if (a[i] < a[i+1]) s=curr/a[i];
curr += ((ll)a[i+1]-a[i])*s;
}
cout << curr << '\n';
return 0;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
#include<map>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++)
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (right + left) / 2;
while(right - left > 1)... | 0 | 52,904,425 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define pb push_back
#define inf 1e9
ll axes[200];
int main ()
{
ll r, d, x; cin >> r >> d >> x;
axes[0] = x;
for (int i = 1; i <= 10; i++) {
cout << (axes[i] = r * axes[i-1] - d) << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int n, m, p;
int x[100];
int main() {
while (cin >> n >> m >> p) {
if (!n) break;
for (int i = 0; i < n; i++) cin >> x[i];
m--;
int sumX = 0;
for (int i = 0; i < n; i++) sumX += x[i];
if (x[m] == 0) {
cout << 0 << endl;
}
else {
cout << sumX * (100 - p) * ... | 0 | 76,496,147 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int S=1;
cin>>N;
vector<int>vec(N);
for(int X=0;X<N;X++){
cin>>vec[X];
if(vec[X]==S){
S++;
}
}
if(S==1){
cout<<-1<<endl;
}
else{
cout<<N-(S-1)<<endl;
}
} | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define rep(i,n) for(int i=0;i<=(n);++i)
#define ALL(v) (v).begin(),(v).end()
typedef long long ll;
typedef pair<ll, int> P;
int h,w,d;
char s[4]... | 0 | 34,827,199 |
#include <queue>
#include <iostream>
using namespace std;
int main(){
priority_queue<int> Q;
string n;
while(cin >> n && n != "end"){
if(n == "insert"){
int a;
cin >> a;
Q.push(a);
}
if(n == "extract"){
int m = Q.top();
Q.pop();
cout << m << endl;
}
}
}
#if ... | #include <iostream>
#include <sstream>
#include <cstdio>
#include <stdlib.h>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
#define max 101
#define INF -1
#define WHITE 0
#define GRAY -1
#define BLACK 1
int n,color[max],d[max];
int varry[max][max];
void bfs(int s){
queu... | 0 | 90,512,701 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define all(X) (X).begin(), (X).end()
#define mp(a, b) make_pair(a, b)
#define pb push_back
#define endl '\n'
#define fi first
#define se second
using namespace __gnu_pbds;
using namespace std;
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#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++)
const ll MAX = 1001001;
const ll MOD = 1000000007;
int main()
{
ll n;
cin >> n;
vector<ll> a(n);
rep(i, ... | 0 | 75,400,692 |
#include <bits/stdc++.h>
using namespace std;
int INF = 1e9 + 5;
int main()
{
int n;
cin >> n;
map<int, int> even, odd;
for (int i = 0; i < n; i++)
{
int num;
cin >> num;
if (i % 2 == 0)
{
even[num]++;
}
else
{
odd[num]+... | #include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = (ll)1000000... | 0 | 3,141,501 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b... | #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 ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<ll>;
using vvi = vector<vi>;
const int INF = 10... | 0 | 78,623,213 |
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long l;
int main(void) {
int n; cin >> n;
l now = 100000;
for(int r = 0; r < n; r++) {
now += now / 20;
if(now % 1000 != 0) now = now - (now % 1000) + 1000;
}
cout << now << endl;
return(0);
} | #include <cstdio>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define TRACE(x) cerr << #x << " = " << x << endl
#define REP(i, n) for (int i=0; i<n; i++)
#define FOR(i, a, b) for (int i=(a); i<(b); i++)
#define _ << " " <<
typedef long long ll;
t... | 0 | 11,049,587 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
ll mod_pow(ll a, ll n, ll mod) {
ll result = 1;
while (n > 0) {
if (n & 1) result = result * a % mod;
a = a * a % mod;
n >>= 1;
}
return result;
}
int D[100000];
int main() {
int N;
cin >> N;
unordered_map<int, in... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
#include <vector>
#include <numeric>
#include <map>
#include <cmath>
#include <iomanip>
#include <queue>
using ll =long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vs = vector<string>;
int main() {
... | 0 | 92,918,634 |
#include <bits/stdc++.h>
#include <limits>
#include <math.h>
#include <cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int> ;
using vi = vector<int> ;
using vvi = vector<vector<int>> ;
using vll = vector<long long>;
using vvll = vector<vector<long long >>;
#define... | #include<iostream>
#include<vector>
#include<algorithm>
using ull = unsigned long long;
int main() {
ull n;
std::cin >> n;
ull A[10001]{};
for (ull i{}; i < n; ++i) {
ull t;
std::cin >> t;
++A[t];
}
auto count{0};
for (ull i{}; i < 10001; ++i) {
for (ull j{}; j < A[i]; ++j) {
std::cout << i << (count<... | 0 | 27,324,433 |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int maxn=1e2+10;
struct point{
int x,y;
}p[maxn];
bool cmp(point a,point b){
return atan2(a.y,a.x)<atan2(b.y,b.x);
}
int nx[maxn];
int main()
{
ios::sync_with_stdio(false);
int n;
cin>>n;
for(int i=1;i<=n;i++)cin>>p[i].x>>p... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string S;
cin >> S;
int q;
cin >> q;
for (auto i=0; i<q; i++) {
string M;
cin >> M;
int a, b;
cin >> a >> b;
if (M == "print") {
cout << S.substr(a, b-a+1) << endl;
} else if (M == "rever... | 0 | 88,451,403 |
#include <iostream>
#include <string>
int main()
{
std::string a, b;
std::cin >> a;
std::cin >> b;
if (a.size() == b.size())
{
bool flag = true;
for (size_t i = 0; i < a.size(); ++i)
{
if (a[i] == b[i])
{
continue;
}
... | #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() {
ll a,b,c,k;
cin >> a >> b >> c >> k;
ll ans = 0;
ll t = k;
k -= a;
if(k<=0){
ans += t;
... | 0 | 37,568,245 |
#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;
#define int long long
int gcd(int a, int b){
if(a < b) return gcd(b, a);
if(b == 0) return a;
return gcd(b, a%b);
}
signed main(){
int n, m;
cin >> n >> m;
vector<int> a(n);
cin >> a[0];
int c = 0;
while(a[0] % 2 == 0){
a[0] /= 2;... | 0 | 37,246,892 |
#include <iostream>
#include <cstdio>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <string>
#include <ctype.h>
using namespace std;
void solve()
{
string s;
int count[26] = { 0 };
while (getline(cin, s))
{
for (int i = 0; i < s.size(); ++i)
{
char c = tolower(s[i]);
count[c - 'a'... | #include <bits/stdc++.h>
#define pb push_back
#define all(c) c.begin(),c.end()
#define allr(c) c.rbegin(),c.rend()
#define MOD 1000000007
#define PI 3.14159265
#define endl '\n'
#define MAX 501
using namespace std;
void quick ()
{
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);/*
}
int gcd(int a, int... | 0 | 56,963,022 |
#include <iostream>
#include <queue>
using namespace std;
int main(){
priority_queue <int> a;
int tmp1;
string tmp2;
while(cin>>tmp2,tmp2!="end"){
if(tmp2[0]=='i'){
cin>>tmp1;
a.push(tmp1);
}
else{
cout<<a.top()<<endl;
a.pop();
}
}
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <list>
#include <algorithm>
using namespace std;
int main(int argc, char const* argv[])
{
vector<int> nl;
int mx = 0;
do{
int n;
cin >> n;
if (!cin.eof()){
nl.push_back(n);
mx = max... | 0 | 40,037,106 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
int INF = 2e9;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_s... | #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;
int main() {
int n, k;
cin >> n >> k;
int m = n-1;
int mx = (n-1) * (n-2) / 2;
if(k > mx) {
cout << -1 << endl;
return 0;
}
int now = mx;
vector<pair<int, int>... | 0 | 37,964,173 |
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <limits.h>
int main()
{
int i,j,k;
int n;
int a,b,c;
int x,z;
int y[100];
int frame,slot;
while(1)
{
scanf("%d %d %d %d %d",&n,&a,&b,&c,&x);
if((n==0)&&(a==0)&&(b==0)&&(c==0)&&(x==0)){break;}
else
{
for(i=0;i<n;i++)... | #include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef long double ld;
int dy4[4] = {-1, 0, +... | 0 | 36,642,073 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sf(a) scanf("%d",&a)
#define MX 1100010
#define inf 1e9
#define m_p make_pair
#define pb push_back
#define mem(x,val) memset(x,val,sizeof(x))
#define read freopen("input.txt","r",stdin... | 0 | 66,777,396 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);}
int main(){
ll n,x;
scanf("%lld%lld",&n,&x);
ll ans=n;
ll a=x,b=n-x;
while(a && b){
if(a>b) swap(a,b);
ans+=b/a*a*2;
b=b%a;
if(b==0) ans-=a;
}
printf("%lld\n",ans);
return 0;
} | #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)
template<class T> inline bool chmax... | 0 | 11,646,982 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,a,b) for(int i=(a);i<(b);++i)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inl... | #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 <unordered_set>
#include <c... | 0 | 32,349,732 |
#include <bits/stdc++.h>
using namespace std;
int Ma[67500000], m;
int main()
{
string s;
cin >> s;
long long n=s.length(), a;
long long H[n+1], D[n+1];
for (int i = 0; i < 67500000; i++)
{
Ma[i] = 2000000;
}
H[0] = 0;
D[0] = 0;
Ma[0] = 0;
for (int i = 1; i <= n; i++)... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
long long int mod = (long long int)1000000007;
using namespace std;
void solve()
{
ll i,j,k,n;
std::cout.precision(10);
int yes=0;
cin>>n;
double m,a[n];
cin>>m;
double sum=0;
for(i=0;i<n;i++)
{
cin>>a[i];
... | 0 | 84,869,988 |
#include <iostream>
#include <queue>
#include <map>
#include <algorithm>
#include <math.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
ll INF = 1000000007;
#define PI 3.14159265
const int MAX = 110000;
ll fac[MAX], finv[MAX], inv[MAX];
std::vector<int> permutations;
int gcd(int a, int b) {
if (b ... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int ans=0;
for(int l=0,r=s.size()-1;l<=r;l++,r--){
if(s[l]==s[r])
continue;
if(s[l]=='x'){
for(;s[l]=='x';l++){
ans++;
if(l>r){
puts("-1");
return 0;
}
}
if(s[l]... | 0 | 174,755 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
string s;
cin>>n>>s;
if(n%2) cout<<"No";
else{
int len = n/2;
if(s.substr(0,len).compare(s.substr(len,len))==0)
cout<<"Yes";
else cout<<"No";
}
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 0 | 42,814,068 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> H(N);
for(int i = 0; i < N; i++) {
cin >> H.at(i);
}
sort(H.begin(), H.end());
reverse(H.begin(), H.end());
long long ans = 0;
if(K >= N) cout << 0 << endl;
else {
for(int i = K; i < N; i++) {
... | #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<<" ";n... | 0 | 61,978,905 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int X, N;
cin >> X >> N;
set<int> st;
rep(i, N) {
... | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> H(N);
rep(i, N) cin >> H.at(i);
int count = 0;
rep(i, N) {
bool isTallest ... | 0 | 87,316,183 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using si = set<int>;
using ii = pair<int, int>;
using vii = vector<ii>;
#define rep(i, n) for (int i = 0; i < n; i++)
#define dotc() int tcs; if (cin >> tcs) rep(tc, tcs)
#define sz(x) (int)x.size(... | #include <iostream>
#include <string>
#include <utility>
using namespace std;
int main(void) {
int N;
while (cin >> N, N) {
int cnt = 0;
pair<bool, bool> legs;
legs.first = false;
legs.second = false;
bool onfloor = true;
for (int i = 0; i < N; i++) {
... | 0 | 12,137,306 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
ll A, B, K;
cin >> A >> B >> K;
ll tmp = A;... | #include "bits/stdc++.h"
using namespace std;
int main() {
int h, w, k;
cin >> h >> w >> k;
vector<string> s(h);
for (int i = 0; i < h; i++) cin >> s[i];
int ans = 0;
for (int is = 0; is < 1 << h; ++is) {
for (int js = 0; js < 1 << w; ++js) {
int cnt = 0;
for (int i = 0; i < h; ++i) {
for (int j = 0; ... | 0 | 60,225,069 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int a[N],b[N];
for(int i=0;i<N;i++) {
cin>>a[i]>>b[i];
}
int ans=0;
for(int i=0;i<N;i++) {
ans+=b[i]-a[i]+1;
}
cout<<ans<<endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph = vector<vector<int>... | 0 | 10,790,725 |
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
long long int N;
cin >> N;
long long int n = N * (N+1) * (N+2) / 6;
long long int u, v;
for(int i = 0; i < N - 1; i++) {
cin >> u >> v;
if ( u < v) n -= u * (N + 1 - v);
if ( u > v) n -= v... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | 0 | 42,957,229 |
#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 <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = lon... | 0 | 33,672,916 |
#include<iostream>
#include<cmath>
using namespace std;
struct Point{
double x;
double y;
Point(double x_in, double y_in){
x = x_in;
y = y_in;
}
Point(){}
};
struct Segment{
Point p1;
Point p2;
Segment(const Point& p1_in, const Point& p2_in){
p1 = p1_in;
p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll N;
cin >> N;
vector<ll> A;
vector<ll> B;
for (int i = 0; i < N; ++i)
{
ll temp;
cin >> temp;
A.push_back(temp);
B.push_back(temp);
}
sort(B.begin(), B.end());
for (auto... | 0 | 23,407,284 |
#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;
string s;
cin >> n >> s;
int ans = 0;
for (char i = '0'; i <= '9'; ++i) {
for (char j = '0'; j <= '9'; ++j) {
for (char k = '0'; k <= '9'; +... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1000000000;
using ll = long long;
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define all(x) (x).begin(),(x... | 0 | 92,897,691 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define int long long
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define eb emplace_back
#define fn for(int i =0 ;i <n;i++)
#define fn1 for( int i =1;i<=n; i++)
#define fm for(int j =0 ;j <m;j++)
#define... | 0 | 84,660,370 |
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<string>
#include<cstring>
#include<time.h>
#include<iomanip>
#include<list>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<bitset>
#include <queue... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef vector<int> vi;;
typedef vector<ll> vll;
#define l() length()
#define sz() size()
#define b() begin()
#define e() end()
#define all(x) x.begin(), x.... | 0 | 80,956,489 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
int main()
{
int n,x;
cin >> n >> x;
int a[n+1];
rep(i,n) cin >> a[i];
a[n] = x;
sort(a,a+(n+1));
int dist[... | #include <bits/stdc++.h>
using namespace std;
bool graph[5][5];
int main(void){
int a,b;
for (int i=0;i<3;i++) {
cin>>a>>b;
graph[a][b]=true;
graph[b][a]=true;
}
int flag=0;
if (graph[1][2]==true) {
if (graph[2][3]==true) {
if (graph[3][4]==true) {
... | 0 | 23,560,832 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
#define NULL 0
#define pi 3.14159265358979323846
#define all(x) x.begin(), x.end()
#define d0(x) cout<<x<<" ";
#define d1(x) cout<<x<<"\n";
#define d2(x,y) cout<<x<<" "<<y<<"\... | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <list>
#include <array>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#include... | 0 | 52,511,246 |
#include<iostream>
using namespace std;
int main() {
int a[101] = {},i = 1,max = 0,tmp;
while (cin >> tmp) {
a[tmp]++;
i++;
}
for (int j = 1; j < 100; j++) {
if (a[j] > max) {
max = a[j];
}
}
for (int j = 1; j < 100; j++) {
if (a[j] == max) {
cout << j << endl;
}
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(){
int H, W;
while(true){
cin >> H >> W;
if(H == 0 && W == 0) break;
for(int i = 0; i < H; i++) cout << string(W, '#') << endl;
cout << endl;
}
} | 0 | 57,336,250 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
long double l;
cin>>l;
l/=3;
l*=l*l;
printf("%.9Lf",l);
return 0;
} | #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() {
ll N, M; cin >> N >> M;
if(N == 1 && M == 1){
cout << 1 << endl;
} else if(N == 1){
cout << M-2 << endl;
} else if(M == 1){
co... | 0 | 57,527,992 |
#include <iostream>
int main(){
int b,f,r,v,n;
int x[4][3][10] = {0};
std::cin >> n;
for(int a = 0;a < n;a++){
std::cin >> b >> f >> r >> v;
x[b - 1][f - 1][r - 1] = x[b - 1][f - 1][r - 1] + v;
}
for(int amatukaze = 0;amatukaze < 3;amatukaze++){
for(int kagerou = 0;kagero... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mk make_pair
#define MAX 1000001
ll prime[MAX];
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
ll rec(vector<vector<ll> >& dp,vector<ll>& ar... | 0 | 39,060,678 |
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <set>
#include <stack>
#include <deque>
#include <cmath>
#include <map>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
template<typename T1,typename T2> inline void chmin(T1 ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
void Digvijay()
{
int n;
cin>>n;
vector<int> a(n);
for(auto& it:a)cin>>it;
int val=1;
bool ok=false;
for(int i=0;i<n;i++)
{
if(a[i]==val)
{
ok=true;
val++;
}
}
if(ok)
{
c... | 0 | 91,341,399 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin>>n){
if(n==0) break;
int k=24*60*60;
int imos[k+1]={};
for(int i=0;i<n;i++){
string l;
cin>>l;
int a=((l[0]-'0')*10 + (l[1]-'0'))*60*60 + ((l[3]-'0')*10 + (l[4]-'0'))*60 ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using ld = long double;
template<typename T> using V = vector<T>;
template<typename T> using VV = vector<vector<T>>;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplac... | 0 | 78,380,224 |
#include<stdio.h>
int main(){
int A, B;
scanf("%d %d", &A, &B);
if(A == 1){
if(B == 2){
printf("%d",3);
}
else{
printf("%d",2);
}
}
else if(A == 2){
if(B == 1){
printf("%d",3);
}
else{
printf("%d",1);
}
}
else if(A == 3){
if(B == 2){
printf("%d",1);
}
else{
printf... | #include <bits/stdc++.h>
#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 FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | 0 | 89,213,105 |
#include <iostream>
using namespace std;
const string YES = "Yes";
const string NO = "No";
int main(void)
{
int W, H, x, y, r;
string answer = YES;
cin >> W >> H >> x >> y >> r;
if(x - r < 0) answer = NO;
if(y - r < 0) answer = NO;
if(W < x + r) answer = NO;
if(H < y + r) answer = NO;
co... | #include<iostream>
using namespace std;
#include<map>
#include<vector>
#include<cmath>
#define int long long int
int power(int a,int b)
{
int x=pow(a,b);
return x;
}
int solve(int val)
{
int j;
if(val>0)
{
int sum=0;
for(j=0;;j+=2)
{
sum+=power(2,j);
if(sum>=val)
{
return j;
}
}
}
else
{... | 0 | 49,722,273 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define LOOP(i,x,n) for(int i=x;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define MP make_pair
#define FR first
#define SC second
#define int long long
using namespace std;
const int MOD=1000000007;
const int INF=9000000009;
signed m... | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>
us... | 0 | 89,440,035 |
#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>;
int main() {
int n;
cin >> n;
bool ans = false;
for(int i = 0; i <= (n/4)+1; i++) {
for(int j = 0; j <= (n/7)+1; j++) {
if(n == (4*i) + (7*j)) ans = true;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
cin >> n >> k;
int a[n];
long dp[k+1] = {0}, m = 1000000007;
for(i = 0; i < n; ++i)
cin >> a[i];
for(j = 0; j <= a[0]; ++j)
dp[j] = 1;
for(i = 1; i < n; ++i) {
for(j = 0; j < k; ++j)
... | 0 | 46,711,848 |
#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 gcd(int a,int b){
if(b ==0) return a;
return gcd(b,a%b);
}
int main(){
int n,k;
cin >> n >> k;
vector<int> a(n);
... | #include <iostream>
using namespace std;
int main() {
while(true) {
string s;
cin >> s;
if (s == "0")
break;
int sum = 0;
for (char& c : s) {
sum += stoi(string{c});
}
cout << sum << endl;
}
return 0;
} | 0 | 54,609,851 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
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; } retu... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s;
std::cin >> s;
int n = s.size();
std::vector<int64_t> v(n + 1, 0);
rep(i, n) {
if (s[i] == '<') {
v[i + 1] = v[i] + 1;
}
}
for (int i = n - 1; i >= 0; i--) {
{
... | 0 | 12,237,675 |
#include<iostream>
using namespace std;
int main(){
char moji;
cin >> moji;
if ('a' <= moji && moji <= 'z'){
cout << "a" << endl;
}
else{
cout << "A" << endl;
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 92,949,856 |
#include <iostream>
#include <algorithm>
#define int long long
signed main()
{
int n;
std::cin >> n;
std::pair<int, int> a[n];
for(int i = 0; i < n; i++) {
std::cin >> a[i].first;
a[i].second = i%2;
}
std::sort(a, a+n);
int ans = 0;
for(int i = 0; i < n; i++)
ans += (i%2 != a[i].second);
s... | #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 | 81,524,506 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m,x,y;
cin>>n>>m>>x>>y;
vector<int> datax(n);
vector<int> datay(m);
for (int i=0;i<n;i++){
cin>>datax.at(i);
}
for (int i=0;i<m;i++){
cin>>datay.at(i);
}
datax.push_back(x);
datay.push_back(y);
sort(datax.begin(),datax.end());... | #include <bits/stdc++.h>
#include "unistd.h"
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i<i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formax=(b);i>=i##formax;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(x) (... | 0 | 13,203,238 |
#include <set>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <cmath>
#include <deque>
#include <bitset>
#include <cstdio>
#include <vector>
#include <string>
#include <complex>
#include <sstream>
#include <climits>
#include <cstring>
#include <fstream>
#include <iostream>
#include <algorithm... | #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 <unordered_set>
#pragma GCC... | 0 | 14,382,880 |
#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 s, t;
cin >> s >> t;
vector<int> sv(26);
vector<int> tv(26);
rep(i,... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int N,X;cin>>N>>X;
vector<int>x(N+1);
x[0]=X;
for(int i=1;i<=N;i++){
cin>>x[i];
}
sort(x.begin(),x.end());
int A[N];
for(int i=0;i<N;i++){
A[i]=x[i+1]-x[i];
}
long long ans=x[1]-x[0];
for(int i=1;i<... | 0 | 80,443,929 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for(ll i = 0;i < n;i++)
#define all(i) i.begin(), i.end()
template<class T, class U> bool cmax(T& a, U b) { if (a<b) {a = b; return true;} else return false; }... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#pragma region Macros
#define FOR(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) FOR(i, 0, n)
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template <class T> bool chmin(T &a, co... | 0 | 95,260,604 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
#define reverse(s) reverse(s.begin(),s.end())
ll gcd(ll a, ll b) {
if (b==0) return a;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
const double PI = 3.14159265358979;
void solve()
{
ll n;
cin >> n;
vector<ll> a(n);
for(int i = 0; i < n; ++i)
{
... | 0 | 74,658,638 |
#include <iostream>
using namespace std;
int main()
{
int a, b, c, i, j;
cin >>a>>b>>c;
j=0;
for(i==0;i<=b-a;i++)
{
if(c%(i+a)==0)
{
j+=1;
}
else{}
}
cout <<j<<"\n";
return 0;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int main(){
int N;
cin>>N;
ll A[N+1]={},B[N+1]={};
bool same=true;
for(int i=0;i<N;i++){
cin>... | 0 | 59,100,069 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define F first
#define S second
#define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define rep(i,n) FOR(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define ve vector
#define vi vector<int>
#d... | #include <iostream>
#include <vector>
#include <array>
#include <set>
#include <cmath>
#include <string>
#include <queue>
#include <list>
#include <stack>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cassert>
#include <bitset>
#include <cctype>
#include <iomanip... | 0 | 51,936,900 |
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))
#d... | #include <bits/stdc++.h>
int main(){
int A, B, C, K;
std::cin >> A >> B >> C >> K;
bool ok = false;
for(int i=0; i<K; i++){
if(B <= A){
B *= 2;
}else if(C <= B){
C *= 2;
}
if(B > A && C > B){
ok = true;
break;
}
... | 0 | 18,463,802 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
vector<int> a(n), b(n, 0);
for (int i = 0; i < n; i++){
cin >> a[i];
}
int mem = 0;
while (true){
if (b[mem] == 1){
ans = -1;
break;
}
ans++;
if (a[mem] == 2) break;
b[mem] = 1;
... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
constexpr char ln = '\n';
const i... | 0 | 2,669,463 |
#include<bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint,vector<llint>,greater<llint> > que;
priority_queue<llint> Que;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
void solv... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
int n, a[maxn];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
auto chk = [&](int x) {
map<int, int> mp;
for (int i = 2; i <= n; i++) if (a[i - 1] >= a[i]) {
if (x == 1) retur... | 0 | 8,102,577 |
#include <bits/stdc++.h>
#include <math.h>
#include <cmath>
using namespace std;
using ll =long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
#define rep(i,n) ;for( int i =0; i < n ; i ++)
#define all(a) a.begin(),a.end()
#define f(i,a,b) for(int i=a;i<b;i++)
b... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
using Graph = vector<vector<int> >;
int main() {
int N, M;
cin >> N >> M;
Graph G(N);
for (int... | 0 | 81,644,404 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <numeric>
#include <deque>
#include <stdio.h>
#include <string>
#include <queue>
#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() {
priority_queue<ll> ... | #include<bits/stdc++.h>
using namespace std;
#define ll unsigned long long
#define inf 1e18
#define MAX 200005
#define mod 1000000007
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld",&a,&b)
#define sfff(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define Case(i) cout<<"Case #"<<i<<": "
#define pf(a) printf... | 0 | 1,966,420 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<cstddef>
#include<queue>
#include<math.h>
#include<iomanip>
using namespace std;
int main()
{
string a, b, A = "", B = "";
cin >> a >> b;
for(int i = 0; i < stoi(b); ++i) A += a;
for(int i = 0; i < stoi(a); +... | #include<bits/stdc++.h>
#define inf 2000000000
#define eb emplace_back
#define pb push_back
#define fi first
#define se second
#define fastio ios::sync_with_stdio(false);cin.tie(NULL)
#define rng_23 mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
using namespace std;
typedef long long ll;
typedef pa... | 0 | 100,434,550 |
#include <bits/stdc++.h>
#define PB push_back
#define MP std::make_pair
#define FI first
#define SE second
#define M 1000005
#define INF 1000000000
int n,S[M],top;
bool flag=1;
std::pair <int,int> Stack[M];
int read(){
char c=getchar();int ans=0;
while (c<'0'||c>'9') c=getchar();
while (c>='0'&&c<='9') ans=ans*10+c-... | #include<bits/stdc++.h>
using namespace std;
void solveA()
{
long long a,b,tem;
cin>>a>>b;
tem=(a+b);
if(tem%2==0)
{
cout<<tem/2<<endl;
}
else
{
cout<<"IMPOSSIBLE"<<endl;
}
}
void solveB()
{
int n,i,j,count;
cin>>n;
int ar[n];
for(i=0;i<n;i++)
{
cin>>ar[i];
}
j=1;
count=0;
... | 0 | 87,641,844 |
#include <cstdio>
#define loop_input(fmt,...) while(~scanf(fmt,__VA_ARGS__))
int main() {
int a, b;
loop_input("%d%d", &a, &b) {
if (a == 0 && b == 0) break;
if (a > b) a ^= b ^= a ^= b;
printf("%d %d\n", a, b);
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
cout << ((min(a, b) + 23) / 25) * 4 + ((abs(a - b) + 50)/ 50) * 2 << " " << 100 << endl;
if (b > a){
int cnt = a - 1;
while (cnt > 0){
int tmp = 0;
for (int i = 0; i < 25; i++){
... | 0 | 33,413,826 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i< i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formin=(b);i>=i##formin;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz... | #include <iostream>
#include <vector>
#include <string>
#include <cstdlib>
#include<algorithm>
#include <iomanip>
#include <math.h>
#include <cctype>
#define db double
#define vi vector<int>
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ld long double
#define maxn 5005
#define mo... | 0 | 37,736,445 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma warning(disable : 4996)
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#incl... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(pos,mp) for(ll pos=mp.begin();pos!=mp.end();pos -++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
int m... | 0 | 47,083,752 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
#define sz(x) (int)(x).size()
const int N = 200010;
int n, a[N];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
int j = 0, sm = 0, x = 0;
ll ans = 0;
for (int i = 0; i < n; i++) {
... | #include <cstdio>
int main()
{
int money = 100000;
int n;
float a = 0.05;
scanf("%d", &n);
while (n != 0){
money += money * a;
if ((money % 1000) != 0){
money -= money % 1000;
money += 1000;
}
n--;
}
printf("%d\n", money);
return (... | 0 | 2,378,229 |
#include<bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i,n) for(int i=0;i<n;++i)
#define all(v) v.begin(), v.end()
typedef long long int ll;
typedef unsigned long long ull;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
ty... | 0 | 90,043,340 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
#defi... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <deque>
#include <numeric>
#include <sstream>
#include <ioman... | 0 | 98,783,141 |
#include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<long long int> v(n, 0);
for (int i = 0; i < n; i++) {
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define lef(x) (x<<1)
#define rig(x) (lef(x)+1)
#define int long long
pair<string,int> a[60];
int32_t main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
for (int i = 0; i < n; ++i)
{
cin>>a[i].first>>a[i].se... | 0 | 77,545,083 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.