code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)pr... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
// cout << fixed << setprecision(10) << flush;
int n;
cin >> n;
vector<int> a(n), b(n), c(n);
vector<vector<int>> edge(n, vector<int>());
vector<vector<int>> weight(n, vector<int>());
for(int i=0; i<n-1; i++... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
ll N, M;
cin >> N >> M;
ll even_max_len = M % 2 == 0 ? M : M - 1;
ll odd_max_len = M % 2 == 1 ? M : M - 1;
for (ll i = M; i > 0; i--) {
if (i % 2 == 0) {
ll j = (even_max_len - i) / 2;
... | // practice with Dukkha
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m; cin >> n >> m;
for (int i = 1, j = m + 1; i < j; i++, j--)
cout << i << ' ' << j << '\n';
for (int i = m + 2, j = m + m + 1; i < j; i++, j--)
cout << i << ' ' << j << '\n';
return 0;
}
| 1 |
#include <string>
#include <vector>
#include <iostream>
using namespace std;
vector<int> x[100]; int n, t;
bool same(vector<int> a, vector<int> b) {
for(int i = 0; i < 4; i++) {
for(int j = 0; j < 4; j++) {
for(int k = 0; k < 4; k++) {
for(int l = 0; l < 4; l++) {
string s;
for(int m = 0; m < i; m++... | #include <iostream>
#include <sstream>
using namespace std;
class Dice {
public:
static int rollingface[][4];
static int sideface[][4];
int face[6];
Dice(string &face_data);
// ~Dice();
void roll(const char &op);
int top();
int front_face(int top, int right);
void print_faces();
... | 1 |
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) <... | #include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
int N, K;
const ll MOD = 998244353;
ll F[4002], F_inv[4002];
ll modpow(ll a, ll b) {
ll rtn = 1, kakeru = a;
while (b > 0) {
if (b & 1)rtn *= kakeru;
kakeru *= kakeru;
kakeru %= MOD;
rtn %= MOD;
b >>= 1;
}
return rtn;
... | 1 |
#include<bits/stdc++.h>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
typedef pair<char,int> P;
int main(){
char s[1000005];
scanf("%s",s);
vector<P> d;//(?ยจ????,??ยฐ)
int count=1; char before=s[0];
for(int i=1;s[i]!=0;i++){
if(s[i]!=before){
d.push_back(P(bef... | #include <iostream>
#include <string>
using namespace std;
int main(void)
{
string s;
cin >> s;
if (s.length() % 2 == 1)
{
cout << "No" << endl;
}
else
{
for (int i = 0; i < (int)s.length(); i += 2)
{
if (s[i] != 'h' || s[i + 1] != 'i')
{
... | 0 |
//
// main.c
// ITP1_4_D
//
// Created by ??ยฑ??ยฐ?????? on 2015/09/29.
// Copyright ?? 2015??ยด HamadaShogo. All rights reserved.
//
#include <stdio.h>
#include <stdlib.h>
long long intSum(int *num, int size);
int intMax(int *num, int size);
int intMin(int *num, int size);
int main(int argc, const char * argv[]) {... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; i++){ cin >> a[i]; }
int min=0, max=0;
long long sum=0;
min = *min_element(a.begin(), a.end());
max = *max_element(a.begin(), a.end... | 1 |
#include<cstring>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#define l(x) (x<<1)
#define r(x) ((x<<1)|1)
#define IL inline
#define reg register
#define LL long long
#define N 200010
#define INF 0x3f3f3f3f
using namespace std;
int n,i,j;
int ans=... | #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 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
struct Dice {
string input;
size_t pos;
int values[6];
int top;
int bottom;
int front;
int back;
int left;
int right;
void Init() {
pos = 0;
top = 1;
bottom = 6;
front = 2;
back = 5;
left = 4;
... | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
class Dice {
public:
int a, b, c, d, z, f;
Dice(int a, int b, int c, int d, int z, int f) {
this->a = a;
this->b = b;
this->c = c;
this->d = d;
this->z = z;
... | 1 |
#include <stdio.h>
int main() {
int n, i, j, k, l, p[101], m[101][101];
scanf("%d", &n);
for ( i = 1; i <= n; i++) {
scanf("%d", &p[i - 1]);
scanf("%d", &p[i]);
}
for ( i = 1; i <= n; i++) {
m[i][i] = 0;
}
for ( l = 2; l <= n; l++) {
for ( i = 1; i <= n - l + 1; i++) {
int j = i + l - 1;
m[i][... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int limN = 105;
int xs[limN], ys[limN];
ll dp[limN][limN];
bool usd[limN][limN];
ll memo(int l, int r) {
if(l>=r)
return 0;
if(usd[l][r])
return dp[l][r];
usd[l][r] = true;
ll &ans = dp[l][r];
ans = (1LL<<62)... | 1 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<functional>
#include<math.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pf(n) printf("%d\n",n)
#define pff(a,b) printf("%d %d\n",a,b);
typedef long long ll;
typedef p... | ///////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////
// _oo0oo_ //
// o8888888o //
// 88" . "88 ------ hzt1 //
// ... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1e9+7;
void add(int64_t& a, int64_t b){
a = (a+b) % MOD;
}
void mul(int64_t& a, int64_t b){
a = a*b % MOD;
}
int nth_bit(int64_t num, int n){
return (num >> n) & 1;
}
int main(){
int N, X, Y, Z;
cin >> N >> X >> Y >> Z;
int XY... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi... | 1 |
#include "bits/stdc++.h"
#include <unordered_set>
#define _CRT_SECURE_NO_WARNINGS
#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define REP2(i, x, n) for(decltype(x) i = (x); i < (n); i++)
#define REP3(i, x, n) for(decltype(x) i = (x); i <= (n); i++)
#define RREP(i, n) for (decltype(n) i = (n) - 1; i >= 0; i... | #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... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int M=1e9+7,N=1<<20;
int n,i,ans,x,f[N],g[N],now,la[N];
inline char gc(){
static char buf[100000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int rd(){
int x=0,fl=1;char ch=gc();
for(;ch<48||ch>57;ch=gc())if(ch... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll inf=1000000000000000000;
#define rep(i,m,n) for(int i=m;i<n;i++)
#de... | 1 |
#include <stdio.h>
#include <math.h>
#define MAXINPUT 100
int main(void){
int h[MAXINPUT],w[MAXINPUT];
int ansh[MAXINPUT]={},answ[MAXINPUT]={};
int i=0,j=0;
int ans=0;
int num=0;
int k;
while(i<MAXINPUT){
scanf("%d %d",&h[i],&w[i]);
if(h[i]==0 && w[i]==0)break;
i++;
num++;
}
for(i=0;i<num;i++,ans=0){... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
typedef long long ll;
typedef pair<int, int> ii;
#define MAXI 1000000
struct NODE{
int h, w... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, x;
cin >> n >> x;
long long a[n], c = 0;
for (long long i = 0; i < n; i++)
{
cin >> a[i];
if (a[i] > x)
{
c += a[i] - x;
a[i] = x;
}
}
for (long long i = 1; i < n; ... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000007
using namespace std;
int main(){
int n;
cin >> n;
string s;
cin >> s;
int w = 0, e = 0;
int ans[n];
rep(i,n)ans[i] = 0;
rep(i,n){
ans[i] = w;
if(s[i]=='W')w++;
}
rep(i,n){
ans[n-1-i] += e;
if(s[n-1-... | 0 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 200005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef d... | #define NguyenDangQuan the_author
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define mset(x, i) memset(x,i,sizeof(x))
#define elif else if
#define heap priority_queue
#define fi first
#define se second
#define pb push_back
#define ld long double
#define ll long long
#define ull unsigned long long
#defin... | 1 |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#define N 45
#define mod 1000000007
using namespace std;
int n, x, y, z, f[N][(1 << 17) + 5], ans;
template < typename T >
inline T read()
{
T x = 0, w = 1; char c = getchar();
while(c < '0' || c > '9') { if(c == '-') w = -1; c = getchar... | #include<bits/stdc++.h>
using namespace std;
const int md = 1e9+7;
int n, x, y, z, sm, g;
long long a[2][1<<20] = {1}, ans;
int main(){
scanf("%d%d%d%d", &n, &x, &y, &z);
sm = x + y + z;
g = (((1<<y)+1)<<z)+1;
for(int i = 0; i <= n; i++){
(ans *= 10) %= md;
for(int j = 0; j < 1<<sm; j++){
if((j ... | 1 |
#include<stdio.h>
int main(void)
{
int i,j,n,n1;
int a,b,c,d;
int cnt[100];
int sum[100];
scanf("%d",&n);
n1=n*(n-1)/2;
for (i=0; i<n; i++) {
sum[i]=0;
cnt[i]=1;
}
for(i=0;i<n1;i++){
scanf("%d %d %d %d",&a,&b,&c,&d);
if(c>d){
sum[a-1]+=3;
}
else if(c<d){
sum[b-1]+=3;
}
else{
sum[a-1]... | #include <stdio.h>
#define MAX 200000
using namespace std;
int temp[MAX];
long long merge(int A[], int lo, int mid, int hi) {
for(int i = lo; i <= hi; i++) temp[i] = A[i];
long long cnt = 0;
int i = lo, j = mid + 1;
for(int k = lo; k <= hi; k++) {
if(i > mid) A[k] = temp[j++];
else if(... | 0 |
#include<cstdio>
#include<algorithm>
using namespace std;
long long Mod = 998244353, F[10100], InvF[10100], po[10100];
long long Pow(long long a, long long b) {
long long r = 1;
while (b) {
if (b & 1)r = r*a%Mod;
a = a*a%Mod; b >>= 1;
}
return r;
}
long long Comb(int a, int b) {
if (a >= b&&b >= 0)return F[a] ... | #include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define MOD(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,n) for (int i = 0; i < n; i++)
#define forr(i,a,b) for (int i = a; i <= b; i++)
#define all(v) v.begin(), v.end()
#define pb(x) push_back(x)
using namespace std;
typedef long l... | 1 |
#include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll... | #pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 2000005
#define inf 1e9
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
ll n,a[maxn],b[maxn],c[maxn];
inline ll read()
{
ll x=0,w=1,x2=0,base=1e9; char c=getch... | 1 |
#include<iostream>
#include<string>
using namespace std;
typedef long long ll;
int main() {
int n;
string s;
cin >> n >> s;
int q;
cin >> q;
while (q--) {
int k;
cin >> k;
ll ans = 0;
ll cm = 0, cc = 0;
int left = 0, right = 0;
ll plus = 0;
for (; left < n; left++) {
while (right < n && righ... | #include<iostream>
#include<algorithm>
using namespace std;
/*
void swap(int &a,int &b){
int tmp=a;
a=b;
b=tmp;
}*/
int partition(int A[],int p,int r){
int x=A[r-1];
int i=p-1;
for(int j=p;j<r;j++){
if(A[j]<=x){
i++;
if(i>=0&&j>=0)
swap(A[i],A[j]);
}
//swap(A[i],A[r-1]);
}
//swap(A[i],A[r-1... | 0 |
#include<stdio.h>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<cmath>
#include<iostream>
#include<queue>
#include<string>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef long double ld;
typedef unsigned long long ull;
typedef... | #include <bits/stdc++.h>
using namespace std;
int A[103], B[103], cnt;
int main()
{
int n, m;
scanf("%d%d", &n, &m);
for(int i = 1; i <= m; i++)
{
scanf("%d", &A[i]);
cnt += (A[i] & 1);
}
if(cnt > 2) return puts("Impossible"), 0;
if(m == 1 && A[1] == 1) return printf("1\n1\n1\n"), 0;
if(m == 1) return pri... | 1 |
// lcmใจใ__builtin_popcountใจใใฏg++ -std=c++17 default.cppใฟใใใชใใใใง
#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 ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0;... | 0 |
// lcmใจใใฏg++ -std=c++17 default.cppใฟใใใชใใใใง
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
//#define double long double
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n,m;cin>>n>>m;
vector<pair<int,int>> pr(m);
rep(i,m){
int s,c;cin>>s>>c;
s--;
pr[i]=make_pair(s,c);
}
rep(i,1000){
string s=to_st... | 1 |
#include <stdio.h>
#include <string.h>
void shift(char *str, int len, int n){
char t[] = "abcdefghijklmnopqrstuvwxyz";
char c;
for(int i=0; i<len; ++i){
c = *(str + i);
if(c >= 'a' && c <= 'z'){
str[i] = t[(c-'a'+n)%26];
}
}
}
int main(void){
char input[81];
char copy[81];
char *token;
int len = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
while (getline(cin, str)) {
for (int i = 0; i < 26; ++i) {
for (char& c : str) {
if (isalpha(c)) {
if (c != 'z') ++c;
else c = 'a';
}
}
if (str.find("that") != string::npos || str.find(... | 1 |
#include<cstdio>
void swap(int &x,int &y)
{
int t=x;
x=y;
y=t;
return ;
}
int main()
{
int a,b,c;
while(~scanf("%d %d %d",&a,&b,&c))
{
int t;
swap(a,b);
swap(a,c);
printf("%d %d %d\n",a,b,c);
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
vector<string> a;
bool cmp(string s, str... | 1 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define ... | #pragma GCC optimize(3,"Ofast","inline")
#pragma GCC target("avx")
#include <bits/stdc++.h>
using namespace std;
#ifdef ONLINE_JUDGE
#define getchar gc
inline char gc(){
static char buf[1<<16],*p1=buf,*p2=buf;
if(p1==p2){
p2=(p1=buf)+fread(buf,1,1<<16,stdin);
if(p2==p1) return EOF;
}
return *p1++;
}
#endif
temp... | 0 |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_poizcy.hpp>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define clr(a,h) memset(a, (h), sizeof(a))
#define mem(a,h) ... | #include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <deque>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <complex>
#include <functional>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<int> v(4);
for(int i = 0; i < 4; i++){
v.at(i) = (int)S.at(i) - (int)'0';
}
bool finish = false;
for (int tmp = 0; tmp < (1 << 3); tmp++){
if(finish) break;
bitset<3> s(tmp);
int test = v.at(0);
... | #include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define n1 "\n"
#define B begin()
#define E end()
#define F first
#define S second
#define pb push_back
#define pf push_fro... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
//S ใฎๅ
้ ญใใ 3 ๆๅญ็ฎใจๆซๅฐพใใ 2 ๆๅญ็ฎใฎ้๏ผไธก็ซฏๅซใ๏ผใซๅคงๆๅญใฎ C ใใกใใใฉ 1 ๅๅซใพใใใ
int count = 0;
int index;
for (int i = 2; i < S.size() - 1; i++) {
if(S[i] == 'C'){
count++;
index = i;
}
}
int up_count = 0;
for (... | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
//้
ๅไปฅๅคใฎ... | 1 |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<string>
#include<map>
#include<cmath>
#include<queue>
using namespace std;
namespace MyLib {
#define ALL(a) a.begin(),a.end()
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define debug(x) if(1)cout<<#x<<":"<<x<<endl;... | #include<iostream>
using namespace std;
int main(){
int L;
int l[10];
int v1, v2;
int st, la;
double pass;
double time;
char comma;
while(cin >> l[0]){
for(int i=1;i<10;i++){
cin >> comma >> L;
l[i] = L + l[i-1];
}
cin >> comma >> v1 >> co... | 0 |
#include <iostream>
#include <vector>
#include <string>
#define rep(i,N) for(int i=0;i<(N);i++)
using namespace std;
int main(){
long long N,i=0;
cin>>N;
vector<long long> p;
while(N!=0){
N=N-1;
p.push_back(N % 26);
N = N / 26;
i++;
}
string res = "";
for(int i = p.size() -1 ; i >= 0 ; i-- )res += (cha... | #include <stdio.h>
int main(){
int t;
scanf("%d", &t);
long long int sum=0;
long long int min =0;
for (int i=1; i<= t; i++){
if (i%3==0 || i%5==0){
min += i;
}
sum+=i;
}
printf("%lld", sum-min);
return 0;
} | 0 |
#include <cstdio>
#include <vector>
#include <algorithm>
#include <set>
#include <cstring>
#include <map>
using namespace std;
const int MAXN = 1000005;
char S[MAXN], T[MAXN];
int n, q[MAXN], head = 1, tail;
signed main () {
scanf("%d%s%s", &n, S+1, T+1);
if(strcmp(S+1, T+1) == 0) { puts("0"); return 0; }
int ans = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 998244353
#define fi first
#define sc second
#define rep(i,x) for(int i... | 1 |
#include <bits/stdc++.h>
using namespace std;
// DAG
vector<bool> visited;
vector<int> dp;
int DFS(const vector<vector<int>> &graph, int v){
if(visited[v] == true) return dp[v];
visited[v] = true;
for(auto next_v : graph[v]){
if(DFS(graph, next_v) == -1) return -1;
dp[v] = max(dp[v],... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main(){
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(n-1));
rep(i, n){
rep(j, n-1){
cin >> a[i][j];
a[i][j]--;
}
rev... | 1 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
//#define ll long long
//#define int unsigned long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree<... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define __ ios_base::sync_with_stdio(0);cin.tie(0);
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(),x.end()
#define forn(i,a,n) for(int i=a; i < n; i++)
typedef long long int lli;
typedef long double Double;
typedef pair<in... | 0 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for(int i=0; i<n; i++)
#define FOR(i, a, b) for(int i=a; i<b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first
#define s... | #include<bits/stdc++.h>
#define ll long long
#define rep(A,B,C) for(A=B;A<C;++A)
#define repd(A,B,C) for(A=(ll)C-1;A>=B;++A)
#define pii pair<int,int>
#define pll pair<ll,ll>
template<typename T>
void mxin(T& a,T b){if(a<b)a = b;}
template<typename T>
void mnin(T& a,T b){if(a>b)a = b;}
using namespace std;
//////////... | 0 |
#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, T; cin >> N >> T;
vector<int> t(N);
rep(i, N){
cin >> t[i];
}
int ans = t[N-1] + T;
for (int i = 1; i < N; i++){
int ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;cin>>N;
vector<int>A(N);
vector<int>B(N);
vector<int>C(N);
vector<long long>D(N);
for(int i=0;i<N;i++)cin>>A[i];
for(int i=0;i<N;i++)cin>>B[i];
for(int i=0;i<N;i++)cin>>C[i];
sort(A.begin(),A.end());
sort(C.begin(),C.end());
long long... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (... | #include <algorithm>
#include <iostream>
using namespace std;
int main(){
int A[128], N;
A[0] = 1;
for(int i=1; i<=32; i++){
A[i] = A[i-1];
if(i>=1) A[i] += A[i-2];
if(i>=2) A[i] += A[i-3];
}
while (cin >> N && N) cout... | 1 |
#define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
// MAX int 2,147,483,647 -> 10ๆก
// MAX ll 9,223,372,036,854,775,807 -> 19ๆก
// MAX O(n) 10^8 -> 8ๅ
// double pi = M_PI or acos(-1)
// printf("%.10f\n",... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using ll = long long;
using P = pair<ll,ll>;
using vec = vector<ll>;
using vecp = vector<P>;
using mat = vector<vec>;
using matp = vector<vecp>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define all(v) v.begin(), v.end()... | 0 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<math.h>
#include<iomanip>
#include<algorithm>
#include<string.h>
#include<cctype>
#include<map>
#include<set>
#include<vector>
#include<sstream>
#include<stack>
using namespace std;
long long int arr[5000+5];
long long int result[5000+... | #include<iostream>
using namespace std;
int main(){
int count,max,i,j,k,l;
int sum,data_set[5000];
while(cin>>count){
if(!count)break;
cin>>data_set[0];
max=data_set[0];
for( i=1;i<count;i++){
cin>>data_set[i];
}
// for(l=1;l<=count;l++){
for( j=0;j<count;j++){
sum=0;
for( ... | 1 |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define INF 120000000
using namespace std;
typedef pair<int, int> P;
typedef long long int LL;
int v, e;
vector<int> g[10010], rg[10010], vs, st;
vector<bool> vis;
void dfs(int x) {
vis[x] = true;
for (int i = 0; i < g[x].size(); i++) {
... | #include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define LOOP(i) while(i--)
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}
using namespace std;
using ... | 1 |
#include <bits/stdc++.h>
#define N 1001
using namespace std;
int n,m;
string s1,s2;
int mem[N][N],used[N][N];
int dfs(int I,int J){
if(I == n) return m-J;
if(J == m) return n-I;
if(used[I][J]++) return mem[I][J];
int res = 1e9;
res = min(res,1+dfs(I+1,J));//insert
res = min(res,1+dfs(I,J+1));//erase
res ... | #include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <string>
#include <tuple>
#include <functional>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <map>
//#include "toollib.h"
#pragma warning (disable:4018)
#define INT_MAX 2147483647
using namespace std;
int judge_equ... | 1 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define sc(x) scanf("%lld",&x);
int main(){
ll n, a, b;
sc(n) sc(a) sc(b)
ll X[... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int t = 753;
int d = 1000;
st... | 0 |
#include <stdio.h>
#include <iostream>
#include <string>
int main(void){
int *num,t=0,a[4];
a[0] = 0, a[1] = 1;
int ans;
num = new int[1000];
do{
std::cin >> num[t];
t++;
} while (num[t - 1] != 0);
t = 0;
while (num[t] != 0){
a[0] = 0; a[1] = 0, a[2] = 1;
for (int i = 0; i < num[t]; i++){
a[3]... | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int stair(int n){
if(n==1)
return 1;
else if(n==2)
return 2;
else if(n==3)
return 4;
else
return stair(n-1)+stair(n-2)+stair(n-3);
}
int main(){
int n;
while(scanf("%d",&n) && n!=0){
int year = stair(n)/3650;
if(stair(n... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (ll i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using ld=long double;
using vin=vector<int>;
using v... | #include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int N; cin >> N;
int x, y;
vector<int> y_x(8, -1);
for (int i = 0; i < N; i++)
{
cin >> y >> x;
y_x[y] = x;
}
vector<int> perm(8);
for (int i = 0; i < 8; i++) { perm[i] = i; }
bool ok = true;
do
{
ok ... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <fstream>
using namespace std;
ifstream fin("../data.txt");
int x1, y1, x2, y2, aux, sx, sy, tx, ty, roads, minix, miniy, nx, ny, ax, ay;
char dir;
int a[2005][2005];
string ans, sdir;
vector<pair<int, int>> d = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int sx,sy,tx,ty;
cin >> sx >> sy >> tx >>ty;
for(int i = sy; i < ty; i++){
cout << "U";
}
for(int i = sx; i < tx; i++){
cout << "R";
}
for(int i = ty; i > sy; i--){
cout << "D";
}
for(int i = tx; i > sx; i--){
cout << "L";
}
cout << "L";
for(int... | 1 |
#include <array>
#include <cstdlib>
#include <iostream>
#include <string>
#include <queue>
#include <vector>
class SSF {
private:
void ScanLine(std::vector<std::string> *map, const char lx, const char rx, const char y, const char oy, std::array<std::queue<char>, 4> *buffer) {
unsigned char i = lx;
while (i <= rx) ... | #include<iostream>
#include<cstdio>
#include<queue>
#include<string>
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
int ans;
string island[20];
int dfs(int x,int y){
island[y][x]='0';
REP(i,4){
int n... | 1 |
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
#include<map>
#include<vector>
#include<stack>
#include<list>
typedef long long ll;
using namespace std;
int a[100010] , n;
int partition(int p , int r){
int x = a[r];
int i,j;
i = p-1;
fo... | #include <iostream>
using namespace std;
void swap(int A[], int i, int j)
{
int t = A[i];
A[i] = A[j];
A[j] = t;
}
int partition(int A[], int p, int r)
{
int x = A[r], i = p - 1;
for (int j = p; j <= r; j++) {
if (A[j] > x) continue;
swap(A, ++i, j);
}
return i;
}
int ma... | 1 |
#include <iostream>
using namespace std;
int main() {
int a, n;
cin >> n >> a;
if(n >= 10){
cout << a;
}else{
cout << a + 100 * (10 - n);
}
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
void abc_150a();
void abc_151a();
void abc_152a();
void abc_154a();
void abc_156a();
int main()
{
//abc_150a();
//abc_151a();
//abc_152a();
//abc_154a();
abc_156a();
}
void abc_150a()
{
int K, X;
cin >> K >> X;
if (500 * K >= X) cout <... | 1 |
#include <bits/stdc++.h>
using namespace std;
int p[1000005];
int getSum(int* BIT,int idx){
int sum=0;
while(idx>0){
sum+=BIT[idx];
idx-=(idx&-idx);
}
return sum;
}
void update(int* BIT,int N,int idx,int val){
while(idx<=N){
BIT[idx]+=val;
idx+=(idx&-idx);
}
return;
}
int main() {
memset(p,0,sizeo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m);
for (int i = 0; i < m; i++) cin >> l[i] >> r[i];
sort (l.begin(), l.end());
sort (r.begin(), r.end());
int ans = r[0] - l[m-1] + 1;
ans = max (ans, 0);
cout << ans ... | 0 |
#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;
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long;
const ll inf = 1001001001;
ll gcd(ll x, ll y) { re... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a;
cin>>a;
int res=a*(1+a+a*a);
cout<<res;
}
| #include <bits/stdc++.h>
using namespace std;
void h(){
cout << "Hello World" << endl;
exit(0);
}
int main() {
int x,a,b; cin>>x;
if(x==1) h();
cin>>a>>b;
cout << a+b << endl;
} | 0 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF (1<<30)-1
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... | #include <iostream>
using namespace std;
int main()
{
bool cr = false, cg = false, cb = false;
int n;
long long ans = 0;
string s;
cin >> n >> s;
int r[n + 1], g[n + 1], b[n + 1];
r[0] = 0;
g[0] = 0;
b[0] = 0;
for(int i = 0; i < n; i++)
{
r[i + 1] = r[i];
g[i ... | 1 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
//ll mod = 998244353;
#define rep(i,n) for(int i = 0; i < (n); ++i... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define append push... | 1 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
//้
ๅไปฅๅคใฎๅ
ฅๅใๅใๅใ
vo... | #include<iostream>
int main(){
int A, B, C, D;
std::cin >> A >> B >> C >> D;
if(A+B > C+D) std::cout<<"Left";
else if(A+B < C+D) std::cout<<"Right";
else std::cout<<"Balanced";
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define pb push_back
#d... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG //GCC5.4.1ใง้
ๅใฎ็ฏๅฒๅคใขใฏใปในใใจใฉใผใซใใ
//cmdใง g++ test.cpp ใจใใใจใณใณใใคใซใงใใ
//ๅถ้1็งใชใ10^6ใฏไฝ่ฃ 10^7ใฏๅคๅ้ใซๅใ 10^8ใฏใใปใฉๅ็ดใงใชใใจๅณใใ
// https://github.com/atcoder/live_library
// cppdbg: test.exeใฎterminalใซๆจๆบๅ
ฅๅใๆใฆใ
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
using Graphl = vector<vector<ll>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i+... | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];cout << (i == a.size() - 1 ? "\n":" ");}
#define rep(i,x) for(int i = 0;i<x;i++)
#define RE... | 0 |
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m, n | m) {
vector<vector<int>> graph(n);
for (int i = 0; i < m; ++i) {
int a, b; cin >> a >> b; --a; --b;
graph[a].push_back(b);
graph[b].push_back(a);
}
vector<i... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
while(1){
int n,i,a[10000],b[10000],c=0,m,j,d[1000000]={0},y=1,e=1,g=0,w=0;
cin >> n >> m;
if(n==0 && m==0){
break;
}
for(i=1;i<=m;i++){
cin >> a[i] >> b[i];
}
for(i=1;i<=m;i++){
if(a[i]==1){
d[y]=b[i]... | 1 |
#include <bits/stdc++.h>
#define INF 1e9
#define endl '\n'
#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 FORE(i, a, b) for (int i = (a), e = (b); i < e; ++i)
#define RFORE(i, a, b) for (int i = (b)-1, e = (a); i >= e; --i)
#define ALL(x) (x).begin(... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(v) v.begin(), v.end()
#define mem(arr) memset(arr, 0, sizeof(arr))
#define ff first
#define ss second
#define int long long int
const int MOD = 1e9 + 7;
const int INF = 1e18;
const int N = 1e6 + 1;
vector<int> g[N];
vector<int> vis(N);
void s... | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int a[4],b,c;
cin>>a[0]>>a[1]>>a[2]>>a[3]>>b>>c;
sort(a,a+4);
if(b>c)swap(b,c);
cout<<a[1]+a[2]+a[3]+c<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e9+7;
int main(){
ll a,c,b;
cin>>a>>b>>c;
cout<<c<< " "<<a<<" "<<b<<endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin()... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(long... | 0 |
#include <bits/stdc++.h>
#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 fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (double i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
typedef pair<double,double> P;
const int INF=1001001001;
// Morris-Pratt
template<typename T>
struct MP {
int n;
T t;
vector<int> a;
MP() {}
MP(const T& t): t(t) {
n = t.size();
a = v... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T>
struct Compress {
vector<T> xs;
Compress(const vector<T>& vs) : xs(vs) {
sort(xs.begin(), xs.end());
xs.erase(unique(xs.begin(), xs.end()), xs.end());
}
int compress(const T& x) {
return ... | 1 |
#include <bits/stdc++.h>
using namespace std;
void print() {
cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
cout << head;
if (sizeof...(tail) != 0)
cout << " ";
print(forward<Tail>(tail)...);
}
template <class T>
void print(vector<T> &vec) {
f... |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<time.h>
#include<vector>
using namespace std;
int main()
{
//ios::sync_with_stdio(false);
//cin.tie(0);
//cout.tie(0);
int n,x,... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,p;
cin>>n;
vector<int>v;
for(int i=0;i<2*n;i++){
cin>>p;
v.push_back(p);
}
sort(v.begin(),v.end());
long res=0;
for(int i=0;i<2*n;i+=2){
res+=min(v[i],v[i+1]);
}
cout<<res;
return 0;
} | #include<iostream>
#include<unordered_map>
using namespace std;
int main(){
int n;
cin>>n;
unordered_map<string,int>bmp,rmp;
for(int i=0;i<n;i++)
{
string element;
cin>>element;
if(bmp.find(element)==bmp.end()){
bmp[element]=1;
}
else
{
... | 0 |
#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;
vector<long long int> divisor(long long int n) {
vector<long long int> res;
for (long long i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long long ll;
struct edge { ll s, t, x; };
typedef pair<ll, ll> P;
typedef pair<ll,P> event;
const ll MAX = 510000;
const ll MOD = 1000000007;
int main() {
ll N;
cin>>N;
ll A[N];
rep(i,N){cin>>A[i];A[i]=-1l... | 0 |
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// ใใผใใซใไฝใๅๅฆ็
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++)... | #include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
#include <cstdlib>
#include <utility>
#include <cmath>
#include <queue>
#include <stack>
#include <cstring>
using namespace std;
#define ll long long
#ifndef ONLINE_JUDGE
#define debug(format, ...) fprintf(stderr, \
"%s:%d: " format "\n", __... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+7;
#define ll long long
char a[N];
int main(){
int n,q,k;
scanf("%d\n",&n);
scanf("%s",a);
scanf("%d",&q);
while(q--){
scanf("%d",&k);
ll nowd=0,nowm=0,cnt=0;
ll sum=0;
for(int i=0;i<n;i++){
if(i... | #include<stdio.h>
#include<math.h>
#include<algorithm>
#include<cctype>
#include<string.h>
#include <stdlib.h>
#define PI 3.1415926
void swap(int* x, int* y) {
int a = *x;
int b = *y;
*x = b;
*y = a;
}
int factorial(int n);
int sum(int n, int*);
int ave(int n, int*);
int min(int n, int*), min(int n, int m);
int ma... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,Q;
cin>>N>>Q;
int I=1100100100;
vector<pair<int,int>> p;
for(int i=0;i<N;i++){
int a,b,c;
cin>>a>>b>>c;
p.push_back(make_pair(a-c,c));
p.push_back(make_pair(b-c,-1*c));
}
for(int i=0;i<Q;i++){
int a;
cin>>a;
p.pus... | #include<bits/stdc++.h>
using namespace std;
int psum[505][505];
int main(){
int n,m,q;
cin>>n>>m>>q;
while(m--){
int l,r;
cin>>l>>r;
psum[r][l]++;
}
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++) psum[i][j]+=psum[i][j-1];
}
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++) psum[i][j]+=psum[i-1][j];
... | 0 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
typedef long long ll;
typedef pair<int, in... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
const int INF = 1e9;
const int MOD = 1000000007;
int main() {
int m;
cin >> m;
ll now = 0;
ll nine_count = 0;
ll d = 0;
rep(i,m){
ll a,b;
cin >> a >> b;
d += b;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mo = 1000000007;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit(){
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpl;
typedef vector<vll> vvll;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((i... | 0 |
#include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define MOD(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,n) for (ll i = 0; i < n; i++)
#define forr(i,a,b) for (ll i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define pb push_back
using namespace std;
typedef long long ll... | #include <bits/stdc++.h>
using namespace std;
#define sz(x) ((int) ((x).size()))
typedef long long ll;
typedef long double ld;
int n;
char g3[3][3] = {
{0, 1, 1},
{1, 0, 0},
{1, 0, 0}
}, g4[4][4] = {
{1, 2, 3, 3},
{1, 2, 1, 1},
{3, 3, 2, 3},
{1, 1, 2, 3}
}, g5[5][5] = {
{2, 3, 3, 2, 2},
{2, 0, 1, 1... | 1 |
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
int a[n];
for(int i=0;i<n;i++) cin >> a[i];
for(int i=n-1;i>0;i--) cout << a[i] << " ";
cout << a[0] << endl;
} | #include<iostream>
using namespace std;
int a[10];
int b[10];
int score(int x[10]){
int a=0,b=0,c=0,tmp;
for(int i=0;i<10;i++){
if(a < x[i]){
tmp = a;
a = x[i];
x[i] = tmp;
}
if(b < x[i]){
tmp = b;
b = x[i];
x[i] = tmp;
}
if(c < x[i]){
tmp = c;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1e9;
const int mod = 1000000007;
int... | #include<bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
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;}
#define rep(i,n) for(int i=0;i<n;i++)
#define all(a) (a).begin(),(a).end()
#defin... | 1 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>=b;--i)
#define fore(i,a) for(auto &i:a)
#define INF INT_M... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define initdp(a, b) for (int i = 0; i <= a; i++) for (int j = 0; j <= b; j++) dp[i][j] = -1;
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define all(arr) arr.begin(), ar... | 0 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <math.h>
//#define PI 3.141592653589
using namespace std;
int main()
{
int n;
long seisuu[3];
cin >> n;
for (int i=0; i<n; i++) cin >> seisuu[i];
sort(seisuu, seisuu+n);
for (int i=1; i<=seisuu[0]; i++)
{
if (n == 2)... | #include <bits/stdc++.h>
using namespace std;
const string YES = "POSSIBLE";
const string NO = "IMPOSSIBLE";
int gcd(int a, int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
void solve(long long N, long long K, std::vector<long long> A)
{
long long gc = 0, ma = 0;
for (int i = 0; i < N; i... | 0 |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
long long mod=(1e+9)+7;
long long n,m;
cin>>n>>m;
static long long sum_x,sum_y;
vector<long long> x(n+10),y(m+10);
for(ll i=1;i<=n;i++) cin>>x[i];
for(ll i=1;i<=m;i++) cin>>y[i];
for(ll xx=1;xx<=n;xx++){
sum_x+=(2*xx-n-1)*x[xx];
... | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++) //0ใใ
#define REP(i,N) for(int j=i;j<N;j++) //iใใ
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (rig... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define ii pair<int,int>
#define vii vector<ii>
#define vi vector<int>
#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(... | 1 |
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
typedef pair<int,int> P;
typedef vector<int> ivec;
template<class T> inline bool chmax(T& a, T b) { if (a < ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
vector<long> a(N);
vector<long> b(N);
for(int i=0;i<N;i++) cin>>a[i]>>b[i];
vector<vector<long>> c(N,vector<long>(2));
for(int i=0;i<N;i++) c[i][0]=a[i]+b[i],c[i][1]=i;
sort(c.begin(),c.end());
reverse(c.begin(),c.end());
lo... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
using namespace std;
int cnt = 0;
int a[1000500];
void insertsort(int a[], int n, int g){
for (int i = g; i < n; i++){
int v = a[i];
int j = i - g;
while (j >= 0 && a[j] > v){
a[j + g] = a[j];
j -= g;
cnt++;
}
a[j + g] =... | #include<stdio.h>
#include<algorithm>
using namespace std;
int a[200000];
int main()
{
int i,n,flag=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
sort(a,a+n);
for(i=0;i<n-1;i++)
{
if(a[i]==a[i+1])
{
flag=1;
break;
}
}
if(flag==1)
{
printf("NO\n");
}
else
{
pri... | 0 |
#include <iostream>
#include <vector>
#include <map>
using namespace std;
const int MAX = 410000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
//invใฎ่ฆ็ด ใซใฏiใฎ้ๅ
ใๆ ผ็ดใใใฆใใ
//ๅๅฆ็
void COMinit(){
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for(int i = 2; i < MAX; i++){
... | #include<bits/stdc++.h>
using namespace std;
int n,lst[1000100][26],gg[1000100];
char s[1000100],t[1000100];
struct treaps
{
int son[1201000][2],size[1201000],num[1201000],tag[1201000],rd[1200100],tt;
void update(int s){size[s]=size[son[s][0]]+size[son[s][1]]+1;}
int build(int n)
{
if (n==0) return 0;
int s=++... | 0 |
// โโโโโโโโ( โขฬชโ)โโโโโโโโโโโโโโโโโโโโโโโโ
// โโโโโโโโโโโโโ ]โโโโโโโโโโโโโโโโโ โโ
// โโโ
โโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโ
// [โโโโโโโโโโโโโโโโโโโ].โโโโโโโโโโโโโโ
// โฅโโฒโโฒโโฒโโฒโโฒโโฒโโค...โโโโโโโโโโโโ
//PointBlank's code (โโ _โ )
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
ll po... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int main()
{
int n, m, q;
cin >> n >> m >> q;
vector<vector<int>> table(n + 1, vector<int>(n + 1, 0));
while(m--)
{
int l,r;
cin >> l >> r;... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rg register
template <typename _Tp> inline _Tp read(_Tp&x){
char c11=getchar();x=0;while(!isdigit(c11))c11=getchar();
while(isdigit(c11))x=x*10+c11-'0',c11=getchar();return x;
}
int n,m,tot,a[105];
int main(){
read(n),read(m);
for(rg int i=1;i<=m;i++)read(a[i... | #include <iostream>
#include <stdio.h>
using namespace std;
class Dice{
public:
int value[6];
void roll(char _order) {
switch(_order) {
case 'N':
swap(value[4], value[0]);
swap(value[0], value[1]);
swap(value[1], value[5]);
break;
case 'E':
swap(value[2], value[0]);
... | 0 |
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#define LL long long
#define M 1000020
using namespace std;
int read(){
int nm=0,fh=1; char cw=getchar();
for(;!isdigit(cw);cw=getchar()) if(cw=='-') fh=-fh;
for(;isdigit(cw);cw=getchar()) nm=nm*10+(cw-'0');
return nm*fh;
}
in... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | 0 |
#include <bits/stdc++.h>
#define MAXN 100005
#define lowbit(x) x & -x
using namespace std;
int n, N;
int a[MAXN][4], b[MAXN], c[MAXN], t[2][MAXN * 3], sum[2];
int read() {
char c = getchar();
int x = 0;
while (!isdigit(c))
c = getchar();
while (isdigit(c)) {
x = (x << 3) + (x << 1) +... | #include <bits/stdc++.h>
using namespace std;
#define dump(...) cout<<"# "<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define peri(i,a,b) for(int i=int(b);i-->int(a);)
#define rep(i,n) repi(i,0,n)
#define per(i,n) peri(i,0,n)
#define all(c) begin(c),end(c)
#define mp mak... | 1 |
#include <bits/stdc++.h>
typedef long long ll;
#define MOD 1000000007
using namespace std;
int main() {
int N; cin >> N;
cout << 0 << endl;
string pres,s;
int l,r,prei;
l = N-1; r=0;
cin >> pres;
if(pres == "Vacant") return 0;
else cout << N-1 << endl;
cin >> s;
if(s == "Vacant"... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
templat... | 0 |
#include <stdio.h>
int main(){
int h1, m1, h2, m2, k;
scanf("%d %d %d %d %d", &h1, &m1, &h2, &m2, &k);
if(h1>h2){
h1-=24;
}
if(h2 == 0 && h1 != 0){
h2 = 24;
}
if(m2<m1){
m2 += 60;
h2--;
}
int mins = (h2-h1)*60 + (m2-m1);
mins-=k;
printf("%d\n", mins);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fastio cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(0)
typedef long long ll;
#define int ll
#define swap(x, y)((x)^=(y)^=(x)^=(y))
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> matrix;
typedef pair<int, int> pii;
typedef p... | 0 |
#include<bits/stdc++.h>
using namespace std;
long long ara[3][4007];
int main()
{
long long n,m,a,b,c,d,e,f,g,h,p,q,r,fr,sc,tr,sz,tz,i,j,k,mx=LLONG_MIN,mn=LLONG_MAX;
long long x,y=0,z=0,cnt=0,res=0,ttl=0,ans=0,sum=0; long long flg=0,flag=1,na=0,as=1;
vector<long long>u,v,w; vector< pair<long ... | #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()
using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
void solve() {
int n;
cin >> n;
ll... | 0 |
#include <iostream>
#include <sstream>
#include <algorithm>
#include <cstdio>
#include <math.h>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <string.h>
#include <bitset>
#define REP(i,a,n) for(int i=a;i<=n;++i)
#define PER(i,a,n) for(int i=n;i>=a;--i)
#define hr putchar(10)
#define pb push_... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_X 200005
const int MAX ... | 0 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int scores[2] = {0, 0};
int points[2][10];
for (int i = 0; i < 2; ++i) {
for (int j = 0; j < 10; ++j) {
cin >> points[i][j];
}
sort(points[i], points[i]+10);
for (int j = 0; j < 3; ++j) {... | #include<iostream>
using namespace std;
int main(){
long long e;
while ((cin >> e), e){
long long x,y, z, min = 1000000;
for (z = 0; z*z*z <= e; z++){
for (y = 0; y*y <= e; y++){
x = e - z*z*z - y*y;
if (x >= 0 && min > x + y + z)min = x + y + z;
}
}
cout << min << endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int n = s.size();
for (int i = 1; i < n; ++i) {
if (s[i - 1] == 'A' && s[i] == 'C') {
cout << "Yes" << '\n';
return 0;
}
}
puts("No");
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i=1; i<=n; i=i+1) {
int x = i;
if (x % 3 == 0) {
cout << " " << i;
} else {
while (x % 10 != 3 && x > 0) {
x = x / 10;
}
if (x % 10 == 3)
cout << " " << i;
}
}
cout << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int d,ans,p[25];
int Abs(int x)
{
return x<0?-x:x;
}
signed main()
{
cin>>d;
p[0]=1LL;
for(int i=1;i<=20;i++) p[i]=p[i-1]*10LL;
for(int i=2;i<=20;i++)
{
int k=i/2;
for(int s=0;s<(1<<k);s++)
{
int w,x=d;
if(i&1) w=10;
else w=1;
fo... | #include <bits/stdc++.h>
#define SIZE 300005
#define MOD 1000000007LL
#define INF 1 << 30
#define LLINF 1LL << 60
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define DOWN(i,b,a) for(int i=b;i>=a;i--)
#define SET(a,c) memset(a,c,sizeof a)
#define FORALL(i,c) for(__typeof((c).begin())i=... | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
#include<bitset>
#include<iomanip>
#include<queue>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using P = pair<int, int>;
const long long MOD = 1000000007;
long long ... | #include <bits/stdc++.h>
using namespace std;
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; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;... | 1 |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ss(x) (int) x.size()
#define cat(x) cerr << #x << " = " << x << endl
#define rep(i, l, r) for (int i = l; i <= r; ++i)
#define per(i, l, r) for (int i = r; l <= i; --i)
using ll = long long;
using namespace st... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int64_t MOD=1000000007;
int main() {
string S;
cin>>S;
vector<int64_t> A(26,0);
int64_t a=-97,b=S.size();
rep(i,b){
int64_t c=S.at(i);
A.at(a+c)++;
}
int64_t ans=b*(b-1)/2;
rep(i,26){
int64_t ... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
char s[3];
cin>>s[0]>>s[1]>>s[2];
int max=0, locmax=0;
for(int i=0;i<3;i++){
if(s[i] == 'R'){
locmax++;
}
else{
locmax=0;
}
if(locmax>max){
max=locmax;
}
}
cout<<max;
}
| #include<iostream>
#include<cmath>
using namespace std;
int main()
{
int a, b, c, k, x, y, z;
cin >> a >> b >> c >> k;
if(a >= b && a >= c)
{x = a; y = b; z = c;}
if(b > a && b >= c)
{x = b; y = c; z = a;}
else if(c > a && c > b)
{x = c; y = a; z = b;}
while(k > 0)
{
k--;... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll stoi9(string s) {
// 10 ^ 9ๅใใๆดๆฐใ่ฟใ
int digit = 0;
for (int i = sz(s... | #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
vector<long long> a(n);
const int b = 200;
for(int i = 0; i < n; i++) {
double p;
cin >> p;
a[i] = p * 1000000000 + 0.5;
}
vector<vector<int>> cnt(b, vector<... | 1 |
#include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9+7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE cout << ((n) ? "POSSIBLE... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)pr... | 0 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<s... | #include <bits/stdc++.h>
using namespace std;
int main(){//priority_queue?
int n, m;
cin >> n >> m;
vector<vector<int>> elist(n), rlist(n);
vector<int> indeg(n);
for(int i=0; i<n-1+m; ++i){
int s, t;
cin >> s >> t;
--s; --t;
elist[s].push_back(t);
rlist[t].push_back(s);
++indeg[t];
}
queue<int>... | 1 |
#include<iostream>
#include<set>
using namespace std;
int main(){
int K, N, i=0;
int input, output;
cin >> N >> K;
set<int> num;
while (i < K){
cin >> input;
num.insert(input);
i++;
}
int a1, a2=10, a3=10, a4=10, a5=10;
output = N;
while (1){
... | #include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int MAXN = 1e4 + 10;
ll dp[MAXN][128], num[MAXN];
char s[MAXN];
int len, D;
ll dfs(int pos, int tot, bool lim) {
if (pos == len + 1) return dp[pos][tot] = (tot == 0);
if (!lim && dp[pos][tot] != -1) return dp[pos][to... | #include<bits/stdc++.h>
const int MOD = 1e9 + 7;
using namespace std;
int main(){
string K;
cin >> K;
int D;
cin >> D;
vector<vector<vector<long long>>> dp(K.size() + 1, vector<vector<long long>>(D, vector<long long>(2, 0)));
dp[0][0][1] = 1;
for(int i = 0; i < (int)K.size(); i++){
for(int j ... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.