code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 44 101M |
|---|---|---|---|
#pragma region template
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 1e9 + 7, MAX = LLONG_MAX, larg = 1e5, INF = -1e9;
long long A, B, C, D, E, F, G, H, I, J, K, L, N, M, O, P, Q, R, S, T, U, V, W;
typedef long long ll;
typedef pair<ll, ll> Pa;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 ... | 1 | 60,947,950 |
#include <iostream>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
typedef long long lli;
typedef vector<lli> vll;
typedef vector<bool> vbl;
typedef vector<vector<lli> > mat... | #include <iostream>
#include <vector>
using namespace std;
struct Node {
Node() { parent = -1; depth = 0; }
int parent;
int depth;
vector<int> children;
};
vector<Node> node(100000);
void set_depth(int id)
{
if (node[id].children.empty())
return;
for (int i = 0; i < node[id].children.size(); ++i)
{
node[node... | 1 | 59,119,789 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
using ll = long long;
typedef pair<int, int> P;
ll gcd(ll a,ll b){
if(a%b==0) return b;
return gcd(b,a%b);
}
int main(){
ll n,x;
cin>>n>>x;
vector<ll> dat(n);
rep(i,n){
ll... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
ll gcd(ll x,ll y) {return y ? gcd(y,x%y) : x;}
ll lcm(ll x, ll y) {return x/gcd(x,y)*y;}
int main(){
int n,x;
cin>>... | 1 | 28,989,003 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define pb push_back
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int a, b;
cin >> a >> b;
cout << (a * b)/ (__gcd(a, b));
return 0;
} | #include<bits/stdc++.h>
using namespace std;
long long lcd(long long a,long long b){
if(a<b) swap(a,b);
while(b){
long long temp = a%b;
a = b;
b = temp;
}
return a;
}
int main(){
long long a,b;
cin>>a>>b;
cout<<a*b/lcd(a,b);
} | 1 | 51,352,505 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int i;
vector<int> t(2, 0);
vector<int> x(2, 0);
vector<int> y(2, 0);
for(i = 0; i < n; i++){
cin >> t[1] >> x[1] >> y[1];
int d_t = t[1] - t[0];
int d_x = abs(x[1] - x[0]);
int d_y = abs(y[1] - y[0]);
int a = d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int t[100010];
int x[100010];
int y[100010];
string ans = "Yes";
cin >> n;
t[0] = 0;
x[0] = 0;
y[0] = 0;
for (int i=1; i<=n; i++) {
cin >> t[i] >> x[i] >> y[i];
}
for (int i=0; i<n; i++) {
i... | 1 | 95,080,246 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
char a,b;
cin>>a>>b;
if((a=='H'&&b=='H')||(a=='D'&&b=='D'))cout<<'H'<<endl;
else c... | #include <iostream>
#include <math.h>
using namespace std;
void solve(){
char N, M;
cin >> N >> M ;
long tmp1,tmp2;
if(N==M ){
std::cout <<"H";
}else{
std::cout << "D";
}
}
int main() {
solve();
} | 1 | 99,989,909 |
#include<iostream>
using namespace std;
int main() {
int H[10000], W[10000], i, a, k;
i = 100000;
a = 0;
k = 0;
for (k; k < i; k++) {
cin >> H[k] >> W[k];
if (H[k] == 0 && W[k] == 0) break;
}
for (int j = 0; j < k; j++) {
... | #include <iostream>
using namespace std;
int main(void){
int H, W;
while (true) {
cin >> H >> W;
if (H == 0 && W == 0) break;
for (int y = 0; y < H; y++) {
for (int x = 0; x < W; x++) {
cout << '#';
}
cout << endl;
}
cou... | 1 | 42,739,462 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(void){
int n;
while(cin >> n , n){
char dic[256];
fill(dic , dic + 256 , 0);
for(int i = 0; i < n; i++){
char c;
cin >> c;
cin >> dic[c];
}
int m;
cin >> m;
for(int i = 0; i < m; i++){
char c;
... | #include<iostream>
#include<vector>
#include<string>
using namespace std;
int main(void){
int n;
while(cin >> n,n){
vector<vector<char> > c(n,vector<char>(2));
const int first = 0;
const int second = 1;
while(n--){
cin>>c[n][first]>>c[n][second];
}
cin>>n;
char in;
string ans;
while(n--){
... | 1 | 62,278,838 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <cstdlib>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a >... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<sstream>
#include<complex>
#include<time.h>
#include<random>
#include<cmath>
#include<math.h>
#include<queue>
#include<time.h>
#include<iomanip>
#include<locale>
#include<utility>
#define rt "\n"
#define re... | 1 | 24,836,893 |
#include <iostream>
#include <string>
#include <stack>
using namespace std;
int main(void){
while(true){
string s;
getline(cin, s);
if(s == "."){ break; }
bool ans = true;
stack<char> scale;
for(size_t i = 0; ans && i < s.length(); i++){
if(s[i] == '(' || s[i] == '['){ scale.push(s[i]); ... | #include<iostream>
#include<stack>
#include<string>
using namespace std;
int main(){
string s;
while(getline(cin, s), s != "."){
int flg = 1;
stack<char> word;
for(int i=0 ; i < s.size() ; i++){
if(s[i]=='[') word.push('[');
if(s[i]=='(') word.push('(');
if(s[i]==']'){
if(!word.empty()&&word.top()=... | 1 | 3,220,634 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
int n;
cin>>n;
int t[n],v[n];
rep(i,n) cin>>t[i];
rep(i,n) cin>>v[i];
int s[n+1];
s[0]=0;
rep(i,n){
s[i+1]=s[i]+t[i];
}
double ans[2*s[n]+1];
rep(i,2*s[n]+1){
ans[i]=min(i/2.0,s[n]-i/2.0);
}
... | #include <iostream>
#include <iomanip>
#include <ios>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <map>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep1(i,n) for(int i=1;i<=(int)(n)... | 1 | 18,733,065 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int root(vector<int> &U,int x){
if(x==U[x]){
return x;
}else{
return U[x]=root(U,U[x]);
}
}
void unite(vector<int> &U,int x,int y){
int px=root(U,x);
int py=root(U,y);
U[px]=py;
}
bool same(vector<int> &U,int x,int y... | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <queue>
#include <cctype>
#include <climits>
#include <stack>
using namespace std;
typedef long long LL;
struct edge{LL from,t... | 1 | 65,377,828 |
#include<iostream>
using namespace std;
int main() {
int n, y; cin >> n >> y;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= n-i; j++) {
int sum = i * 10000 + j * 5000 + (n - i - j) * 1000;
if (sum == y) {
cout << i << ' ' << j << ' ' << (n - i - j) << endl;
return 0;
}
}
}
cout << "-1 -1 ... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int N, Y;
cin >> N >> Y;
int N10 = min((int)(Y / 10000), N);
int N5 = min((int)(Y / 5000), N);
for (int i = 0; i <= N10; ++i) {
for (int j = 0; j <= N5; ++j) {
int t = 10000 * i + 5000 * j + 1000 * (N - i - j);
if (t == Y... | 1 | 35,348,024 |
#include <stdio.h>
int main()
{
char S[20];
scanf("%s", &S);
getchar();
if (S[2] == S[3] && S[4] == S[5])
{
printf("Yes\n");
}
else
{
printf("No\n");
}
return 0;
} | #include <bits/stdc++.h>
typedef uint64_t u64;
typedef int64_t i64;
typedef uint32_t u32;
typedef int32_t i32;
typedef uint16_t u16;
typedef int16_t i16;
typedef uint8_t u8;
typedef int8_t i8;
using namespace std;
#define rep(idx, N) for (u64 idx = 0; idx < N; idx++)
int main() {
string s;
cin >> s;
if (s[2] == s... | 1 | 35,427,828 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int N,M;
cin>>N>>M;
int ans=(1900*M+100*(N-M))*pow(2,M);
cout<<ans<<endl;
return 0;
} | #include "bits/stdc++.h"
#include <set>
using namespace std;
#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 (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
... | 1 | 86,992,232 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[56], b[56];
int graph[9][9];
bool seen[9];
int ans = 0;
void dfs(int node) {
for (int i = 1; i <= n; i++) {
if (!seen[i]) break;
if (i == n) {
ans++;
return;
}
}
for (int i = 1; i <= n; i++) {
... | #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()
const int N = 10;
vector<int> adj[N];
int n, m, ans = 0;
int vst[N];
void dfs(int i, int c = 1) {
if (c == n) ans++;
vst[i] = 1;
for (auto &j : adj[i... | 1 | 82,845,980 |
#include <iostream>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
bool can = false;
for (int i = 1; i <= b; i++) {
if ((a*i) % b == c) can = true;
}
cout << (can ? "YES" : "NO") << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int a,b,c;
int main(void){
cin>>a>>b>>c;
a=a%b;
int A=a;
while(true){
A=(A+a)%b;
if(A==c){
cout<<"YES"<<endl;
return 0;
}
if(A==a){
cout<<"NO"<<e... | 1 | 9,605,260 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#def... | # include <iostream>
# include <cmath>
# include <algorithm>
# include <stdio.h>
# include <cstdint>
# include <cstring>
# include <string>
# include <cstdlib>
# include <vector>
# include <bitset>
# include <map>
# include <queue>
# include <ctime>
# include <stack>
# include <set>
# include <list>
# include <random>
... | 1 | 16,185,999 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
using namespace std;
const int INF = 1e9;
int main() {
int N, K;
cin >> N >> K;
vector<ll> A(N), B(N);
rep(i, N) cin >> A[i];
ll ans = 1e18;
rep(bit, 1 << N) {
if (__builtin_popcount(bit) < K)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N, K; cin >> N >> K;
vector<ll> a(N);
for(int i = 0; i < N; i++){
cin >> a[i];
}
ll ans = 1e18;
for(int i = 0; i <1<<(N - 1); i++){
bitset<18> bit(i);
if(bit.count() != K-1)continue;
ll ans1 = 0;
ll bound... | 1 | 56,531,188 |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | #include<bits/stdc++.h>
using namespace std;
int x,y,z;
int k;
long long a[1005],b[1005],c[1005];
long long sum[1005*1005];
long long ans[3005*1005];
long long cnt;
bool cmp (long long x , long long y)
{
return x > y;
}
int main()
{
scanf("%d%d%d%d",&x,&y,&z,&k);
for(int i=1;i<=x;++i)
scanf("%lld",&a[i]);
for(... | 1 | 56,537,433 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define bp __builtin_popcount
#define pb push_back
#define sz(s) (int)(s.size())
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag, tree_order_statistics_node_update> indexed_set;
cons... | #include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i=0; i<(int) n; i++)
using namespace std;
typedef long long ll;
int main() {
int n;
string s, t;
cin >> n >> s >> t;
int acc = n * 2;
for (int i = n; i >= 0; i--) {
string si = s.substr(s.length() - i, i);
... | 1 | 38,164,011 |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef long double ld;
#define fr(i,a,b) for(ll i=a; i<b; i++)
#define rf(i,a,b) for(ll i=a; i>=b; i--)
#define pb push_back
#define mp make_pair
#define show(a) for(auto el:a)cout<<el<<" "
#define ff first
#defi... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n = 0;
cin >> n;
cout << n / 3 << endl;
return 0;
} | 1 | 55,558,233 |
#include<bits/stdc++.h>
using namespace std;
vector<int> vis(200001,0);
vector<int> sizee(200001,0);
int dfs(int x,vector<set<int> > &adj)
{
vis[x]=1;
int currsize=1;
for(auto j:adj[x])
{
if(vis[j]==0)
{
currsize+=dfs(j,adj);
}
}
sizee[x]=currsize;
... | #include<bits/stdc++.h>
using namespace std;
vector<int>adj[1000001];
int vis[1000001];
void dfs(int src,int &node)
{
node++;
vis[src]=1;
for(int child:adj[src])
{
if(vis[child]==0)
{
dfs(child,node);
}
}
}
int main()
{
int n,m,count,ans=-1;
cin>>n>>m;
... | 1 | 24,774,495 |
#include<iostream>
#include<cctype>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cctype>
#include<cstring>
#include<utility>
const int inf=0x7fffffff;
typedef long long int ll;
using namespace std;
string s,p;
char ans[][10]... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string s, p;
cin >> s >> p;
string ss = s + s;
auto it = search(ss.begin(), ss.end(), p.begin(), p.end());
if (it != ss.end()){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | 1 | 80,603,238 |
#include<iostream>
#include<vector>
#include <cmath>
#include <map>
#include <algorithm>
#include <string>
using namespace std;
int main(void){
int n ;
cin >> n ;
int count = 0 ;
for(int i = 1 ; i < n +1 ; i++){
if(n - i > 0 && i != n-i){
count ++ ;
}
}
cout << count... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int ans=n/2 -(n%2==0);
cout<<ans<<endl;
} | 1 | 39,526,972 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <math.h>
#include <string>
#include <string.h>
#include <stack>
#include <queue>
#include <vector>
#include <utility>
#include <set>
#include <map>
#include <stdlib.h>
using namespace std;
#define ll long long
#define ld long double
#d... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int N;
while (1) {
cin >> N;
if (!N) break;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int ans = 10000000;
for (int i = 0; i < N; i++) {
for (int j = ... | 1 | 98,639,073 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long num, max, a, b=0;
cin >> num >> max;
vector<long long> list2;
for (long long i=0; i<num; i++) {cin >> a; list2.push_back(a);}
sort(list2.begin(),list2.end());
reverse(list2.begin(),list2.end())... | #include <bits/stdc++.h>
using namespace std;
#define gap " "
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ok cout<<"ok"<<endl
#define dbg(x) cout<<(#x)<<" is "<<x<<endl
#define fastio {ios_base::sync_with_stdio... | 1 | 44,777,201 |
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 1000000
#define MAX_V 10
int d[MAX_V][MAX_V];
int V;
void warshall_floyd() {
for(int k=0;k<V;k++)
for(int i=0;i<V;i++)
for(int j=0;j<V;j++) d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
void clearD() {
for(int i=0;i<M... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
vector<int> x(10);
x[0] = 0;
x[1] = 1;
for(int i = 0; i < 9; i++){
x[i+1] = x[i] * 2 + 1;
}
int y = x[9] * 2 + 1;
while(true){
int n;
cin >> n;
if(n == 0)
b... | 1 | 21,752,346 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
int R[M];
int L[M];
for(int i=0; i<M; i++){
cin >> L[i] >> R[i];
}
int min_R = *max_element(L, L+M);
int max_R = *min_element(R, R+M);
int count = max_R -... | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int maxOfL = 1, minOfR = n;
for (int i=0; i<m; i++) {
int l, r;
cin >> l >> r;
maxOfL = max(maxOfL, l);
minOfR = min(minOfR, r);
}
cout << max(minOfR-maxOfL+1, 0) << endl;
} | 1 | 86,981,478 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<stdio.h>
#include<cstdio>
using namespace std;
int main()
{
double x1, x2, y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
double X = max(x1, x2) - min(x1, x2);
double Y = max(y1, y2) - min(y1, y2);
printf("%.8lf\n", sqrt(X*X + Y*Y));
return 0;
} | #include<iostream>
#include<cmath>
#include<iomanip>
using namespace std;
int main()
{
double x1,x2;
double y1,y2;
double distance;
cin >> x1 >> y1 >> x2 >> y2;
distance=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
cout << fixed << setprecision(4) << distance << endl;
return 0;
} | 1 | 95,946,828 |
#include<iostream>
using namespace std;
struct card {
char suit;
int value;
};
void bubbleSort(card *A, int n)
{
card t;
for (int i = 0; i<n; i++)
for (int j = n-1; j >= i + 1; j--)
{
if (A[j].value <A[j - 1].value)
{
t = A[j]; A[j] = A[j - 1]; A[j - 1] = t;
}
}
}
void selectSort(card *A, int n)... | #include <iostream>
#include <vector>
using namespace std;
typedef struct {
char suit;
int value;
} Card;
void bubble_sort(Card a[], int n) {
int i, j;
for (i = 0; i < n; i++) {
for (j = n - 1; j > i; j--) {
if (a[j].value < a[j - 1].value) {
swap(a[j], a[j - 1]);
}
}
}
}
void sele... | 1 | 86,937,617 |
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int a,b,c;
cin >> a >> b >> c;
int mid = a + b + c - max(max(a, b), c) - min(min(a, b), c);
cout << max(max(a, b), c) * 10 + mid + min(min(a, b), c);
return 0;
} | 1 | 72,163,723 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int h,w,m;cin>>h>>w>>m;
map<int,int> mph,mpw;
set<pair<int,int>> st;
int maxh=0,maxw=0;
for(int i=0;i<m;i++)
{
int y,x;cin>>y>>x;
mph[y]++;
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = 3e5+5;
int row[N], column[N];
set<pair<int,int>> targets;
int main()
{
int H, W;
scanf("%d%d",&H,&W);
int M;
scanf("%d",&M);
for(int i=1;i<=M;i++)
{
int a, b;
scanf("%d%d",&a,&b);
row[a]++;
column[b]++;
targets.insert({a,... | 1 | 89,800,346 |
#include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if (ps... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; 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)
#define sz(x) ((in... | 1 | 73,434,154 |
#include <bits/stdc++.h>
#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(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define PB push_back
#define INF (1<<29)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#... | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#define rep(i, n) for (int i = 0; i < n; i++)
int a, b;
char k[23][23];
int memo[23][23];
int dp(int x, int y) {
if (x == 1 && y == 1) return 1;
if (k[x][y]) return 0;
if (memo[x][y] != -1) return memo[x][y];
if (x == 1) return memo[x][y] = dp(x... | 1 | 1,741,637 |
#include <iostream>
using namespace std;
#define INF 2000000005
int hsize=0;
int A[250];
int getPK(int i){
if (i==0)return -INF;
return A[(i-1)/2];
}
int getLK(int i){
if (i*2+1>=hsize)return -INF;
return A[i*2+1];
}
int getRK(int i){
if (i*2+2>=hsize)return -INF;
return A[i*2+2];
}
int main(){
cin >> hsi... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
const int INF = 2100000000;
class Heap{
public:
vector<int> a;
int N;
Heap(int n){
N = n;
a.resize(N, INF);
}
int get_parent(int x){
return a[(x)/2];
}
int get_left(int x){
if(x*2 < N){
... | 1 | 20,205,378 |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define all(a) (a).begin(),(a).end()
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
const int INF=1e9;
int main(){
ll n,k;
ll a[100100];
whil... | #include <cstdio>
int n,k,ans,tmp;
int a[100000];
int main(){
while(scanf("%d%d", &n, &k)){
if(n == 0 && k == 0) break;
ans = 0;
for(int i = 0; i < n; i++) scanf("%d", &a[i]);
for(int i = 0; i < k; i++) ans += a[i];
tmp = ans;
for(int i = 0; i < n-k; i++){
tmp += a[k+i]-a[i];
if(ans < tmp) ans = tmp;... | 1 | 88,357,762 |
#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 <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(void){
int N;
cin >> N;
int cmax = 0, Nmax = 1;
for (int i = 1; i <= N; i++) {
int c = 0;
int t = i;
while (t%2 == 0){
c++;
t /= 2;
}
if (c > cmax){
cmax = c;
Nmax = i;
... | 1 | 85,791,181 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
int main() {
int n, ans = 0, tmp = 0;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
reverse(h.begin(), h.end());
for (int i =... | 1 | 21,674,558 |
#include <iostream>
using namespace std;
int main();
int point(int n);
int point(int n){
int sum = 0, diff, i;
int ans[100000];
for(i = 1; sum <= n; i++){
sum += i;
ans[i] = i;
}
i = i - 1;
ans[i + 1] = 0;
sum = sum - ans[i];
ans[i] = 0;
diff = n - sum;
if(diff != 0){
for(int j = 1; j <= diff; j++){
... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int sum = 0, t = 1;
vector<int> ans;
while (sum < n) {
ans.push_back(t);
sum += t;
t++;
}
for (int i = 0; i < (int) ans.size(); i++) {
if(ans[i] == sum - n) ... | 1 | 88,383,095 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vec... | #include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int maxn = 100005;
struct Edge
{
int to, nxt;
} e[maxn << 1];
int first[maxn];
inline void add_edge(int from, int to)
{
static int cnt = 0;
e[++cnt].nxt = first[from];
first[from] = cnt;
e[cnt].to = to;
e[++cnt].nxt = first[to];
... | 1 | 96,531,399 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main() {
int n, ans, mini = 100000000;
cin >> n;
vector<int> x(n);
rep(i, n) cin >> x[i];
rep(i, 100) {
int dist = 0;... | 1 | 13,258,056 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int> a(m), b(m);
rep(i, m) std::cin >> a[i] >> b[i];
std::map<int, int> map;
rep(i, m) {
if (b[i] == n) {
map[a[i]]++;
}
}
rep(i, m) {
... | #include<bits/stdc++.h>
#define rep(i,n) for(ll i = 0; i < n; i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF 1e9
using ll = long long;
using namespace std;
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) {... | 1 | 47,487,082 |
#include <cstdio>
#include <utility>
#include <queue>
#include <vector>
#include <iostream>
#include <algorithm>
#include <math.h>
#include <map>
#include <string.h>
using namespace std;
int d[11][11];
const int INF=100000000;
int main() {
while(1){
int E; cin>>E; if(E==0) break;
fill(d[0],d[11],INF);
... | #include <bits/stdc++.h>
#define REP(i,n) for(int i = 0 ; i < n ; ++i)
using namespace std;
typedef long long Int;
Int dp[10][10];
Int INF = 999999999;
int n ;
vector<int> edges;
int main() {
while(cin >> n , n) {
REP(i, 100) {
dp[i / 10][i % 10] = INF;
}
REP(i, n) {
... | 1 | 54,371,234 |
#include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using bll = boost::multiprecision::cpp_int;
using bdouble = boost::multiprecision::cpp_dec_float_100;
#include <boost/math/tools/minima.hpp>
#endif
#ifdef... | #include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#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 RE(i,n) FOR(i,1,n)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define R(i,n) REP(... | 1 | 80,319,008 |
#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... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | 1 | 51,928,743 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <cctype>
#include <stack>
#include <queue>
#include <cstring>
#include <map>
#include <list>
#in... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main() {
string s;
cin >> s;
string ans;
for (int i = 0; i < s.length(); i++) {
char c = s.at(i);
switch (c) {
case '0':
ans += c;
break;
case '1':
ans += c;
break;
case 'B':
i... | 1 | 84,333,242 |
#include <stdio.h>
#include <string.h>
int main(void) {
char s[40], ans[1200][40], maxm = 0, maxl = 0;
int now = 0, i, j, k, n[1200];
while(scanf("%s", s) != EOF) {
int t = 1;
for(i = 0; i < now; ++i) if(!strcmp(s, ans[i])) {
n[i]++, t = 0;
break;
}
if(t) {
strcpy(ans[now], s);
... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>
using namespace std;
typede... | 1 | 12,249,829 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
while(1)
{
int x,y;
cin>>x>>y;
if(x==0&&y==0)break;
cout<<min(x,y)<<" "<<max(x,y)<<endl;
}
} | #include <iostream>
#include <stdio.h>
int main() {
int a, b;
while (true) {
std::cin >> a >> b;
if (a == 0 && b == 0) {
break;
}
if (a > b) {
std::cout << b << ' ' << a << std::endl;
} else {
std::cout << a << ' ' << b << std::endl;
... | 1 | 75,884,641 |
#include<iostream>
#include<string>
using namespace std;
#define rep(i,j) for(int i = 0; i < (j); i++)
int main(){
int n;
cin >> n;
string change[] = {"",".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
while(n--){
string str;
cin >> str;
int len = str.size();
string ans = "";
rep(i,len){
i... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string code[] = {".,!? ", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
int len[] = {5, 3, 3, 3, 3, 3, 4, 3, 4};
int N;
cin >> N;
while(N--){
string s;
cin >> s;
char c = '#';
int idx = 0;
for(int i = 0; i < s.size(); ... | 1 | 2,650,787 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n;
int ans;
signed main () {
scanf ("%lld", &n);
for (int i = 1; i <= n; i++) {
ans += i * (n - i + 1);
}
for (int i = 1; i < n; i++) {
int x, y;
scanf ("%lld%lld", &x, &y); if (x > y) swap (x, y);
ans... | #include <iostream>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <string>
#include <sstream>
#include <algorithm>
#include <random>
#include <cstdio>
#include <cstdlib>
#in... | 1 | 55,797,057 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int 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; } re... | #include<bits/stdc++.h>
#include<algorithm>
#include<math.h>
#include<string>
#include<iostream>
#include<vector>
#include<cstdlib>
#include<stdio.h>
#include<cmath>
#include<limits>
#include<iomanip>
using namespace std;
template <class T> using V = vector<T>;
template<class T> inline bool chmin(T& a, T b) {
if (a... | 1 | 22,928,614 |
#include<algorithm>
#include<cmath>
#include<climits>
#include<cstdio>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<string>
#include<utility>
#include<vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
co... | #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;
signed main(void)
{
int n, l, out_l, out_r;
string s;
cin >> n >> s;
l = out_l = out_r = 0;
rep(i, n)
{
if (s[i] == ')')
{
if (out_r > 0)
out_r--;
if (l ==... | 1 | 31,596,174 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H,W;
cin >> H >> W;
vector<vector<char>> table(H,vector<char>(W));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> table.at(i).at(j);
}
}
vector<vector<char>> table2(0,vector<char>(W));
int Hnew = H;
for (int... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h,w;
cin >> h >> w;
bool bw[w]={0};
bool bh[h]={0};
vector<vector<char>> data(h, vector<char>(w));
for (int i = 0; i < h; i++) {
int cnt_w=0;
for (int j = 0; j < w; j++) {
cin >> data.at(i).at(j);
if (data.at(i).at(j)=='#') {... | 1 | 40,171,277 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <list>
#include <queue>
#include <set>
using namespace std;
int main(void){
char str1[50], str2[50];
int n; cin >> n;
for (int m = 0; m < n; m++){
cin >> str1... | #include<cstdio>
#include<iostream>
#include<sstream>
#include<cctype>
using namespace std;
int n2d(const char *s) {
int res=0;
char c;
int last=1;
while(c=*s++) {
int w;
switch(c) {
case 'm':
w = 1000;
break;
case 'c':
... | 1 | 91,402,788 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <string>
#include <cctype>
#include <map>
#include <limits>
#include <iomanip>
using namespace std;
const int mod = 1000000007;
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
#define ll long long
int... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
using ll=long long;
using ld=long double;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ordered_set tree<pll, null_type,less... | 1 | 37,788,456 |
#include <stdio.h>
int main()
{
int n,p;
scanf("%d%d",&n,&p);
printf("%d\n",n+1-p);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using i64 = int64_t;
using ll = long long;
int main() {
int N,i;
cin >> N >> i;
cout << N + 1 - i << endl;
return 0;
} | 1 | 23,820,262 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 1LL << 62;
const double PI = acos(-1);
const double eps = 1e-10;
int main() {
string s, t;
cin >> s >> t;
cout << t << s << endl;
return 0;
} | #include <iostream>
#include <string>
int main()
{
std::string S, T;
std::cin >> S >> T;
std::cout << T << S << std::endl;
return 0;
} | 1 | 89,744,416 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long num, max, a, b=0;
cin >> num >> max;
vector<long long> list2;
for (long long i=0; i<num; i++) {cin >> a; list2.push_back(a);}
sort(list2.begin(),list2.end());
reverse(list2.begin(),list2.end())... | #include<stdio.h>
int main(void)
{
int n,w;
int a[100];
int i,j;
scanf("%d",&n);
scanf("%d",&w);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
int k,l;
for(k=0;k<n-1;k++){
for(l=n-1;l>k;l--){
if(a[l-1]<a[l]){
int temp=a[l];
a[l]=a[l-1];
a[l-1]=temp;
}
}
}
int x=... | 1 | 6,354,128 |
#include<iostream>
#include<vector>
using namespace std;
int main() {
int table[3][10][4];
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 10; j++) {
for (int k = 0; k < 4; k++) {
table[i][j][k] = 0;
}
}
}
int n;
cin >> n;
int b, f, r, v;
for (int m = 0; m < n; m++) {
cin >> b >> f >> r >> v;
... | #include <iostream>
using namespace std;
int main(void){
int k[5][4][11] = {0};
int num;
int b,f,r,v;
cin>>num;
for(int i=0;i<num;i++){
cin>>b>>f>>r>>v;
k[b][f][r]+=v;
}
for(int i=1;i<5;i++){
for(int j=1;j<4;j++){
for(int m=1;m<11;m++){
cout<<" "<<k[i][j][m];
if(m==10){
cout<<endl;
bre... | 1 | 20,020,132 |
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int dp[50];
ll Fib(int n) {
if (dp[n] == 0) {
... | #include <bits/stdc++.h>
#define N 45
using namespace std;
int main(void) {
int i,n;
vector<int> F(N);
cin >> n;
F.resize(n);
F[0] = 1;
F[1] = 1;
for(i=2;i<=n;i++){
F[i] = F[i-2] + F[i-1];
}
cout << F[n] << endl;
return 0;
} | 1 | 24,479,093 |
#include <iostream>
using namespace std;
string N,out_moji;
double x,H[1100],T,A;
int main() {
cin >> N;
x = N.size();
for (int i = 0; i < x; i = i +2) {
out_moji = out_moji + N[i];
}
cout << out_moji << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
for(int i=0;i<s.size();i++) {
if(i%2) continue;
else cout << s[i];
}
cout << endl;
return 0;
} | 1 | 58,347,962 |
#include <iostream>
#include <cmath>
#include <numeric>
#include <vector>
using namespace std;
int main(){
int N, temp;
cin >> N;
vector<int> A;
for(int i = 0; i < N; i++){
cin >> temp;
A.push_back(temp);
}
double average = accumulate(A.begin(), A.end(), 0) / double(A.size());
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main(){
int N;
cin >> N;
vector<int> A(N);
for(int i=0; i<N; i++) cin >> A[i];
ll min_cost = INF;
for(int i=-100; i<=100; i++) {
ll cost=0;
for(int j=0; j<N; j++) {
... | 1 | 34,038,945 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <math.h>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
sort(a.begin(), a.end());
long sum = 0;
for (int i = 0; i < n; ... | #include <stdio.h>
int main(){
long long int s,max,min,k;
int n;
scanf("%d",&n);
max = -1000000;
min = 1000000;
s = 0;
for (int i=0; i<n ; ++i){
scanf("%lld",&k);
if(k>max) max = k;
if(k<min) min = k;
s =s+k;
};
printf("%lld %lld %lld\n",min ,max, s);
return 0;
} | 1 | 76,118,229 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, T;
cin >> N >> T;
vector<int> t(N + 1);
for(int i = 0; i < N; i++){
cin >> t.at(i);
}
t.at(N) = 2 * pow(10, 9) + 1;
int ans = 0;
for (int i = 0; i < N; i++){
ans += min(T, t.at(i+1)-t.at(i));
}
cout ... | #include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) for (int soeji = s... | 1 | 6,010,709 |
#include <iostream>
using namespace std;
int research(int n, int s, int v, int t)
{
if(n == 0 && v == s){
return 1;
}
if(v > s || n < 0){
return 0;
}
int c = 0;
for(int i = t+1; i <= 9; i++){
c += research(n-1, s, i+v, i);
}
return c;
}
int main()
{
int n, s, c;
while(1){
cin >> n >> s;
if(n == 0 &&... | #include <iostream>
using namespace std;
int n;
int s;
int count;
int rec(int state, int num, int sum) {
int count;
count = 0;
if(num > n) {
if(sum == s) {
return 1;
} else {
return 0;
}
}
for(int i = state; i <= 9; i++) {
count += rec(i+1, num+1, sum+i);
}
return count;
}
int ... | 1 | 45,568,799 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> A(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> A[i];
sum += abs(A[i]);
}
sort(A.begin(), A.end());
if (A[0] >= 0) {
cout << sum - A[0] * 2 << endl;
int x = A[0];
for... | #pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include... | 1 | 42,245,592 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
int main() {
int A, P;
cin >> A >> P;
int n = A * 3 + P;
n /= 2;
cout << n << endl;
} | #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>;
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; } re... | 1 | 27,467,188 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
#define int long long
signed main() {
int n,m;
cin >> n >> m;
priority_queue<int> que;
rep(i,n) {
int a; cin >> a;
que.push(a);
}
while(m--) {
int v = que.top();
que.pop();
v/=2;
que.pu... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
ll power(ll x, ll y);
#define repp(I, A, B) for(int I = A; I <= B; I++)
#define rep(I, A, B) for(int I = A; I < B; I++)
#define rrep(I, B, A) for(int I = B; I >= A; I--)
#define pb emplace_back
#define ff first
#define ss secon... | 1 | 38,951,165 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define int long long
using namespace std;
signed main(){
int x,y;
cin >> x >> y;
int a = abs( abs(x) - abs(y) );
int ans = 1001001001001001001;
if( x + a == y ) ans = min(ans,a+0);
if( -x + a == y ) ans = min(ans,a+1);
if( -x - a == y ) ans =... | #include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
const ll inf = 1001001001001001001;
int main(){
ll x,y;scanf("%lld%lld",&x,&y);
ll ans = inf;
if(x <= y) ans = min(ans,y-x);
if(-x <= y) ans = min(ans,y+x... | 1 | 24,244,012 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const int MOD=1e9+7;
const long double Pi=acos(-1);
using P=pair<ll,ll>;
ll gcd(ll a,ll b){
if(a%b==0){return b;}
else{return gcd(b,a%b);}
}
ll lcm(ll a,ll b){
return a*b/gcd(a,b);
}
ll pow(ll x,ll y){
ll tmp=x,res=1;
w... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define forn(i,n) for(int i=0;i<n;i++)
#define fre(i,a,b) for(int i = a; i < b; i++)
#define sf(n) scanf("%lld", &n)
#define sff(a,b) scanf("%lld %lld", &a, &b)
#define sfff(a,b,c) scanf("%d %d %d", &a, &b, &c)
#define pfn(n) printf("%d\n", n)
#define pf... | 1 | 54,321,264 |
#include <iostream>
#include <algorithm>
using namespace std;
int main( void )
{
char s[ 4 ];
char t[ 4 ];
cin >> s >> t;
int ans = 0;
for ( int i = 0; i < 3; i++ )
{
if ( s[ i ] == t[ i ] )
{
ans++;
}
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){long long q,i,p=0;
string n,m;
cin>>n>>m;
for(i=0;i<3;i++){
if(n[i]==m[i])
p++;
}cout<<p;
return 0;
} | 1 | 90,071,702 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
#define ALL(a) (a).begin(),(a).end()
const ll INF = 1e18+18;
const ll MAX = 200000;
const ll M... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int MOD=1e9+7;
ll INF=1e18;
int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
int main(){
int a, b; cin>>a>>b;
a--, b--;
char g[100][100];
for(int i=0; i<100; i++){
for(int ... | 1 | 47,634,887 |
#include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
#define f2(i,j,k) for(int i=j;i>k;i--)
using namespace std;
int main(){
string n;
cin>>n;
bool f=false;
if(n=="keyence"){
cout<<"YES"<<endl;
return 0;
}
long long j=n.size()-7;
f(i,0,8){
string ans=n.subst... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,x,y) for(int i=x;i<y;i++)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a / __gcd(a, b) * b
#define range(a) (a).begin(),(a).end()
const int inf = 2147483647;
int main (){
string s;cin>>s;
bool flag = false;
rep(i,0,s.size()){
... | 1 | 77,896,453 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
for (long long i = sqrt(N); i > 0; i--) {
if (N%i == 0) {
int count = 1;
long long n = N/i;
while(n >= 10) {
n /= 10;
count++;
}
cout << count << endl;
break;
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, n+1)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define rwhole(x) (x).rbegin(), (x).rend()
#... | 1 | 73,904,624 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N, A, B, C, X;
while( cin >> N >> A >> B >> C >> X, N + A + B + C + X ) {
int data[100];
int flame = 0;
int cnt = 0;
for(int i=0; i<N; i++) cin >> data[i];
while( 1 ) {
if( data[cnt] == X ) {
cnt++;
}
if( cnt == N )... | #include <cstdio>
#include <vector>
#include <queue>
int testcase_ends() {
size_t N;
int A, B, C, X;
scanf("%zu %d %d %d %d", &N, &A, &B, &C, &X);
if (N == 0 && A == 0 && B == 0 && C == 0 && X == 0) return 1;
std::queue<int> q;
for (size_t i = 0; i < N; ++i) {
int y;
scanf("%d", &y);
q.push(y);
... | 1 | 43,026,593 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
int32_t main()
{
int n, m;
cin>>n>>m;
vector<int> s(n);
vector<int> t(m);
for(int i=0; i<n; i++) cin>>s[i];
for(int i=0; i<m; i++) cin>>t[i];
vector<vector<int> > dp(n+1, vector<int>(m+1, 1));
for(i... | #include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<string>
#include<numeric>
#include<vector>
#include<set>
#include<map>
#include<unordered_map>
#include<stack>
#include<queue>
#include<list>
using namespace std;
const int maxn=2e3+5;
typedef long long ll;
const int mod=... | 1 | 62,739,373 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll h, w, dp[1007][1007];
char grid[1007][1007];
int main() {
cin >> h >> w;
for(ll i = 1; i <= h; ++i) {
for(ll j = 1; j <= w; ++j) cin >> grid[i][j];
}
dp[1][1] = 0;
bool ok = 1;
for(ll i = 1; i <= h; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e5 + 5;
const int MAX_L = 20;
const long long MOD = 1e9 + 7;
const long long INF = 1e9 + 7;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<vi> vvi;
const int MAXH = 1010, MAXW = 1010;
char g... | 1 | 84,031,737 |
#include<bits/stdc++.h>
#include<cstdio>
using namespace std;
int main(){
string s,t; cin >> s >> t;
bool frg= true;
for(int i=0;i<s.length();i++){
if(s[i]!=t[i]) frg=false;
}
if(frg) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
string s, t;
cin >> s >> t;
if (s.size() + 1 != t.size())
{
cout << "No" << endl;
return (0);
}
for (int i = 0; i < s.size(); i++)
{
if (s[i] != t[i])
{
cout << "No" << endl;
return (0);
}
}
cout << "Yes" << endl;
return (0);
} | 1 | 26,767,952 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
vector<string> s(3);
for(ll i=0;i<3;i++) cin >> s[i];
ll f=1;
for(ll i=0;i<2;i++) {
if (s[i][s[i].size()-1]!=s[i... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#... | 1 | 75,684,190 |
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define f(i,n) for(auto i=0;i<n;i++)
#define fr(i,n) for(auto i=n-1;i>=0;i--)
#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)
#define fl(i,x) for(auto i : x)
#define memset(a,first,last,val) fs(i,first,last,1) a[i]=val
#define nl cout<<"\n";
#define chk(x) co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans=0;
cin >> N;
vector<int> d(N);
for(int i=0; i<N; i++) cin >> d.at(i);
for(int i=0; i<N; i++) {
for(int j=i+1; j<N; j++) {
ans += d.at(i)*d.at(j);
}
}
cout << ans << endl;
} | 1 | 29,799,835 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> S(H, vector<char>(W));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> S.at(i).at(j);
}
}
vector<vector<int>> L(H, vector<int>(W));
for (int i = 0; i < H; i++) {
fo... | #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-... | 1 | 70,861,910 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int length1 = S.size();
vector<char> kaibun;
vector<int> position;
int tmp = 0;
for (int i = 0; i < length1; i++) {
if (S[i] != 'x') {
kaibun.push_back(S[i]);
position.push_back(tmp);
tmp = 0;
}
el... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
string s;
cin >> s;
string t;
vector<int> counts;
int cnt = 0;
for (int i=0; i<s.size(); i++){
if(s[i] != 'x'){
t += s[i];
counts.push_back(cnt);
cnt = 0;
}else... | 1 | 44,294,236 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> array;
int stock;
while (cin >> stock) {
if (stock == 0) break;
array.push_back(stock);
}
int time[101] = { 0 };
for (int i = 0;i < array.size();i++) {
time[array.at(i)]++;
}
int max = 0;
for (int j = 0;j < 100;j++) {
i... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, i, m = 0;
vector<int> t(101);
while (cin >> n)
t[n]++;
for (auto e : t)
m = max(e, m);
for (i = 1; i < 101; i++)
if (m == t[i]) cout << i << endl;
} | 1 | 53,387,653 |
#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... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector <int>a(n);
for(int i=0;i<n;i++){
cin >> a.at(i);
}
sort(a.begin(),a.end());
int sa = a.at(n/2)- a.at(n/2 -1);
cout<< sa <<endl;
} | 1 | 78,696,514 |
#include <cstdio>
#include <algorithm>
#include <limits.h>
#define INF INT_MAX/100
#define FOR(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(void){
int n,x,y,z,ans,tmp=0,nodes=0,sum=INF;
int graph[50][50];
char str[100];
while(1){
fgets(str,sizeof(str),stdin);
sscanf(str,"%d",&n);
if(n==0)... | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int INF=99999999;
int N;
int a[45],b[45],c[45];
int d[10][10];
int m;
void print(){
for(int i=0;i<=m;i++){
for(int j=0;j<=m;j++){
printf("%d ",d[i][j]);
}
printf("\n");
}
printf("\n");
}
int main(){
while(1){
... | 1 | 37,717,347 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s;
std::cin >> s;
int n = s.size();
std::vector<int64_t> v(n + 1, 0);
rep(i, n) {
if (s[i] == '<') {
v[i + 1] = v[i] + 1;
}
}
for (int i = n - 1; i >= 0; i--) {
{
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | 1 | 75,339,970 |
#include "bits/stdc++.h"
using namespace std;
const int N=2e5+20;
int n,k,x;
map <int,queue <int>> m;
long long s,ans;
int main()
{
scanf("%d%d",&n,&k);
m[0].push(0);
for(int i=1;i<=n;i++)
{
scanf("%d",&x);
s+=x;
int r=(s-i)%k;
m[r].push(i);
while(i-m[r].front()>=k) m[r].pop();
ans+=m[r].size()-1;
}
p... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<cctype>
#include<queue>
#include<map>
#include<stack>
#include<string>
#include<cstring>
#include<set>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int... | 1 | 55,477,511 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a >... | #include<bits/stdc++.h>
#include<boost/dynamic_bitset.hpp>
using namespace std;
using u64 = uint64_t;
using s64 = int64_t;
int main(void) {
u64 N, M, X;
cin >> N >> M >> X;
vector<u64> C(N);
vector<vector<u64>> A(N, vector<u64>(M));
vector<u64> All(M);
for(u64 i=0; i<N; i++) {
cin >> C[i... | 1 | 73,085,326 |
#include<iostream>
using namespace std;
int main(){
int current,desired;
cin>>current>>desired;
cout<<2*desired-current;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define F first
#define S second
typede... | 1 | 31,090,483 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
int N;
cin >> N;
ll a[N];
for(int i = 0; i < N; i++) ... | #include <cstdio>
#include <iostream>
#include <cassert>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <unordered_map>
using namespace std;
typedef long long LL;
ty... | 1 | 97,326,348 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,... | #include <bits/stdc++.h>
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> p;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int ... | 1 | 95,675,752 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
static const int INF (1<<30);
int main() {
int N; cin >> N;
vector<tuple<ll, ll, ll> > v(N);
rep(i, N) {
ll a, b, sum;
cin >> a >> b;
sum = a + ... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
#include<stdio.h>
#include <cstdint>
#inclu... | 1 | 55,990,830 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 2000000000000000000ll
#define fi first
#define sec second
#define... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int N,M;
int main(){
cin>>N>>M;
vector<long long> a[3];
for(int i=0;i<N;i++){
for(int j=0;j<3;j++){
long long num;cin>>num;
a[j].push_back(num);
}
}
long long res=0;
for(int bit=0... | 1 | 36,934,756 |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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 rev(i, n) for(int i = (int)(n - 1); i >= 0; i... | #include<iostream>
#include<algorithm>
#include<string>
#include<map>
#include<vector>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
typedef long long ll;
int main(){
int x,y,a,b,c; cin >>x>>y>>a>>b>>c;
int p[a],q[b],r[c];
vector<pair<int, int> > all;
rep(i,a){ cin >> p[i]; all.push_back... | 1 | 64,439,698 |
#include<iostream>
#include<cstring>
using namespace std;
int table[10][10];
int town;
int INF = 9999;
void fw(){
for(int k = 0; k <= town; k++){
for(int i = 0; i <= town; i++){
for(int j = 0; j <= town; j++){
table[i][j] = min(table[i][j], table[i][k] + table[k][j]);
... | #include<bits/stdc++.h>
using namespace std;
enum { maxn = 20, INF = 10000000000000LL };
typedef long long LL;
LL G[maxn][maxn];
int vis[maxn];
LL d[maxn][maxn];
int inq[maxn];
int m;
void spfa(int src)
{
memset(inq, 0, sizeof inq);
for(int i = 0; i < maxn; i++) d[src][i] = INF;
d[src][src] = 0LL;
queue... | 1 | 27,044,333 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
signed main(void)
{
int d;
cin >> d;
d = 25 - d;
cout << "Christmas";
rep(i, d)
{
cout << " Eve";
}
cout << endl;
return 0;
} | 1 | 53,673,877 |
#include <bits/stdc++.h>
#include <math.h>
#define ALL(a) a.begin(), a.end()
#define rep(i, K, N) for(long long int i = K; i < N; i++)
#define ll long long int
using namespace std;
int main() {
ll N, M;cin >> N >> M;
if(N == 1 && M == 1){cout << 1;exit(0);}
if(N == 2 || M == 2){cout << 0;exit(0);}
if(N == 1 && M !... | #include<iostream>
#include<algorithm>
using namespace std;
int main()
{
long long n,m,res;
cin >> n >> m;
if(n==1&&m==1)
res=1;
else if(n==1||m==1)
res=max(n,m)-2;
else
res=(n-2)*(m-2);
cout << res << endl;
return 0;
} | 1 | 8,829,041 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
int main(){
int n;
string s;
cin >> n >> s;
vector<int> data(n);
rep(i,0,n){
... | #include <bits/stdc++.h>
using namespace std;
bool find(int i, int j, int k, string s) {
int now = 0;
for (int idx = 0; idx < s.size(); idx++) {
if (now == 0 && s[idx] == '0' + i) {
now++;
continue;
}
if (now == 1 && s[idx] == '0' + j) {
now++;
continue;
}
if (now == 2 &&... | 1 | 96,038,763 |
#include <stdio.h>
int n, a, c[10007];
int main() {
scanf("%d", &n);
for(int i = 0; i < n; i++) scanf("%d", &a), c[a]++;
for(int i = 0; i < 10001; i++) {
for(int j = 0; j < c[i]; j++) {
printf(--n ? "%d " : "%d\n", i);
}
}
} | #include <cstdio>
#include <cmath>
#include <utility>
#include <vector>
using namespace std;
#define nmax 10005
int Countingsort( int A[], int B[], int n){
int i, j;
int C[ nmax ] = {};
for( j = 0 ; j < n ; j++ ){
C[ A[j] ]++;
}
for( j = 1; j < nmax ; j++ ){
C[j] = C[j] + C[j-1];
... | 1 | 63,557,222 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.