code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <map>
#include <queue>
#include <cmath>
#include <iomanip>
#include <set>
#include <functional>
#include <list>
#define MOD (1000000000 + 7)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> tup;
const i... | #include <bits/stdc++.h>
#define rep(i , n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int a[3][3];
int d[3][3];
int main() {
int count = 0;
rep(i, 3){
rep(j, 3){
cin >> a[i][j];
}
}
int n;
cin >> n;
rep(k, n) {
int x;
... | 0 | 47,978,686 |
#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(n) begin(n),end(n)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
rep(i,n) cin >> a[i];
... | #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 | 71,456,486 |
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll long long
#define ff first
#define ss second
#define Endl endl
#define int long long
int gcd(int a,int b){
return b?gcd(b,a%b):a;
}
bool cmps(pair<int,int>p1,pair<int,int>p2) {
return p1.ss<p2.ss;
}
int lcm(int a, ... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <time.h>
#include <cstdlib>
#include <cmath>
#include <fstream>
#include <iomanip>
using namespace std;
int findindex(int n, int x[]) {
for (int i = 0; i < 6; i++) {
if (x[i] == n) {
return i;
}
}
... | 0 | 45,338,337 |
#include<iostream>
#include<vector>
using namespace std;
int main() {
string S;
cin >> S;
vector<int> a(1000);
for (int i = 0; i < S.length(); i++) {
a[S[i] - 'a']++;
}
bool check = true;
for (int i = 0; i < 1000; i++) {
if (a[i] > 1) {
check = false;
}
}
if (check) {
cout << "yes" << endl;
}
else... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001... | 0 | 8,015,311 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int t;
cin>>t;
string s;
cin>>s;
int ans=1;
for(int i=0;i<s.size()... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define REP(i,n) for(int _n=n, i=0;i<_n;++i)
#define FOR(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FORD(i,a,b) for(int i=(a),_b=(b);i>=_b;--i)
#define trav(a, x) for (auto& a : x)... | 0 | 88,988,677 |
#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 a,b;
cin>>a>>b;
a>b?cout<<"safe":cout<<"unsafe";
} | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx")
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int (i)=0;i<(n);i++)
#define REP(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define MOD 1000000007
#define fcout cout << fixed << setprecision(15)
#define int long l... | 0 | 37,590,881 |
#include <iostream>
#include <string>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <cassert>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <map>
#include <queue>
#include <random>
#include <numeric>
#include <time.h>
#include <stack>
#include <bitset>
#define prev asasd... | #include <bits/stdc++.h>
const int MAXN = 1010;
typedef long long LL;
int xs[MAXN], ys[MAXN], n;
char step[50];
const int UP = 39;
int main() {
std::ios_base::sync_with_stdio(false), std::cin.tie(0);
std::cin >> n;
for (int i = 1; i <= n; ++i)
std::cin >> xs[i] >> ys[i];
for (int i = 1; i <= n; ++i)
if ((xs[i] ... | 0 | 72,487,709 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n,k;
cin >> n >> k;
priority_queue<int> q;
vector<vector<int>> v(k);
rep(i,n){
int x,y;
cin >> x >> y;
int z=k-x;
if(z>=0) v[z].push_back(y);
}
ll ans=0... | #include <iostream>
using namespace std;
int main(){
int i = 0;
int x[25565] = {0};
int y[25565] = {0};
do{
cin >> x[i] >> y[i];
i = i + 1;
}while(x[i-1] != 0 || y[i-1] != 0);
i = 0;
do{
if(x[i] != 0 || y[i] != 0){
if(x[i] <= y[i]){
cout <<... | 0 | 78,074,645 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
typedef long long ll;
vector<vector<char>> g(100,vector<char>(100));
int main(){
int a,b; cin >> a >> b;
rep... | #include <bits/stdc++.h>
using namespace std;
int MAX_N=262144;
vector<int64_t> seg(MAX_N*2-1);
int64_t qu(int a,int b,int k,int l, int r){
if(r<=a||b<=l){
return -1;
}
else if(a<=l&&r<=b){
return seg[k];
}
else{
int64_t X=qu(a,b,k*2+1,l,(l+r)/2);
int64_t Y=qu(a,b,k*2+2,(l+r)/2,r);
return ... | 0 | 5,352,945 |
#include<iostream>
using namespace std;
int main(){
char chara ;
cin >> chara ;
if( chara == 'a' || chara == 'e' || chara == 'i' || chara == 'o' || chara == 'u' )
cout << "vowel" << endl ;
else
cout << "consonant" << endl ;
return 0;
} | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | 0 | 58,945,330 |
#include <iostream>
#include <map>
#include <algorithm>
#include <string>
#include <vector>
#include <numeric>
#include <cmath>
#include <queue>
#include <iomanip>
#include <functional>
#define CHMAX(a,b) a = std::max(a,b)
#define CHMIN(a,b) a = std::min(a,b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,k;
cin>>a>>b>>c>>k;
int need=0;
while(a>=b)
{
b*=2;
need++;
}
while(b>=c)
{
c*=2;
need++;
}
if(need<=k)
{
cout<<"Yes\n";
}
else
{
cout<<"No\n";
}
} | 0 | 79,373,819 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N; cin >> N;
vector<int> X(N); for (auto &x : X) cin >> x;
int L; cin >> L;
vector<vector<int>> dp(N, vector<int>(17));
for (int a = 0; a < N; a++) {
auto it = upper_bound(begin(X), end(X), X[a]+L) - 1;
dp[a][0] = it - be... | #include <bits/stdc++.h>
#include <array>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)
struct Problem {
void Solve() {
LL a, b, c; cin >> a >> b >> c;
ULL K; cin >> K;
if (K % 2) swap(a, b);
cout << (a - b) << endl... | 0 | 25,602,394 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x, y;
cin >> x >> y;
if(x % y == 0) {
cout << -1 << "\n";
} else {
cout << x << "\n";
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
using namespace std;
const int INF=1145141919,MOD=1e9+7;
const long long LINF=8931145141919364364,LMOD=998244353;
int main(){
int n; cin>>n;
int t[n+1]={}; rep(i,n){cin>>t[i+1],t[i+1]*=2;}
rep(i,n) t[i+1]+=t[... | 0 | 18,973,203 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<string> A(N), B(M);
for (int i = 0; i < N; ++i) cin >> A.at(i);
for (int i = 0; i < M; ++i) cin >> B.at(i);
bool exist = false;
for (int ly = 0; ly < N; ++ly) {
for (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ... | 0 | 22,067,982 |
#include<iostream>
using namespace std;
int main(){
int i,j,n,min,swap,count=0;
int a[100];
cin >> n;
for (i=0;i<n;i++){
cin >> a[i];
}
for (i=0;i<n;i++){
min = i;
for (j=i;j<n;j++){
if (a[j]<a[min]){
min = j;
}
}
if (min > i){
swap = a[i];a[i] = a[min];a[min] = swap;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define FORR(i, m, n) for (ll i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).... | 0 | 60,669,755 |
#pragma GCC optimize ("-O3","unroll-loops")
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<casse... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
set<string> s;
string w;
char c;
cin >> w;
s.insert(w);
c = w.at(w.size() - 1);
for (int i = 1; i < n; i++) {
string x;
cin >> x;
if (s.find(x) == s.end() && x.at(0) == c) {
... | 0 | 89,130,404 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N,K;
int a[60];
int total = 0;
cin >> N >> K;
for(int i=0;i<N;++i) cin >> a[i];
sort(a,a+N,greater<int>());
for(int i=0;i<K;++i){
total += a[i];
}
cout << total << endl;
} | #include <bits/stdc++.h>
using namespace std;
string query(int n) {
cout << n << '\n' << flush;
string s; cin >> s;
if (s == "Vacant") exit(0);
return s;
}
int main() {
int n; cin >> n;
int l = 0;
int r = n - 1;
string L = query(l);
string R = query(r);
while (true) {
int m = (l + r) / 2;
R = query(m);
... | 0 | 99,077,104 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) r... | 0 | 93,367,149 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
vector<long long> a(n+1, 0);
for(int i = 0; i < n; i++) {
if(s[i] == '<') {
a[i+1] = max(a[i]+1, a[i+1]);
}
}
for(int i = n-1; i >= 0; i--) {
if(s[i] == '>') {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
bool Check(vector<int> vec,int c){
for(int i=0;i<vec.size();i++){if(vec[i] == c) return false;}
return true;
}
int main(){
int N,M,a,b,ans=0; cin >> N >> M;
vector<vector<int>> data(N+1);
vector<int> ... | 0 | 51,038,814 |
#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... | #include <iostream>
#include <string>
#include <map>
#include <algorithm>
using namespace std;
typedef map<string, int> freqmap;
freqmap fm;
int main() {
string word;
while (cin >> word) {
fm[word]++;
}
string most_used;
int most_used_i = 0;
for (freqmap::iterator i = fm.begin(); i!= fm.... | 0 | 51,531,891 |
#include <bits/stdc++.h>
using namespace std;
multiset<int>st;
int main(){
long long n;
cin >> n;
long long now = 1;
long long sum = 0;
while(sum < n){
sum+=now++;
}
long long diff = sum-n;
for(long long i = 1; i < now; ++i){
if(i != diff)printf("%lld\n", i);
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
template<class T> inline bool chmin(T& a, T b){
if(a > b){
a = b;
return true;
}
return false;
}
template<class T> inli... | 0 | 64,055,022 |
#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++)
#define _GLIBCXX_DEBUG
template <typename T>
bool chmax(T &a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typenam... | #include <iostream>
using namespace std;
int main(){
int *x;
int _x[10];
x = _x;
int in = 0;
while(cin >> in){
if(!in){
cout << *(x-1) << endl;
x--;
}else{
*x = in;
... | 0 | 60,117,978 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int a,b,c;
... | #include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
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;}
char alpha[26] = {'a... | 0 | 68,690,748 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
int len = v.size();
s << "[";
for (int i = 0; i < len; i++) {
if (i > 0) s << ", ";
s << v[i];
}
s << "]";
return s;
}
int main()... | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using std::string;
using std::vector;
us... | 0 | 49,105,701 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int m, n;
scanf("%d%d", &n,&m);
if(n == 1 || m == 1) cout<<"1\n";
else{
long long c = ((long long)n*(long long)m + 1)*.5;
cout<<c<<'\n';
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int H,W,N;
cin >> H >> W >> N;
int dx[9] = {-1,0,1,-1,0,1,-1,0,1};
int dy[9] = {1,1,1,0,0,0,-1,-1,-1};
vector<int> a(N),b(N);
set< pair<int,int> > s;
set< pair<int,int> > used;
for(int i=0;i<N;i++){
cin >> a[i] >> b[i]... | 0 | 29,474,365 |
#include <bits/stdc++.h>
using namespace std;
long long f(long long k){
return (k*(k-1))/2;
}
int main(){
long long n;
long long now=0;
cin>>n;
vector<long long> p(n,0);
long long a[n];
for(int i=0;i<n;i++){
cin>>a[i];
a[i]--;
p[a[i]]++;
}
for(int i=0;i<n;i++){
now+=f(p[i]);
}
for(int... | #include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <queue>
using namespace std;
const int nmax = 1e9 + 7;
const long long INF = 1e18;
const double PI = 2 * asin(1);
typedef long long ll;
int main(){
int num[10] =... | 0 | 47,447,445 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
double A, B;
cin >> A >> B;
for (int i = 1; i < 1e8; i++) {
if (floor(i * 0.08) == A && floor(i * 0.1) == B) {
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
} | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | 0 | 17,790,718 |
#include "bits/stdc++.h"
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long>H(N);
long long MAX = -1;
for (long long i = 0; i < N; i++) {
cin >> H.at(i);
}
long long ans = 0;
for (long long i = 0; i < 200; i++) {
long long num = 0;
bool check = false;
for (long long j = 0; j < N; ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, start, n) for (ll i = (ll)(start); i < (ll)(n); ++i)
static const ll INFTY = 1L << 62L;
ll solver(string S, ll K)
{
ll ans = 0, tmp = 0;
bool flag = true;
rep(i, 0, S.size() - 1)
{
if (S[i] != S[i + 1])
{
... | 0 | 3,207,562 |
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 200005;
int n;
int a[N];
int q[N];
bool solv()
{
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
sort(a + 1, a +... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
ll n, xi[1010], yi[1010], c[2], m, ans[40];
ll dx[]={1,-1,0,0};
ll dy[]={0,0,1,-1};
char ch[]={'R','L','U','D'};
void fuck(ll x,ll y,ll w){
if (w>m) return;
ll mn=1e100, d;
for (int i=0;i<4;++i){
ll t=abs(x+dx[i]*ans[w])+abs(y+dy[i]*a... | 0 | 63,947,741 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
const int N=2e5+5;
int n;
int a[N];
bool inc(int k, vector<pair<int, int> > &v)
{
vector<pair<int, int> > temp;
int cur=0;
while(v.size() && v.back().first==k)
{
temp... | 0 | 7,725,869 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define PI 3.141592653589793238
#define INF 1050000000
using vi = vector<int>;
int main() {
vector<vector<char>> C(2, vector<cha... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,M,X,Y;
cin >> N >> M >> X >> Y;
vector<int>x(N);
vector<int>y(M);
for(int i = 0; i < N; i++) {
cin >> x[i];
}
for(int i = 0; i < M; i++) {
cin >> y[i];
}
sort(x.begin(),x.end());
sort(y.begin(),y.end... | 0 | 73,669,979 |
#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... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define test int t; cin>>t; while(t--)
vector<int>arr[200001];
int vis[200001],di[200001];
void bfs(int root)
{
queue<int> que;
que.push(root);
di[root] = 0;
vis[root] = 1;
while (!que.empty()) {
root = que.front();
que... | 0 | 34,077,391 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,n,counter=0;
cin>>N;
vector<int>vec(N);
for(int i=0;i<N;i++){
cin>>vec.at(i);
}
for(int i=0;i<N;i++){
if(i==0){
if(vec.at(i)==2)
break;
n=vec.at(i);
counter++;
}
else if(i<N-1){
if(vec.at(n-1)==2){... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<PII> VP;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define pb push_back
#define paired make_pair
#define AL... | 0 | 36,524,530 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
#define rep(i, n) for (int i = 0; i < n; i++)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dxx[8] = {1, 1, 1, 0, 0, -1, -1, -1}, dyy[8] = {-1, 0, 1, -1, 1, -1... | 0 | 1,533,988 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL<<60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } retur... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int i = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int i = (m); (i) < (n); (i)... | 0 | 97,430,383 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using Pa = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll N,X;
cin >> N >> X;
vec<ll> P(N+1,1... | 0 | 69,578,647 |
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
int abs(int a,int b){
int c=max(a,b)-min(a,b);
return c;
}
priority_queue<int, vector<int>, greater<int> > qu;
signed main(){
cin.tie(NULL);
ios::sync_with_stdio(false);
int a,b,c;
int d=0,e=0;
cin>>a>>b>>c;
for(int i=0;i<c;... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N; cin >> N;
vector<ll> x(N); for(int i=0;i<N;i++) cin >> x[i];
ll L; cin >> L;
ll tmp=0;
int y[N];
int j=0;
for(int i=0;i<N;i++){
int ind=upper_bound(x.begin(),x.end(),x[i]+L)-x.begin();
if(in... | 0 | 45,462,298 |
#include <bits/stdc++.h>
#define pb push_back
#define Int long long
using namespace std;
const int MAXN=500005;
const long MOD=(long)(1e9+7);
vector<int> adj[MAXN];
vector<pair<int,int>> G[MAXN];
Int N,M,K;
Int B,C,H,W;
Int X,Y,Z;
vector<Int> A;
Int ceilS(Int x,Int y){
return (x+y-1)/y;
}
using D=long double;
Int p... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (a[n - 1] != 2) {
cout << -1 << '\n';
return 0;
}
vector<long long> mn(n + 1, 2), mx(n + 1, 2);
for (in... | 0 | 90,444,586 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 1000000007
const ll INF... | #include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <iomanip>
using namespace std;
using ll = long long;
#define rep(i, j, n) for(int i = (j); i < (n); ++i)
#define rrep(i, j, n) for(int i = (n) - 1; (j) <= i; --i)
constexpr ll MOD = 1000000007;
constexpr ll INF = 1LL << 60;
int main(... | 0 | 78,787,814 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_bac... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#define between(a,x,b) ((a)<=(x)&&(x)<=(b... | 0 | 42,779,090 |
#include<bits/stdc++.h>
#define rep(i,a,n) for(ll i=a;i<n;i++)
using namespace std;
typedef long long ll;
int main(){
ll n;
cin>>n;
ll a[n],num[n+1];
rep(i,0,n+1)num[i]=0;
rep(i,0,n){
cin>>a[i];
num[a[i]]++;
}
ll sum=0;
rep(i,1,n+1){
if(num[i]>=2){
rep(j,1,num[i])sum+=j;
}
}
re... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typede... | 0 | 72,212,916 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef... | 0 | 32,970,762 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
string s;
cin >> s;
int ans = 4;
if(s=="RRS" || s=="SRR") ans = 2;
else if(s=="RSS"||s=="SRS"||s=="SSR"||s=="RSR") ans = 1;
else if(s=="SSS") ans = 0;
else ans = 3;
cout << ans << endl;
return 0;
} | #ifndef CLion
#pragma GCC optimize ("O3")
#endif
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/numeric>
#define F first
#define S second
#define pb push_back
#define ll long long
#define all(x) x.begin() , x.end()
#define rep(i,s,e) for (int i = s;... | 0 | 14,962,659 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 100005
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N=1e5+10;
int a[N],p[N];
ll sum[N],ans[N];
int main()
{
int n;
scanf("%d",&n);
for (int i=1;i<=n;i++) {
scanf("%d",&a[i]);
p[i]=i;
}
sort(p+1,p+n+1,[&](const int &i,const int &j){ return a[i]>a[j] || a[i]==... | 0 | 12,818,654 |
#include <iostream>
#include <cstdio>
#include <string>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <stdlib.h>
#include <string.h>
#include <cmath>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <set>
const long long MOD = 1e9 +... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound... | 0 | 82,216,716 |
#include <stdio.h>
int main(void){
int a,b;
scanf("%d %d",&a,&b);
if(a<b){
printf("a < b\n");
}else if(a>b){
printf("a > b\n");
}else{
printf("a == b\n");
}
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) __builtin_popcountll(b... | 0 | 18,861,394 |
#include <stdio.h>
void B_sort(int data[], int n) {
int tmp;
for (int i = 0; i < n-1; i++) {
for (int j = i+1; j < n; j++) {
if (data[i] < data[j]) {
tmp = data[i];
data[i] = data[j];
data[j] = tmp;
}
}
}
}
int ave(int data[], int n) {
int i;
int sum = 0;
int ave;... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
map<int, int> mp;
int main(int argc, char* arg... | 0 | 16,730,518 |
#include <cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<set>
#include<tuple>
#include<bitset>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
int d[200005];
int main(void) {
int n;
cin >> n;
ll ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0; i<n; i++)
typedef long long ll;
typedef long long unsigned int llu;
ll MOD = 1000000007;
ll INF = 1000000009;
ll a[20];
ll p[20];
void solve(){
ll n,k;
cin >> n >> k;
rep(i,n){
cin >> a[i];
if(i!=0) p[i]=max(a[i],p[i-... | 0 | 99,936,571 |
#include <iostream>
#include <string.h>
using namespace std;
int main()
{
string alphabet;
cin >> alphabet;
if(alphabet[0] >= 'A' && alphabet[0] <= 'Z')
{
cout << "A" << endl;
}
if(alphabet[0] >= 'a' && alphabet[0] <= 'z')
{
cout << "a" << endl;
}
} | #include <cstdio>
#include <climits>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <cstdio>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <utility>
#include <queue>
#include <cstring>
#include <set>
#define rep(i, n) for (in... | 0 | 37,415,960 |
#include <bits/stdc++.h>
using namespace std;
void solve(long long a, long long b, long long c, long long d){
long long tmp = a * c;
if(a * d > tmp) tmp = a*d;
if(b * c > tmp) tmp = b*c;
if(b * d > tmp) tmp = b*d;
cout << tmp << endl;
}
int main(){
long long a;
scanf("%lld",&a);
long lon... | #include<iostream>
using namespace std;
int main() {
for (;;) {
int a, b;
cin >> a >> b;
if (a == 0 && b == 0) {
break;
}
for (int k = 0; k < b; k++) {
cout << "#";
}
for (int m = 0; m < a - 2; m++) {
cout << endl;
cout << "#";
for (int j = 0; j < b - 2; j++) {
cout << ".";
}
cou... | 0 | 5,787,877 |
#include <bits/stdc++.h>
#if LOCAL
#include "dump.hpp"
#else
#define dump(...)
#endif
using namespace std;
using ll=long long;
#define FOR(i,a,b) for(ll i=(a);i<(b);++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 1; } return 0;}
template<class T>bool chmin(T &a, co... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
#include <stack>
#include <queue>
#include <list>
#include <numeric>
#include <fstream>
#define NDEBUG
#include <cassert>
using namespace std;
#define TEST
#ifdef T... | 0 | 44,576,740 |
#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <cstring>
#include <utility>
#include <vector>
#include <complex>
#include <valarray>
#include <fstream>
#include <cassert>
#include <cmath>
#include <functional>
#includ... | #include <fstream>
#include <iostream>
using namespace std;
#define MOD 998244353
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,b) FOR(i,0,b)
#define RFO(i,a,b) for (int i = (b-1); i >= (a); i--)
#define RF0(i,b) RFO(i,0,b)
#define lli long long int
#define pii pair<int,int>
#define add(a,b) ((int) (... | 0 | 100,283,946 |
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
template... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#include <bitset>
#define ll long long
using namespace std;
using p = pair<ll, ll>;
ll dx[4] = {-1, 0, 1, 0};
ll dy[4] = {0, 1, 0, -1};
int main(void){
ll n;
cin >> n;... | 0 | 28,692,216 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,M;
cin >> A >> B >> M;
vector<int> a(A),b(B);
int x,y,c;
int i;
int pa=100000,pb=100000;
int price;
for(i=0; i<A; i++){
cin >> a.at(i);
if(pa>a.at(i)) pa=a.at(i);
}
for(i=0; i<B; i++){
cin >... | 0 | 53,492,467 |
#include <cstring>
#include <iostream>
struct card {
char mark;
unsigned int number;
};
static void print_cards(const card cards[], const unsigned int n) {
const char* sep = "";
for (unsigned int i = 0; i < n; ++i) {
const card* const cardp = &cards[i];
std::cout << sep << cardp->mark << cardp->number;
... | #include <bits/stdc++.h>
using namespace std;
void err() {
cout << -1 << endl;
exit(0);
}
void dfs (int crr, int dpt, vector<vector<int>>& grh, long long& cnt) {
cnt += dpt;
for (int nxt : grh[crr]) {
dfs(nxt, dpt + 1, grh, cnt);
}
}
int main() {
int n;
cin >> n;
vector<long long> d(n);
map<long l... | 0 | 15,366,972 |
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <algorithm>
#include <climits>
#include <iomanip>
#define endl "\n"
#define debug(x) cout << #x << " : " << x << endl;
#define debug2(x, y) cout << #x << " : " << x << ", " <<... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
int main(){
priority_queue<long long> que;
long long n,m;
cin >> n >> m;
LL a[n];
for(LL i=0;i<n;i++){
cin >> a[i];
que.push(a[i]);
}
for(LL i=0;i<m;i++){
LL b = que.top();
que.pop();
que.push(b/2);
}
LL ans = 0;
for(LL i=0;i<n;i++){
... | 0 | 16,721,582 |
#include <iostream>
using namespace std;
bool isEven(const string &s){
int mid = s.length() / 2;
for(int i = 0 ; i < mid ; ++i){
if(s[i] != s[i + mid]) return false;
}
return true;
}
int main(int argc, char const *argv[])
{
string s;
cin >> s;
s.pop_back(); s.pop_back();
while(!i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int k;
cin >> k;
vector<ll> a(k);
for(int i = 0; i < k; i++)
{
cin >> a[i];
}
if(a[k-1] != 2)
{
cout << -1 << endl;
return 0;
}
ll l = 2, h = 3;
for(int i = k-2; i >= 0; i... | 0 | 100,522,817 |
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
using namespace chrono;
using ll = long long;
using ii = pair<int, int>;
constexpr int MN = 200002;
int N, A[MN];
time_point<high_resolution_clock> start;
void fast_incorrect() {
int ans = 0;
map<int, int> M;
for (int i = 1; i < ... | # include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { re... | 0 | 79,731,389 |
#include <iostream>
using namespace std;
int main() {
bool judge = true;
int x, y;
int n = 0;
while (judge) {
cin >> x >> y;
if ((x == 0) && (y == 0)) {
judge = false;
} else {
if (x > y) {
cout << y << " " << x << endl;
} else {
cout << x << " " << y << endl;
}
}
}
... | #include <bits/stdc++.h>
typedef long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < int , int >
#define F first
#define S second
#define endl '\n'
#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-lo... | 0 | 7,564,453 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
#include <limits>
using namespace... | #include<bits/stdc++.h>
using namespace std;
#define inf INT_MAX
#define INF LLONG_MAX
#define ll long long
#define ull unsigned long long
#define M (int)(1e9+7)
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--)
#define ... | 0 | 2,461,853 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
long doubl... | #include <iostream>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin >> n;
ll a[52];
for(int i = 0; i < n; i++) cin >> a[i];
ll ans = 0;
while(true){
int l = 0;
for(int i = 1; i < n; i++){
if(a[i] > a[l]) l = i;
}
if(a[l] < n) break;
... | 0 | 94,319,946 |
#include <cctype>
#include <iostream>
#include <string>
using namespace std;
int main() {
string a, b, c;
cin >> a >> b >> c;
cout << char(toupper(a[0])) << char(toupper(b[0])) << char(toupper(c[0]))
<< endl;
return 0;
} | #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<int>;
using vvi = vector<vi>;
template<class T>... | 0 | 18,320,051 |
#include <iostream>
#include <stdlib.h>
#include <time.h>
using namespace std;
void roll_dice(char c, int d[])
{
int buf;
switch(c)
{
case 'N':
buf = d[6];
d[6] = d[5];
d[5] = d[1];
d[1] = d[2];
d[2] = buf;
break;
case '... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector... | 0 | 80,602,684 |
#pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
using base = complex<double>;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M 1000000007
#define M2 998244353
#define ll long long
#define pll pair... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<int, int> mp;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
mp[a]++;
}
int even = 0;
for (auto &x:mp) {
if (x.second % 2 == 0) even++;
}
int ans = mp.size();
if (even ... | 0 | 14,850,179 |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | 0 | 55,587,749 |
#include <iostream>
using namespace std;
int main(){
int n=1000 ,m ,coin=0;
while( true ){
cin >> m;
if( m == 0 ){
break;
}
n -= m;
if( n >= 500 ){
coin += n / 500;
n %= 500;
}
if( n >= 100 ){
coin += n / 100;
n %= 100;
}
if( n >= 50 ){
coin +... | #include <iostream>
#include <string>
using namespace std;
int main(int argc, char* argv[]) {
string s;
cin >> s;
int from_left[s.size()];
for (int i = 0; i < s.size(); ++i) {
if (i == 0)
from_left[0] = 1;
else if (s[i] == s[i - 1]) {
from_left[i] = from_left[i - 1];
} else {
from_... | 0 | 41,583,223 |
#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 rrep(i, n) for (int i = 1; i < (int)(n+1); i++)
int main() {
int N;
cin>>N;
vector<int>A(N);
int ans;
rep(i,N){
cin>>A[i];
if(i==0){
... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <cmath>
#include <functional>
#include <fstream>
#include <cstdlib>
typedef long long ll;
#define ... | 0 | 30,610,485 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<long> v(N+1);
v.at(0) = 2;
v.at(1) = 1;
for (int i = 2; i < N+1; i++){
v.at(i) = v.at(i-1) + v.at(i-2);
}
cout << v.at(N) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int remaining = n;
int left = 0, right = n - 1;
while (right -... | 0 | 26,109,630 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<functional>
using namespace std;
int flg[1000000];
int main(void)
{
int n,i,j,cnt;
while(scanf("%d",&n)!=EOF){
for(i=2;i<=n;i++) flg[i]=1;
for(i=2;i*i<=n;i++){
if(flg[i]==1){
for(j=2;i*j<=n;j++){
flg[i*j]=0;
}
}
}
cnt=0;
for(... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define printl(s) cout << s << endl;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll = long long;
using vvi = vector<vector<int>>;
const ll modSeed = pow(10,9) + 7;
const int INF = 1'000'000'000;
template <typename T>
vector<T> getVector(ll num){
... | 0 | 33,894,627 |
#include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
const bool debug=false;
#define DEBUG if(debug==true)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
int main(void) {
int n;
cin >>n;
int t[n],v[n];
rep(i,n)cin>>t[i];
rep(i,... | #include<bits/stdc++.h>
using namespace std;
const int INF=1e+9;
const int MOD=1e+9+7;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define REPD(i,n) for(int i=n-1;i>=0;i--)
#define REP2(i,a,b) for(int i=a;i<(int)(b);i++)
#define REPD2(i,a,b) for(int i=a;i>(int)(b);i--)
template<class T>
vector<T> make_vec(size_t a){
... | 0 | 8,653,500 |
#include <iostream>
using namespace std;
int main(void)
{
int X;
cin >> X;
int a, b, r, x;
a = 360;
b = X;
r = a % b;
x = a * b;
while (r != 0)
{
a = b;
b = r;
r = a % b;
}
int K;
K = (x / b) / X;
cout << K << "\n";
} | #include <iostream>
#include <vector>
#include <string>
#include <stack>
using namespace std;
bool isPair(char top, char input) {
if ((top == '(' && input ==')')
|| (top == '[' && input ==']')) {
return true;
}
return false;
}
void check(string str) {
stack<char> st;
for (int i = 0... | 0 | 1,899,719 |
#include<cstdio>
#define LL long long
#define eps 1e-6
int main(){
LL a,b,c;
double d;
scanf("%lld%lf",&a,&d);
d+=eps;
b=d*100;
c=a*b/100;
printf("%lld\n",c);
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; string s, t; cin >> n >> s;
int rc = 0, lc = 0;
for (auto i = 0; i < n; i++) {
if(s[i] == '(') rc++;
else {
if(rc == 0) lc++;
else rc--;
}
}
for (auto i = 0; i < lc; i++) t += "(";
t ... | 0 | 16,008,170 |
#include <bits/stdc++.h>
inline void rotate(std::string& s) {
const char t = s[s.size() - 1];
for (int i = s.size() - 1; i > 0; --i)
s[i] = s[i - 1];
s[0] = t;
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
std::string s;
std::getline(std::ci... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll,ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
c... | 0 | 28,388,739 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using pll = pair<long long, long long>;
int main() {
int N;
long long M;
cin >> N >> M;
vector<pll> v(N);
for (int i = 0; i < N; ++i) cin >> v[i].first >> v[i].second;
sort(v.begin(), v.end());
long long res = 0;... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#i... | 0 | 8,598,894 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vecto... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef long long unsigned int ... | 0 | 52,416,383 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=1005,INF=1000;
int main(){
ll N;cin>>N;
vector<ll> S(N);
bool flag=true;
ll sum=0,a=0;
for(int i=0;i<N;i++){
cin>>S[i];
sum+=S[i];
a+=(i+1);
... | #include<algorithm>
#include<bitset>
#include<climits>
#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_... | 0 | 17,190,452 |
#include <iostream>
#include <climits>
#include <vector>
#include <numeric>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
const int INF = INT_MAX / 2;
struct Edge{
int from, to, cost;
Edge( int f, int t, int c ) : from( f ), to( t ), cost( c )
{
return;
}
};
int main()
{
cin.tie( 0 );
ios... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
int main(){
int a, b, c; std::cin >> a >> b >> c;
int A = std::min({ a, b, c });
int C = std::max({ a, b, c });
int B = a + b + c - A - C;
if ((A % 2 == 0 && B % 2 == 0 ... | 0 | 53,595,925 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
#include <string.h>
#include <set>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L" <... | #include <iostream>
int main(void) {
std::string s1;
std::string s2;
std::getline(std::cin, s1);
std::getline(std::cin, s2);
bool compared = true;
for (int i = 0; i < s1.size(); i++) {
compared = true;
for (int j = 0; j < s2.size(); j++) {
int k = (i + j) % s1.size();
if (s1[k] != s2[j])... | 0 | 86,488,301 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if(n<=9){
cout << n << endl;
}
else if(n<=99){
cout << 9 << endl;
}
else if(n<=999){
cout << 9 + (n-100+1) << endl;
}
else if(n<=9999){
cout << 9 + (999-100+1) << endl;
}
else if(n<=99999){
cout << 9 + ... | #include<stdio.h>
int main()
{
int d,sum=0,t;
while(scanf("%d",&d) !=EOF)
{
sum=0;
t=d;
for(t;t<600;t+=d)
{
sum+=t*t*d;
}
printf("%d\n",sum);
}
return 0;
} | 0 | 98,224,939 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n, k;
while(cin >>n >>k){
if(n == 0 && k == 0) break;
vector<int> vec;
int max = 0, now = 0;
for(int i = 0; i < k; i++){
int tmp;
cin >>tmp;
max += tmp;
now +=... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define per(i,n) for(int i = n-1; i >= 0; i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
int main() {
ll n;
cin >> n;
vll a(n);
... | 0 | 49,339,321 |
#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
#include <cstdint>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph =... | #include<bits/stdc++.h>
#define ll long long
#define lowbit(x) (x&-x)
using namespace std;
const int N = 1e5+7, M = 1e3;
int a[N];
vector<int> vec[M];
int main()
{
int n;
scanf("%d", &n);n *= 2;
if(n==1)
{
puts("No");
return 0;
}
for(int i = 1; i*(i+1) <= n; i++)
{
if... | 0 | 1,662,181 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n];
int sum =0;
for(int i=0;i<n;i++)
{
cin>>a[i];
sum += a[i];
}
sum /= n;
int sum1 = sum+1;
int ans =0;
int ans2 = 0;
for(int i=0;i<n;i++)
{
ans += ( sum - a[i] )*(... | #include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
int main(){
ll a;
cin>>a;
string s;
string t;
vector<string> k(2*a);
cin>>s>>t;
rep(i,a){
k[2*i]=s[i];
k[2*i+1]=t[i];
... | 0 | 32,735,211 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
int main() {
int a,b,c;cin >> a>> b >> c;
ll sum=0;
for(int i = 0; i < b; i++) {
sum += a;
if(sum % b == c){
cout << "YES" << endl;
return 0;
}
... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < ... | 0 | 95,760,316 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,n;
int sum = 0;
cin >> N;
n = N;
for (int i = 0; i < N; i++) {
sum += N % 10;
N /= 10;
if (N % 10 == N) {
sum += N;
break;
}
}
if (n % sum == 0) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
... | #include <iostream>
#include <cstdio>
#include <map>
using namespace std;
int n, a[200005];
int lt=1, rt, md, ans;
int f(int p) {
int i, t;
map<int,int> mp;
if(p==1) {
for(i=2; i<=n; i++) if(a[i] <= a[i-1]) return 0;
return 1;
}
for(i=2; i<=n; i++) if(a[i] <= a[i-1]) {
t = a[i];
mp.erase(mp.upper_bound(t),... | 0 | 45,084,910 |
#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000
int main(){
string S;
cin>>S;
vector<int> dp(1<<26,Inf);
dp[0] = 0;
int now = 0;
for(int i=0;i<S.size();i++){
now ^= 1<<(S[i]-'a');
for(int j=0;j<26;j++){
d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define pb push_back
#defi... | 0 | 91,086,778 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <string>
#include <cmath>
#include <climits>
#include <cstdint>
using namespace std;
inline namespace atcoder {
template <typename T, size_t Depth>
struct vector_helper { using type = vector<typename vector_helper<T, Depth - 1>... | #include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
#define f2(i,j,k) for(int i=j;i>k;i--)
using namespace std;
int main(){
long long h,w;
cin>>h>>w;
char a[h][w];
vector<long long> H(h,0),W(w,0);
f(i,0,h){
long long c=0;
f(j,0,w){
cin>>a[i][j];
if(... | 0 | 96,276,938 |
#include<bits/stdc++.h>
#define int long long
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<int,int>
#define vi vector<int>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define sz(x) (int)x.size()
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e9;
const static ll MOD = 1e9+7;
int main(){
string S, S_; cin >> S; S_ = S;
set<char> ST;
for(auto ch : S) ST.insert(ch);
for(int i = 0; i < 26; i++){
char add = i+97;
if(ST.find(add) == ST.end())... | 0 | 63,826,789 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int x = 1;
int y = 1;
for (int i = 0; i < N; i++){
y *= 2;
if (x + K <= y){
x += K;
}else{
x *= 2;
}
}
cout << x << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i,a,b) for (ll i = (a), _b = (b); i <= _b; i++)
#define frr(i,a,b) for (ll i = (a), _b = (b); i >= _b; i--)
#define rep(i,n) for (ll i = 0, _n = (n); i < _n; i++)
#define repr(i,n) for (ll i = n - 1; i >= 0; i--)
#define fill(ar,val) memset(ar... | 0 | 81,946,562 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
int n, x; cin >> n >> x;
vector<int> co(n+1);
rep(i,n) {
int y; cin >> y;
co... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include ... | 0 | 89,493,482 |
#include <cstdio>
using namespace std;
int main() {
char c;
unsigned int cnt = 0;
unsigned int max_cnt = 0;
for (int i=0;i<3;i++) {
scanf("%c", &c);
if (c == 'R') {
cnt++;
} else {
cnt = 0;
}
if (cnt > max_cnt)
max_cnt = cnt;
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,n) for (int64_t i=0; i<(n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n; cin... | 0 | 72,770,564 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s; cin >> s;
string ans = "";
for (auto &&c : s)
{
if (c == '1')
{
ans.push_back('1');
}
if (c == '0')
{
ans.push_back('0');
}
if (c == 'B' && !ans.empty())
{
ans.pop_back();
}
}
cout << a... | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<set>
#include<string>
#include<stdio.h>
#include<cmath>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define repn(i, n) for(int i = 1; i <= n; i++)
#define all(x) (x).begin(), (x).end()
#define lint long long
int main(... | 0 | 77,176,739 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
int64_t INF = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t n;
cin >> n;
vi a(n);
rep(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
int n;
map<ll, ll> mp;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
vector<... | 0 | 78,120,806 |
#include<iostream>
#include<algorithm>
#include <array>
int main(void){
int x,y,temp;
while(1){
std::cin >>x>>y;
if (x == 0&&y == 0){
break;
}
if (x > y){
std::swap(x, y);
}
std::cout << x <<" "<< y << std::endl;
}
return 0;
} | #include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <set>
#include <map>
#include <stack>
#include <cmath>
#include <regex>
#include <iomanip>
#include <climits>
#include <utility>
#include <queue>
using namespace std;
using ll = long long int;
usin... | 0 | 42,363,284 |
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
const int MAXN=100005;
int n,m;
vector<int> adj[MAXN];
int col[MAXN];
bool dfs(int u,int color)
{
if(col[u])
return color==col[u];
col[u]=color;
bool ret=true;
for(int i=0;i<(int)adj[u].size();i++)
{
int v=adj[u][i];
if(!dfs(v,color==... | #include<stdio.h>
int main()
{
int n, m, mult, sum;
scanf("%d %d", &n, &m);
mult = n * 3;
sum = m + mult;
printf("%d\n", sum/2);
} | 0 | 97,606,427 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
typedef long long ll;
int main(){
string N;
cin >> N;
if (N.find("7") == string::npos) cout << "No" << endl;
else cout << "Yes... | #include <iostream>
using namespace std;
typedef long long ll;
int main(){
int N;
cin>>N;
ll res=1;
for(int i=1;i<=N;i++){
res*=(ll)i;
}
cout<<res<<endl;
return 0;
} | 0 | 67,849,109 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
bool a=true;
char C='a';
vector<string> W(N);
for(int i=0;i<N;i++){
cin >> W.at(i);
if(i!=0){
if(W.at(i).at(0)!=C){
a=false;
}
}
C=W.at(i).at(W.at(i).size()-1);
}
sort(W.begin(),W.end());
for... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | 0 | 35,120,965 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(x,n) for(int x=0;x<n;x++)
#define vei vector<int>
#define velli vector<long long int>
#define pb(x) push_back(x)
#define pb2 pop_back()
#define all(x) (x).begin(),(x).end()
#define be(x) (x).begin()
typedef pair<int,int> P;
int main()... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using v... | 0 | 96,233,375 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i,s,n) for(int i = s;i<n;i++)
#define repe(i,s,n) for(int i = s;i<=n;i++)
#define pb push_back
#define fi first
#define se second
typedef long long ll;
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
static co... | #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 | 45,441,538 |
#include <iostream>
#include <climits>
#include <vector>
class TMinimumMultiplications
{
std::vector<std::vector<int> > FTable;
std::vector<std::pair<int, int> >& FMatrixChain;
int GetMinimum(int Begin, int End);
public:
TMinimumMultiplications(std::vector<std::pair<int, int> >& MatrixChain);
int Get(int Begin, in... | #include<bits/stdc++.h>
using namespace std;
bool same(int x){
vector<int> v;
while(x){
v.push_back(x%10);
x/=10;
}
int a=v[0];
for(int i=1;i<v.size();i++) if(v[i]!=a) return 0;
return 1;
}
signed main(){
int n;
cin>>n;
while(!same(n)) n++;
cout<<n;
return 0;
} | 0 | 65,602,131 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | #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 | 99,458,890 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.