code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MOD 1000000007
void solve()
{
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll x=b-a+1;
ll ans=x;
ans-=(b/c-(a-1)/c);
... | 0 | 82,803,735 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long a,b;
cin >> a >> b;
vector<string> ans(100,"");
for(long i=0;i<100;i++) ans[0]+=".";
for(long i=0;i<100;i++) ans[99]+="#";
for(long i=1;i<99;i++) {
ans[i]=".";
for(long j=0;j<49;j++) {
ans[i]+="#";
}
for(long j=0;j<49;j++)... | #pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;
#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/range/adaptor/reversed.hpp>
using namespace boost;
using ml = boost::multiprecision::... | 0 | 12,977,568 |
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
#in... | #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>
#include <cctype>
#in... | 0 | 75,457,859 |
#include <iostream>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <set>
using namespace std;
int main()
{
while (1)
{
int b = 1;
cin >> b;
if (b == 0)
{
break;
}
vector<string> a;
vector<string> d;
for (int i = 0; i < b; i++)
{
string w;
cin >> w;
stri... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
usi... | 0 | 65,417,513 |
#include <iostream>
using namespace std;
using int64 = long long;
int main() {
int64 a,b,c,k;
cin >> a >> b >> c >> k;
cout << (k%2? b-a : a-b) << endl;
return 0;
} | #include<vector>
#include<stdio.h>
#include<iostream>
using namespace std;
vector<pair<int,int>> g[100001];
int diks[100001];
bool is_checked[100001];
bool is_reached[100001];
bool is_root(int a){
if(is_checked[a]) {
return true;
} else is_checked[a] = true;
for(int i = 0; i < g[a].size(); i++){
... | 0 | 37,386,098 |
#include<bits/stdc++.h>
#include<stack>
using namespace std;
int main(void) {
char str[105];
while(1){
cin.getline(str, sizeof(str));
if(str[0] == '.') break;
stack<char> s;
s.push('0');
int flag = 1;
for(int i = 0; str[i] != '\0'; i++){
if(str[i] == '... | #include<cstdio>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<set>
#include<cstring>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#define pb push_back
#define LLIandI pair<long ... | 0 | 17,291,921 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, ll num=0){
if(num == 0) num = (ll)v.size();
if(is_reverse) for(ll i=num-1; i>=0; i--){ cout<<v[i]; if(i!=0) cout<<" ";}
else for(ll i=0; i<num; i++){ cout<<v[i]; if(i... | #include <algorithm>
#include <iostream>
#include <vector>
#include <set>
using namespace std;
int main(){
int N;
cin >> N;
vector<long long> A(1<<N);
for(int i = 0; i < (1<<N); ++i) cin >> A[i];
vector<long long> dp(1<<N,0), M(1<<N,0);
for(int i = 1; i < (1<<N); ++i){
set<int> s;
for(int j = 0; j <... | 0 | 4,275,309 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MAX 200003
#define MOD 1000000007
using Graph=vector<vector<pair<int,double>>>;
int main(){
int N;
cin>>N;
vector<ll> A(N),B(N);
ll sum=0;
int k;
bool flag=false;
for(int i=0;i<N;i++){
cin>>A.at(i)>>B.at(i);
sum+=A.at(i);
... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 0 | 14,853,585 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;... | #include <bits/stdc++.h>
using namespace std;
using ll = int_fast64_t;
constexpr ll llmax = INT_FAST64_MAX;
constexpr ll llmin = INT_FAST64_MIN;
using ull = uint_fast64_t;
constexpr ull ullmax = UINT_FAST64_MAX;
#define FOR(i, b, e) for (int i = (b); i < (e); ++i)
#define RFOR(i, b, e) for (int i = ((e) - 1); (b) <=... | 0 | 14,801,522 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#incl... | #include<bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vector<int> >
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
using ll = long long;
using ld =long double;
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=... | 0 | 16,873,435 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lol;
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i++)
#define FORD(i,a,b) for(lol i=a;i>=lol(b);i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) lol(x.size())
#define ... | # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <tuple>
# include <unordered_map>
# include <numeric>
# include... | 0 | 87,954,271 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
template <class T>
void print_vect(std::vector<T> v){
for(int i = 0 ; i < v .size(); i++) cout << v[i] << " ";
cout << endl;
}
int cal_cost(vi& a , int p){
int ans = 0;
for(const auto & num... | 0 | 9,133,391 |
#include<cstdio>
#include<iostream>
using namespace std;
int main()
{
int da[150]={0},a,i=0,max=0;
while(cin>>a)
{
da[a]++;
if(max<=da[a])max=da[a];
}
for(int j=0;j<150;j++)
{
if(da[j]==max)cout<<j<<endl;
}
return 0;
} | #include<iostream>
#include<string>
using namespace std;
int d[10000],p[10000];
int main(){
int n,m;
while(true){
cin>>n>>m;
if(n==0&&m==0)
break;
int load=0;
for(int i=0;i<n;i++){
cin>>d[i]>>p[i];
load+=d[i];
}
if(load<=m)
cout<<"0"<<endl;
else{
int count=0;
for(int i=0;i<n-1;i++){
for(int j=n-... | 0 | 46,293,147 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int MOD = 1000000007;
typedef long long ll;
template<typename T> void print(const T & v);
int main() {
int A,... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#inclu... | 0 | 37,588,718 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m;
while (scanf("%d %d", &n, &m) && n){
pair<int, int> P[100000];
int ans = 0;
for (int i = 0; i < n; i++){
int a, b;
scanf("%d %d", &a, &b);
ans += a * b;
P[i] = make_pair(-... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<ll, ll>;
const long double PI = acos(... | 0 | 25,888,419 |
#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>;
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;}
int main() {
int A, B, K;
cin >> A >> B >> K;
int cnt = 0;
for (int i = min(A,B); i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H,W;
cin>>H>>W;
vector<vector<char>> grid(H, vector<char>(W));
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
cin>>grid.at(i).at(j);
}
}
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(grid.at(i).at(j)=='.') continue;
e... | 0 | 8,546,677 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(ll i = (a); i < (b); ++i)
#define FOR_EQ(i,a,b) for(ll i = (a); i <= (b); ++i)
#define rep(i,n) FOR(i,0,n)
#define rep_eq(i,n) FOR_EQ(i,0,n)
#define DEBUG_VARIABLE(variable) cout << #variable << ":" << variable << endl
#define INFTY 100000000000000000... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using vec = vector<ll>;
using vec2 = vector<vector<ll>>;
ll inf = pow(2,62);
int main(){
ll s;cin >> s;
const ll m... | 0 | 27,818,568 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#include <bitset>
#include <numeric>
#define ll long long
using namespace std;
using p = pair<ll, ll>;
ll dx[8]={ 0, 1, 0,-1, 1, 1,-1,-1};
ll dy[8]={ 1, 0,-1, 0, 1,-1, 1,-1};... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define vl vector<ll>
#define pll pair<ll,ll>
#define mll map<ll, ll>
#define rep(i,a) for(ll i= 0;i < a;i++)
#define rep1(i,a) for(ll i= 1;i < a;i++)
#define foi(i, a, b) for(ll i = a; i<b ; i++)
#define fod(i, a, b) for(ll i = a; i>=b ; ... | 0 | 46,774,533 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int n,m;cin>>n>>m;
vector<pair<long,long>>ab;
for(int i = 0;i<n;i++){
int a,b;cin>>a>>b;
ab.push_back(make_pair(a,b));
}
sort(ab.begin(),ab.end());
lo... | #include <bits/stdc++.h>
using namespace std;
template<class e, class t, int N>
std::basic_istream<e,t>& operator>>(std::basic_istream<e,t>& in, const e(&literal)[N]) {
std::array<e, N-1> buffer;
in >> buffer[0];
if (N>2)
in.read(&buffer[1], N-2);
if (strncmp(&buffer[0... | 0 | 43,607,479 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
typedef long long ll;
typedef pair<int, int> pii;
const int inf=1010001000;
const ll INF=1001000100010001000;
const int mod=(int)1e9+7;
int main(){
int n,k;
cin>>n>>k;
vector<int>... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
int N;
int C[510], S[510], F[510];
signed main() {
cin >> N;
rep(i, N-1) cin >> C[i] >> S[i] >> F[i];
rep(i, N) {
int now = 0;
for (int j=i; j<N-1; j++) {
... | 0 | 52,169,407 |
#include<bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,n) REP(i,0,(n))
typedef long long ll;
using namespace std;
int main() {
ll N, sum = 0;
cin >> N;
int A[N];
rep(i, N) {
cin >> A[i];
sum += A[i];
}
ll k = sum / (N * (N + 1) / 2);
if (k * N * (N ... | #include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
const ll INF = 1001001001;
int main()
{
int n;
string s, t;
cin >> n;
cin >> s;
cin >> t;
... | 0 | 21,061,669 |
#include <bits/stdc++.h>
using namespace std;
int main()
{int c[2], K; cin >> c[0] >> c[1] >> K;
for (int i{}; K--; i = !i) c[i] /= 2, c[!i] += c[i];
cout << c[0] << " " << c[1];} | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;
template <class T, class F>
T UpperBound(T i0, T i1, F f) {
while (i0 < i1) {
T i = i0 + (i1 - i0) / 2;
if (f(i)) i0 = i + 1; ... | 0 | 893,565 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printInt(a) printf("%d\n", a)
#define scanInt(a) scanf("%d", &a)
#define scan2Int(a, b) scanf("%d %d", &a, &b)
#define scan3Int(a, b, c) scanf("%d %d %d", &a, &b, &c)
using namespace std;
int main() {
int k, a, b;
scanInt(k);
sc... | #include <bits/stdc++.h>
using namespace std;
int main() {
string ABCD;
cin >> ABCD;
int A, B, C, D, temp;
temp = stoi(ABCD);
A = temp / 1000;
temp -= A * 1000;
B = temp / 100;
temp -= B * 100;
C = temp / 10;
temp -= C * 10;
D = temp;
vector<bool> ops(4, true);
int op... | 0 | 37,698,664 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
ll ans = 1e15;
for(ll i = 1; i*i <= N; i++) {
if(N%i == 0) {
ans = min(ans, i + N/i - 2);
}
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
int ... | 0 | 7,434,981 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void solve()
{
int n, m, k;
cin >> n >> m >> k;
bool ok = false;
rep(i, n + 1) rep(j, m + 1)
{
if (i * (m - j) + j * (n - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int k = 0, s = 0;
cin >> k >> s;
int ans = 0;
for(int i = 0; i <= k; i++) {
for(int j = 0; j <= k; j++) {
if(i + j <= s && (s - (i + j) <= k)) ans++;
... | 0 | 49,841,259 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
vector<ll> minPath;
vector<vector<pair<ll, ll>>> G;
void dfs (int i) {
for (ll j = 0; j < G[i].size(); j++) {
if (minPath[G[i][j... | 0 | 57,438,805 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(obj) (obj).begin(), (obj).end()
#define bit(n) (1LL << (n))
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld double
#define rep(i,a,b) for(ll i=a; i<b; ++i)
#define BOOST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define all(v) v.begin(),v.end()
#define sl(a) a.size()
#define mo... | 0 | 86,910,427 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);
int N;
int num = 0;
cin>>N;
string S = to_string(N);
for(int i = 0;i < S.size();i++){
if(S[i] == '7'){
cout<<"Yes"<<'\n';
num = 1;
break;
}
}
if(num == 0){
cout<<"No"<<'\n'... | #include<iostream>
using namespace std;
int main()
{
while (true){
int n;
cin >> n;
if (!n) break;
char order[128];
for (int i = 0; i < 128; i++) order[i] = i;
for (int i = 0; i < n; i++){
char in1, in2;
cin >> in1 >> in2;
order[in1] = in2;
}
int m;
cin >> m;
for (int i = 0; i < m; i++){
... | 0 | 595,249 |
#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 mt make_tuple... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
typedef long long int ll;
#define FOR(i,n,m) for(ll i=(ll)(m);i<(ll)(n);++i)
#define REP(i,n) FOR(i,n,0)
#define IREP(i,n) for(ll i=(ll)(n);i>=0;--i)
const ll MOD = 1000000007;
using namespace std;
int num(int n)
{
int ng = n + 1;
int ok = 1... | 0 | 14,668,636 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
int n, k = 0;
cin >> n >> k;
int *arr = new int[n];
for (int i = 0; i < n; i++)
{
arr[i] = 0;
}
for (int i = 0; i < k; i++)
{
int duck;
cin >> duck;
for (int j = 0; j < duck; j++)
{
int a = 0;
cin >> a;
arr[a - 1] += 1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll n; cin >> n;
vector<ll> a(n);
rep(i, 0, n) cin >> a[i];
ll mx = 101;
rep(i, 0, n-1){
if(a[i] == a[i+1]){
a[i+1] = mx;
... | 0 | 88,271,509 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int w,h,a[100][100],n,x,y;
while(cin >> w >> h, w, h){
for(int i=0;i<=w;i++){
for(int j=0;j<=h;j++) a[i][j] = 0;
}
a[0][1] = 1;
cin >> n;
for(int i=0;i<n;i++){
cin >> x >> y;
a[x][y] = -1;
}
for(int... | #include<bits/stdc++.h>
#define Bye return 0
#define ll long long
using namespace std;
void solve(){
ll n, m, x; cin>>n>>m>>x;
ll price[n];
ll level[n][m];
for (ll i=0; i<n; i++){
cin>>price[i];
for (ll j=0; j<m; j++)
cin>>level[i][j];
}
ll minimum = LONG_LONG_MAX;
... | 0 | 7,790,260 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#defin... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
#define ll long long
const int inf = 1000000000;
int main(){
string s;
cin >> s;
string ans= "yes";
rep(i,s.size()){
for(int j=i+1;j<s.size();j++){
if(s[i]==s[j]){
ans ="no";
... | 0 | 77,371,742 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int v[5];
for(int i=0; i<5; i++){
cin >> v[i];
}
sort(v, v+5, greater<int>());
for(int i=0; i<5; i++){
cout << v[i];
if(i != 4)
cout << " ";
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd... | 0 | 68,978,034 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
int n, m;
const int INF = 100000000;
vector<int> G[100000];
vector<int> D(100000, INF);
vector<int> P(100000, 0);
void bfs() {
queue<int> Q;
Q.push(0);
D[0] = 0;
while ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 19,716,381 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll l1[51][51];
ll dir[8][2]={{1,0},{0,1},{0,-1},{-1,0},{-1,1},{-1,-1},{1,-1},{1,1}};
map<ll,ll>di;
int main()
{
ll n,k,m,a,b,s=1;
cin>>n>>k;
for(int i=1;i<=n;i++){
s+=min(s,k);
}
cout<<s;
} | #include <stdio.h>
int main(void){
int i,j,k,n,x,l;
l = 0;
for ( ; ; ){
scanf("%d %d",&n,&x);
if (n == 0 && x == 0){
break;
}
for (i = 1; i < n - 1; i++){
for (j = i + 1; j < n; j++){
for (k = j + 1; k < n + 1; k++){
if (i + j + k == x){
l++;
}
... | 0 | 63,318,668 |
#include <stdio.h>
int main(){
char character, character2;
scanf("%c", &character);
character2 = character + 1 ;
printf("%c", character2);
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 PB(N) push_back(N)
#define MOD 1000000007
using namespace std;
using Graph = vector<vector<int>>;
long long modinv(long long a, long long m){
long long b = m, u=1,v=0;
while(b){
long long t=a/b;
a -= t*... | 0 | 88,708,592 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int ... | #include <iostream>
#include <cmath>
#include <climits>
#include <algorithm>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <string.h>
#include <iomanip>
#include <ctype.h>
#define ll ... | 0 | 71,517,933 |
#include<bits/stdc++.h>
using namespace std;
const double eps=1e-10;
const double pi=3.1415926535897932384626433832795;
const double eln=2.718281828459045235360287471352;
#define LL long long
#define IN freopen("in.txt", "r", stdin)
#define OUT freopen("out.txt", "w", stdout)
#define scan(x) scanf("%d", &x)
#define mp ... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int N, K;
cin >> N >> K;
vector<int> P(N), C(N);
for (int i = 0; i < N; i++)
{
cin >> P[i];
P[i]--;
}
for (int i = 0; i < N; i++)
{
cin >> C[i];
}
long long ans = LONG_LONG_MIN;
for (int i = ... | 0 | 45,069,583 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (ll i = a; i < b; i++)
#define REP(i,b) FOR(i,0,b)
#define RFOR(i,a,b) for (ll i = a-1; i >= b; i--)
#define RREP(i,a) RFOR(i,a,0)
#define REPALL(i,x) for (ll i = 0; i < x.size(); i++)
#define RREPALL(i,x) for (ll i = x.size()-1; i >= 0; i--)
#define ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define REP(i,m,n) for(ll i = m; i < (ll)(n); ++i)
#define rep(i,n) REP(i, 0, n)
int main() {
ll n;
cin >> n;
ll p[200010];
rep(i, n) cin >> p[i];
ll pos[200010];
rep(i, n) pos[p[i]] = i;
set<ll> larger_pos;
larger_p... | 0 | 30,533,890 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int INT_INF = 2147483646;
const ll LL_INF = 9223372036854775807;
const double PI=3.1415926535897932;
bool SecondCompare(const pair<int,int> &a,const pair<int,int> &b)
{
return a.second<b.s... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool cmp(pair<int, int> a, pair<int, int> b) {
if(a.second > b.second) return true;
else return false;
}
int main() {
int n, h;
cin >> n >> h;
vector<pair<int, int>> k(n);
for(int i = 0; i < n; i++) {
int a, ... | 0 | 83,975,588 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
ret... | #include <iostream>
#include <cmath>
#include <climits>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <string>
#include <stack>
#include <algorithm>
#include <map>
#include <numeric>
#include <set>
#include <queue>
#include <bitset>
using namespace std;
#define ll long long
#define ld long double
#d... | 0 | 57,473,357 |
#include <iostream>
#include <math.h>
#include <algorithm>
#include <functional>
#include <string>
#include <vector>
#include <cstring>
#include <set>
#include <map>
#include <queue>
#include <utility>
using namespace std;
typedef long long LL;
#define dump(c) { for (auto it = c.begin(); it != c.end(); ++it) if (it ==... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pai acos(-1)
#... | 0 | 43,404,116 |
#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 <iostream>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <tuple>
#include <complex>
#include <cassert>
#include <exce... | 0 | 8,830,694 |
#include <iostream>
int f(int a, int b,int c)
{
if (a * a == b * b + c * c) {
return 1;
} else if (b * b == c * c + a * a) {
return 1;
} else if (c * c == a * a + b * b) {
return 1;
} else {
return 0;
}
}
int main()
{
int N;
std::cin >> N;
for (int i = 0; i < N; i++) {
int a;
int b;
int c... | #include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
using namespace std;
#define FOR(i,N) for(int i=0;i<N;i++)
int main(){
long long N,K,X,X1,X2,ans=0,keep1,keep2;
cin >> X >> N;
vector<long>p(N);
FOR(i,N)cin >> p[i];
if(count(p.begin(),p.end(),X) == 0){
ans = X;
}els... | 0 | 69,516,588 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N ;
int64_t L2=0;
if(N==1){
L2=1;
}
else{
int64_t L0=2;
int64_t L1=1;
L2=0;
for(int i=0; i<N-1; i++){
L2=L1+L0;
L0=L1;
L1=L2;
}
}
cout << L2 << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(0);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 0 | 61,201,306 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(... | #include <iostream>
#include <functional>
#include <algorithm>
#include <vector>
#include <queue>
#include <cassert>
using namespace std;
using Weight = int;
using Capacity = int;
struct Edge {
int src, dst; Weight weight;
Edge(int s, int d, Weight w) : src(s), dst(d), weight(w) {}
};
using Edges = vector<Edge>... | 0 | 2,038,251 |
#include <iostream>
#include <algorithm>
using namespace std;
#define MAX_N 100
#define INF (1 << 21)
int cost[MAX_N][MAX_N];
int rc[MAX_N+1];
int main() {
int n; cin >> n;
for(int i=0;i<n;i++) {
int tmp;
if(i==0) {
cin >> rc[i] >> rc[i+1];
}
else {
cin >> tmp >> rc[i+1];
}
}
for... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int INF = 1 << 30;
int main() {
int N, M, X;
cin >> N >> M >> X;
vector<int> C(N);
vector<int> understand(M);
vector<vector<int>> A(N, vector<int>(M));
for (int i = 0; i < N; i++) {
cin >> C[i];
for (int j = 0; j < M; j++) {
ci... | 0 | 45,696,600 |
#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <limits>
#include <string>
#include <bitset>
#include <functional>
using namespace std;
using lint = long long;
using pii = pair<int, int>;
using vec = vector<int>;
usin... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,n) for(int i=(a); i<(n); i++)
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
using P = pair<int ,int>;
const int INF = 1001001001;
const int MOD... | 0 | 42,282,700 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
using namespace std;
int main() {
string s; cin >> s;
ll ans = 0;
ll countB = 0;
for(ll i = s.length()-1; i >=0; i --){
if(s[i] == 'B'){
ans += (s.length() -1 - i -countB);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<ll> >;
const ll INF = 1e18;
const ll MOD = 1000000007;
const ll MX = 0;
#define rep(i,n) for(ll i=0; i<(ll)(n); i++)
#define ALL(x) (x).begin(),(x).end()
#define MAX(x) *max_element(ALL(x))
#define PB push_back
#define F fi... | 0 | 5,083,790 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<iomanip>
#define MOD 1000000007
#define INF 1001001001
#define MIN -1001001001
#define rep(i,k,N) for(int i=k;i<N;i++)
#define MP make_pair
#defin... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#include <utility>
using namespace std;
int main() {
int N;
cin >> N;
vector<map<int, int>> cnt_map(2);
for (int n = 0; n < N; ++n) {
int v;
cin >> v;
++cnt_map[n % 2][v];
}
vector<vector<pair<int, int>>> cnts(2, vector<pa... | 0 | 94,110,526 |
#include <iostream>
using namespace std;
int ari;
int jiku[102];
int u[102];
int v[102][102];
int ushi[102][102];
int main(){
cin>>ari;
for(int i=1;i<ari+1;i++){
cin>>u[i];
cin>>jiku[u[i]];
for(int j=1;j<jiku[u[i]]+1;j++){
cin>>v[u[i]][j];
}
}
for(int k=1;k<ari+1;k++){
for(int l=1;l<jik... | #include <iostream>
#include <string>
using namespace std;
int main(){
string s;
cin >> s;
int slen = s.length();
string result = "AC";
if(s[0] != 'A'){
result = "WA";
}
int count = 0;
for(int i = 1; i < slen; i++){
if(isupper(s[i])){
if(i == 1 || i == slen - ... | 0 | 99,224,026 |
#include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#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(x) x.begin(),x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
usi... | #include<bits/stdc++.h>
using namespace std;
int count( int n )
{
int ans =0;
while( n%2==0)
{
ans++;
n = n/2;
}
return ans;
}
int main()
{
int n ;
cin>>n;
int ans = INT_MIN;
int val =0;
for(int i=1;i<=n;i++)
{
int temp = count(i);
if( temp > ... | 0 | 24,903,677 |
#include <iostream>
#include <cstdio>
using namespace std;
int main() {
while (1) {
int m, f, r;
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1) {
break;
}
if (m == -1 || f == -1) {
printf("F\n");
continue;
}
int total = m + f;
if (total >= 80) {
printf("A\n");
}
else if (total >... | #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 reps(i,a,b) for(int i= a; i < b; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int n;
int cnt = 62;
vector<ll> vec;
ll mod = 1e9+7;
ll solve() ... | 0 | 17,561,369 |
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#inc... | #include <bits/stdc++.h>
using namespace std;
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define mii map<ll,ll>
#define pii pair<ll,ll>
#define vi vector<ll>
#define endl "\n"
#de... | 0 | 32,026,889 |
#include <bits/stdc++.h>
using namespace std;
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
using ll = long long;
int main(){
int n;cin>>n;
vector<int> h(n);
rep0(i,n){
cin>>h[i];
}
int ans=1;
... | #include<bits/stdc++.h>
using namespace std;
void Output(int sum){
if((int)(sum/1000) != 0){
if((int)(sum/1000) != 1){
cout << sum/1000;
}
cout << 'm';
}
sum = sum%1000;
if((int)(sum/100) != 0){
if((int)(sum/100) != 1){
cout << sum/100;
}
cout << 'c';
}
sum = sum%100;
i... | 0 | 83,064,885 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair< int, int > pii;
typedef pair< pii, int > ppi;
#define fill(a,b) memset(a,b,sizeof(a))
#define all(v) (v).begin(),(v).end()
#define sp(k) cout<<setprecision(k)<<fixed;
#define rep(i,a) for(in... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | 0 | 19,575,850 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <algorithm>
#include <sstream>
#include <istream>
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
int main(){
strin... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, k, s;
cin >> n >> k >> s;
long long INF = 10000000000;
vector <long long> ans(n, INF);
for (int i; i < k; i ++){
ans[i] = s;
}
for (int i; i < n; i ++){
if (ans[i] == INF){
if (s == 1000000000){
... | 0 | 30,763,949 |
#include <bits/stdc++.h>
#define arep(a,i,n) for(ll i=(a);i<(n);i++)
#define rep(i,n) for(ll i=0;i<(n);i++)
#define cinf(x,n) for(ll i=0;i<(n);i++)cin>>x[i];
#define coutf(x,n) for(ll i=0;i<(n);i++)cout<<x[i]<<endl;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
int m... | #pragma region header
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#inc... | 0 | 1,894,994 |
#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>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | 0 | 30,838,610 |
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main(){
int n;
cin>>n;
int x,m=0,k=0,in;
for(int i=0;i<n;i++){
cin>>x;
if(x>=m){k=m;m=x;in=i;}
else if(x>=k){k=x;}
}
for(int i=0;i<n;i++){
if(i==in){cout<<k;}
if(i!=in){cout<<m... | #include <bits/stdc++.h>
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int k, a, b; cin >> k >> a >> b;
for (int i = 1; k * i <= b; ++i)
{
if (k * i >= a && k * i <= b)
{
cout << "OK" << endl;
return 0;
}
else
co... | 0 | 72,933,600 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll h,w;
cin >> h >> w;
ll ans;
if(h==1||w==1){
ans=1;
}
else if(h%2==0||w%2==0){
ans=h*w/2;
}
else {
ans=(h*w/2)+1;
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define INF 1000000007
int main(){
string s;
cin >> s;
int n = s.length();
string ans = "";
for ( int i = 0; i < n ; i++ ){
if( s[i] == 'B' ){
if( ans.size() == 0 )
continue;
else
ans.pop_back();
}
else if( s[i] == '1' )
a... | 0 | 79,105,998 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
int cnt[26] = {};
for (auto c: s) {
cnt[c-'a']++;
}
ll n = s.length();
ll ans = n * (n-1) / 2 + 1;
for (auto e: cnt) {
ans -= (ll)e * (e-1) / 2;
}
cout << ans << e... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
int n,m; cin >>n >>m;
int a[50], b[50], c[50], d[50];
rep(i,n) cin >>a[i] >>b[i];
rep(i,m) cin >>c[i] >>d[i];
rep(i,n){
int min_dist = abs(a[i]-c[0])+abs(b[i]-d[0]), checkpoint = ... | 0 | 75,419,142 |
#include <iostream>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <algorithm>
#include <climits>
using namespace std;
#define fastio ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define t_times int t; cin >> t; while(t--)
#define fr(i, st, n) for(int i = (int )... | #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>
#includ... | 0 | 46,643,558 |
#include <iostream>
using namespace std;
int a[101];
int n, k;
int main(){
cin >> n >> k;
for(int i = 0; i < k; i++){
int di, aij; cin >> di;
for(int j = 0; j < di; j++){
cin >> aij;
a[aij]++;
}
}
int ans = 0;
for(int i = 1; i <= n; i++){
ans += (!a[i] ? 1 : 0);
}
cout << ans <... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<int, int>;
const int MOD = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
#define print(x) cout << x << endl
#define prints(x) cout << fixed << setprecision(10) << x << endl
#define printc(... | 0 | 32,987,034 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9+7
using ll = long long;
using P = pair<int, int>;
using lP = pair<ll, ll>;
using fP = pair<double, doubl... | 0 | 15,843,149 |
#pragma GCC optimize ("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("-ffloat-store")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define nl cout << '\n'
#define sor(x) sort(x.begin(), x.end())
#define rev(v) reve... | #include<stdio.h>
#include<algorithm>
using namespace std ;
int use[ 50000 + 1 ] ;
int coin[ 20 ] ;
int main()
{
int n ,m ;
scanf( "%d %d" ,&n ,&m ) ;
int i ,j ;
for( i = 0 ; i < m ; ++i )
{
scanf( "%d" ,&coin[ i ] ) ;
++use[ coin[ i ] ] ;
}
i = 1 ;
while( i < n )
{
if( use[ i ] > 0 )
{
for( j = 0 ;... | 0 | 9,114,276 |
#include<iostream>
#include<algorithm>
using namespace std;
const int MAX_N=1e3*5;
const int INF=1e8;
int a[MAX_N];
int main(){
int n;
while(cin>>n && n!=0){
for(int i=0;i<n;i++)cin>>a[i];
sort(a,a+n);
int ans=INF;
for(int i=0;i<n-1;i++){
ans=min(ans,a[i+1]-a[i]);
}
cout<<ans<<endl;
}
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
using namespace std;
using vint = vector<int>;
using vvint = vector<vector<int>>;
... | 0 | 33,052,191 |
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <set>
using namespace std;
#define LL long l... | #include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) for(int i=0;i < (n);i++)
#define ALL(obj) (obj).begin(),(obj).end()
using namespace std;
const long long INF = 1LL << 60;
const int IINF=100000000;
const int MOD = (int)1e9 + 7;
typedef long long ll;
vector<long long> divisor(long lon... | 0 | 70,248,506 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
long long int A, B, K; cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) {
if (A % 2 != 0) A--;
B += A / 2;
A /= 2;
}
else {
... | #include<iostream>
#include<cmath>
#include<string>
#include<cctype>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int a,b,c,t;
scanf("%d %d %d",&a,&b,&c);
for(;;){
if(a<=b && b<=c){
break;
}
if(a>b){... | 0 | 95,571,419 |
#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;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MODAD... | 0 | 60,277,870 |
#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#define NIL (-1)
int main()
{
int m, f, r;
for (;;)
{
scanf("%d %d %d", &m, &f, &r);
if ((m == NIL) && (f == NIL) && (r == NIL))
{
break;
}
if ((m == NIL) || (f == NIL))
{
printf("F\n");
}
else
{
int sum = m + f;
if (sum >= 80)
{
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main()
{
int n = 0;
fscanf(stdin, "%d", &n);
vector<int> v(n);
for (int i = 0; i < n; ++i) {
fscanf(stdin, "%d", &v[i]);
}
int cnt = 0;
for (int i = 0; i < n; ++i) {
int ix = i;
for (int j = i; j < n; ... | 0 | 97,360,787 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
ll A, B, K;
cin >> A >> B >> K;
ll res = K - A;
if (res >= 0)... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#define endl '\n';
#define all(v) ((v).begin()), ((v).end())
#define sz(s) (int)s.size()
#define Ceil(x,y) ((x+y-1)/y)
#define RT(x) return cout<<x,0;
#define mem(x,y) memset(x,y,sizeof(x))
#define v... | 0 | 36,558,145 |
#include<bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (int i = 1; i <= (int)(n); i++)
#define FORD0(i... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 9,082,963 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int X; cin >> X;
int G = lcm(360, X);
printf("%d\n", G / X);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
const long long INF = numeric_limits<long long>::max();
template <class T> inline bool chmin(T& a, T b) {
if (a... | 0 | 96,619,550 |
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <deque>
#include <queue>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(s... | #include <bits/stdc++.h>
using namespace std;
const int N=1e5+3;
int arr[N];
int main(){
std::ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
long test;
test=1;
while(test--)
{
long long i,j,n,q,e=0,t,o=0,c=0,temp,k,maxpeak=0,peak,d;
string s;
cin>>n;
for(i=0;i... | 0 | 87,423,147 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mod 1000000007
int main(){
ll h, w;
cin>>h>>w;
char a[h][w];
for(ll i=0; i<h; i++){
for(ll j=0; j<w; j++){
cin>>a[i][j];
}
}
ll dp[h][w];
memset(dp, 0, sizeof(dp));
dp[h-1][w-1]=1;
for(ll i=h-1; i>=0; i--){
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
ll h,w;
ll direction2[4][2]={{1,0},{0,1},{0,-1},{-1,0}};
bool valid(int a,int b)
{
if(a>=1&&a<=h&&b>=1&&b<=w)return true;
else return false;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s,t;char s2;
cin>>... | 0 | 44,733,752 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int a, b, m;
cin >> a >> b >> m;
vector<int> pa(a), pb(b);
rep(i, a) cin >> pa.at(i);
rep(i, b) cin >> pb.at(i);
vector<vector<int>> discount(m, vector<int>(3));
re... | #include<vector>
#include <iostream>
#include<string>
#include <complex>
using namespace std;
int main(){
int a[5];
for(int i = 0;i < 5; i++){
cin >> a[i];
}
int t = 0;
int k = 0;
int min = 9;
int tar = 0;
for(int i = 0; i < 5; i++){
if(min > a[i]%10 && a[i] % 10 != 0){
... | 0 | 30,792,523 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pi = pair<int, int>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<pi>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vect... | 0 | 21,455,736 |
#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<bitset>
#include<unordered_map>
#include <climits>
#include<fstream>
using... | #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>
#include <cctype>
#in... | 0 | 57,954,447 |
#include <iostream>
#include <cmath>
#include <climits>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <string>
#include <stack>
#include <algorithm>
#include <map>
#include <numeric>
#include <set>
#include <queue>
#include <bitset>
using namespace std;
#define ll long long
#define ld long double
#d... | #ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#define WOULD
#define YOU
#define PLEASE
#define ACCEPT
#define MY
#define SUBMISSION
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include... | 0 | 41,053,941 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define foreach(i,n) for(auto &&i:n)
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort(all(x))
#define GSORT(... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(void)
{
int n, cnt = 0;
string s;
cin >> n >> s;
rep(i,1000){
int c[3] = {i/100, (i/10)%10, i%10};
int e = 0;
rep(i,n){
if(c[e]+'0' == s[i]) e++;
}
if(e... | 0 | 25,527,016 |
#include <bits/stdc++.h>
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vecto... | #include<iostream>
#include<vector>
#include<stack>
using namespace std;
int main() {
int N, M; cin >> N >> M;
vector<int>x(N, 0); stack<int>s;
vector<vector<pair<int, int>>>L(N), R(N);
for (int i = 0, lef, rig, d; i < M; i++) {
cin >> lef >> rig >> d; lef--; rig--;
L[rig].push_back({ lef,d }); R[lef].push_back... | 0 | 11,188,816 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#include <climits>
#include <memory>
#include <numeric>
#include <utility>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b... | #include<bits/stdc++.h>
using namespace std;
#define sz size()
#define mk make_pair
#define clr clear()
#define B begin()
#define E end()
#define EM empty()
#define mem(a,b) memset(a,b,sizeof(a))
#define rep(i,n) for(i=0;i<n;i++)
#define Rep(i,n) for(i=1;i<=n;i++)
#define all(cont) cont.begin(),cont.end()
#define pb pu... | 0 | 46,044,394 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
REP(i,n) cin >> a[i];
int ans = 1000000;
int i = -100;
while(i <=... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,t... | 0 | 75,663,997 |
#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;
string n;
int main(){
cin >> n;
rep(i, n.size()){
if (n[i]=='1') n[i]='9';
else n[i]='1';
}
cout... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define fi first
#define sc second
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) <... | 0 | 82,224,263 |
#include<iostream>
int main(){
char t;
int y,m,d;
std::cin >> y >> t >> m >> t >> d;
if(y <= 2019 && m <= 4) std::cout<<"Heisei";
else std::cout<<"TBD";
} | #include <algorithm>
#include <iostream>
#include <vector>
#include <numeric>
using namespace std;
struct Doubling {
int sz, n;
vector<vector<int>> table;
Doubling(int n, long long ma = 1LL << 62) : sz(0), n(n) {
while ((1LL << sz) < ma) ++sz;
table.assign(sz, vector<int>(n, -1));
}
... | 0 | 91,320,194 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5 + 5;
vector<int> jobs[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
if (m - a + 1 > 0)
... | #include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int x=0,y=0,p=0,f[30][30]={0},j[30][30]={0};
cin>>x>>y;
if(x==y && x==0)break;
cin>>p;
for(int i=0;i<p;i++){
int a,b;
cin>>a>>b;
j[a][b]=-1;
}
f[1][1]=1;
for(int i=1;i<=x;++i){
for(int ... | 0 | 14,682,596 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl "\n"
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define int long long i... | #include<bits/stdc++.h>
using namespace std;
int check(string s)
{
for(int i=0;i<s.length()/2;i++)
{
if(s[i]!=s[s.length()-1-i])
return 0;
}
return 1;
}
int main()
{
string s,p="",m="";
cin>>s;
int n=s.length();
if(check(s))
{
for(int i=0;i<(n-1)/2;i++)
... | 0 | 4,512,252 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int N = 200005;
vector<int> e[N];
vector<int> c;
int dfs(int id) {
if (c[id] != 0) return 0;
c[id] = 1;
int res = 1;
rep(i, e[id].size()) {
res += dfs(e[id][i]);
}
re... | #include <bits/stdc++.h>
using namespace std;
#define dbg(x) cout<<#x<<"="<<x<<'\n'
#define ll long long
#define pr pair<int,int>
#define pb push_back
#define ff first
#define ss second
#define vi vector<int>
#define For(i,n) for(int i=0;i<(n);++i)
#define Forr(i,n) for(int i=n-1;i>=0;i--)
#pragma GCC optimization("Ofa... | 0 | 1,537,634 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9+7;
int main()
{
string s;
cin >> s;
int l,r;
l=0;
r=s.length()-1;
int ans = 0;
while(l<r)
{
if (s[l]==s[r])
{
l=l+1;
r=r-1;
}
else
{
if (s[l... | #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... | 0 | 62,917,500 |
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007
const int maxn= 100010;
lli modexp(lli x, lli y)
{
x%=MOD;
lli ans=1ll;
while(y>0ll)
{
if(y&1ll)
ans=(ans*x)%MOD;
x=(x*x)%MOD;... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll MOD = 1000000007;
int dis(int l, int r, const vector<P> &A) {
return abs(A[l].first - A[r].first) + abs(A[l].second - A[r].second);
}
int mai... | 0 | 89,670,211 |
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define pb push_back
#define ff first
#define ss second
#define pb push_back
using namespace std;
void solve(){
ll k,x;
cin>>k>>x;
if(k*500>=x)
cout<<"Yes";
else
cout<<"No";
}
int main(){
ios_base::sync_with_stdio(false);
... | #include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,a,ans=0,b[100005]={};
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
b[a-1]++;
b[a]++;
b[a+1]++;
}
for(int i=0;i<=100000;i++){
... | 0 | 46,746,834 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define cint cpp_int
#define endl "\n"
#define REP(i,a,n) for(int i=a;i<n;++i)
#define REPR(i,a,n) for(int i=a;i>n;--i)
#define RUP(a,b) (((a)+(b)-1)/(b))
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define mp make_pair
#define mt make_tup... | 0 | 65,253,817 |
#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 <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main(){
int N,K;
cin >> N >> K;
vector<int>V(N);
for(int i = 0; i < N; i++) {
cin >> V[i];
}
int ans... | 0 | 92,350,105 |
#include <algorithm>
#include <iostream>
#include <vector>
int main()
{
std::vector<int> num_bridges(4);
for (int i = 0; i < 3; i++) {
int a, b;
std::cin >> a >> b;
a--;
b--;
num_bridges[a]++;
num_bridges[b]++;
}
for (auto elem : num_bridges) {
if ... | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef lon... | 0 | 69,722,470 |
#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++)
typedef long long ll;
bool kaibun(string s){
bool ans = true;
rep(i,s.size()/2+1){
if(s[i]!=s[s.size()-1-i]){
ans = false;
}
}
return ans;
}
int ma... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | 0 | 54,034,969 |
#include<iostream>
#include<string>
#include<map>
using namespace std;
map<string,int> table;
int main()
{
string word, frequent, longest;
size_t N=0;
while(cin>>word){
table[word]++;
if(table[word]>N){
N=table[word];
frequent=word;
}
if(word.size()>longest.size()){
longest=word;
}
}
cout<<frequ... | #include<iostream>
#include<algorithm>
#include <utility>
using namespace std;
int N, M;
pair<int, int> PD[10010];
int solve();
int min(int, int);
bool compare(pair<int, int>, pair<int, int>);
int main()
{
while (cin >> N >> M && N)
{
int d, p;
for (int i = 0; i<N; i++)
{
cin >> d >> p;
PD[i] = make_pair(... | 0 | 71,024,847 |
#include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#inclu... | #include <bits/stdc++.h>
#define REP(i, m, n) for(int (i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class... | 0 | 36,490,138 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MOD 1000000007
int main(){
fast;
int n,m,w1,w2,cnt=0;
cin>>n>>m;
string arr1[n],arr2[m];
for(int i=0;i<n;i++)
cin>>arr1[i];
for(int i=0... | #include <iostream>
using namespace std;
int main(){
int k, a, b;
cin >> k >> a >> b;
if(b-a >= 3 && k > a-1){
long long int ans = a;
ans += (long long int)(b-a)*((long long int)(k-a+1)/2);
if((k-a+1) % 2) ans++;
cout << ans << endl;
}else{
cout << k+1 << endl;
... | 0 | 91,681,904 |
#include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
int main()
{
int n;
cin >> n;
int a[300000] {0};
for(int i = 0; i < (1 << n); i++) cin >> a[i];
int fir[300000];
int sec[300000];
bool looked[300000];
for(int i = 0; i < (1 << n); i++) fir[i] = i;
fill(sec... | #include<bits/stdc++.h>
using namespace std;
const int maxn=100000+10;
int x[maxn],xx[maxn],w[maxn];
int i,j,k,l,r,s,t,n,m;
long long c;
int main()
{
cin>>n>>l>>t;
for(i=1;i<=n;i++) cin>>x[i]>>w[i];
for(i=1;i<=n;i++) {
if(w[i]==2) w[i]=-1;
r=x[i]+w[i]*t;
if(r>0) (c+=r/l)%=n;
... | 0 | 2,582,989 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.