code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main()
{
vector<pair<int, int>> dish(5, make_pair(0, 0));
for (int i = 0; i < 5; i++)
{
cin >> dish[i].second;
dish[i].first = -(dish[i].second % 10);
if (dish[i].first == 0)
{
dish[i].first -= 10;
}
}
... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef long double lld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
ll gcd(ll a, ll b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
ll lcm(ll a, ll b){
... | 0 | 24,029,553 |
#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++)
#define PR(x) cout << (x) << "\n"
#define PS(x) cout << (x) << " "
const long long INF = numeric_limits<long long>:... | #include <cstdio>
#include <cstring>
#include <utility>
#define MAXN 36
#define DEBUG(d,n) {for (int i = 0; i < n; i++) {\
if (i != n-1) printf("%c%c ", d[i].suit, d[i].value);\
else printf("%c%c", d[i].suit, d[i].value);\
} printf("\n")... | 0 | 30,930,806 |
#include <iostream>
#include<cstdio>
using namespace std;
int main(void){
int a, b;
scanf("%d %d", &a, &b);
printf("%d %d %.5lf\n", a / b, a % b, (double)a / (double)b);
} | #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() {
string s, t;
cin >> s >> t;
int n = s.size();
map<char, char> st, ts;
rep(i,n) {
if (st.count(s.at(i))) {
if (st.at(s.at(i)) != t... | 0 | 94,008,195 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> dp(1e5+5);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
dp[a]++;
a++;
dp[a]++;
a -= 2;
if (a >= 0) dp[a]... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string a;
getline(cin,a);
if(a.size()==2 && a[0]==a[1]){
cout<<"1 2"<<endl;
return 0;
}
long long i,flag=0;
for(i=0;i<a.size()-2;i++)
{
if(a[i]==a[i+1] || a[i]==a[i+2] || a[i+1]==a[i+2]){
cout<<i+1<... | 0 | 16,214,608 |
#include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<math.h>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
const int N=100000;
const db pi=acos(-1.0);
#define low... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | 0 | 10,500,118 |
#include <bits/stdc++.h>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string S;
cin >> S;
int ans = 10000;
for(int i=0; i+2<S.size(); i++){
int a = S[i] - '0';
int b = S[i+1] -'0';
int c = S[i+2] -'0';
int val = a*100 + b*10 +c;
if(ans ... | #include<bits/stdc++.h>
using namespace std;
#define Fast ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w", stdout)
#define aise cout<<"aise"<<endl
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define ... | 0 | 85,574,066 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
using namespace std;
template<typename A, typename B> bool chmin(A &a, const B &b){ return b < a && (a = b, true); }
template<typename A, typename B> bool chmax(A &a, const B &b){ return a < b && (a = b, true); }
int main(){
int ... | #include <iostream>
#include <string>
using namespace std;
int main() {
char left[15] = {'q', 'a', 'z', 'w', 's', 'x', 'e', 'd', 'c', 'r',
'f', 'v', 't', 'g', 'b'};
char right[11] = {'y', 'h', 'n', 'u', 'j', 'm', 'i', 'k', 'o', 'l', 'p'};
while (true) {
string s;
cin >> s;
if (s[0] == '#') return 0;
in... | 0 | 24,175,180 |
#include<iostream>
#include<algorithm>
#define N 101
using namespace std;
int main(){
int i, m, a[N] = {};
while(cin >> i)
a[i]++;
for(int j = 1; j < N; j++)
m = max(m,a[j]);
for(int k = 1; k < N; k++)
if(a[k] == m)
cout << k << "\n";
} | #include<cstdio>
#include<algorithm>
using namespace std;
int main(void){
char s[4];
scanf("%s",s);
if(s[0]!=s[1]&&s[0]!=s[2]&&s[1]!=s[2]){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
} | 0 | 47,667,519 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int n, m;
cin>>n>>m;
long long int a[n][2], c[m][2];
for(int i=0; i<n; i++) cin>>a[i][0]>>a[i][1];
for(int j=0; j<m; j++) cin>>c[j][0]>>c[j][1];
int ans=0;
for(int i=0; i<n; i++){
long long int min_dist=10000000000000000;
for(int... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll N, H;
cin >> N >> H;
vector<ll> a(N)... | 0 | 79,027,007 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int N;
cin >> N;
int ans = N;
for(int i = 0; i <= N; i++) {
int cnt = 0;
int X = i;
int Y = N-i;
while(X != 0) {
cnt+=X%6;
X/=6;
}
while(Y != 0) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
int h1, m1; cin >> h1 >> m1;
int h2, m2; cin >> h2 >> m2;
int k; cin >> k;
int m = 0;
if (h2 >= h1) {
m += (h2 - h1) * 60;
} else {
... | 0 | 57,346,719 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define INF 2100000000
#define MOD 1000000007
bool dbgflag = false;
ll dpfunc(int i, int j, vector<vector<ll>>&dp, string s) {
if (dbgflag) cout << "dp " << i << "... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | 0 | 88,210,022 |
#include<bits/stdc++.h>
using namespace std;
constexpr int maxn = 100000;
int A[maxn];
int main(){
ios::sync_with_stdio(false);
int N, ans = 0;
cin >> N;
map<int, int> mp;
for(int i = 0; i < N; i += 1){
cin >> A[i];
mp[A[i]] = i;
}
sort(A, A + N);
for(int i = 0; i < N; i ... | #include <bits/stdc++.h>
using namespace std;
int ctoi(const char c){
if('0' <= c && c <= '9') return (c-'0');
return -1;
}
int main() {
int n;
string S;
cin >> n >> S;
int ans = 0;
vector<int> s(n);
for(int i=0;i<n;i++){
s.at(i) = ctoi(S.at(i));
}
for(int i=0;i<10;i++){
int a=-1;
for(in... | 0 | 10,293,440 |
#include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i... | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | 0 | 3,826,487 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#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 srepn(i,l,... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#... | 0 | 32,950,934 |
#include<stdio.h>
int main(){
long long a,b,k;
scanf("%lld%lld%lld",&a,&b,&k);
if(a>=k){
a-=k;
}else if(a+b>=k){
k-=a;
a=0;
b-=k;
}else{
a=0;
b=0;
}
printf("%lld %lld",a,b);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
#define INF 200000000000
template<class T>bool chmax(T &a, const T &b) { if (a<b) ... | 0 | 40,401,294 |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
const long long mod = 1e9+7;
const int dx[4] = {0,1,0,-1};
const int dy[4] = {1,0,-1,0};
const int ddx[4] = {1,1,-1, -1};
const int ddy[4] = {1,-1,-1,1};
int main(){
int a[32] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1,... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
ll A[100005];
ll B[100005];
int main() {
cin.tie(0... | 0 | 53,246,471 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int A;
cin >> A;
int G = A, M = A;
for (int i = 1; i < N; i++) {
int a;
cin >> a;
G = __gcd(a, G);
M = max(a, M);
}
if (K <= M && K % G == 0) cout << "POSSIBLE" << endl;
else cout << "IMPOSSIBLE" << end... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5 , MOD = 1e9 + 7;
bool bad[N];
int memo[N];
int solve (int n) {
if (n <= 0) return n == 0;
int &ret = memo[n];
if (~ret) return ret;
return ret = (solve(n - 2) + solve(n - 1)) % MOD;
}
int main() {
int n , m;
cin >> n >> m;
v... | 0 | 34,367,904 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <vector>
#include <queue>
#include <string>
#include <cmath>
#define ll long long
using namespace std;
ll q,a,b;
int main()
{
int q;
cin >> q;
for (int query = 0; query < q; ++query)
{
ll a, b;
cin >> a >> b;
if (a > b)
{
swap(a, b);
... | #include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
using Graph = vector<vector<Pll>>;
ll ... | 0 | 65,817,595 |
#include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<queue>
#include<vector>
#include<map>
#include<iomanip>
#include<tuple>
#include<bitset>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define printfloat(x) cout << fixed << setprecision(7) << (x) << endl;
#define printbit(... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
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)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_e... | 0 | 7,537,094 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
namespace io{
const int l=1<<20;
char buf[l],*s,*t;
inline char gc(){
if(s==t){
t=(s=buf)+fread(buf,1,l,stdin);
return s==t?EOF:*s++;
}
return *s++;
}
char c;
template<class IT>inline void gi(IT &x){
x=0;c=gc();while(c<'0'||c>'9')c=gc... | #include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<cstring>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<climits>
#include<fstream>
#define MOD (1000000007)
using namespace std;
typedef long long ... | 0 | 63,911,480 |
#include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void){
int N;
cin >> N;
vector <int> A(N + 1);
vector <int> B(N);
rep(i,N + 1) cin >> A[i];
rep(i,N... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const long long INF = 1LL << 60;
const ll C = 1000000000+7;
int main() {
int N, K;
cin >> N >> K;
vector<ll> num(K, 0);
for(int i=1; i<=N; i++) num[i%K]++... | 0 | 98,340,661 |
#include<bits/stdc++.h>
#define ll long long
#define MAX 1000005
#define MOD (ll)(1e9+7)
using namespace std;
int main()
{
int n;
cin >> n;
string s;
cin >> s;
ll ans=0;
for(int i=0; i<n;) {
int x=s[i];
while(s[i]==x) {
i++;
}
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int,int>;
const long long inf = 1000000001;
const double PI = 3.14159265358979323846;
int main(void){
int n;
cin >> n;
int w[n];
rep(i,n) cin >> w[i];
int sum1 = 0;
... | 0 | 98,747,820 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PB push_back
#define PPB pop_back
typedef pair<int, int> pii;
static const int INF = 1LL<<61;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
string ans1, ans2, in;
map<string, int> gedo;
while (cin >> in) {
if (ans2.size... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(ll i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#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 | 82,425,740 |
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, A, B, C, X;
while (cin >> N >> A >> B >> C >> X,
N || A || B || C || X) {
vector<int> Y(N);
for (int i = 0; i < N; i++) cin >> Y[i];
int ans = -1, pos = 0;
for (int i = 0; i <= 10000; i+... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pb push_back
int main() {
ll n;
scanf("%lld", &n);
if (n & 1) {
printf("0");
} else {
ll res = 0;
while (n) {
res += n / 10;
n /= 5;
}
... | 0 | 72,266,411 |
#include <bits/stdc++.h>
#define rep(i,m,n) for(int i=m; i<n; i++)
#define co(n) cout << n << endl
using namespace std;
int main(){
int n, a, b;
cin >> a >> b;
co(a+b/2);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 1'000'000'000'000'000'000
using Node = long long;
using Distance = long long;
using Weight = long long;
using Edge = tuple<Node, Node, Weight>;
ll V,E;
vector<Edge> Edges;
vector<Distance> dist;
bool BellmanFord(ll start){
dist.assign(... | 0 | 95,649,846 |
#include<iostream>
#include <limits.h>
using namespace std;
int main()
{
int n, m[101][101], p[101];
cin >> n;
for (int i = 1; i <= n; i++)
cin >> p[i - 1] >> p[i];
for (int i = 1; i <= n; i++)
m[i][i] = 0;
for (int j = 2; j <= n; j++)
{
for (int i = 1; i <= n - j + 1; i++)
{
int k = i + j - 1;
... | #include<iostream>
#include<algorithm>
using namespace std;
int a[8];
int main(){
for(int i=0;i<8;i++)cin>>a[i];
cout<<max(a[0]+a[1]+a[2]+a[3],a[4]+a[5]+a[6]+a[7])<<endl;
return 0;
} | 0 | 69,016,009 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <sstream>
#include <string>
#include <map>
#include <set>
#include <stdlib.h>
#include <cmath>
#include <math.h>
#include <fstream>
#include <bitset>
#include <time.h>
#include <queue>
using namespace std;
const int K = 1<<26;
int IN... | #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;
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; }
r... | 0 | 99,354,612 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
int main(){
int N;
cin >> N;
int T[N], A[N];
for(int i = 0; i < N; i++) cin >> T[i];
for(int i = 0; i < N; i++) cin >> A[i];
int confirmT[N], confirmA[N];
... | #include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define ALL(a) (a).begin(),(a).end()
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define ll long long
#define ull unsigned long long
int dx[4] = {1, 0, -1, 0};
int... | 0 | 9,518,661 |
#include <bits/stdc++.h>
#include <array>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)
struct Problem {
void Solve() {
UL V, E; cin >> V >> E;
vector<vector<UL>> G(V);
vector<UL> ins(V);
rep(i, E) {
UL a, b; cin... | #include<bits/stdc++.h>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#define endl "\n"
#define ll long long
#define int long long
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cin.exceptions(cin.failbit);cout.tie(NULL);
using namespace std;
bool isPrime(... | 0 | 78,119,920 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,A,B;
cin >> N >> A >> B;
int M = 1;
vector<int> sum(N+1,0);
for (int i = 1; i < N+1; i++) {
M = i;
while (M != 0){
sum.at(i) += M % 10;
M = (M - M % 10)/10;
}
}
long long Sum = 0;
for (int i = 1; i < N+1; i++) {
... | #include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
scanf("%d", &n);
vector<int> vip(n+1);
for(int i = 1; i < n+1; i++){
scanf("%d", &vip[i]);
}
vector<int> viq(n+1);
for(int i = 1; i < n+1; i... | 0 | 100,052,213 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <cmath>
#include <iomanip>
#include <set>
using namespace std;
typedef long long ll;
int main() {
string o, e;
cin >> o >> e;
string a[110];
int o_size = o.size();
int e_size = e.size();
int o_current = 0;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int main()
{
string s;
int k;
cin>>s>>k;
int m=s.length();
vector<vector<int> > dp(k+1,vector<int>(2));
dp[0][0]=1;
for(int i=1;i<=m;i++)
{
vector<vector<int> > new_dp(k+1,vector<int>(2));
... | 0 | 39,937,801 |
#include <iostream>
using namespace std;
int SelectionSort(int a[], int n){
int count = 0;
for(int i=0; i<n; i++){
int minj=i;
for(int j=i; j<n; j++){
if(a[j]<a[minj]) minj = j;
}
if(i!=minj){
swap(a[i], a[minj]);
count++;
}
}
return count;
}
int main(void){
int n;
... | #include<iostream>
#include<map>
using namespace std;
int main(){
int N, M;
int ans = 0;
cin >> N;
string s[N];
for(int i = 0; i < N; i++) cin >> s[i];
cin >> M;
string t[M];
for(int i = 0; i < M; i++) cin >> t[i];
map<string, int> money;
for(int i = 0; i < N; i++) money[s[i]];
... | 0 | 43,915,844 |
#include <iostream>
#include <algorithm>
using namespace std;
void nextRand(int *x,int a,int b,int c){
*x = (a * (*x) + b) % c;
}
int main(){
while(true){
int n;
int a,b,c;
int x;
cin >> n >> a >> b >> c >> x;
if(n==0){
break;
}
int *reels = new int[n];
for(int i=0;i<n;i++){
cin >> reels[i];
}... | #include<iostream>
using namespace std;
int count(long long n){
int cnt=0;
while(n>0){
n/=10;
cnt++;
}
return cnt;
}
int main(){
long long n;
long long b;
int cur=0;
int ans=100000;
cin>>n;
for(long long i=1;i*i<=n;i++){
if(n%i==0){
b=n/i;
cur=m... | 0 | 40,257,205 |
#include<bits/stdc++.h>
using namespace std;;
int main(){
string s,t,u;
int a,b;
cin>>s>>t>>a>>b>>u;
if(s==u)
cout<<a-1<<' '<<b<<endl;
else
cout<<a<<' '<<b-1<<endl;
} | #include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 9e18
#define ceill(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp << " " <<
ll mod = 1e9+7;
void ans(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostre... | 0 | 3,406,184 |
#include"iostream"
#include"vector"
using namespace std;
int main()
{
vector<int> branch;
int n;
cin>>n;
for(int i=0;i<n;i++)
{
int num;
cin>>num;
branch.push_back(num);
}
for(int i=0;i<branch.size();i++)
{
cout<<"node "<<i+1<<": key = "<<branch[i]<<", ";
if(i>0)
... | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
while (1)
{int a=1;
int b;
int c=0;
int cz=0;
cin >> a;
if (a == 0)
{
break;
}
b = 1000-a;
if (b >= 500)
{
cz = b / 500;
c = c +cz ;
b = b % 500;
}
if (b >= 100)
{
cz = b /100;
c = c + cz;
b = b % 1... | 0 | 11,810,706 |
#include <iostream>
using namespace std;
int main(){
int N, A, B;
cin >> N >> A >> B;
long long res=0;
for(int i=0;i<=N;i++){
int tmp=i, sum=0;
while(1){
sum+=tmp%10;
if(tmp/10 == 0) break;
else tmp/=10;
}
if(A<=sum && sum<=B) res+=i;
}
co... | #include<iostream>
using namespace std;
void sumOfIntegers()
{
int n;
int count;
while(cin>>n)
{
count=0;
for(int a=0;a<10;a++)
{
for(int b=0;b<10;b++)
{
for(int c=0;c<10;c++)
{
for(int d=0;d<10;d++)
... | 0 | 61,664,236 |
#include <iostream>
int main()
{
int64_t n, m;
std::cin >> n >> m;
int64_t sum = 0;
if (n >= m / 2)
{
sum = m / 2;
}
else
{
sum = n;
m -= 2 * n;
sum += m / 4;
}
std::cout << sum << std::endl;
return 0;
} | #include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<deque>
using namespace std;
typedef long long ll;
const ll INF = 1e12+1;
template <class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
template <class T> inline bool chmin(T& a,... | 0 | 1,787,967 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #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... | 0 | 68,227,215 |
#include <iostream>
using namespace std;
int main(){
int n,max=0,x[100]={0};
int x_max;
while (scanf("%d",&n)!=EOF) {
x[n-1]++;
}
for (int i=0; i<100; i++) {
if (max<x[i]) {
max=x[i];
x_max=i;
}
}
cout << x_max+1 << endl;
for (int i=x_max+1; i<100; i++) {
if (x[x_max]==x[i]) {
cout << i+1 <<end... | #include<bits/stdc++.h>
using namespace std;
int main(void){
int N, cnt = 0, ans = 0;
cin >> N;
for(int i = 1; i <= N; i++){
if(i % 2 == 1){
for(int j = 1; j <= i; j++){
if(i % j == 0)
cnt++;
}
if(cnt == 8)
ans++;
cnt = 0;
}
}
cout << ans << "\n";
return 0;
} | 0 | 36,078,053 |
#include<stdio.h>
int main(void){
int a,b,c,d;
scanf("%d %d %d %d",&a,&b,&c,&d);
if(a+b>c+d){
printf("Left");
}else if(a+b<c+d){
printf("Right");
}else{
printf("Balanced");
}
return 0;
} | #include <bits/stdc++.h>
#define db1(x) cout<<#x<<"="<<x<<'\n'
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define vll vector< ll >
#define M 100000
#define MD 1000000007
#define pb push_back
#define rep(i,a,b) for(ll i = a; i <= b... | 0 | 57,083,393 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
if (A + B > C + D)
cout << "Left" << endl;
else if (A + B == C + D)
cout << "Balanced" << endl;
else
cout << "Right" << endl;
} | #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;
const int mod = 1000000007;
const int inf = 1000000007;
int main() {
int n;
string s;
cin >> n >> s;
ll cnt = 0;
vector<ll> cntR(n);
vector<ll> cntB(n);
vector<ll> ... | 0 | 48,231,406 |
#include <bits/stdc++.h>
using namespace std;
#define _overload3(_1,_2,_3,_4,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n,s) for (int i=a;s>0?i<n:i>n;i+=s)
#define rep(...) _overload3(__VA_ARGS__,per,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
string S, T;
cin >> S >> T;
int m = -1;
rep(i, S.size() - T.size() + 1) {
bool ok = true;
rep(j, T.size()) {
if (S[j + i] != '?' && S[j + i] != T[j]) {
ok =... | 0 | 77,341,549 |
#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#inc... | #include <iostream>
using namespace std;
void print_tree(int *xs, int n){
for(int i = 0; i < n; ++i){
printf("node %d: ", (i+1));
printf("key = %d, ", xs[i]);
if(i){
int p = (i-1)/2;
printf("parent key = %d, ", xs[p]);
}
int left = i*2 + 1;
int... | 0 | 34,166,175 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,n) for (ll i = 0; i < (n); ++i)
#define RREP(i, n) for (ll i = (n) - 1; i >= 0; --i)
#define ALL(v) (v).begin(), (v).end()
template<class T>
using reverse_priority_queue = priority_queue<T, vector<T>, great... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using Pa = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N,K;
cin >> N >> K;
vec<ll> A(N),B... | 0 | 76,941,203 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
struct Node {
int key;
Node *prev, *next;
};
Node *nil;
void init() {
nil = (Node *)malloc(sizeof(Node));
nil->next = nil;
nil->prev = nil;
}
void insert(int key) {
Node *x = (Node *)malloc(sizeof(Node));
x->key = k... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAXN = 1e5+5;
ll n, a[MAXN], val[MAXN];
vector<ll> g[MAXN];
void dfs(ll v, ll f = -1) {
ll ct = 0;
for (ll u : g[v]) {
if (u == f)
continue;
ct++;
dfs(u, v);
}
if (ct == 0) {
val[v] =... | 0 | 17,638,278 |
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
using namespace std;
using pii = pair<int,int>;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef vector<bool> VB;
typedef vector<string> VS;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define REP(i, init, N) for (int i =... | 0 | 72,935,471 |
#include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<clas... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <climits>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 0; i < (n) + 1; i++)
#define all(a) (a).begin(), (a).end()
typedef long long int ll... | 0 | 88,133,238 |
#include <iostream>
#include <stack>
using namespace std;
int main(){
string str;
while(true){
getline(cin,str);
if(str==".") return 0;
bool ok = true;
stack<char> s;
for(auto c:str){
if(c=='('||c=='['){
s.push(c);
}else if(c==']'){... | #include<iostream>
typedef long long ll;
using namespace std;
int main() {
ll x, t;
cin >> x >> t;
if (x < t) cout << 0 << endl;
else cout << x - t << endl;
return 0;
} | 0 | 56,369,838 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#inclu... | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 0 | 27,085,490 |
#include <iostream>
using namespace std;
int main(){
string keys[] = {
"",
".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz",
};
int n;
string s;
int kind;
int cur;
cin >> n;
for( int lp=0;lp<n;lp++ ){
cin >> s;
cur=-1;
for( unsigned in... | #include <iostream>
using namespace std;
int P[10010];
void init(int N) {
for (int i=0; i<=N; ++i) P[i] = i;
}
int root(int a) {
if (P[a] == a) return a;
return (P[a] = root(P[a]));
}
bool is_same_set(int a, int b) {
return root(a) == root(b);
}
void unite(int a, int b) {
P[root(a)] = root(b);
}
int N=... | 0 | 72,142,891 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using namespace std;
int main(){
int n;
cin >> n;
double input[n];
rep(i, n) cin >> input[i];
sort(input, input+n);
double res = input[0];
for(int i=0; i<n; i++) res = (res + input[i])/2;
cout << res ... | #include<bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const int INF= 1e9+5;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll> >vvl;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> T;
const ll MOD=1000000007LL;
string abc="abcdefghijk... | 0 | 49,023,593 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
templa... | #include <bits/stdc++.h>
#include <complex>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll N,M,H,W,K,Q,A,B,C,L,R;
string ... | 0 | 99,936,012 |
#include <bits/stdc++.h>
using namespace std;
#define PI 3.141592653589793
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef long double ld;
int main(){
ll N, M;
cin >> N >> M;
vector<ll> a(N,0);
vector<ll> b(N,0);
ve... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s; cin >>s;
int w=0;
for (auto c: s) if(c=='W'){w++;}
int left_white = 0, t;
long long ret = 0;
for (int i = 0; i < w; i++) {
t = s.substr(left_white, s.size()).find('W');
if (t==0) {
}
else {
... | 0 | 73,755,522 |
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
bool b[26]= {false};
int l = s.size();
for (int i=0; i<l; i++){
b[(s[i]-'a')]=true;
}
for (int i=0; i<26; i++) {
if (!b[i]) {
cout << char (i + 'a') <<endl;
return 0;
}
}
cout << "None" <<endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
using namespace std;
long long MOD = 1000000007;
int main(){
int N;
cin >> N;
vector<ll>... | 0 | 100,419,957 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vecto... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
ll nck(ll n, ll k){
ll ret = 1;
rep(i, k){
ret *= (n - i);
ret /= (i... | 0 | 64,216,119 |
#include <bits/stdc++.h>
#define pb push_back
#define long long long
#define pll pair < long , long >
#define vll vector < pll >
#define ml map < long , long >
#define mll map < pll , long >
#define x first
#define y second
#define vl vector < long >
#define io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using ... | #include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#d... | 0 | 55,067,345 |
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
while (1) {
long a[5001] = { 0 };
long n;
cin >> n;
if (n == 0)break;
a[0] = 0;
long maxv = -100000;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
a[i] = max(a[i], a[i] + a[i - 1]);
maxv =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = ll(1000000000+7);
ll mpow(ll x, ll n){
ll ans = 1;
while(n != 0){
if(n&1) ans = ans*x % MOD;
x = x*x % MOD;
n = n >> 1;
}
return ans;
}
int main(void)
{
ll N, K;
cin >> N >> K;
vector<ll> ans... | 0 | 63,371,809 |
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
int main(void) {
int N, A, B;
cin >> N >> A >> B;
int ans = 0;
string i_str;
for (int i = 1; i <= N; i++) {
int j = 0;
int tmp = 0;
i_str = to_string(i);
while(i_str[j]){
tmp ... | #include <iostream>
#include <algorithm>
#include <vector>
#include <fstream>
#include <string>
#include <sstream>
#include <math.h>
#include <set>
using namespace std;
#define rep(i,n) for(int i = 0; i < n ; i++)
#define pb push_back
static const int INF = (1 << 21);
int main (void) {
string a,b;
cin >> a >> b;
... | 0 | 66,199,275 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E18;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a... | #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);... | 0 | 95,893,890 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O2,no-stack-protector,unroll-loops,fast-math")
#define F first
#define S second
#define pb push_back
#define SZ(x) (ll)(x.size())
#define all(x) x.begin(),x.end()
#define MP make_pair
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pl... | #include <iostream>
#include <string>
#include <math.h>
using namespace std;
int main(){
string str,command,p;
string X="print",Y="reverse",Z="replace";
int q,a,b,i,j;
char w;
cin >> str;
cin >> q;
for(i=0;i<q;i++){
cin >> command >> a >> b;
if(command == X){
for(j=a;j<=b;j++){
cout << str[j];
}
... | 0 | 75,765,707 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const static int N = 10;
int partition(vector<int>& A,int p,int r) {
int x = A[r];
int i = p - 1;
for(int j=p;j<r;j++) {
if(A[j] > x) {
i++;
swap(A[i],A[j]);
}
}
swap(A[i+1],A[r]);
return i+1;
}
void quick_sor... | 0 | 56,240,011 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int counter=0;
string a;
cin>>a;
for(int i=0;i<3;i++){
if(a.at(i)=='a'){
counter++;
break;}}
for(int i=0;i<3;i++){
if(a.at(i)=='b'){
counter++;
break;}}
for(int i=0;i<3;i++){
if(a.at(i)=='c'){
counter++;
break;}}
if(counter==3)
cout<<"Yes"<<endl;
else
cout<<"No"... | #include <bits/stdc++.h>
#define rep(X,N) for(ll X = 0LL; X < (N); X++)
#define ALL(V) (V).begin(),(V).end()
#define endl "\n"
using namespace std;
typedef long long ll;
const double PI = 3.1415926535897932384626;
const ll MODN = 1000000007;
const ll MODN2 = 998244353;
const double EPS = 1e-10;
int main(){
string s... | 0 | 71,226,433 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#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 all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | 0 | 96,591,593 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n);
int ai=a[n-1];
int index=lower_bound(a,a+n,ai/2)-a;
if(a[index]==ai/2){
cout<<ai<<" "<<a[index]<<endl;
return 0;
}
if(a[i... | #include<bits/stdc++.h>
#define mp make_pair
using namespace std;
typedef long long ll;
typedef long l;
typedef long long unsigned ull;
ll nCr(int n,int r){
long long p=1,k=1;
if(n<r)
return 0;
if(n-r<r){
r = n-r;
}
if(r!=0){
while(r){
p *= n;
k *= r;
... | 0 | 86,245,830 |
#include <iostream>
#include <string>
#include <cctype>
#define MAXSIZE 101
#define PI 3.141592653589
using namespace std;
int main(){
string s;
getline(cin,s);
for(int i=0;i<s.size();i++){
if(islower(s[i])){
s[i]=toupper(s[i]);
}else if(isupper(s[i])){
s[i]=tolower(s[i]);
}
}
std::cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> a(H, vector<char>(W));
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
cin >> a.at(i).at(j);
}
}
int row = H;
int col = W;
vector<int> memorow;
... | 0 | 41,619,300 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
long n;
cin >> n;
if( n&1 ){
cout << 0 << endl;
return 0;
}
long nTmp = n/2;
long ans = 0, multiple = 5;
while( nTmp >= multiple ){
ans += nTmp / multiple;
multiple *= 5;
}
cout << ans << en... | #include <iostream>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
if (a<b){
if(b<c){
cout << "Yes" << endl;
}else if(b>c){
cout << "No" << endl;
}
}else{
cout << "No" << endl;
}
return 0;
} | 0 | 27,809,435 |
#include <iostream>
#include <string>
#include <stack>
#include <cctype>
using namespace std;
#define DEBUG(x) cerr << #x << " = " << x << endl
int main() {
while(true) {
string line; getline(cin, line);
if(line == ".") break;
stack<char> s;
bool valid = true;
for(int i = 0; ... | #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;
string s;
cin >> n >> s;
int ans = 0;
rep(i, 1000) {
int t = i;
int cnt = 0;
for (int j = n - 1; j >= 0; j--) {
if (s[j] - '0' == t % 10) {
cnt++;
t /= 10;
if ... | 0 | 15,637,885 |
#include <bits/stdc++.h>
using namespace std;
using str = string;
using ss = stringstream;
str key="keyence";
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
str s;cin>>s;
int fk=0;
for(;fk<7;fk++)if(s[fk]!=key[fk])break;
int bk=0;
for(;bk<7;bk++)if(s[s.size()-1-bk]!=key[7-1-bk])break;
... | #include <iostream>
#include <string>
using namespace std;
int main(){
int i,cnt_0=0,cnt_1=0;
string s;
cin >> s;
for(i=0;i<s.length();++i){
if(s[i]=='0') ++cnt_0;
else ++cnt_1;
}
cout << 2*min(cnt_0,cnt_1) << endl;
return 0;
} | 0 | 97,110,052 |
#include <iostream>
using namespace std;
typedef long long ll;
ll gcd(ll n,ll m){
if(m==0){
return n;
}
else{
return gcd(m,n%m);
}
}
int main(){
ll n,x;
cin >> n >> x;
cout << 3*(n-gcd(n,x)) << endl;
} | #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 | 58,902,197 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
const long MOD = 1000000007;
typedef pair<int, int> P;
typedef long long ll;
int main(){
int H, W, D;
cin >> H >> W >> D;
int A[H][W];
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
cin >>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i,a,n) for(ll i=a;i<(ll)(n);i++)
int main(){
int N; cin>>N;
string S[N];
rep(i, N){
cin>>S[i];
}
map<char, long> m;
int i=0;
for(string s : S){
m... | 0 | 34,368,372 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, a, n) for (ll i = a; i < (ll)n; ++i)
const ll MOD = 1000000007;
using namespace std;
const int dy[4] = {0, 1, 0, -1};
const int dx[4] = {1, 0, -1, 0};
int main(void)
{
int n;
cin >> n;
vector<int> v(n);
rep(i, 0, n) cin >> v[i];
int ans =... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
#define REP(i, n) for(int i = 0; i < n; ++i)
#define FOR(i, t, n) for(ll i = t; i <= (ll)n; ++i)
struct edge {
int from, to;
ll cost;
};
class Eratosthenes {
public:
vector<bool> prime;
Eratosthenes(int size) ... | 0 | 72,595,252 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 110000;
int a[maxn];
int nxt[maxn][20];
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, l, q; cin >> n;
for(int i = 1; i <= n; ++ i) cin >> a[i];
cin >> l;
for(int i = 1; i <= n; ++ i) {
int nx = upper_bound(a + i, a + n + 1, a... | #include <iostream>
using namespace std;
typedef long long int LLI;
int main()
{
int n, ans = 0;
cin >> n;
int l, r;
for(int i = 0; i < n; i++)
{
cin >> l >> r;
ans += r - l + 1;
}
cout << ans;
} | 0 | 58,846,431 |
#include <iostream>
using namespace std;
int main()
{
int N;
cin >> N;
for(int i = 0; i < N; i++) {
int Y, M, D;
cin >> Y >> M >> D;
int res = 1;
for(; D < ((Y % 3 == 0 || M % 2 == 1) ? 20 : 19); D++) res++;
for(; M < 10; M++) res += ((Y % 3 == 0 || (M+1) % 2 == 1) ? ... | #include <iostream>
#include <stdio.h>
#include <string.h>
#include <queue>
using namespace std;
const int M=1005;
char ti[M][M];
int isu[M][M];
int n,m,nn;
int dx[]={0,0,-1,1};
int dy[]={-1,1,0,0};
queue<int> qu;
void init_bfs()
{
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
if(ti[i][j]=='S')
... | 0 | 79,784,983 |
#include <iostream>
#include <vector>
int main(void){
int n, m;
std::cin >> n >> m;
std::vector<std::vector<int>> check(m);
std::vector<int> p(m);
for (int i = 0; i < m; i++) {
int k;
std::cin >> k;
for (int j = 0; j < k; j++) {
int num;
std::cin >> nu... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,N-1,0)
#define RREPS(i,n) RFOR(i,N,1)
#define int long long
#define mp make_pair
#define ... | 0 | 79,632,970 |
#include<stdio.h>
#include<string.h>
int main()
{
int n;
scanf("%d",&n);
char str[102];
scanf("%s",&str);
int len=strlen(str);
if(len>n)
{
str[n]='.';
str[n+1]='.';
str[n+2]='.';
str[n+3]='\0';
}
printf("%s",str);
return 0;
} | #include <cstdio>
using namespace std;
int main() {
int n[101]={};
int mode=0;
while (true) {
int a;
if (scanf("%d", &a) == EOF)
break;
++n[a];
if (mode < n[a])
mode = n[a];
}
for (size_t i=1; i<=100; ++i)
if (n[i] == mode)
... | 0 | 17,536,325 |
#include<iostream>
using namespace std;
int main(){
int gold,change,count;
while(cin>>gold){
if(gold==0) break;
change = 1000 - gold;
count = 0;
while(change!=0){
if(change>=500){
count++;
change -= 500;
}
else if(change<500&&change>=100){
count++;
change -= 100;
}
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
const double PI = acos(-1.0);
const ll MOD = 1e9 + 7;
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << #x << ": " << x << endl;
#define popcnt __builtin_popcount
string color= "RGBY";
in... | 0 | 82,327,349 |
#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 all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using vi = vector<int>;
using vv = vector<vi>;
int main(){
int n,m;
cin>>n>>m;
vv road(n, vi (n,0));
rep(i,m){
int a,b;
cin >> a >> b;
a--;b--;
road[a][b] = 1;
road[b][a] = 1;
... | 0 | 43,576,160 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmi... | 0 | 59,412,229 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
signed main() {
ll n, d;
cin >> n >>d;
vector<vector<ll>> x(n, vector<ll>(d));
rep(i, n){
rep(j, d){
cin >> x.at(i).at(j);
}
}
ll ans = 0;
for(ll i = 0; i < n; i++){
for(ll j = i + 1;... | #include<iostream>
#include<string.h>
#include <algorithm>
#include <cstring>
#include <math.h>
#include <map>
using namespace std;
int main()
{
long long a;
char s[4];
cin>>a>>s;
int bb =(s[0]-'0')*100 +(s[2]-'0')*10+(s[3]-'0');
long long ans =bb*a/100;
cout<<ans<<endl;
return 0;
} | 0 | 28,155,514 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> VI;
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) { if (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
LL a[101010], d[101010];
int main(){
int N;
scanf("%d", &N);
L... | 0 | 19,008,222 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char c;
bool hasVowel = false;
cin >> c;
string vowel = "aiueo";
for (int i=0; i<5; i++) {
if (c == vowel.at(i)) hasVowel = true;
}
if (hasVowel == true) cout << "vowel" << endl;
else cout << "consonant" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#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 all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<... | 0 | 4,219,736 |
#include<cstdio>
#include<cmath>
#include<iostream>
using namespace std;
int main(void) {
int K, A, B;
scanf("%d %d %d", &K, &A, &B);
bool ans = false;
for (int i = A; i <= B; i++) {
if (i % K == 0) ans = true;
}
printf(ans ? "OK" : "NG");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
string s;
int n;
in... | 0 | 30,297,400 |
#include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<(n);i++)
#define REP2(i,d,n) for(int i=(d);i<(n);i++)
#define RREP(i,n) for(int i=(n);i>=0;i--)
#define CLR(a) ... | #include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
struct Node {
int i;
int v;
Node(int i = -1, int v = -1) {
this->i... | 0 | 16,154,362 |
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long long;
using P = pair<ll,ll... | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <queue>
#include <stack>
#include <map>
#define FOR(i,b,e) for(int i=b;i<e;i++)
#define REP(i,n) FOR(i,0,n)
using namespace std;
const int N = 100;
int n;
int d[N+1];
vector< vector<int> > ns;
queue<int> q;
int main() {
cin.tie(0);
... | 0 | 17,929,949 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
void solve()
{
int n,k;
cin>>n>>k;
int h[n];
for(int i=0; i<n; i++){
cin>>h[i];
}
int dp[n];
dp[0]=0;
for(int i=1; i<n; i++){
int c=INT_MAX;
for(int j=1; j<=k; j++){
... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
in... | 0 | 33,637,630 |
#include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define endl "\n"
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
int n, h, w, r, c;
cin >> n >> h >> w;
int ans = 0;
fo... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n;
while(cin >> n, n != 0) {
vector<int> v(n);
for(int i = 0; i < n; ++i) {
cin >> v[i];
}
sort(v.begin(), v.end());
int ans = 0;
for(int i = 1; i < n - 1; ++i) {
ans += v[i];
}
cout << ans / (n - 2)... | 0 | 41,359,563 |
#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()
void solve() {
int n, a;
cin >> n >> a;
cout << n * n - a << '\n';
}
signed main() {
#ifdef _DEBUG
#endif
ios::sync_with_stdio(0); cin.tie(0);
in... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#define N 200005
using namespace std;
int n,top;
int s[N],st1[N],st2[N];
bool check(int a){
top=0;
for(int i=1;i<=n;i++){
if(s[i]<=s[i-1]){
if(a==1) return 0;
while(top>0&&st1[top]>s[i]... | 0 | 47,467,347 |
#include <bits/stdc++.h>
using namespace std;
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; }
const ll INF = 1LL << 60;
const int MAX = 1000000010;
const ll MOD... | #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; cin>>N;
vector<int> vW(N);
int total=0;
rep(i,N){
int x; cin>>x;
total += x;
vW[i]=x;
}
int ans = 1e9;
int left = 0;
for(int i=0; i<... | 0 | 67,797,128 |
#include <iostream>
#include <string>
#include <queue>
#define llint long long
using namespace std;
llint n;
llint a[100005];
void GaussianElimination(llint a[], int n)
{
llint r = 0;
for(int i = 59; i >= 0 && r < n; i--){
if((a[r]&(1LL<<i)) == 0){
int p = -1;
for(int j = r+1; j < n; j++){
if(a[j] & (1LL<... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vecto... | 0 | 40,385,446 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
int sum =0;
for(int i =0;i<B-A+1;i++){
string a = to_string(A + i);
if(a.at(0)==a.at(4)&&a.at(1)==a.at(3)){
sum++;
}
}
cout<<sum<<endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
typedef pair<int,int> Pi;
const... | 0 | 58,613,796 |
#include <iostream>
#include <string>
#include <map>
using namespace std;
void solve()
{
map<string, int> Map;
string str;
getline(cin, str);
str += ' ';
int n = str.size();
string temp;
string LongestWord;
for(int i = 0; i < n; ++i)
{
if(str[i] == ' ')
{
++Map[temp];
if(LongestWord.size() < temp.siz... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define EPS (1e-15)
#define rep(i, n)... | 0 | 76,804,104 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<cstring>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<climits>
#include<fstream>
#define MOD (1000000007)
using namespace std;
typedef long long ... | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
#define INF 1LL<<60
#define fs first
#define sc second
#define pb push_back
#define int long long
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i = (b-1);i>=a;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#d... | 0 | 61,220,087 |
#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(),a.rend()... | #include<iostream>
#include<string>
#include<sstream>
using namespace std;
string intTostring(int num){
stringstream ss;
ss<<num;
return ss.str();
}
int mcxiToint(string str){
int num=0;
int loop=0;
for(int i=(int)str.size()-1;i>=0;i--){
if(str[i]=='i') loop=1;
if(str[i]=='x') loop=10;
if(str[i]... | 0 | 50,212,124 |
#include <iostream>
#include <string>
using namespace std;
string s, t;
int main() {
int N; cin >> N;
cout << 0 << endl;
cin >> s;
if(s == "Vacant") {
return 0;
}
int l = 0, r = N;
while(t != "Vacant") {
int mid = (l+r) / 2;
cout << mid << endl;
cin >> t;
if(mid % 2^s == t) l = mid;
... | #include <algorithm>
#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>
#incl... | 0 | 63,528,881 |
#include <bits/stdc++.h>
using namespace std;
#define XDAY 196471
void solve(int y,int m,int d){
int today=1;
for(int i=1;i<y;i++){
if(i%3) today+=195;
else today+=200;
}
for(int i=1;i<m;i++){
if(i%2||!(y%3)) today+=20;
else today+=19;
}
today+=(d-1);
cout<<XD... | #include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
#include<list>
using namespace std;
const int maxn = 100000;
const int infly = (1<<29);
vector <int> G[maxn+5];
list <int> out;
bool c[maxn];
int N;
int indge[maxn];
void bfs(int s)
{
queue <int> q;
q.push... | 0 | 85,736,887 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=300009;
const int MOD=1e9+7;
ll a[N],n,ans;
int main() {
cin>>n;
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<60;i++) {
ll x=0;
for(int j=0;j<n;j++) if((a[j]>>i)&1) x++;
ll t=x*(n-x)%MOD;
for(int ... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | 0 | 26,508,212 |
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
#include <queue>
#include <iomanip>
#include <string>
#include <algorithm>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep_1 (i,j,n) for(int i=j;i<n;i++)
typedef long long ll;
typedef long l;
const ll ... | #include<bits/stdc++.h>
#include<bitset>
using namespace std;
#define M 1000000007
#define pb push_back
#define f first
#define s second
#define rep(i, st, ed) for(int i=st; i<ed; i++)
#define repn(i, st, ed) for(int i=st; i<=ed; i++)
#define repb(i, ed, st) for(int i=ed; i>=st; i--)
#define all(v) v.begin(),v.end()
ty... | 0 | 42,272,491 |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
#define ll_MAX LONG_LONG_MAX
#define ll_MIN LONG_LONG_MIN
#define pi pair<int,int>
#define endl "\n"
#define MAXN 100005
#define mod 1000000007
using namespace std;
void solve()
{
}
int main()
{
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXV = 100;
const ll INF = (1LL<<60);
int V, E;
ll adjMat[MAXV][MAXV];
int main(){
scanf("%d%d",&V,&E);
for (int i = 0; i < V; i++)
for(int j = 0; j < V; j++)
adjMat[i][j] = INF;
for (int i = 0, s, t, d; i < E;... | 0 | 65,148,277 |
#include <bits/stdc++.h>
#define ll long long
#define endl '\n'
#define PI acos(-1)
#define sz 100010
#define RUN_FAST ios::sync_with_stdio(false);
using namespace std;
int main()
{
int n;
scanf("%d", &n);
int arr[n], i;
for (i=0; i<n; i++) scanf("%d", &arr[i]);
sort(arr, arr+n);
for (i=1; i<n; ... | #include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include <string>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include<bits/stdc++.h>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#defi... | 0 | 87,314,232 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include<iomanip>
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
using namespace std;
#define debug(x) cout<<(#x)<<"="<<(x)<<", ";
#defin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | 0 | 40,584,402 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.