code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <stdio.h>
#include <string.h>
int main(void) {
char x[1000] = "";
int sum;
do {
sum = 0;
scanf("%s", x);
for (int i = 0; i < strlen(x); i++) {
sum += (x[i] - '0');
}
if (sum < 1) break;
printf("%d\n", sum);
} while (true);
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define E "\n"
using namespace std;
const long long MOD = (long long)1e9 + 7;
int n, X, Y, x, y, cur, dat[2000][2];
vector<string> ans;
vector<char> apd;
bool ck(int u, int v, int d)
{
if (abs(u) + abs(v) <=... | 0 | 20,837,104 |
#include <stdio.h>
using namespace std;
int main(){
int n,taro_point = 0,hanako_point = 0,j;
char taro_card[101],hanako_card[101];
scanf("%d",&n);
for(int i = 0; i < n; i++){
scanf("%s %s",taro_card,hanako_card);
for(j = 0; taro_card[j] != '\0' && hanako_card[j] != '\0' && taro_card[j] == hanako_card[j];j++);
... | #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 | 100,829,528 |
#include "bits/stdc++.h"
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define debug(...) cerr<<__LINE__<<... | 0 | 68,935,781 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c=0;
cin>>a>>b;
c=a-b;
++c;
cout<<c;
} | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 82,559,491 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int n; cin >> n;
vector<vector<int>> a(n,vector<int>(n,0));
for(int i=0;i<n;i++){
int u,k; cin >> u >> k;
if(k==0) continue;
for(int j=0;j<k;j++){
int v; cin >> v;
... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | 0 | 98,554,662 |
#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 = 1001001001;
int main(){
int n;
cin >> n;
vector<int> x(n);
rep(i,n) cin >> x[i];
int ans = INF;
for(int i=1; i <= 100; ++i){
int sum = 0;
rep(j... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int n, m;
cin >> n >> m;
vector<int> p(m), y(m);
rep(i,m) {
cin >> p[i] >> y[i];
p[i]-... | 0 | 16,909,886 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
cout<<a+b+c-max(a,max(b,c));
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define In_The_Name_Of_Allah_The_Merciful ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define Alhamdulillah return 0;
#define all(v) v.begin(),v.end()
#define debug(n) cerr << "[" << #n << " = " << n << "]" << endl
const int N = 1... | 0 | 25,040,868 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <map>
#include <vector>
#include <iomanip>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<string> S;
string s;
int T[N];
for (int i = 0; i < N; i++) {
cin >> s >> T[i];
S.push_back(s);
}
string X... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vll;
#define fi first
#define print(v) for(ll i:v) cout<<i<<ss
#define se second
#define pb push_back
#define nn "\n"
... | 0 | 34,606,503 |
#include <bits/stdc++.h>
using namespace std;
struct Unionfind {
vector<int> par;
Unionfind(int n = 1) : par(n, -1) {}
int root(int x) {
if (par[x] < 0) return x;
return par[x] = root(par[x]);
}
bool issame(int x, int y) { return root(x) == root(y); }
bool uni(int x, int y) {
x = root(x);
y ... | # include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
typedef long long ll;
unordered_set<ll>SET;
unordered_map<ll,int>byk;
const int N=2e5+5;
int arr[N];
ll ps[N];
ll kombin(ll x){
return x*(x-1)/2;
}
int main(){
io... | 0 | 13,424,578 |
#include <iostream>
#include <unordered_map>
#include <vector>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
unordered_map<string, int> order;
vector<int> times(N,0);
for (int i = 0; i < N; i++) {
string title;
int time;
cin >> title >> time;
times[i] = time;
order[title] = i;
}
... | #include <bits/stdc++.h>
#define f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,b,k) for( ll i = a; i >= b ; i-= k)
#define ones(x) (ll) __builtin_popcount(x)
#define fs first
#define sc second
#define pb push_bac... | 0 | 7,338,985 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define MIN(a,b) ((a)>(b)? (b): (a))
#define MAX(a,b) ((a)<(b)? (b): (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main(){
int a,b;
cin >> a >> b;
... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 17,381,037 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main(){
char S, T; cin >> S >> T;
if(S < T) cout << '<' << endl;
else if(S == T) cout << '=' << endl;
else cout << '>' << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef unsigned long ul;
typedef pair<ul, ul> P;
int main() {
int n;
int t[110000], x[110000], y[110000];
t[0] = x[0] = y[0] = 0;
cin >> n;
for(int i = 1; i < n + 1; i++) {
cin >> t[i] >> x[i] >> y[i]... | 0 | 4,310,504 |
#include <bits/stdc++.h>
using namespace std;
int MOD=1000000007;
int main(){
int N; long long K; cin >> N >> K;
int A[2000];
for(int i=0; i<N; i++) cin >> A[i];
long long inner=0,outer=0;
for(int i=0; i<N; i++){
for(int j=0; j<N; j++){
if(A[i]>A[j]){
outer++;
if(i<j) inner++;
... | #include <iostream>
using namespace std;
const int maxn = 1e5;
int h[maxn];
int dp[maxn];
int N, K;
int main(int argc, char const *argv[])
{
cin >> N >> K;
for(int i = 0 ; i<N ; i++){
cin >> h[i];
}
dp[0] = 0;
for(int i = 1 ; i<N ; i++){
int minx = 0x3f3f3f3f;
for(int j = 1 ;... | 0 | 93,067,315 |
#pragma target("avx")
#pragma optimize("O3")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k; cin >> n >> k;
const int p = 200001;
vector<int> num(p);
for (int i = 0; i < n; i++) {
int a; cin >> a;
num[a]++;
}
sort(num.begin(), num.end(), greater<int>());
int cnt = 0;
for (int i = 0; i < k; i++) {
cnt += num... | 0 | 26,575,325 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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(){
ios::sync_with_stdio(false);
cin.tie(0);
int h1,m1,h2,m2,k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int hun = ((h2+24)*60 + m2 - ((h1*60)+m1))%(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int64_t... | 0 | 55,291,122 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long int n,i=0,j,c=0,p,m=0,max=0,h[100000],dp[100000];
string s;
cin >> n;
for(i=0;i<n;i++)
{
cin >> h[i];
}
dp[1]=abs(h[0]-h[1]);
dp[2]=abs(h[0]-h[2]);
for(i=3;i<n;i++)
{
dp[i]=min(abs(h[i]-h[i... | #include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
typedef tuple<long long, long long, long long> tllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
bool compTuple(co... | 0 | 57,942,313 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin>>n; --n;
int sqn = sqrt(n);
int c = 0;
for(int x=1; x<=sqn; ++x) c += (n / x - x) * 2 + 1;
cout<< c <<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | 0 | 79,184,578 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
ll dp[100001][2] = {};
int main(){
int n, i, j;
string l;
cin >> l;
n = l.length();
dp[i][0] = 1;
for(i=0; i<n; i++){
if(l[i] == '0'){
dp[i+1][0] = dp[i][0];
... | #include<bits/stdc++.h>
using namespace std;
#define ll long int
int main()
{
string s;
cin>>s;
int n=s.length();
int l1=(n-1)/2;
int l2=(n+3)/2;
bool pahla=true;
bool dusra=true;
for(int i=0, j=l1-1;i<=j;i++, j--)
{
if(s[i]!=s[j])
{
pahla=false;
... | 0 | 37,904,630 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie... | #include <bits/stdc++.h>
#include <regex>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main(){
int n;
cin>>n;
uint64_t ans;
vector<uint64_t>a(100000);
ans=1;
uint64_t k=1;
rep(i,18){
k*=10;
... | 0 | 32,385,881 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main(){
ll n, m; cin >> n >> m;
map<ll,ll> data;
ll sum = 0; data[0]++;
for(int i=0; i<n; i++){
ll a; cin >> a;
sum += a;
sum %= m;
data[sum]++;
}
ll ans = 0;
for(auto x : data) ans += x.s... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const double PI = 3.1415926535897932384;
const int INF = 1000000000;
const ll LINF = 1000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijklmnopqrstuvwxyzabc";
const ll MOD = 1000000007;
struct UnionFind... | 0 | 27,617,258 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
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>;
#define ll long long
#define mod 1000000007
#define ... | #include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#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_... | 0 | 37,777,473 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define MOD 1000000007ULL;
#define rep(i,n) for(ll i=0;i<n;i++)
int main() {
ll K,S;
cin>>K>>S;
ll count=0;
rep(x,K+1){
rep(y,... | #include<bits/stdc++.h>
using namespace std;
#define lint long long
#define P pair<int, int>
#define LLP pair<long long, long long>
#define REP(i, x, n) for(int i = (x), i##_len = (int)(n) ; i < i##_len ; ++i)
#define rep(i, n) for(int i = 0, i##_len = (int)(n) ; i < i##_len ; ++i)
#define repr(i, n) for(int i = (int)(... | 0 | 22,748,324 |
#include <bit>
#include <bitset>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <stack>
typedef long double ld;
typedef long long ll;
us... | #include <iostream>
#include <string>
using namespace std;
int main()
{
string n;
while(1){
cin >> n;
if(n=="-"){
break;
}
int h;
cin >> h;
for(int i=0;i<h;i++){
int s;
cin >> s;
n = n.substr(s)+n.substr(0,s);
}
cout << n << endl;
}
return... | 0 | 27,232,997 |
#include "bits/stdc++.h"
using namespace std;
int main() {
long long N, ANS = 1, MOD = 1000000007;
string S;
cin >> N >> S;
S = 'W' + S + 'W';
vector<long long> V1, V2;
V1.resize(N * 2 + 1);
V2.resize(N * 2);
for (int i = 0; i < N * 2 + 1; i++) {
if (S[i] == S[i + 1]) V1[i] = 0;
else V1[i] = 1;
}
for (int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int count_digits(int x) {
int count = 0;
while (x) {
count += x % 10;
x /= 10;
}
return count;
}
int main() {
int n, a, b;
cin >> n >> a >... | 0 | 5,784,817 |
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
using std::min; using std::max;
using std::swap; using std::sort;
using std::upper_bound;
typedef long long ll;
template<typename T>
void read(T &x) {
int flag = 1; x = 0; char ch = getchar();
while(ch < '0' || ch > '9') { if(ch == '-') flag =... | #include <bits/stdc++.h>
using namespace std;
#define TRACE(x) x
#define WATCH(x) TRACE(cout << #x" = " << x << endl)
#define WATCHR(a, b) TRACE(for (auto it=a; it!=b;) cout << *(it++) << " "; cout << endl)
#define WATCHC(V) TRACE({cout << #V" = "; WATCHR(V.begin(), V.end());})
#define sz(x) int((x).size())
#define all... | 0 | 23,605,936 |
#include <iostream>
using namespace std;
int main() {
int A, B; cin >> A >> B;
if (A % 3 == 0 || B % 3 == 0 || (A + B) % 3 == 0) printf("%s\n", "Possible");
else printf("%s\n", "Impossible");
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | 0 | 80,207,985 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n,m,x,y;
int hantei = 0;
cin >> n >> m >> x >> y;
int X[n],Y[m];
for(int i=0;i<n;i++){
cin >> X[i];
if(X[i] == y || X[i]>y){
hantei = 1;
break;
}
}
for(int i=0;i<m;i++){
... | #include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
using namespace std;
#define FOR(i,k,n) for(int i=(k); i<(int)(n); +... | 0 | 2,836,729 |
#include<bits/stdc++.h>
#define INF 2000000000
#define MOD 1000000007
#define EPS (1e-10)
using namespace std;
vector<int> dx = {1,-1,0,0};
vector<int> dy = {0,0,1,-1};
int main() {
int h,w; cin >> h >> w;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
string str; cin >> str;
if (str == "snuke"... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vc vector<char>
#define mii map<int,int>
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define get_bit(x, k) ((x >> k) & 1)
void MAIN() {
string s, t;
cin >> s >> t;
... | 0 | 6,005,512 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<map>
#include<tuple>
#include<algorithm>
#include<cmath>
#include<limits>
#include<set>
#include<deque>
#include<queue>
#include<stack>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int... | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
string mes[] = {
".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz"
};
int main() {
int n;
cin >> n;
while(n--) {
string s;
cin >> s;
int N = s.size();
int pos = -1;
int stock = -1;
... | 0 | 13,883,675 |
#include<iostream>
#include<cmath>
#include<cstdio>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<utility>
#include<algorithm>
#include<cstring>
#include<sstream>
#include <iomanip>
using namespace std;
typedef long long ll ;
typedef double db;
typedef vector<int> vi;
typedef pai... | #include <iostream>
#include <vector>
#include <algorithm>
void showVector(std::vector<int> readVec){
int size = readVec.size();
for(int i = 0; i < size; ++i){
std::cout << readVec.at(i);
if(size - 1 != i){
std::cout << " ";
}else{
std::cout << std::endl;
... | 0 | 30,749,765 |
#include<iostream>
#include<string>
bool check_upper(char c);
int main()
{
char c;
std::cin >> c;
if( check_upper(c) )
{
std::cout << "A";
return 0;
}
std::cout << "a";
return 0;
}
bool check_upper(char c)
{
if( 65 <= (int)c && (int)c <=90 )
{
return true;
... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
rep... | 0 | 7,199,484 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
int n, k;
cin >> n >> k;
cout << (n % k != 0) << '\n';
}
signed ... | #include <iostream>
#include <bits/stdc++.h>
#define ll long long int
#define d 1000000007
using namespace std;
int main()
{
int t;
t=1;
while(t--)
{
int n;
cin >> n;
ll total=0;
for(int i=1;i<n;i++)
{
for(int j=1;j*i<n;j++)
{
... | 0 | 9,732,760 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define srep... | #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 x;
cin >> x;
int ans = 0;
rep(a, 100) {
int sa = x;
sa -= a * 101;
if (sa < 0) continue;
rep(b, 50) {
i... | 0 | 3,784,578 |
#include <iostream>
#include <cstdio>
#include <string>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <ctime>
using namespace std;
#define rep(i,a,n... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/priority_queue.hpp>
typedef __gnu_pbds::priority_queue<int> pq;
int main(void) {
int n, m; scanf("%d %d", &n, &m);
int k; scanf("%d", &k);
vector<int> x(k), y(k);
vector<int> c(m, 0);
vector<vector<int>> g(n);
pq q;
for (int i... | 0 | 73,176,470 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for(int i=0;i<(int)n;i++)
#define PI acos(-1)
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
ll mod=1e9+7;
int main(){
fast_io
int k;
cin>>k;
int a[32]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1,... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,l;
cin>>n>>l;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
int ind=-1;
for(int i=0;i<n-1;i++)
{
if(arr[i]+arr[i+1]>=l)
{
ind =i;
break;
}
}
if(ind==-1)
{
cout<<"Impossible"<<endl;
}
else
{
cout<<"Possible"<<endl;
for... | 0 | 99,388,946 |
#include<iostream>
using namespace std;
int H, W;
int main() {
string s;
cin >> H >> W;
for (int i = 0; i < H; i++) {
cin >> s;
cout << s << endl;
cout << s << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
int head(int n) {
string s = to_string(n);
return s[0] - '0';
}
int tail(int n) {
string s = to_string(n);
return s[s.length() - 1] - ... | 0 | 77,362,107 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
long long N;
cin >> N;
vector<long long> A_vec;
long long A;
long long i;
for(i=1; i<=N; i++){
cin >> A;
A_vec.push_back(A-i);
}
sort(A_vec.begin(),A_vec.end());
A = A_vec[N/2];
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#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 rep11(i,n) for(int i=1;i<(int)(n);++i)
#define repo(i,o,n) for(int i=o;i<(int)(n);++i)
#define repm(i,n) for(int i=(i... | 0 | 81,618,647 |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi vector<vector<int> >
#define vvl vector<vector<l... | #include<bits/stdc++.h>
using namespace std;
#define rep0(i,n) for(i=0;i<n;i++)
#define rep1(i,n) for(i=1;i<n;i++)
#define test(a) cout << "*" << a << endl;
int main(){
string s;
bool existAC = false;
int i;
int existC=false;
int placeC;
cin >> s;
if(s[0]=='A'){
for(i=2;i<s.size()-1;i++){
if(s[i... | 0 | 73,073,106 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Y... | #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(){
function<l... | 0 | 93,156,447 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree< int , null_type, less<int>, rb_tree_tag, tree_order_statis... | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i,n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i... | 0 | 87,368,890 |
#include <bits/stdc++.h>
using namespace std;
long long n, a[100002], v[100002], ans[100002];
vector<int>p;
int main()
{
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> v[i];
a[i] = v[i];
}
sort(a + 1, a + n + 1);
for (int i = n; i >= 1; i--) {
while (!p.empty() && v[i] >= v[p.back()])
p.pop... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int n, a[50];
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
int ans = 0;
for (int i = 0; i < n; i++)
{
for (int j = i + 1; j < n; j++)
{
ans += a[i] *... | 0 | 47,672,776 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const ll Mod = 998244353;
const int MAX = 510000;
const double PI = 3.14159265358979323846;
int main() {
int N;
string S;
cin >> N >> S;
map<char, ll> dict;
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned lo... | 0 | 69,255,395 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <iomanip>
#include <map>
#include <set>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <string>
#include <limits>
using namespace std;
using i64 = int64_t;
using P = pai... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 99,210,142 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define f(a, b) for (ll i = a; i <= b; i++)
#define pb push_back
#define pf push_front
#define mp make_pair
using namespace std;
#define N 200005
const ll INF = 1000000000000000001;
const ll MOD = 1000000000;
void solve(){
ll n; cin >> n;
ll a... | 0 | 98,434,068 |
#include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deq... | #include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+10;
int n,m,x,y,ind[maxn];
signed main()
{
cin>>n>>m;
for(int i=1;i<=m;i++)cin>>x>>y,ind[x]++,ind[y]++;
for(int i=1;i<=n;i++)
if(ind[i]&1)puts("NO"),exit(0);
puts("YES");
return 0;
} | 0 | 88,927,700 |
#include<iostream>
#include<vector>
using namespace std;
using ll=long long;
int main(){
int n;
cin>>n;
ll now=1;
ll MAX=1e18;
vector<ll> a(n);
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]==0){
cout<<0<<endl;
return 0;
}
}
for(int i=0;i<n;i++){
if(MAX/now<a[i]){
cout<<-1<<e... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
#define INF 10000... | 0 | 63,515,136 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vect... | #include <bits/stdc++.h>
using namespace std;
#ifdef zxc
#include "debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
using ll = int64_t;
using ld = long double;
const ld EPS = 1e-10;
const ll MOD = 1e9 + 7;
const ld PI = 3.141592653589793;
const i... | 0 | 53,691,011 |
#include <bits/stdc++.h>
using namespace std ;
typedef double du ;
typedef string st ;
typedef long long ll ;
typedef long double ld ;
typedef long long int lli ;
#define vi vector <lli>
#define loop(num) for (lli i = 0 ; i < num ; i ++ )
#define loopcin(num , ar ) for (lli i = 0 ; i < num ; i ++ ) {cin >> ar [i] ;}
#d... | #include <stdio.h>
int main ( void )
{
puts ( "1x1=1\n1x2=2\n1x3=3\n1x4=4\n1x5=5\n1x6=6\n1x7=7\n1x8=8\n1x9=9\n2x1=2\n2x2=4\n2x3=6\n2x4=8\n2x5=10\n2x6=12\n2x7=14\n2x8=16\n2x9=18\n3x1=3\n3x2=6\n3x3=9\n3x4=12\n3x5=15\n3x6=18\n3x7=21\n3x8=24\n3x9=27\n4x1=4\n4x2=8\n4x3=12\n4x4=16\n4x5=20\n4x6=24\n4x7=28\n4x8=32\n4x9=36\n5... | 0 | 59,167,671 |
#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)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #include<bits/stdc++.h>
using namespace std;
#define N 12000
int n,x,y,d,cnt[2],c[2][N];
bool f[N],g[N];
char s[N];
int main(){
scanf("%s%d%d",s+1,&x,&y); n=strlen(s+1);
int i;
for (i=1;i<=n && s[i]=='F';i++) x--;
d=0;
for (;i<=n;i++)
if (s[i]=='F'){c[d][c[d][0]]++; cnt[d]++;}
else{d... | 0 | 41,150,846 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long long LL;
vector<vect... | 0 | 20,527,264 |
#include <iostream>
using namespace std;
int main(){
int a;
cin >> a;
cout << a*800 - a/15*200;
} | #include <bits/stdc++.h>
using namespace std;
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi acos(-1.0)
#define nl '\n'
#define mem(a,b) memset(a,b,sizeof(a))
#define all(a) a.begin(),a.end()
#define Sort(x) sort(x.begin(),x.end())
#define Reverse(x) r... | 0 | 78,961,718 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#i... | #include<iostream>
#include<string>
using namespace std;
int main(){
string s;
cin >> s;
string ope[3];
for(int op=0;op < (1<<3);op++){
int sum = 0;
sum = s[0] - '0';
for(int i=0;i < 3;i++){
if((op >> i) & 1){
sum += s[i+1] - '0';
ope[i] = '+';
}else{
sum -= s[i+1... | 0 | 100,771,808 |
#include <iostream>
int main()
{
int a,hanako = 0,tosiki = 0;
std::cin >> a;
std::string str1,str2;
for(int b = 0; b < a;b++){
std::cin >> str1;
std::cin >> str2;
if(str1 < str2){
tosiki = tosiki + 3;
}
if(str1 > str2){
hanako = hanako + 3;... | #include<bits/stdc++.h>
#include<stdio.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,n) FOR(i,0,n)
#define _USE_MATH_DEFINES
#define f first
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define INF 1000000000000000000
#define MAXN (int)(1e7)+1
#define MOD 1000000007
using na... | 0 | 60,273,292 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int n, b = 0, a = 0, ba=0;
cin >> n;
int ans = 0;
rep(i,n) {
string s;
cin >> s;
for(int i = 0; i < s... | 0 | 35,020,117 |
#include <bits/stdc++.h>
using namespace std;
signed main(){
int P, Q, R;
scanf("%d%d%d", &P, &Q, &R);
printf("%d\n", P + Q + R - max({P, Q, R}));
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
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 repr(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define lint long long
int main(){
int a, b; cin >> a >> b; ... | 0 | 27,603,006 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
int main()
{
std::cout << std::setprecision(20);
int N;cin >> N;
vector<pair<double, pair<int, int>>> vec;
for(int i = 0;i < N;i++){
int b,c;cin >> b >> c;
if(b == 0 && c == 0)vec.push_back(make_pair(0, make_pair(b, c)))... | 0 | 68,159,743 |
#include <bits/stdc++.h>
using namespace std;
template<class T>
T ceil(T a, T b) {
return (a+b-1)/b;
}
int main() {
int n, x, t;
cin >> n >> x >> t;
int ans = t * ceil(n,x);
cout << ans << endl;
} | #include <stdio.h>
int face[7][7][4] = {
{{0},{0},{0},{0},{0},{0},{0}},
{{0},{0},{0,1,2,3},{0,1,3,5},{0,1,4,2},{0,1,5,4},{0}},
{{0},{0,2,1,4},{0},{0,2,3,1},{0,2,4,6},{0},{0,2,6,3}},
{{0},{0,3,1,2},{0,3,2,6},{0},{0},{0,3,5,1},{0,3,6,5}},
{{0},{0,4,1,5},{0,4,2,1},{0},{0},{0,4,5,6},{0,4,6,2}},
{{0},{0,5,1,3},{0},{0,5,3,6}... | 0 | 68,509,568 |
#include<iostream>
#include<string>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
const int Max = 1e3 + 7;
char lst[Max][Max];
int ls[Max][Max];
int main()
{
ll n, k;
cin >> n >> k;
ll sum = 1;
for (int i = 1; i <= n; i++)
{
sum += min(sum, k);
}
cout << sum;
} | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define rng(a) a.begin(), a.end()
#define ina(n,a) cin >> n; for(int i = 1; i <= n; i++) cin >> a[i]
#define sz(x) (int)(x).size()
#define se second
#define fi first
#define prev coyhhhhhhyoc
#define next sdNNNmNNNNNNNmd... | 0 | 88,268,387 |
#include <stdio.h>
int main(){
int N,M,C,D;
scanf("%d %d", &N, &M);
C=(N-1)*N/2;
D=(M-1)*M/2;
printf("%d", C+D);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Y... | 0 | 20,271,207 |
#include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) fo... | #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 = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | 0 | 4,335,793 |
#include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); i < (ll)(n); i++)
#define repe(i, f, n) for (ll i = (f); i <= (ll)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int, int>;
int main() {
int N;
cin >> N;
vector<int> a(N);
a[0] = 0;
rep(i, 0, N) {
cin >> a[i];
a[i]-... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int* mallocint(int si)
{
return (int*) malloc(si * sizeof(int));
}
int* inputint(int n)
{
int *ans = mallocint(n);
for( int i = 0; i < n; i++ ) cin >> ans[i];
return ans;
}
#define _LL long long
_LL gcd(int a, int b)
{
if( b == 0 ) re... | 0 | 15,868,514 |
#include <iostream>
#define int long long int
using namespace std;
void solve() {
int M;
cin >> M;
int ans = 0;
int sum = 0;
while (M--) {
int c, d; cin >> d >> c;
ans += c;
sum += d*c;
}
ans -= 1;
ans += (sum - 1)/9;
cout << ans << endl;
}
signed main() {
cin.tie(0);
ios::sync_with_st... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<int>
#define pii pair<int,int>
#def... | 0 | 89,517,592 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
ll gcd(ll a,ll b){ if(b==0) return a; return gcd(b,a%b);}
ll lcm(ll a,ll... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<pii > vii;
typedef vector<pll > vll;
#define pb push_back
#define mp make_pair
#define ar array
#define mod 1000000007
#define F first
#de... | 0 | 99,292,281 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main()
{
char x,y;
cin>>x>>y;
if(x>y)
cout<<">";
else if(x<y)
cout<<"<";
else
cout<<"=";
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define ld long double
#define mem(a, b) memset(a, (b), sizeof(a))
#define rep(i, j, k) for (int i = j ; i < k ; ++i)
#define rrep(i, j, k) for (int i = j; i > k; --i)
#define all(cont) cont.begin(), cont.end()
#define ra... | 0 | 97,649,384 |
#include <iostream>
#include <cstring>
using namespace std;
char a[5] = {'.', ',', '!', '?', ' '};
int main(){
int n;
cin >> n;
for(int i = 0; i < n; i++){
string str;
cin >> str;
int t = 0, s = -1;
for(int j = 0; j < str.size(); j++){
if(str[j] == '0'){
if(t == 0) continue;
if(t == 1){
s %= ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD 1000000007
int main (){
int N,M;
long long ans=0;
cin>>N>>M;
vector<pair<long long,long long>>energy(N);
rep(i,N){
long long a,b;
cin>>a>>b;
energy[i]=make_pair(a,b);
}
sort(energy.be... | 0 | 73,538,155 |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<utility>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#define EPS 1e-9
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#defi... | #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 A, B, C;
cin >> A >> B >> C;
bool isYes = false;
rep(i, 1000) {
rep(j, 1000) {
if ((A * i) - (B ... | 0 | 57,006,580 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(long long N, long long M){
ll max_val = max(M/2, N);
ll ans;
if(max_val == N) ans = M/2;
else ans = N + (M/2-N)/2;
cout << ans << endl;
}
int main(){
long long N;
scanf("%lld",&N);
long long M;
scanf("%lld... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<s... | 0 | 5,669,494 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define f(a, b) for (ll i = a; i <= b; i++)
#define pb push_back
#define pf push_front
#define mp make_pair
using namespace std;
#define N 200005
const ll INF = 1000000000000000001;
const ll MOD = 1000000000;
void solve(){
ld n, x, t; cin >> n >> ... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);
using namespace std;
namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const ... | 0 | 19,234,843 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 1e9 + 7, MAX = 1e18, larg = 1e5, INF = -1e9;
long long A, B, C, D, E, F, G, H, I, J, K, L, N, M, O, P, Q, R, S, T, U, V, W;
typedef long long ll;
typedef pair<ll, ll> Pa;
priority_queue<Pa> que;
int ... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, a, n) for (ll i = a; i < (ll)n; ++i)
using namespace std;
int main(void)
{
ll n;
cin >> n;
vector<ll> a(n);
rep(i, 0, n) cin >> a[i];
ll sum = 0, res = 0, right = 0;
rep(left, 0, n)
{
while (right < n && ((sum ^ a[right]) ... | 0 | 16,971,807 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,a;
cin >> N;
a=0;
for(int i=0;i<N;i++){
a+=(i+1);
}
cout << a <<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#... | 0 | 36,008,941 |
#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 ... | #include <iostream>
using namespace std;
typedef struct
{
char suit;
char value;
} Card;
void bubbleSort(Card* a,int n)
{
int i=0,j;
Card temp;
bool flag = true;
while(flag)
{
flag = false;
for(j=n-1; j>=i+1; j--)
{
if(a[j].value<a[j-1].value)
{
temp=a[j];
a[j]=a[j-1];
a[j-1]=temp;
fl... | 0 | 73,512,899 |
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
using namespace std;
#define ll long long
#define all(x) x.begin(),x.end()
int const N = 200001;
int n, m;
vector<pair<int,int>> g[N];
string id[N];
int main(){
scanf("%d%d", &n, &m);
for(int i = 0; i<m; ++i){
int x, y;
... | #include<iostream>
#include<queue>
using namespace std;
int main(){
priority_queue<int> pq;
string order;
while(true){
cin >> order;
if(order == "insert"){
int key;
cin >> key;
pq.push(key);
}
else if(order == "extract"){
cout<<... | 0 | 38,411,411 |
#include<iostream>
using namespace std;
int main(){
int n,i=1;
while(1){
cin >> n;
if(n == 0) break;
cout << "Case " << i << ": " << n << endl;
i++;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repp(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define rrep(i, n, m) for (int i = n; i >= m; i--)
#define ALL(a) (a).begin(), (a).end()
#define p(a, b) printf(a, b);
#define c(s) cout << (s) << endl;
#define yes... | 0 | 31,722,523 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi first
#def... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define INF (1e9)
#define rep(i,n) for(int i=0;i<(int)n;i++)
vector<int> dat;
int n;
int main(){
int ans=0;
cin>>n;
dat=vector<int>(n);
rep(i,n) cin>>dat[i];
while(dat.size()){
ans++;
rep(i,dat.size()){
if(d... | 0 | 16,228,911 |
#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#define MIN 100000
using namespace std;
int main()
{
int a[6];
int flag=0,ans;
for(int i=1; i<6; i++)
{
cin>>a[i];
if(i>1)if(a[i]!=a[i-1])flag=1;
}
if(!flag)
{
if(a[1]%10==0){
cout<<a[1]*5<<endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<pair<int, int>> ab(n);
vector<pair<int, int>> cd(n);
rep(i, n) {
int tmpx, tmpy;
cin >> tmpx >> tmpy;
ab[i] = make_pair(tmpx,... | 0 | 33,517,824 |
#include <iostream>
#include <algorithm>
#include <vector>
template <typename Iterator>
auto findMaximumSum (Iterator begin , Iterator end) -> long long
{
long long res = * begin;
auto tmp = res;
for (auto ite = begin + 1; ite != end; ++ ite)
{
tmp += * ite;
res = std::max (res , tmp);
... | #include<iostream>
#include<algorithm>
#include<vector>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
vector<int> p;
int i;
for(i=0;i<n;i++){
int f;
cin >> f;
... | 0 | 20,398,594 |
#include <iostream>
int main(void){
int N, tmp_h, tmp=0, ans=0;
std::cin >> N >> tmp_h;
for(int i=1; i<N; ++i){
int h;
std::cin >> h;
if (h <= tmp_h){
++tmp;
tmp_h = h;
} else {
if (tmp > ans) ans = tmp;
tmp = 0;
tmp... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return 1;
}
return 0;
}
templa... | 0 | 72,855,615 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)j; i<(int)n; i++)
int main() {
int h,w; cin>>h>>w;
char c[h][w];
rep(i,0,h){
rep(j,0,w) cin>>c[i][j];
}
rep(i,0,h){
rep(j,0,w) cout<<c[i][j];
cout<<endl;
rep(j,0,w) cout<<c[i][j];
cout<<endl;
}
} | #include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& opera... | 0 | 37,492,380 |
#include <iostream>
#include <vector>
#include <map>
#include <string>
using namespace std;
int main() {
int n, m;
char key, val;
vector<string> dst;
while (true)
{
map<char, char> keymap;
cin >> n;
if (n == 0)break;
while (n-- > 0) {
cin >> key >> val;
keymap[key] = val;
}
cin >> m;
string new... | #define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include <unordered_map>
#define endl "\n"
#define all(v) v.begin(),v.end()
#define allr(s) s.rbegin(),s.rend()
#define RT(s) return cout<<s,0
#define sz(s) (int)(s.size())
#define PI acos(-1)
#define EPS 1e-8
#define watch(x) cout << (#x)<<" = "<<x<<endl
using... | 0 | 58,314,566 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
int a = 0, b = 0;
for (int i = 0; i < S.size(); i++) {
if (i % 2 == 0 && S.at(i) == '1') {
a++;
}
if (i % 2 == 1 && S.at(i) == '0') {
a++;
}
if (i % 2 == 1 && S.at(i) == '1') {
b++;
}
if ... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <vector>
#define pb push_back
#define ms(a) memset(a,0,sizeof(a))
#define ll long long
#define ull unsigned ll
using namespace std;
#define MAXN 60
#define MAXVAL (1e16+1000)
#define fastio ios_base::sync_with_stdio(... | 0 | 42,557,001 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
using namespace std;
usi... | #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 n,ans = 0;
cin >> n;
vector<pair<ll,int>> a;
for(ll i = 2; i * i <= n; i++){
int cnt = 0;
while (n%i == 0){
n/=i;
cnt++;
}
a.emp... | 0 | 18,606,670 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll,ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll,ll>>>
... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <queue>
#include <map>
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++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(... | 0 | 35,524,978 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vec... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i,n){
cin >> s.at(i);
sort(s.at(i).begin(),s.at(i).end());
}
vector<int> alp(26);
vector<int> ans(26,100);
int count=0... | 0 | 51,397,085 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1e9
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
template <typename T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {... | #include<iostream>
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered... | 0 | 80,913,649 |
#include <cstdio>
#include <vector>
#include <queue>
int testcase_ends() {
size_t N;
int A, B, C, X;
scanf("%zu %d %d %d %d", &N, &A, &B, &C, &X);
if (N == 0 && A == 0 && B == 0 && C == 0 && X == 0) return 1;
std::queue<int> q;
for (size_t i = 0; i < N; ++i) {
int y;
scanf("%d", &y);
q.push(y);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll N;
int findDigit(ll x, ll y)
{
ll s, t;
s = log10(x) + 1;
t = log10(y) + 1;
return max(s, t);
}
int main()
{
cin >> N;
ll s = sqrt(N);
ll res = N;
for (int i = 1; i <= s; i++)
{
if (N % i == 0)
{
... | 0 | 60,318,111 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | #include <bits/stdc++.h>
using namespace std;
#define rall(x) x.rbegin() , x.rend()
#define all(x) x.begin() , x.end()
#define fi first
#define se second
#define pb push_back
using ll = long long;
using ii = pair <ll , ll>;
void in(ll &x);
const ll N = 2e5 + 10;
#define singleCase
ll n,a[N],ps[N];
map <ll , ll> freq;
v... | 0 | 24,181,834 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
int a,b;
while(cin>>a>>b)
{
int c,d,e,f,g;
c=a-1;
d=(c*(c+1))/2.;
e=b-1;
f=(e*(e+1))/2.;
cout<<d+f<<endl;
}
return 0;
} | #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 calcBitLength(ll n) {
ll x = n;
ll ret = 0;
while (... | 0 | 82,549,378 |
#include <bits/stdc++.h>
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll; typedef vector<int> VI; typedef pair<ll,int> pii;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int D;
cin >> D;
switch(D){
case 22:
cout << "Christmas Eve Eve Eve" << endl;
break;
case 23:
cout << "Christmas Eve Eve" << endl;
break;
case 24:
cout << "Christmas Eve" << endl;
break;
case 25:
cou... | 0 | 56,314,453 |
#include <iostream>
#include <string>
using namespace std;
int main(){
while(true){
string s;
getline(cin, s);
if(s == ".")
return 0;
string stack = "";
for(auto &x:s){
if(x == '(' || x == '[')
stack.push_back(x);
else if(x ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | 0 | 50,190,986 |
#include "bits/stdc++.h"
using namespace std;
#define DEBUG(x) cout<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cout<<#v<<":";for(int i=0;i<v.size();i++) cout<<" "<<v[i]; cout<<endl
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1000000000
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<<")" << "\n";
#define DEB... | 0 | 7,608,821 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int n,r; cin >> n >> r;
int ans=r;
if(n<10) ans = r+100*(10-n);
cout << ans << endl;
return 0;
} | #include <iostream>
#include <stdio.h>
#include <math.h>
#define MAX 100
int H[MAX];
int n;
int parent(int i) {
int index = floor(i/2.0);
return H[index];
}
int left(int i) {
return H[2 * i];
}
int right(int i) {
return H[(2 * i) + 1];
}
int main() {
int val;
scanf("%d", &n);
for (int i = 1;... | 0 | 98,903,614 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll a,b,c,k,count=0;
cin>>a>>b>>c>>k;
if(b<=a) count = (ll)(log2(a/(b*1.0)))+1;
b = b*((ll)(pow(2,count)));
if(c<=b) count += (ll)(log2(b/(c*1.0)))+1;
if(co... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define whatis(x) cout << #x << " is " << x<<" ";
#define whatisl(x) cout << #x << " is " << x<<"\n";
#define parr(array,end)for(ll loop=0;loop<end;loop++)cout<<array[loop]<<" ";cout<<"\n";
#define lline cout<<"\n";
#define e... | 0 | 22,402,710 |
#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() {
string s;
cin >> s;
int n = s.size();
int tmp;
int ans = 760;
for (int i = 0; i < (n-2); ++i){
tmp = (s[i]-'0')*100+(s[i+1]-'0')*10+(s[i+2]-'0');
an... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v) \
for (int64_t i = 0; i < (v)... | 0 | 93,859,516 |
#include <iostream>
int main() {
std::string s, t;
std::cin >> s >> t;
std::sort(s.begin(), s.end());
std::sort(t.begin(), t.end());
std::reverse(t.begin(), t.end());
std::cout << ((s < t)?("Yes"):("No")) << std::endl;
return 0;
} | #include<cstdio>
#include<cstdlib>
#include<cmath>
#include<climits>
#include<iostream>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<numeric>
#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) f... | 0 | 28,962,979 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | #include <bits/stdc++.h>
#define uni(x) (x).resize(unique(ALL(x)) - (x).begin())
#define fprint(v) for(auto x : v) cout << x << ' '
#define ALL(x) (x).begin(), (x).end()
#define MP(x, y) make_pair(x, y)
#define SZ(x) int((x).size())
#define PB(x) push_back(x)
#define ll long long
#de... | 0 | 50,362,153 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
int n, k, s;
cin >> n >> k >> s;
vector<int > a;
rep(i,k) a.push_back(s);
if(k < n) {
if(s==1e9) rep(i,n-k) {
... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <climits>
#include <vector>
#include <string>
#include <set>
#include <iomanip>
#include <map>
#define rep(i,n) for (int i=0;i<(n);++i)
using namespace std;
using ll = long long;
const int INF = 10000000;
int main(){
int a, b, c; cin >> a >> b;
... | 0 | 14,692,097 |
#include <math.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define PI 3.14159265358979323846264338327950L
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
int main() {
int a, b, c, d;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a, b;
cin >> a >> b;
if(a == "H"){cout << b << endl;}
else{
if(b == "H"){cout << "D" << endl;}
else{cout << "H" << endl;}
}
} | 0 | 12,787,010 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define re(i,n) for(ll i=0;i<n;++i)
#define ocut cout
#define ouct cout
#define itn int
struct Union{
vector<int> par;
Union(int a){
par=vector<int>(a,-1);
}
int find(int a){
if(par[a]<0){
return a;
... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long l... | 0 | 12,011,515 |
#include<iostream>
using namespace std;
int map[101];
int main(){
int n;
while( cin >> n ){
map[n]++;
}
int max=0;
for( int i=1; i<=100; i++ )
if( max < map[i] ) max = map[i];
for( int i=1; i<=100; i++ )
if( max == map[i] ) cout << i << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <time.h>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <string>
#include <bitset>
using namespace std;
#define FOR(I,F,N) for(int I = F; I < (int)(N... | 0 | 48,733,285 |
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <cctype>
#include <complex>
#include <string>
#include <sstream>
#include... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF ... | 0 | 9,267,273 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.