code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 32 101M |
|---|---|---|---|
#include <iostream>
#include <stdio.h>
#include <string>
#include <map>
#include <stack>
#include <vector>
#include <string.h>
#include <set>
#include <queue>
#include <cmath>
#include <algorithm>
using namespace std;
struct node
{
int x;
int y;
int dist;
node(int x , int y , int dist)
{
this -> x = x;
this ->... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(... | 0 | 11,332,475 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define all(v) v.begin(),v.end()
#define sz size()
#define mp make_pair
#define pb push_back
#define rep(p,a,b) for(ll p=a ; p<b ; p++)
#define rap(p,a,b) for(ll p=a ; p<=b ; p++)
#define per(p,a,b) for(ll p=a ; p>=b ; p--)
#define F first
#define S se... | 0 | 21,710,273 |
#include <iostream>
#include <cmath>
using namespace std;
int main(int argc, char* argv[]) {
int N, M;
cin >> N >> M;
long double ret = 0;
ret = (M * 1900 + (N - M) * 100) * pow(2, M);
cout << ret << endl;
return 0;
} | #include<bits/stdc++.h>
#define N 100010
#define ll long long
using namespace std;
ll n, sum, ans, res;
ll a[N], p[70];
void rd(ll &ans)
{
ans = 0; ll f = 1;
char x = getchar();
while(x > '9' || x < '0') {if(x == '-') f = -1; x = getchar();}
while(x >= '0' && x <= '9') ans = ans * 10 + x - '0', x = getc... | 0 | 32,316,546 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>... | #include <bits/stdc++.h>
#define ep emplace_back
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pil pair<int,ll>
#define pli pair<ll,int>
typedef long long ll;
using namespace std;
int a[15][15];
int price[15];
int main()
{
cin.tie(0);cout.tie(0);
ios::sync_with_stdio(false);
... | 0 | 15,003,603 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll gcd(ll a,ll b){
if(a<b)swap(a,b);
if(a%b==0)return b;
return gcd(a%b,b);
}
ll lcm(ll a,ll b){
return a/gcd(a,b)*b;
}
int main() {
int n;
cin>>n;
vector<ll> T(n);
re... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
... | 0 | 16,216,981 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#defin... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n;
int a[5000];
while(cin >> n && n>0){
for(int i=0;i<n;i++)
cin >> a[i];
long long sum=0,tmp=0,ma=-100000;
int m=-100000;
bool flg=true;
for(int i=0;i<n;i++){
if(flg) m=max(m,a[i]);
if(a[i]>=0){
f... | 0 | 25,132,356 |
#include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typen... | 0 | 46,559,396 |
#pragma GCC optimize("Ofast")
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#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 <cstdl... | #include <iostream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <functional>
#include <stack>
#include <queue>
#include <string>
#include <unordered_map>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007ll;
const ll hmax=1000000000;
const l... | 0 | 15,197,205 |
#include "bits/stdc++.h"
using ll = long long;
using namespace std;
int sum(int x) {
if(x < 10) return x;
return x % 10 + sum(x / 10);
}
void solveCase() {
int n;
cin >> n;
vector <int> v(n);
for(auto &e: v) {
cin >> e;
}
vector <int> cntArr;
int cur = v[0];
int cnt = 1;
for(int i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int i=ini;i<n;i++)
#define _rep(i,ini,n) for(int i=ini;i>=n;i--)
#define ToEnd(a) a.begin(),a.end()
uint64_t MOD=1000000007;
int main(){
int N; cin>>N;
vector<int64_t> A(N),B(N);
rep(n,0,N) cin>>A.at(n);
rep(n,0,N) cin>>B.at(n);
... | 0 | 83,415,570 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<vector<int>> bingo(3,vector<int>(3));
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
cin >> bingo.at(i).at(j);
}
}
int n;
cin >> n;
vector<int> number(n);
for(int i=0;i<n;i++){
cin >> number.at(i);
}
for(int i=0;i<3;i++){... | #include <bits/stdc++.h>
using namespace std;
#define erorp(x) cout<<#x<<"={"<<(x.F)<<" , "<<x.S<<"}"<<endl;
#define print(v,r) f(i,0,r) cout<<v[i]<<" "; cout<<endl;
#define is_bit(x,y) (x%(1<<(y+1))>=(1<<y))
#define eror(x) cout<<#x<<'='<<(x)<<endl;
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define Gett(x,y) scanf("%d%d... | 0 | 38,162,751 |
#include<bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define pb push_back
#define fi first
#define se second
#define in insert
#define mp make_pair
#define GCD(a,b) __gcd(a,b);
#define endl "\n"
#define FRU f... | #include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define ll long long
int main(){
Hello
string s, a = "", b = "";
cin >> s;
for(int i = 0; i < s.size(); i++){
if(i % 2) a += '1';
else a += '0';
}
fo... | 0 | 83,504,789 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n, a, b;
cin >> n >> a >> b;
cout << ((b - a) % 2 ? "Borys" : "Alice") << endl;
} | #include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
bool solve() {
int N;
cin >> N;
vector<int> A(N);
REP(i, N) cin >> A[i];
ll sum_A = accumulate(all(A), 0ll);
ll n_stones_per_operation = (ll)N * (N + ... | 0 | 29,747,833 |
#include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do { cout << "\033[32;1m " << #x << " -> "; err(x); } while (0)
void err() { cout << "\033[39;0m" << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cout << v << ' ';... | #include <bits/stdc++.h>
#include <stdio.h>
#include<iostream>
#include<cstdio>
#include<bitset>
#include<algorithm>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<string.h>
#include<cmath>
#include<utility>
#include<functional>
#include<map>
#include<set>
#include<cctype>
#in... | 0 | 62,649,282 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define fi first
#define se second
#define lz length()
#define all(x) (x).begi... | 0 | 67,131,639 |
constexpr bool isDebugMode = false;
int testcase = 1;
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge{long long to,cost;};
const int inf = 1 << 27;
const ... | #include <iostream>
#include <algorithm>
#include <vector>
#define rep(i,n) for (int i=0; i < (n); ++i)
using ll = long long ;
using namespace std;
const int INF = 1001001001;
int main() {
int n ;
cin >> n ;
vector<int> a(26) ;
rep(i,n){
string s ;
cin >> s ;
vector<int> tmp(26) ... | 0 | 8,399,913 |
#include <stdio.h>
int main()
{
int n;
scanf("%d",&n);
int x[n+2], y[n+2];
int dp[n+2][n+2];
for(int i = 1; i<=n; i++){
scanf("%d %d",&x[i],&y[i]);
dp[i][i] = 0;
} x[n+1] = y[n];
dp[n+1][n+1] = 0;
int min = 1<<30;
for(int m = 2; m<=n+1; m++){
for(int i = 2; i<... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool ch... | 0 | 44,660,929 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
long long N, M;
cin >> N >> M;
if(N == 1 && M == 1){
cout << 1 << endl;
return 0;
}
if(N == 1){
cout << M - 2 << endl;
return 0;
}
if(M == 1){
cout << N - 2 << endl;
return ... | #include <bits/stdc++.h>
#define ri register
#define int long long
#define E (n+1)
using namespace std; const int N=1000010;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
re... | 0 | 97,603,292 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<fstream>
using namespace std;
string s;
int dp[(1<<26)+1];
long long now=0;
int main(){
cin>>s;
memset(dp,63,sizeof(dp));
dp[0]=0;
for(int i=0;i<=s.length()-1;i++){
now^=(1<<(s[i]-'a'));
for(int j=0;j<=25;j++){
if((now^(1<<j))!... | #include <iostream>
using namespace std;
void swap(int *a, int i, int j) {
int tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
void selectionSort(int *a, int n, int &ans) {
for (int i = 0; i < n; ++i) {
int minj = i;
for (int j = i; j < n; ++j) {
if (a[j] < a[minj]) minj = j;
... | 0 | 64,479,697 |
#include <iostream>
#include <queue>
using namespace std;
#define MAX 110
int matrix[MAX][MAX];
int dst[MAX];
void input(int num){
for(int i=0;i<MAX;i++){
dst[i] = -1;
for(int j=0;j<MAX;j++){
matrix[i][j] = 0;
}
}
for(int i=1;i<=num;i++){
int v; cin >> v;
... | #include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long ... | 0 | 53,514,704 |
#include<stdio.h>
int main(){
int input, angka1=0, angka2=0, angka3=0;
scanf("%d", &input);
angka1=input/100;
angka2=(input-(angka1*100))/10;
angka3=input%10;
if(angka1 == 7 || angka2 == 7){
printf("Yes\n");
}
else if (angka3 == 7){
printf("Yes\n");
}
else{
puts("No\n");
}
return 0;
} | #include <iostream>
#include<string>
#include<list>
#include<algorithm>
#include<cstdio>
using namespace std;
int main(){
int n,t;
scanf("%d",&n);
list<int> V;
string com;
for(int i=0;i<n;i++){
cin>>com;
if(com[0]=='i'){
scanf("%d",&t);
V.push_front(t);
... | 0 | 80,580,343 |
#include <iostream>
#include <algorithm>
using namespace std;
int N, M, C[21];
int dp[21][50001];
int main(){
for(int i = 0; i < 21; i++){
for(int k = 0; k < 50001; k++){
dp[i][k] = 30000;
}
}
for(int i = 0; i < 21; i++){
dp[i][0] = 0;
}
cin >> N >> M;
for(int i = 0; i < M; i++){
cin >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
i... | 0 | 7,615,762 |
#include<bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
#define rep(i, N) for(int (i) = 0; (i) < (N); (i)++)
#define all(v) (v).begin(), (v).end()
#define eb emplace_back
int main(){
int N, K;
cin >> N >> K;
if(K == 1) K = N;
cout << max(N - K, 0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
int a;
cin>>a;
if(a<1200)cout<<"ABC"<<endl;
else if(a<2800)cout<<"ARC"<<endl;
else cout<<"AGC"<<endl;
return 0;
} | 0 | 18,965,369 |
#include <vector>
#include <set>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
void yes(bool cond) { cond ? puts("Yes") : puts("No"); }
int main()
{
cin.tie(0); ios::sync_with_stdio(false);
ll N, K, d,... | #include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define ll long long
const int N = 1e5 + 5, mod = 1e9 + 7;
bool step[N];
int n, m, dp[N];
ll solve(int idx){
if(idx > n || (step[idx] == false)) return 0;
if(idx == n) return 1;
... | 0 | 82,068,678 |
#ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define rep(i, l, r) for (ll i = (l); i < (r); ++i)
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define vi vector<int>
#define vll vector<ll>
#d... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define repr(i, j) for(int i = j; i >= 0; --i)
#define INF (1 << 30)
#define MOD 1e9 + 7
typedef long long ll;
typedef unsigned long long ull;
typedef pair<string, int> P;
int main() {
int h, ... | 0 | 89,754,926 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
#define reverse(s) reverse(s.begin(),s.end())
ll gcd(ll a, ll b) {
if (b==0) return a;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
int a=A+B;
if(A%3==0){
cout<<"Possible"<<endl;
}
else if(B%3==0){
cout<<"Possible"<<endl;
}
else if(a%3==0){
cout<<"Possible"<<endl;
}
else{
cout<<"Impossible"<<endl;
}
} | 0 | 71,875,841 |
#include <bits/stdc++.h>
#define ll long long
#define db double
#define deb(x) cout<<#x<<": "<<x<<"\n"
#define all(x) x.begin(),x.end()
#define fo(i, n) for(i=0 ; i<n ; i++)
#define Fo(i, k, n) for(i=k ; i<n ; i++)
using namespace std;
const ll mod = 1000000007;
const ll N = 300005;
const ll inf = 10000000000000000;
... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
long q,h,s,d,n;
cin >>q>>h>>s>>d>>n;
q *= 4;
h *= 2;
long minimum = min(q,h);
minimum = min(minimum,s);
long ans = 0;
if(n >= 2){
if(2*minimum > d){
... | 0 | 34,132,703 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
char* Solve(string S)
{
stack<char> s;
for (int i = 0; i < S.size(); i++)
{
if (S[i] == '(') s.push(')');
else if (S[i] == '[') s.push(']');
else if (S[i] == ')' || S[i] == ']')
{
if (s.empty() || ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
int n,m;
cin>>n>>m;
vector<ll>x(n),y(n),z(n);
rep(i,n)cin>>x[i]>>y[i]>>z[i];
ll ans=0;
rep(bit,1<<3){
vector<ll>a(n);
rep(i,n){
... | 0 | 12,329,800 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
ll dp[310][310];
int main() {
int n, k;
cin >> n >> k;
... | #include <iostream>
#include <algorithm>
#include <vector>
#define ll long long
#define INF (1000000000000)
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
ll V, E;
cin >> V >> E;
vector< vector< ll > > dist(V, vector<ll> (V, INF));
for(ll i = 0; i< V; i++)
dist[i][i] = 0;
for(ll i = ... | 0 | 87,007,629 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define be(v) v.begin(), v.end()
#define ll long long
ll INF = 1e9;
int main() {
int n; cin >> n;
vector<int> w(n);
int ans = 0;
rep(i,n) {
cin >> w[i];
ans+=w[i];
}
int mi = ans;
int ... | #include <iostream>
#include <string>
#include <array>
using namespace std;
int main() {
string l;
array<int32_t, 27> count = {0};
while (cin >> l) {
for (uint8_t c : l) {
if ('A' <= c && c <= 'Z') {
count[c - 'A']++;
} else if ('a' <= c && c <= 'z') {
... | 0 | 25,601,827 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
bool f[1000001];
fill(f,f+1000001,true);
f[0]=f[1]=false;
for(int i=2;i*i<=1000001;i++)
if(f[i])
for(int j=i*i;j<=1e6;j+=i)
f[j]=false;
int n;
while(cin>>n)
cout<<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie... | 0 | 67,099,385 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k; cin >> n >> k;
vector<int> nums;
int a;
for (int i = 0 ; i < n; ++i) {
cin >> a;
nums.push_back(a);
}
sort(nums.begin(), nums.end());
int res = 0;
for (int i = 0; i < k; ++i) {
res +... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat(i, a, b) for (int i = (a); i < (b); i++)
#define revrepeat(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define revrep(i, n) ... | 0 | 58,282,107 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int N,M;
cin>>N>>M;
long long N1=min(N,M);
long long M1=max(N,M);
if(N1==1&&M1==1) cout<<1<<endl;
else if(N1==1&&M1!=1) cout<<M1-2<<endl;
else cout<<(N1-2)*(M1-2)<<endl;
return 0;
} | #include<stdio.h>
#include<string.h>
#define k 1046527
char a[100];
char b[100];
char H[k][14];
int zhengshu(char a){
if(a=='A')return 1;
else if(a=='C')return 2;
else if(a=='G')return 3;
else if(a=='T')return 4;
else return 0;
}
long long zhuanhuan(char b[]){
long long sum=0;
long long p=1,i;
for(int i=0;i<strlen(b);i... | 0 | 46,757,533 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = (0); i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define limit(x,l,r) ma... | #include<bits/stdc++.h>
using namespace std;
using LL = long long;
using P = pair<LL, LL>;
int main(){
LL H, W, N;
cin >> H >> W >> N;
map<P, LL> Map;
for(int i = 0;i < N;i++){
int ai, bi;
cin >> ai >> bi;
for(int i = ai-2;i <= ai;i++){
for(int j = bi-2;j <= bi;j++){... | 0 | 91,783,755 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <random>
#include <chrono>
using namespace std;
using namespace __gnu_pbds;
#define endl '\n'
typedef long long ll;
typedef pair<ll, ll> pii;
typedef tree<int, null_type,less<int>, rb_tree_tag, tree_order_sta... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0; i<(n); i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main()... | 0 | 63,441,508 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const char nl = '\n';
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n,x;
cin>>n>>x;
if (n*500>=x){
cout<<"Yes"<<nl;
}
else cout<<"No"<<nl;
return 0;
} | # include <cstdio>
# include <algorithm>
using namespace std;
const int MAX = 2000000 + 10;
int idx, key, a[MAX];
void heapInsert(int k) {
idx++;
a[idx] = k;
int p = idx / 2, i = idx;
while (i > 1 && a[p] < a[i]) {
swap(a[p], a[i]);
i = p;
p = i / 2;
}
}
void maxHeapify(int i... | 0 | 11,756,504 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
string ans;
string A,B;
cin >> A >> B;
for(int i=0; i<N; i++)
{
ans+=A.at(i);
ans+=B.at(i);
}
cout << ans <<endl;
} | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = m... | 0 | 58,010,581 |
#include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef vector<double> Vec;
typedef vector<Vec> Mat;
typedef pair<ll,ll> P;
typedef pair<double,ll> Pd;
typedef priority_queue<P,vector<P>,greater<P>> P_queue;
typedef priority_queue<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
ll n;
cin >> n;
vector<ll> a(n+1);
vector<ll> b(n);
rep(i,n+1) cin >> a[i];
rep(i,n) cin >> b[i];
ll ans = 0, t = 0;
rep(i,n) {
... | 0 | 18,845,492 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int r;
cin >> r;
int result = r * r;
cout << result << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define REP(i,n) FOR(i,0,n)
#define pb push_back
#define en "\n"
#define ITER(i,a) for( typeof(a.begin()) i=a.begin();i!=a.end();i++)
#define mod 1000000007
#define mpp make_pair
#define mes(a... | 0 | 52,801,866 |
#include <bits/stdc++.h>
using namespace std;
#include<cstdlib>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
typedef long long ll;
int main(){
int n,m;
cin >> n >> m;
int t = 1900*m + 100*(n-m);
cout << t * pow(2,m);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n+1); i++)
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0... | 0 | 21,501,649 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int time, h;
string str, a, b;
while(1){
cin >> str;
if(str == "-") break;
cin >> time;
for(int i = 0; i < time; ++i){
cin >> h;
a = str.substr(0, h);
b = str.substr(h);
str = b + a;
}
cout << str << endl;
}
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | 0 | 21,505,374 |
#include<iostream>
#include<cmath>
#include<vector>
#include<climits>
#include<algorithm>
#include<numeric>
#include<iomanip>
#include<map>
#include<set>
#include<random>
#include<cassert>
using namespace std;
#define ll long long int
#define ld long double
const ll Mod = 1000000007;
ll CaseN=1;
const ld PI = 22/7.0;
b... | #include<bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for(ll i = 0; i < n; i++)
const ll INF = 1LL << 60;
vector<bool> seen;
vector<int> values;
vector<int> ans;
void dfs(Graph &G, int v, int val){
seen[v] = true;
... | 0 | 37,299,543 |
#include <iostream>
using namespace std;
static void bubbleSort(int *ID, int *A, int N){
int temp;
bool flag;
do{
flag = false;
for (int j = N - 1; j >= 1; j--){
if (A[ID[j]] < A[ID[j - 1]]){
temp = ID[j];
ID[j] = ID[j - 1];
ID[j - 1] = temp;
flag = true;
}
}
} while (flag);
}
static voi... | #include<iostream>
#include<vector>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
#include<map>
#define INF 0xFFFFFF
#define ull unsigned long long
#define ll long long
#define ms(x,a) memset(x,a,sizeof(x))
#define endl "\n"
#define M(a,b) (a+b)/2
#define L(x) 2*x
#define R(x) 2*x+1
using namespace std;
ty... | 0 | 55,444,670 |
#include<bits/stdc++.h>
#include<chrono>
using namespace std;
using namespace std::chrono;
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define fi first
#define se second
#define int long long
#define pb push_back
#define emp emplace_ba... | #include <bits/stdc++.h>
#define uni(x) (x).resize(unique(ALL(x)) - (x).begin())
#define fprint(v) for(auto x : v) cout << x << ' '
#define ALL(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846
#define MP(x, y) make_pair(x, y)
#define SZ(x) int((x).size())
#define PB(x) pus... | 0 | 98,193,199 |
#include <iostream>
#include <utility>
#include <climits>
#include <numeric>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
void solve(int n){
long dp[10][10],ans=INT_MAX,ans2;
rep(i,10) rep(j,10) dp[i][j]=INT_MAX;
rep(i,n){
int f,t,l;
cin>>f>>t>>l;
dp[f][t]=l;dp[t][f]=l;
dp[i][i]=0;
}
rep(k,10... | # include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { re... | 0 | 55,683,315 |
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <assert.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-9;
static const double PI = acos(-1.0);
#define REP(i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll md = 1000000007;
#define rep(i, b) for(i = 0; i < b; i++)
#define fr first
#define sc second
using vl = vector<ll>;
using vvl = vector<vl>;
vl p, B, fac(2, 1), ifac(2, 1);
ll ad(ll a, ll b, ll mod = md) {
return (a%... | 0 | 72,592,686 |
#include <bits/stdc++.h>
using namespace std;
int num = 0;
bool checking_the_format(int a, int i)
{
num++;
if (num == a + 1)
{
if (!(i == '-'))
{
return false;
}
}
else if (!(isdigit(i)))
{
return false;
}
return true;
}
int main()
{
int a, b;
string s;
cin >> a >> b >> s;
for (int i : s)
{
if... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long int;
int main(){
ll n;
cin >> n;
ll ans = 0;
if (n % 2 != 0){
cout << 0 << endl;
return 0;
}
ll i = 5;
ll count = 0;
while(n / 2 >= i){
i *= 5;
count++;
}... | 0 | 43,218,079 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
signed main()
{
string a,b,c;
cin >> a >> b >> c;
if(a.back() == b[0] && b.back() == c[0])
{cout << "YES";}
else{cout << "NO";}
} | #include <bits/stdc++.h>
using namespace std;
bool c[200][200];
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
c[a][b] = true;
}
vector<pair<int, int> > v;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
... | 0 | 48,947,925 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x,y; cin>>x>>y;
if(x*2==y||x*4==y)
cout<<"Yes"<<endl;
else{
if((x*4-y)%2==0&&x*4>y){
if((x*4-y)/2<x)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
}
else
cout<<"No"<<endl;
}
} | 0 | 66,351,915 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REP1(i, n) for(int i = 1; i <= (n); i++)
#define REPD(i,a,b) for (int i=(a);i<=(b);i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> ... | #include <iostream>
#include <string>
using namespace std;
struct Node {
int parent;
int r_sibling;
int l_child;
int depth;
};
Node T[100000];
const int NIL = -1;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
T[i].parent = T[i].r_sibling = T[i... | 0 | 5,480,978 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(){
int n;
string s, t;
cin >> n >> s >> t;
for (int i=0 ; i<n ; i++)
cout << s.at(i) << t.at(i);
} | #include <algorithm>
#include <boost/optional.hpp>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string... | 0 | 94,990,297 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using ll = long long;
const ll INF = 100000000000000;
int main(){
ll n;
std::cin >> n;
std::vector<ll> a(n);
for(int i = 0; i < n; i++){
std::cin >> a[i];
a[i] -= i + 1;
}
std::sort(a.begin(), a.end());
... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) ... | 0 | 79,359,938 |
#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 sp(n) cout << fixed << setprecision(n)
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... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<string> VS;
typedef vector<pair<LL, LL> > VP;
#define For(in) for (LL i = 0; i < (n); i++)
#define FOR(in) for(LL i=1; i <= (n); i++)
#define pb push_back
#define sr(v) sort(v.begin(), v.end())
#define rev(v) rever... | 0 | 6,400,440 |
#include<iostream>
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define endl '\n'
using namespace std;
int main()
{
fastio;
long long n,i,j,temp;
cin>>n;
long long p[n+1],a[n+1],b[n+1];
for(i=1;i<=n;i++)
{
cin>>p[i];
}
for(... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, co... | 0 | 62,321,974 |
#include <bits/stdc++.h>
using namespace std;
using llong = long long;
using ldbl = long double;
using lpair = pair<llong, llong>;
#define ALL(x) x.begin(), x.end()
constexpr llong mod = 1e9+7;
constexpr llong inf = mod * mod;
int main() {
llong N, K;
vector<lpair> xy;
cin >> N >> K;
xy.resize(N);
for (auto &... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<cmath>
using namespace std;
#define REP(i, limit) for(int i=0; i< limit; ++i)
#define FOR(i, j, limit) for(int i=j; i< limit; ++i)
#define DUMP(a) REP(d,a.size()){cout<<a[d];if(d!=a.size()-1)cou... | 0 | 25,272,443 |
#include<stdio.h>
int main()
{
while (1)
{
int n, x;
scanf("%d %d", &n, &x);
if (n == 0 && x == 0) break;
int i, j, k, total, ways=0;
for (i = 1; i <= n - 2; i++)
{
for (j = i + 1; j <= n - 1; j++)
{
for (k = j + 1; k <= n; k++)
{
total = i + j + k;
if (total == x) ways += 1;
}... | #include <iostream>
#include <string>
#define R return
using namespace std;
char convert (int cnt, int num)
{
int d;
switch (num)
{
case 1:
d=cnt%5;
if (d==1) R '.';
if (d==2) R ',';
if (d==3) R '!';
if (d==4) R '?';
if (d==0) R ' ';
case 2:
d=... | 0 | 16,969,083 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >... | #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() {
long n;
cin >> n;
vector<long> p(n);
rep(i,n) {
cin >> p.at(i);
}
long count=1;
long min=p.at(0);
for (long i=1; i<n; ++i) {
... | 0 | 11,233,858 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <string>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <fstream>
#include <unordered_map>
#include <time.h>
using namespace std;
#def... | #include <bits/stdc++.h>
const int INF =1e9;
const int MOD =1e9+7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >= int(... | 0 | 94,892,929 |
#include <bits/stdc++.h>
#define INF 1001001001
using namespace std;
const int MAXN = 100010;
int main() {
int n;
cin >> n;
vector<int> dp(100100, INF);
dp[0] = 0;
vector<int> p;
int a = 1;
while (a < MAXN) {
p.push_back(a);
a *= 9;
}
a = 1;
while (a < MAXN) {
p.push_back(a);
a *= 6;
}
for (int i = ... | #include<bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
typedef long long LL;
int N;
LL A[200001];
typedef pair<int,int>P;
P p[200001];
bool check(LL x){
p[0]=P(1,A[0]);
LL now=0;
for(int i=1;i<N;i++){
if(A[i]-A[i-1]>0){
if(p[now].first==1){
p[... | 0 | 51,583,647 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const int MOD=1000000007;
int main() {
int a,b,c,d,e;
cin >> a;
cin >> b;
cin >> c;
cin >> d;
cin >> e;
int m=10;
if(a%10>0){
m=min(a%10,m);
a=(a/10+1)*10;
}
if(b%10>0){
m=min(b%10,m);
b=(b/10+1)*10;
}
if(c%10>0){
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, N;
cin >> W >> H >> N;
int Mx = 0, mx = W, My = 0, my = H;
vector<int> x(N), y(N), a(N);
for (int i = 0; i < N; i++) {
cin >> x.at(i) >> y.at(i) >> a.at(i);
if (a.at(i) == 1) Mx = max(x.at(i), Mx);
if (a.at(i) == 2) mx = min(x.at... | 0 | 1,074,893 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int num, m;
cin >> num >> m;
vector<tuple<long long, long long, long long>> tpl;
vector<pair<long long, long long>> p(m);
vector<long long> vec(m);
for (int i = 0; i < m; i++) {
long long a, b;
cin >> a >> b;
tpl.... | #include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int n,m;
char bef[201];
char aft[201];
while(scanf("%d",&n)){
if(n==0)
break;
string s;
cin.ignore();
for(int i=0;i<n;i++){
getline(cin,s);
bef[i] = s[0];
aft[i] = s[2];
}
scanf("%d",&m);... | 0 | 93,179,491 |
#include <iostream>
#include <ctime>
#include <cstdlib>
using namespace std;
const int NMAX = 10000;
void PrintArray(int* A, int N)
{
cout << A[0];
for (int k = 1; k < N;k++) {
cout << " " << A[k] ;
}
cout << endl;
}
void Swap(int& a, int &b) {
int tmpA, tmpB;
tmpA = a;
tmpB = b;
a = tmpB;
... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
vector<int> t(n+2), a(n+2), h(n+2, 0);
t[0] = 0;
a[n+1] = 0;
for(int i = 1; i <= n; i++){
cin >> t[i];
if(t[i] != t[i-1]) h[i] = t[i];
}
for(int i = 1; i <= ... | 0 | 8,429,591 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
int ans = 0;
cin >> n;
for (int i = 1; i < n+1; i += 2){
int counter = 1;
for(int j = 1; j < i; j++){
if (i%j == 0){counter += 1;}
}
if (counter == 8){ans += 1;}
}
cout << ans << endl;
... | 0 | 11,704,152 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int v,s,t;
cin>>v>>t>>s;
if (t*s>=v)
cout<<"Yes";
else
cout<<"No";
return 0;
} | #include<bits/stdc++.h>
#define mod 1000000007
#define int long long int
#define phi 1.6180339
#define rep(i,n) for(auto i=0;i<(n);i++)
#define endl "\n"
#define For(i,a,b) for(auto i=(a);i<(b);i++)
#define op1 cin.tie(NULL)
#define op2 cout.tie(NULL)
#define op3 std::ios_base::sync_with_stdio(false)
#define MAXX 10000... | 0 | 36,377,665 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c, d, disx, disy, pm_start;
vector<vector<int>> pm{{1, 1}, {-1, 1}, {-1, -1}, {1, -1}};
cin >> a >> b >> c >> d;
disx = abs(a - c);
disy = abs(b - d);
if (c - a >= 0)
{
if (d - b >= 0)
pm_start = 0;
else
pm_start = 3... | #include<bits/stdc++.h>
#define fi 2*acos(0.0)
#define ee 2.71828
#define ll long long
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Node struct node
#define spc " "
#define E 2.71828182845904523536
#define pb push_back
#define pp pop_back
#define ff first
#define ss second
#define valid(n... | 0 | 93,433,467 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<string> f(n);
for (int i = 0; i < n; ++i)
cin >> f[i];
queue<pair<int, int>> q;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (f[i][j] == '#')
q... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod = int(1e9)+7;
using V = vector<ll>;
using P = pair<ll,ll>;
int main(){
int n,m;cin >>n>>m;
vector<int>p(m);
vector<int>y(m);
for (int i = 0; i <... | 0 | 50,592,458 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <set>
#include <algorithm>
#include <iomanip>
typedef long long ll;
const ll MOD = 1e9 + 7;
const long long INF = 1LL<<60;
const double PI=3.14159265358979323846;
const int NMAX=100005;
using namespace std;... | #pragma GCC optimize("trapv")
#include<bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
using namespace std;
using ll = long long;
using pi = pair<int, int>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vpi = vector<pi>;
using ld = long double;
const int... | 0 | 46,072,426 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define uniq(x) ((x).erase(unique(all(x)),(x).end()))
#define sz(x) ((int)(x).size())
#... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
int n; cin >> n;
V<ll> c(n), s(n), f(n);
for(int i = 0; i < n - 1; i++){
... | 0 | 36,949,472 |
#include <iostream>
using namespace std;
int main(void){
string input;
string r = "yuiophjklnm";
while (cin >> input && input != "#") {
int pre = 0, now = 0;
int count = 0;
int len = input.length();
for (int i = 0; i < len; ++i) {
char c = input[i];
no... | #include<stdio.h>
#define NUM 2014
void print_message(const char* input)
{
static const char button1[] = {'.', ',', '!', '?', ' '};
static const char button2[] = {'a', 'b', 'c'};
static const char button3[] = {'d', 'e', 'f'};
static const char button4[] = {'g', 'h', 'i'};
static const char button5[... | 0 | 1,070,568 |
#include <iostream>
#include <map>
#include <algorithm>
#include <string>
#include <vector>
#include <numeric>
#include <cmath>
#include <queue>
#include <iomanip>
#include <functional>
#define CHMAX(a,b) a = std::max(a,b)
#define CHMIN(a,b) a = std::min(a,b)
#define MAXMIN(a,b,c) std::max(a,min(b,c))
#define CHABS(a)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF = 1LL << 60;
int main(){
ll A, B, C;
cin >> A >> B >> C;
ll maxx = max(A, max(B, C));
vector<ll> dif(3);
dif[0] = maxx - A;
dif[1] = maxx - B;
dif[2] = maxx - C;
sort(d... | 0 | 96,009,993 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<ll>;... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
map<string , int> blue , red;
int n;
cin>>n;
for(int i=0;i<n;i++)
{
string s;
cin>>s;
blue[s]++;
}
int m;
cin>>m;
for(int i=0;i<m;i++)
{
string s;
cin>>s;
... | 0 | 95,147,658 |
#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 <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using pqg = priority_queue<ll,vector<ll>, greater<ll> >;
using pql = priority_queue<ll,vector<ll> >;
using pqg_p = priority_queue<P,vector<P>, greate... | 0 | 22,150,960 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using v1 = vector<int>;
using vl = vector<long long>;
using v2 = vector<vector<int>>;
using v3 = vector<vector<char>>;
ll gcd(ll a, ll b){
if(a % b == 0) return b;
else return gcd(b, a%b);
}
ll lcm(... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <numeric>
#include <iomanip>
#include <map>
#include <set>
#include <deque>
#include <utility>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)... | 0 | 42,087,669 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
reverse(str.begin(), str.end());
bool ans = true;
while(str.size() != 0) {
if(str.find("maerd") == 0){
str = str.erase(0, 5);
}
else if(str.find("esare") == 0){
str = str.erase(0, 5);
}
else if(s... | #include <iostream>
#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>
#inc... | 0 | 45,355,775 |
#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 <cstdio>
#include <algorithm>
#include <cctype>
#include <cmath>
using namespace std;
typedef long long int64;
inline int read(int f = 1, int x = 0, char ch = ' ')
{
while(!isdigit(ch = getchar())) if(ch == '-') f = -1;
while(isdigit(ch)) x = x*10+ch-'0', ch = getchar();
return f*x;
}
const int N =... | 0 | 95,116,187 |
#include<iostream>
using namespace std;
int in(){int a;cin>>a;return a;}
int a[100001],b[100001],ans,ak=1e9+7,ac=ak;
int main(){
int n=in(),m=in(),k=in();
for(int i=1;i<=n;i++)a[i]=in(),ac=min(a[i],ac);
for(int i=1;i<=m;i++)b[i]=in(),ak=min(b[i],ak);
ans=ak+ac;
while(k--)ans=min(ans,a[in()]+b[in()]-in());
return ... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <utility>
#include <tuple>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstring>
#include <cmath>
#define rep(i, n) for (int i = 0; ... | 0 | 74,691,410 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d.at(i);
}
int sum = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define ln '\n'
using namespace std;
using LL = long long;
u... | 0 | 71,766,817 |
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 1000000007
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i-... | 0 | 23,161,565 |
#include<bits/stdc++.h>
#define int long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define PI acos(-1)
#define bp __builtin_popcountll
#define all(x) x.begin(),x.end()
#define sp fixed<<setprecision
#define pii pair<long long,long long>
#define FAST ios_base::sync_with_stdio(fa... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int S, M, inputLength;
string input, next;
while(true) {
cin >> input;
if(input == "-") break;
inputLength = input.size();
cin >> M;
for(int i=0; i < M; i++) {
cin >> S;
... | 0 | 15,637,292 |
#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)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template<typename H> bool chmin(H& v1, const H v2) { if (v1 > v2) { v1 = v2; return true... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
const int mod = 1e9 + 7;
void check(vector<bool> &flag, int index, int &ans)
{
flag.at(index) = true;
int cnt = 2;
for (long long i = 2; i * i <= (index + 1); i++)
{
if ((index + 1) % i == 0)
{
fla... | 0 | 66,345,378 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
while(true){
if(n-3<0) break;
else if(n-3>=0){
n-=3;
++ans;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define f(i,n) for(int i=0;i<(n);i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
#define P pair<int,int>
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
using namespace std;
int modpow(int x, int y, int m = mod... | 0 | 25,714,555 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define v2(v,n,m,init) vector<vector<i... | #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 | 24,688,926 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in) for(int i=0; i<(int)in.size(); i++) cin>>in[i]
#define forout(out) for(int i=0; i<(int)out.size(); i++) cout<<out[i]<<endl
#define rep(i, n) for(int i=0; i<(n); i++)
int main() {
ll L, R;
cin >> L >> R;
if (R - L >= 2050) c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | 0 | 67,228,010 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
typedef pair< int, int > iP;
int main() {
int n;
while(cin >> n, n) {
vector< iP > v;
vector< int > t(24 * 3600, 0);
for(int i = 0; i < n; i++) {
int h, m, s, hh, ... | #include<iostream>
#include<cstdio>
#include<functional>
#include<cstring>
#include<string>
#include<vector>
#include<queue>
#include<cmath>
#include<algorithm>
#include<map>
#include<ctime>
using namespace std;
typedef long long ll;
typedef long double ld;
const int maxn = 1e5+7;
const int inf = 1e5;
const int modn = ... | 0 | 16,831,292 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int INF = 100000000;
int main(void) {
while(1){
int n;
vector<int> vec;
cin >> n;
if(n == 0) break;
for(int i=0; i<n; i++){
int t;
cin >> t;
vec.pb(t);
}
sort(vec.begin(), vec.end());
int ans = 0;
for(int i=1; i... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s,s1;
cin>>s>>s1;
char key[s.length()+1] ;
strcpy(key, s.c_str());
char flagment[s1.length()+1] ;
strcpy(flagment, s1.c_str());
int n = s.length()-s1.length();
for ( int i=n; i>= 0 ;i--) {
bool temp = true ;
for ( int j= 0 ;j... | 0 | 72,090,781 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | #define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n;
std::cin >> n;
vector<ll> sum(n+1);
for (int i = 0; i < n; i++) {
sum[i+1] = sum[i]+i+1;
}
ll index = distance(sum.begin(),lower_bound(sum.begin(),su... | 0 | 24,356,603 |
#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 <iostream>
#include<algorithm>
using namespace std;
int main(void){
int A,B,m;
cin>>A>>B>>m;
int a[A];
int b[B];
for (int i = 0; i<A;i++){
cin>>a[i];
}
for (int i = 0; i<B;i++){
cin>>b[i];
}
int x[m];
int y[m];
int c[m];
for (int i = 0; i<m;i++){
... | 0 | 1,651,407 |
#include<iostream>
#include<string>
#include<map>
using namespace std;
typedef long long ll;
const int Max = 1e5 + 5;
int lst[Max];
int main()
{
ll x, y;
cin >> y >> x;
ll res = 1e18+5;
for (int i = 1;i <= x - 1;i++)
{
ll a = (x - i) * y;
ll b = i * (y / 2);
ll c = x * y - a - b;
res = min(res, max(a, max(... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define ROF(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
using pii = pair<int, int>; using vpii = vector<pii>;
using vi = vector<int>; using vvi = vector<vi>;
using ll = long ... | 0 | 94,238,499 |
#include <iostream>
using namespace std;
static const int N = 100;
int main(int argc, char const *argv[])
{
int M[N][N];
int n, u, k, v;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
M[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
cin >>... | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | 0 | 58,463,578 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>> n;
vector<int> p(n);
for(int i=0; i<n; i++) cin>> p[i];
int lowest=p[0],ans=0;
for(int i=0; i<n; i++){
if(lowest>=p[i]){ lowest=p[i]; ans++;}
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int x,y;
cin>>x>>y;
if(x==y)
{
while(x--)
{
cout<<y;
}
}
else
{
int mi = min(x,y);
int ma = max(x,y);
while(ma--)
{
cout<<mi;
}
}
return 0... | 0 | 66,783,709 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
#define For(i,a,b) for(i=a;i<(ll)b;i++)
#d... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int>pii;
#define MOD 1000000007
#define MAXN 200005
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define pb push_back
#define f first
#define s second
#define debug(x) cout << "debug 1: " << x << "\n";
#define debug2(x, y) cout... | 0 | 91,692,700 |
#include <iostream>
using namespace std;
int main() {
int N,a,b,max_man,out_man;
int A[210];
cin >> N;
int res = 0;
max_man = 0;
out_man = 1;
for (int i = 1; i <= N; ++i) {
a = 0;
b = i;
for (int j = 0; a < 1 ; ++j) {
if (b % 2... | #include <bits/stdc++.h>
int main(void)
{
std::string num;
std::cin >> num;
std::string tmp;
int ans = 0;
for (int i = 0; i < (1 << 3); i++) {
tmp = num[0];
ans += num[0] - '0';
for (int j = 0; j < 3; j++) {
if (i & (1 << j)) {
tmp += '+';
tmp += num[j+1];
ans += num[... | 0 | 10,636,229 |
#include<iostream>
#include<queue>
using namespace std;
#define MAX 100
const int INF = (1<<21);
int mat[MAX][MAX] = {};
int n, d[MAX] = {};
bool c[MAX];
void bfs(int u){
queue<int> p;
int now = 0;
d[u] = now++;
c[u] = true;
p.push(u);
while(!p.empty()){
int x = p.front(); p.pop();
... | #include<algorithm>
#include<bitset>
#include<climits>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_... | 0 | 41,539,995 |
#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 abcd;
cin >> abcd;
vector<int> n(4);
rep(i,4) n[i] = abcd[i] - '0';
if(n[0]+n[1]+n[2]+n[3]==7) printf("%d+%d+%d+%d=7",n[0],n[1],n[2],n[3]);
else if(n[0... | #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)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
ll result = 0;
FOR(i, 1, N + 1) {
result += (ll) i * (N - i + 1... | 0 | 31,234,640 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int n, k;
string s;
cin >> n >> s >> k;
char sk = s[k - 1];
for (int i = 0; i < s.size(); ++i) {
if (s[i] != sk) {
s[i] = '*';
}
}
cout << s << '\n';
} | #include <bits/stdc++.h>
using namespace std;
int main (void) {
int M, N;
cin >> N >> M;
vector<string> A(N), B(M);
for ( int i = 0; i < N; i++ ) cin >> A.at(i);
for ( int i = 0; i < M; i++ ) cin >> B.at(i);
for ( int i = 0; i < N; i++ ) {
for ( int j = 0; j < N; j++ ) {
bool... | 0 | 44,408,896 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
int n,m;
vector <int> par;
vector <int> ran;
void inti(int n){
for(int i=0; i<n; i++){
par.push_back(i);
ran.push_back(0);
}
}
int find(int x){
if(par[x] == x... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define sidha(i,a,b) for(int i=a;i<b;i++)
#define vi vector<int>
#define pb push_back
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int r,d,x;cin>>r>>d>>x;
ll arr[11];
arr[0]=r*x-d;
sidha(i,1,10){
arr[i]=r*arr[... | 0 | 10,852,792 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vii... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<string>> vvs;
typedef vector<vector<char>> vvc;
typedef vector<vector<bo... | 0 | 18,915,290 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX_N=3e2+10;
const ll INF=1e18+10;
ll dp[MAX_N][MAX_N][MAX_N],H[MAX_N];
int N,K,M;
int main(){
for(int i=0;i<MAX_N;i++) for(int j=0;j<MAX_N;j++) for(int k=0;k<MAX_N;k++)
dp[i][j][k]=INF;
scanf("%d%d",&N,&K); M=N;
for(int i=0;i<N;i++) sca... | #include <iostream>
#include <string>
using namespace std;
int main()
{
string s, w, r;
int q, i, j, a, b;
cin >> s >> q;
for(i = 0; i < q; ++i){
cin >> w >> a >> b;
if( w == "replace" ){
cin >> r;
for( j = a; j <= b; ++j)
s[j] = r[j-a];
}else if( w == "print" ){
for( j = a; j <= b; ++j)
c... | 0 | 28,306,140 |
#include <stdio.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
int main(void) {
int n, i, j;
scanf("%d", &n);
char r[n][n];
rep(i, n) rep(j, n) r[i][j] = 0;
rep(i, n) {
int u, k;
scanf("%d%d", &u, &k);
u--;
rep(j, k) {
int v;
scanf("%d", &v);
v--;
r[u][v] = 1;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const long long INF = 1e18;
# define len(x) ((int)(x).size())
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(int i=((int)(n)-1)... | 0 | 57,637,302 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define eb emplace_back
#define pb push_back
#define size(s) (int)s.size()
#define int long long
#define vi vector<int>
#define vs vector<string>
#define vv vector<vector<int>>
#define pii pair<int,int>
#define m_p(x,y... | #include<cstdio>
#include<cctype>
#include<cstring>
#include<algorithm>
char a[15]={'a','b','c','d','e','f','g','q','r','s','t','v','w','x','z'};
using namespace std;
int main(){
char str[33]={0};
while(1){
scanf("%s",str);
if(str[0] == '#')break;
int len = 0;
len = strlen(str);
... | 0 | 82,257,475 |
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 10000000000000000
#define N 100
long long A[N][N];
void warshallfloyd(int n) {
for (int k = 0; k < n; k++) {
for (int i = 0; i < n; i++) {
if (A[i][k] == INF) continue;
for (int j = 0; j < n; j++) {
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long a,b,c,d;
cin>>a>>b>>c>>d;
if(b<a)
{
long long e = a-b;
cout<<(c*b)+(d*e)<<endl;
}
else
{
cout<<c*a<<endl;
}
return 0;
} | 0 | 90,354,695 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.