code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
// https://atcoder.jp/contests/arc069/tasks/arc069_b
#include "algorithm"
#include "bitset"
#include "cmath"
#include "functional"
#include "iomanip"
#include "iostream"
#include "map"
#include "numeric"
#include "queue"
#include "set"
#include "string"
#include "vector"
#define rep(i, to) for (ll i = 0; i < (to); ++i... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i,a,b) for(ll i=a;i<b;i+... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 1000000000
#define LLINF 100000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec sec... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECC... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define Opy ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
typedef long long ll;
int main()
{
//Opy;
/*-------------------------------------------------
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll X;
cin >> X;
ll c1=0;
ll c2=0;
while(X >= 500){
X -= 500;
c1++;
}
while(X >= 5){
X -= 5;
c2++;
}
cout << c1*1000+c2*5 << endl;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N= 998244353;
ll m_pow(ll n, ll k){
if(k==0) return 1;
else{
ll a = (m_pow(n,k/2)*m_pow(n,k/2))%N;
if(k%2==0) return a;
else return (a*n)%N;
}
}
int main(){
ll n,m,k;
cin >> n >> m >> k;
vector<ll> m... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
using ll = long long;
const int N = 2e5 + 5;
const int MOD = 1e9 + 7;
int n;
ll ar[N], sum[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> ar[i];
... | 0 |
#include <stdio.h>
int main(){
char stringa[120];
char stringb[120];
scanf ("%s %s", &stringa, &stringb);
printf ("%s%s", stringb, stringa);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const str... | 1 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | #include <iostream>
#include <cmath>
#include <vector>
#include <bitset>
#include <string>
#include <utility>
#include <queue>
#include <algorithm>
using namespace std;
long long int mpown(long long int m, int n);
int bitCount(int bits);
int main()
{
int n,k;
cin >> n >>k;
vector<long long int> v(n);
... | 0 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cctype>
#include <algorithm>
#include <cstdlib>
#include <vector>
#define R register
#define IN inline
#define gc getchar()
#define ll long long
#define MX 105
template <class T>
IN void in(T &x)
{
x = 0; R char c = gc;
for (; !isdigit(c); c = gc);
for ... | #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 int INF = 1001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
const int MAX = 510'000;
long long fac[MAX], finv[MAX], inv[MAX];
// ... | 0 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 1... | #include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(void){
int n, m, t, i, j;
scanf("%d %d", &n, &m);
vector<int> sports;
vector<int> votes(m, 0);
for(i = 0;i < n;++i){
scanf("%d", &t);
sports.push_back(t);
}
for(i = 0;i < m;++i){
scanf("%d", &t);
for(j = 0;j < n;... | 0 |
#include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
string S;
cin >> S;
bool hflag = false, iflag = false;
string ans = "Yes";
for (int i = 0; i < S.length(); i++) {
if (S[i] == ... | #include <bits/stdc++.h>//復習必須
#include<iostream>
#include<vector>
#include <cmath>
#include <map>
#include <algorithm>
#include <string>
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
using namespace std;
#define P pair<int, int>
int main () {
string s ;
cin >> s ;
size_t n = s.length() ;... | 1 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int main(){
int n,m,q;
cin>>n>>m>>q;
vector<vector<int>> d(n,vector<int>(n));
rep(i,m){
int l,r;
cin>>l>>r;
l--; r--;
d[n-l-1][r]++;
}
rep(i,n)for(int j=1;j... | #include<bits/stdc++.h>
using namespace std;
int n, l, q;
vector<int>v;
vector<vector<int> >moves;
void preprocess(){
int cur = 1;
for(int i = 1; i <= n; i++){
while(cur <= n && v[cur] - v[i] <= l){
cur++;
}
moves[i][0] = cur - 1;
}
for(int j = 1; j <= 17; j++){
... | 0 |
// #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <locale>
#include <cctype>
#include <sstream>
using namespace std;
typedef ... | #include <iostream>
#include <string>
class Baseball{
private:
int point;
int out_count;
int runner;
public:
Baseball();
void singleHit();
void homerun();
void out();
void new_inning();
int get_out_count();
int get_point();
~Baseball() = default;
};
Baseball::Baseball(){
new_inning();
}
void Baseball::si... | 1 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string str;
int i,j;
cin >> str;
string st="";
for( i=str.size()-1; i>=0 ; i-- )
st+=str[i] ;
cout << st << endl;
} | #include<iostream>
#include<string>
#include<algorithm>
#include<iterator>
int main(){
std::string str;
std::cin >> str;
std::reverse_copy(str.begin(), str.end(),
std::ostream_iterator<char>(std::cout,""));
std::cout << std::endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
vector<string> vs(3);
for (int i = 0; i < 3; ++i) {
cin >> vs[i];
}
vector<int> cur(3, 0);
int t = 0;
char ans;
while (true) {
if (cur[t] >= vs[t].size()) {
ans = 'A' + t;
break;
}
cur[t]... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if(s.size()==3){
for(int i=2;i>=0;i--){
cout << s.at(i);
}
cout << endl;
}
else{
cout << s << endl;
}
}
| 0 |
#include <iostream>
void ArrayDump(int *A, int N)
{
for (int i = 0; i < N; i++) {
std::cout << *(A + i);
if (i != N - 1) {
std::cout << " ";
}
}
std::cout << std::endl;
}
int BubbleSort(int *A, int N)
{
bool flag = true;
int exchange_num = 0;
while (flag) {
... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 1
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=... | 0 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#define MOD 998244353
using namespace std;
typedef long long ll;
template <typename Tp> inline void getint(Tp &num){
register int ch, neg = 0;
while(!isdigit(ch = getchar())) if(ch == '-') neg = 1;
num ... | #include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
/*
//#if __cplusplus >= ... | 1 |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 1000005
using namespace std;
typedef long long LL;
char s[N];
int dp[N][2];
int main()
{
scanf("%s",s+1);
dp[0][1]=1;
for(int i=1;s[i];i++)
{
int d=s[i]-'0';
dp[i][0]=min(dp[i-1][0]+d,dp[i-1][1]+10-d);
dp[i][1]=min(dp[i-1][0]+... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS... | 0 |
#include <iostream>
#include <cstring>
#include <string>
using namespace std;
int main(){
string s;
int n;
int c_pos;
cin>>n;
cin.ignore();
while(n--){
getline(cin,s);
while((c_pos=s.find("Hoshino"))!=string::npos){
s.replace(c_pos,7,"Hoshina");
}
... | #include <iostream>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdio>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
string s;
int main(){
getline(cin,s);
while(getline(cin,s)){
... | 1 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
for... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | 1 |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
using namespace std;
typedef long l... |
#include <iostream>
using namespace std;
int main()
{
int n, a, b, count = 0, pointX = 0, pointY = 0;
cin >> n;
do {
cin >> a >> b;
if (a > b) {
pointX += (a + b);
}
else if (a < b) {
pointY += (a + b);
}
else {
pointX += a;
pointY += b;
}
count++;
if (count == n) {
cout << pointX ... | 1 |
//Author:xht37
#include <bits/stdc++.h>
#define ui unsigned int
#define ll long long
#define ul unsigned ll
#define ld long double
#define pi pair <int, int>
#define fi first
#define se second
#define mp make_pair
#define ls (p << 1)
#define rs (ls | 1)
#define md ((t[p].l + t[p].r) >> 1)
#define vi vector <int>
#d... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long int ll;
pair<ll,int> p[100005];
int main(){
ll n,x; cin >> n >> x;
vector<ll> b(n),l(n),u(n);
for(int i=0;i<n;i++){
cin >> b[i] >> l[i] >> u[i];
}
ll sum=0;
for(int i=0;i<n;i++){
p[i]=pair<ll,int>((x-b[i])*u[i]+b... | 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<stdio.h>
#include<string.h>
#define N 8
int mp[N][N],row[N],col[N],dneg[2*N-1],dops[2*N-1];
void init()
{
for(int i=0; i<N; i++)
row[i]=col[i]=0;
for(int i=0; i<2*N-1; i++)
dneg[i]=dops[i]=0;
for(int i=0; i<N; i++)
for(int j=0; j<N; j++)
mp[i][j]=0;
}
void che... | 0 |
#include<bits/stdc++.h>
using namespace std;
void solve3()
{
puts("aa.");
puts("..b");
puts("..b");
}
string mp[10][10];
void init()
{
mp[4][0] = "aabc";
mp[4][1] = "ddbc";
mp[4][2] = "efgg";
mp[4][3] = "efhh";
mp[5][0] = "aabbc";
mp[5][1] = "dee.c";
mp[5][2] = "d.ffd";
mp[5]... | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cfloat>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <string>
#include <set>
using namespace std;
int... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10; //微調整用（EPSより小さいと0と判定など）
... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const ... | 0 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#... | //============================================================================
// Name : JOI.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <iostr... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
signed main() {
int n;
string s;
cin >> n >> s;
vector<int> R, G, B;
rep(i,n) {
if(s[i] == 'R') R.push_back(i);
if(s[i] == 'G') G.push_back(i);
if(s[i] == 'B') B.push_back(i);
}
long long ans ... | #include<cstdio>
using namespace std;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
char s[400][401];
int par[160000];
int c1[160000];
int c2[160000];
int find(int x) {
if (par[x] == x) return x;
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)... | 0 |
#include <iostream>
#include <iomanip>
using namespace std;
int main(){
int n;
int area[11][11];
while(cin >> n){
if(n == 0) break;
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
cin >> area[i][j];
}
}
for(int i = 0; i < n; i++){
int count = 0;
for(int j = 0; j < n; j++){
count ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,int> plli;
typedef pair<int,pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
#define rep(i,n) for ... | 0 |
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
/*------------------------------------------------------------------*/
#define ll long long int
#define mp make_pair
#define pb push_back
#define MOD 1000000007
bool isvowel(char c)
{
if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u')
return true;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 10;
int n; ll k, ans, a[maxn], lef[maxn], rig[maxn];
int main() {
scanf("%d %lld", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%lld", a + i), ans += a[i];
}
ans += (n - 1) * k;
lef[1] = a[1];
for (int i = 2; ... | 0 |
#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <sstream>
#include <typeinfo>
#include <map>
using namespace std;
typedef long long LL;
#define REP(i,N) for(int i = 0; i < (int)N; i++)
int dy[4] = {1,0,-1,0};
int ... |
#include<iostream>
#include<string>
#include<algorithm>
#include<sstream>
using namespace std;
static const int MAX_N = 12;
int field[MAX_N][MAX_N];
static const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
int stoi(std::string str) {
int ret;
std::stringstream ss;
ss << str;
ss >> ret;
return ret;
}
void df... | 0 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
/* a と b の最大公約数を返す関数 */
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b,... | #include<iostream>
using namespace std;
int N,M,A[1001],B,V[1001];
int main(int i,int j){
cin>>N>>M;
for(;i<=N+M;i++){
cin>>((i<=N)?A[i]:B);
for(j=1;j<=N;j++){
if(i>N&&B>=A[j]){
V[j]++;break;
}
}
}
int max=0;
for(i=1;i<=N;i++){
if(max<V[i]){
max=V[i];j=i;
}
}
cout<<j<<endl;
return 0;
} | 0 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX_INPUT_SIZE 1024
void trace(int num, int* array);
int bubbleSort(int num, int* array);
int
main(int argc, char* argv[])
{
char input[MAX_INPUT_SIZE];
int num = atoi(fgets(input, sizeof(input), stdin));
int* array = new int[num];
... | #include<iostream>
using namespace std;
int main()
{
int flag = 1, tmp, n, a[100], count = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
while (flag)
{
flag = 0;
for (int i = n - 1; i > 0; i--)
if (a[i] < a[i - 1])
{
tmp = a[i];
a[i] = a[i - 1];
a[i - 1] = tmp;
count++;
fla... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef tuple<long double,ll,ll> T;
const ll mod=1e9+7,INF=mod*mod*3;//M_PI
#define rep(i,N) for(ll i=0; i<(N); i++)
#define rep1(i,N) for(ll i=1; i<(N); i++)
#define f first
#define s second
#define pb pu... | #include "bits/stdc++.h"
#define ll long long
#define lld long double
#define MOD 1000000007
#define inf 1000000007
#define pii pair<int,int>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0; i<(int)(n); i++)
int main(){
int H, W, ans=1; cin >> H >> W; string A[H];
REP(i, H){ cin >> A[i]; }
int B[H][W]={}; vector< pair<int, int> > C;
REP(i, H){ REP(j, W){
if(A[i][j]=='#'){ B[i][j]=1; C.push_back(make_pair(i, j)); }
} }
REP(i, ... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
const int N = 1010;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
int _w;
int n, m;
char str[N][N];
int dis[N][N];
queue<pii> q;
bool inside( int x, int y ) {
return x >= 1 && x <= n && y >= 1 && y <= m;
}
int main() {
_w =... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
ll modpow(ll a,ll n,ll mod){
if(n == 0) return 1LL;
if(n % 2 == 0){
ll d = modpow(a,n/2,mod) % mod;
return (d*d) % mod;
}
return (a % mod) * (modpow(a,n-1,mod) % mod) % mod;
}
int main(){
ll n; cin >> n;
... | #include <stdio.h>
#include <iostream>
#include <vector>
#include <array>
constexpr int64_t MOD = 1'000'000'007;
constexpr int64_t help = 1;
int main() {
int64_t n;
std::cin >> n;
std::array<uint64_t, 62> bits{};
for (int64_t i = 0; i < n; i++) {
int64_t d;
std::cin >> d;
for (int64_t b = 0; b < 62; b++)... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001
#define mod 1000000007
#define pi 3.141592653589793
typedef vector<int> vi;
typedef vector<ll> vl;
ll gcd(ll a,ll b){
if(b>a) swap(a,b);
if(b==0) return a;
return gcd(b,a%b);... | #include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <algorithm>
#include <stdio.h>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <numeric>
//#include <map>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> vData;
for (int i = 0; i < n; i++)... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int N, T;
cin >> N >> T;
vector<int> A(N), B(N);
for(int i = 0; i < N; i++) cin >> A[i] >> B[i];
vector<int> ind(N);
for(int i = 0; i < N; i++) ind[i] = i;
sort(ind.begin(), ind.end(), [&](int i, int ... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define L first
#define R second
using namespace std;
int qmin(int a, int b){
return (a < b) ? a : b;
}
int qmax(int a, int b){
return (a > b) ? a : b;
}
int n;
pair<int, int> seg[100100];
int len(int l, int r){
return qmax(r-l+1, 0);
}
int mai... | 0 |
#include <cstdio>
#include <algorithm>
#include <vector>
#define file(x) freopen(#x".in", "r", stdin), freopen(#x".out", "w", stdout)
inline int read()
{
int data = 0, w = 1; char ch = getchar();
while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
if (ch == '-') w = -1, ch = getchar();
while (ch >= '0' && ... | #include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
typedef long long ll;
const ll MAXN = 2e5+10;
const ll MOD = 1e9+7;
ll H, W, A, B, ans = 0, fac[MAXN], inv[MAXN];
int main() {
scanf("%lld%lld%lld%lld", &H, &W, &A, &B);
inv[1] = inv[0] = 1;
fac[1] = fac[0] = 1;
for (ll i ... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define cyes cout<<"YES"<<endl
#define cno cout<<"NO"<<endl
#define sp <<" "<<
#define cst(x) cout<<fixed<<setprecision(x)
#define pi 3.14159265359
#define mod 1000000007
struct edge {
int to;
int weight;
ed... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[214514];
int main() {
ll n;
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
ll ans=0;
if(a[0]!=0)cout<<-1<<endl;
else{
ll cnt=1;
for(int i=1;i<=n;i++){
if(a[i]==a[i-1])cnt++;
else if(a[i]>a[i-1]){
if(a[i]-a[i-1]>1){
cout<<-1<<endl;... | 1 |
#include <iostream>
using namespace std;
int main(){
int A,B,C;
cin >> A >> B >> C;
if (A != B && A != C && B != C) {
cout << "No" << endl;
}
else if (A == B && B == C) {
cout << "No" << endl;
}
else if (A == B && A != C) {
cout << "Yes" << endl;
}
else if (A == C && A != B) {... | // GRL_1_A
#include <iostream>
#include <vector>
#include <queue>
#include <math.h>
#define N 1000000000
using namespace std;
struct edge{
int adj;
int dis;
};
int main(){
int V, E, r, s, t, d, x;
vector<vector<edge> > A;
vector<int> distance;
queue<int> ver;
edge e;
cin>>V>>E>>r;
A.resize(V);
for(int... | 0 |
// C++ 14
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(ll __x = __start; __x < __end; __x++)
typedef pair<int, int> Edge;
int n;
vector<Edge> G[100000];
vector<ll> D(100000, 0);
int main() {
cin >> n;
loop(i,0,n-1) {
int a, b, c; cin >> a >> b >> c;... | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<functional>
#include<iostream>
#include<queue>
#define rep(i,a,b) for(i=a;i<b;i++)
#define F1 first.first
#define F2 first.second
#define F3 second
#define INF 2100000000
#define long long int int
using namespace std;
typedef pair<pair<int,int>,int> P1;
ty... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int H = 105;
const int W = 10;
const int MOD = 1e9 + ... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <math.h>
using namespace std;
typedef long long ll;
const int MAXN = 3e5 + 10;
const int Mod = 1e9 + 7;
int N;
char S[MAXN];
ll f[MAXN][2][2][3], s[MAXN];
ll ans;
int main() {
register int i, j, k, l;
scanf("%s", S + 1); N = strle... | 0 |
#include<iostream>
#include<algorithm>
#include<utility>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define P pair<int, int>
using namespace std;
char field[12][12];
int cnt;
int dx[4] = { 1, 0, -1, 0 };
int dy[4] = { 0, 1, 0, -1 };
char depth;
void dfs(int x,int y){
/*
rep(i, 12){
re... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,t;
while(cin>>n,n){
int c[10];fill(c,c+10,0);
for(int i=0;i<n;i++)cin>>t,c[t]++;
for(int i=0;i<10;i++){if(!c[i])cout<<'-';else for(int j=0;j<c[i];j++)cout<<'*';cout<<endl;}
}
} | 0 |
#include <bits/stdc++.h>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define ... | %:pragma GCC optimize "-O3"
%:pragma GCC optimize("Ofast")
%:pragma GCC optimize("inline")
%:pragma GCC optimize("fast-math")
%:pragma GCC optimize("unroll-loops")
%:pragma GCC optimize("inline-functions")
%:pragma GCC optimize("no-stack-protector")
%:pragma GCC optimize("inline-small-functions")
%:pragma GCC optimize(... | 0 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
// increment
#define rep_n(_1, _2, _3, NAME, ...) NAME
#define rep_2(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define rep_3(i, initial, n) \
for (int(i) = (int)(initial); (i) < (int)(n); ++(i))
#define rep(...) rep_n(__VA_ARGS__, rep_3, rep_2... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N, Q;
cin>>N>>Q;
string S;
vector<int> ac_cnt(N, 0);
int cnt = 0;
cin>>S;
for(int i=0; i<N-1; i++){
if(S[i]=='A' && S[i+1]=='C'){
S[i]='a';
cnt++;
}
ac_cnt[i+1... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
#define ll long long
int main (){
int a,b;
cin >> a >> b;
int i=0;
int sum = 1;
while(sum<b){
sum--;
sum+=a;
i++;
}
cout << i << endl;
return 0;
} | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
using namespace std;
int main(){
int l,r;
cin>>l>>r;
long long ans=3000;
if(r-l>=2200)cout<<0<<endl;
else{
for(long long i=l;i<=r-1;i++){
for(long long j=i+1;j<=r;j++){
lon... | 0 |
#include <bits/stdc++.h>
using namespace std;
struct hito{
long long sum;
long long H;
long long P;
};
bool cmp(const hito &a, const hito &b){
return a.sum < b.sum;
}
int main(){
int N; cin >> N;
long long INF = 1e18;
hito A[5010] = {};
for(int i = 1; i <= N; i++){
cin >> A[i].H >> A[i].P;
A[i].s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct node
{
ll x;
ll y;
};
node a[5007];
int n;
bool cmp(node p,node q)
{
if (p.x+p.y==q.x+q.y) return p.y<q.y;
return p.x+p.y<q.x+q.y;
}
int main(){
ios::sync_with_stdio(false);
scanf("%d",&n);
for (int i=1;i<=n;i++)
... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cout << #x << " = " << x << endl;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++it)
#define MSET(c, v) memset(c, v, sizeof(c))
const int I... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = int;
int main()
{
ll i,j,k;
ll h,w;
cin >> h >> w;
ll inf = 160*80;
vector<vector<ll>> a(h,vector<ll>(w,0));
vector<vector<ll>> b(h,vector<ll>(w,0));
for(i = 0;i... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <functional>
using namespace std;
using i64 = int64_t;
const i64 MOD = 1e9+7;
const i64 INF = 1e18+7;
struct UnionFind{
int n;
vector<int> par;
UnionFind(int n) : n(n), par(n, -1){}
int Find(int x){return par[x] < 0 ? x : Find(par[x]);}
bool U... | #include<bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define M 1000000007
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define f first
#define s second
#define b begin
#define e end
#define pb push_back
#define mp make_pair
#define FOR(i,a,b) for(i=a;i<b;i++)
#define RFOR(i,a,b) for(i=a;i>=b;i--)
#de... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
using namespace std;
long long MOD = 1000000007;
template<typename T>
void cout_vec(vector<T> &vec... | #include <bits/stdc++.h>
#define fi first
#define se second
#define ii pair<int, int>
#define int long long
using namespace std;
const int INF = 1e9;
int n, m;
int ans = INF;
int a[85][85], b[85][85];
bool f[85][85][52000];
void attempt(int i, int j, int diff)
{
if (i == n && j == m)
{
ans = min(ans,... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m,i,x,y;
cin>>n>>m>>x>>y;
int ara[n],bra[m];
for(i=0;i<n;i++)
cin>>ara[i];
for(i=0;i<m;i++)
cin>>bra[i];
sort(ara,ara+n);
sort(bra,bra+m);
for(i=ara[n-1]+1;i<=bra[0];i++)
{
if(i>x && i<=y)
... | #include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
using namespace std;
bool hantei( vector<int>& x, vector<int>& y ) {
rep( Z, -100, 100+1 ) {
bool flag = true;
rep( i, 0, x.size() ) {
if ( x.at(i) >= Z ) flag = false;
}
rep( i, 0, y.size() ) {
if ( y.at(i) < Z ) ... | 1 |
#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 <... | #include <bits/stdc++.h>
using namespace std;
#define task "test"
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define openfile if (fopen(task ".inp","r")){freopen(task ".inp","r",stdin);freopen(task ".out","w",stdout);}
#define ll long long
#define pii pair <int, int>
#define pll pair <ll... | 0 |
#include <bits/stdc++.h>
#define sz(arr) (int)arr.size()
#define all(arr) arr.begin(), arr.end()
using namespace std;
void _cin() {}
template <class Head, class... Tail>
void _cin(Head&& head, Tail&&... tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
#define Cin(T, ...) \
T __VA_ARGS__; \
_cin(__VA_A... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <map>
using namespace std;
int main(){
double n;
cin >> n;
cout << n*(180-(360/n)) << endl;
return 0;
}
| 1 |
//Be Name Khoda, Besmellah Rahmane Rahim, In The Name Of God;
//#include<bits/stdc++.h>
#include<iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include<bitset>
#include<list>
#include<cassert>
#include<numeric>
#include... | #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 MAXN 1000005
#define eps 1e-12
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef ... | 1 |
#include <stdio.h>
using namespace std;
int final_board[8][8] = {{0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0},
{0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0}};
void deletePossibility(int tmp_board[8][8],int row,int column){
tmp_board[row][column] = 1;
for(int i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int i=ini;i<n;i++)
#define _rep(i,ini,n) for(int i=ini;i>=n;i--)
int main(){
int n;
cin>>n;
vector<pair<int,int>> a,b;
rep(i,0,n){
int x,y;
cin>>x>>y;
a.push_back(make_pair(y,x));
}
rep(i,0,n){
... | 0 |
#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>;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
signed main(){
string s;
cin >> s;
cout << s.subs... | #include <iostream>
using namespace std;
int main()
{
string name;
int count = 0;
getline(cin,name);
/*if (name == "FESTIVAL")
{
cout << "Yes" << endl;
}*/
if(name[name.length()-1] == 'L')
{
for(int i = 0; i < name.length()-8; i++)
{
cout << name[i];
}
}
cout << endl;
}
| 1 |
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
int w,h;
vector<vector<int> > b;
int sx,sy,gx,gy;
int ans;
void test(int x,int y,int n){
int bx,by;
int xx=x,yy=y;
if(++n>=ans) return;
while(b[y][x+1]==0){
x++;
if(x==gx&&y==gy){
ans=n;
return;
}
}
if((x!=... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define HMAX 20
#define WMAX 20
using namespace std;
int w,h;
int dd[5]={0,1,0,-1,0};
void dfs_aux(int sx, int sy, int map[WMAX][HMAX],int *min,int count){
rep(r,4){
int nx=sx,ny=sy;
if(map[nx+dd[r]][ny+dd[r+1]]==1)
continue;
while(... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define mp make_pair
#define PI pair<ll,ll>
#define poly vector<ll>
#define mem(a) memset((a),0,sizeof(a))
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(int)(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> v1;
typedef vector<v1> v2;
typedef vector<v2> v3;
typedef unordered_map<ll, unordered_map<ll, ll>> graph;
const ll INF = 1ll << 50;
const ll mod = 1000000007;
ll n;
ll query(ll x){
cout << x << endl;
... | 0 |
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=1;i<=n;i++)
#define drep(i,n) for(int i=n;i>=0;i--)
#define INF 100000005
#define MAX 100000001
#define dmp make_pair
#define dpb push_back
#define fi first
#define se second
using namespace std;
//__gcd(a,b)... | #include<stdio.h>
#include<string.h>
#include<math.h>
int value( char c )
{
switch( c ){
case 'I':
return 1;
break;
case 'V':
return 5;
break;
case 'X':
return 10;
break;
case 'L':
return 50;
break;
case 'C':
return 100;
break;
case 'D':
return 500;
break;
case 'M':
... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long n;
string s,sw = "SW";
string solve();
string check(string now);
int main() {
cin >> n >> s;
cout << solve() << endl;
return 0;
}
string solve(){
string ans;
for(int i = 0;i < 4;++i){
string now;
now += sw[i % 2];
no... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
int main() {
int n,p;
while (cin >> n >> p && n != 0 && p != 0) {
vector<int> a(n, 0);
int flag = n;
int winner;
int i = 0;
while (1) {
if (p != 0) {
if (a[i % n] == 0) flag--;
a[i % n] += 1;
... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=100010;
pair<int,int> p[maxn];
int n;
int L1,R1,L2,R2;
int L[maxn],R[maxn];
void solve(){
scanf("%d",&n);
for(int i=1;i<=n;++i){
scanf("%d%d",&p[i].first,&p[i].second);
}
sort(p+1,p+n+1);
L1=p[1].first;R1=p[1].second;
L[n]=p[n... | /*
* @Author: RBQRBQ
* @Date: 2020-04-05 15:08:15
* @LastEditors: RBQRBQ
* @LastEditTime: 2020-04-05 19:16:50
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<ll,ll> pii;
namespace IO{
template<typename T>inline void read(T &x){
x=0;ll f=1;char ... | 1 |
//hate penalty
#include <bits/stdc++.h>
using namespace std;
int dsu[200001], dsu2[200001];
map <pair<int, int> ,int> mp;
int find(int x){
if (dsu[x]) return dsu[x]=find(dsu[x]);
return x;
}
int find2(int x){
if (dsu2[x]) return dsu2[x]=find2(dsu2[x]);
return x;
}
int main(){
int n, k, l;
cin >> n >> k >> l;... | #include <iostream>
#include <vector>
#include <string>
#include <cstdlib>
#include<algorithm>
#include <iomanip>
#include <math.h>
#include <iostream>
#include <bitset>
#include <map>
#define db double
#define vi vector<int>
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ld long... | 0 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include<bits/stdc++.h>
#define ll long long
const ll mod = 1000000007 ;
using namespace std ;
int main()
{
int n;
cin>>n;
int A[n];
int cnt = 0 ;
for(int i=0 ; i<n ; i++)
cin>>A[i];
for(int i=0 ; i<n ; i++)
{
for(int j=i+1 ; j<n ; j++)
{
for(int k=j+1 ; k<n ; k++)
{
if(A[i]+A[j]>A[k] && A[k]+... | 0 |
#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<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define FORR(i, m, n) for (ll i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).... | 0 |
#include <bits/stdc++.h>
#define enter putchar('\n')
#define space putchar(' ')
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
typedef pair<int, int> pii;
map<pii, int> M;
vector<pii> E[500005];
set<pii> s;
int n, m, ncnt, d[500005];
template <class T> int read(T &x) {... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define reps(i,f,n) for(int i=f; i<n; ++i)
#define rep(i,n) reps(i,0,n)
int main()
{
int m, a, b;
while(cin >> m >> a >> b, m){
vector<int> pt(m);
for(int i=0; i<m; ++i){
cin >> pt[i];
}
... | 0 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define Rep(i, n) for(int i=0... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typede... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#define FASTIO ios_base::sync_with_stdio(0);cin.t... | 0 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#define FASTIO ios_base::sync_with_stdio(0);cin.t... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);
using namespace std;
namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(cons... | 0 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> ii;
int fact[2000005];
int mod = 998244353;
long long qexp(long long b, long long p){
long long res = 1;
while(p){
if(p&1) res = (res * b) % mod;
b = (b * b) % mod;
p >>= 1;
}
return res;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
#define fir first
#define sec second
#define rep(i,a,b) for (int i = (a) ; i <= (b) ; ++ i)
#define rrp(i,a,b) for (int i = (a) ; i >= (b) ; -- i)
#define gc() getchar()
template <typename tp>
inline void r... | 1 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <functional>
#include <limits.h>
#include <set>
#include <map>
#include <tuple>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//マクロ
//forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
//Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#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+... | 1 |
#include <bits/stdc++.h>
using namespace std;
vector<int> primes={2,3,5,7};
int primes_extend(int calc_from, int calc_to);
int factoring(int n, map<int,int> &factors);
const int combination_max=100000+1000;
const int combination_modulo=1000000007;
vector<int64_t> factorials(combination_max);
vector<int64_t> factorial... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, A = 1;
cin >> N >> K;
for (int i = 0; i < N; i++) {
if (A * 2 < A + K) A *= 2;
else {
for (; i < N; i++) A += K;
break;
}
}
cout << A << endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int v,e;
cin>>v>>e;
int g[v][v];
int INF=1LL<<55LL;
for(int i=0;i<v;i++)
for(int j=0;j<v;j++)
g[i][j]=(i!=j)*INF;
for(int i=0;i<e;i++){
int s,t,d;
cin>>s>>t>>d;
g[s][t]=d;
}
for(int k=0;k<v;k++)
f... | #include <stdio.h>
#include <limits.h>
int main(){
int n,m,s,i,j;
scanf("%d%d",&n,&m);
int e[m+1][3],dist[m+1],update=1,k,d[200][200];
//printf("xxx");
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(i==j)d[i][j]=0;
else d[i][j]=INT_MAX;
}
}
for(i=0;i<m;i++){
for(j=0;j<3;j++){
scanf("%d",&e[i][j]);
}
d... | 1 |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAX_N = 1005;
int c[MAX_N][MAX_N];
int main()
{
string X,Y;
cin >> X;
cin >> Y;
for(int i=0;i<=X.length();i++){
c[i][0] = i;
}
for(int j=0;j<=Y.length();j++){
c[0][j] = j;
}
for(int i=1;i<=X.length();i++){
for(int j... | #include <bits/stdc++.h>
#define max 1000007
#define ll long long int
using namespace std;
vector <ll> primes;
void sieve()
{
bool isprime[max+1];
for(ll i=0;i<=max;i++) {
isprime[i] = true;
}
isprime[0]=false;
isprime[1]=false;
for(ll i=3;i*i<=(max);i=i+2)
{
if(isprime[i]) {... | 0 |
#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<typename T> void chmax(T &a, T b) { a = max(a, b); }
template<typename T> void chmin(T &a, T b) { a = min(a, b); }
const ll INF = 1e15;
int main() {
ll x, y;
cin... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a,b,c,k;
int64_t target;
int64_t remains;
cin >> a >> b >> c >> k;
target = max(a,max(b,c));
remains = a + b + c - target;
target = target * pow(2,k);
cout << target + remains << endl;
return 0;
}
| 0 |
#include <stdio.h>
#include <algorithm>
#define INF 100000000
using namespace std;
int n;
int graph[100][100];
void floyd(){
for(int k=0;k<n;k++)
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
graph[i][j]=min(graph[i][j],graph[i][k]+graph[k][j]);
}
int main(){
int k,i,j,a,b,c,d,e,x;
while... | #include <iostream>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
using namespace std;
struct edge{
int to,cost;
edge(){}
edge(int to,int cost):to(to),cost(cost){}
};
typedef pair<int,int> P;
int d[101];
const int INF=(int)1e9;
int main(void){
int n,k;
while(cin>>n>>k,!(n==0&&k... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 10000000000000000
int main(){
int A,B,M;
cin>>A>>B>>M;
vector<int> a(A),b(B);
for(int i=0;i<A;i++)cin>>a[i];
for(int i=0;i<B;i++)cin>>b[i];
int ans = 1000000;
fo... | #include <iostream>
using namespace std;
struct Dice
{
Dice(int d[6]){
for(int i = 0; i < 6; ++i)
n[i] = d[i];
}
void toN(){ shift( n[0], n[1], n[5], n[4] ); }
void toS(){ shift( n[0], n[4], n[5], n[1] ); }
void toW(){ shift( n[0], n[2], n[5], n[3] ); }
void toE(){ shift( n[0], n[3], n[5], n[2] ); }
void s... | 0 |
#include <iostream>
#include<math.h>
#include<iomanip>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;
int main()
{
int a=0,b=0,a1=0,b1=0,i=0,n=0,j=0;
for(i=1;;i++){
cin >> n;
if(n==0)break;
for(j=0;j<n;j++){
cin >> a >> b;
if(a>b)... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define show(x) cout <<#x<<" = "<<(x... | 0 |
#include <stdio.h>
int main() {
char str[100];
scanf("%s", str);
if (str[3] == '7') {
str[3] = '8';
}
printf("%s\n", str);
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main()
{
string str;
cin>>str;
cout<<2018<<str.substr(str.find('7')+1)<<endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string A,B,C; cin >> A >> B >> C;
int a,b,c;
a = A.size();
b = B.size();
c = C.size();
char s,t,u,v;
s = A.at(a-1);
t = B.at(0);
u = B.at(b-1);
v = C.at(0);
if (s == t && v == u){
cout << "YES";
}
else cout << "NO";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,M,X,Y;
cin >> N >> M >> X >> Y;
vector<int>x(N);
vector<int>y(M);
for(int i = 0; i < N; i++) {
cin >> x[i];
}
for(int i = 0; i < M; i++) {
cin >> y[i];
}
sort(x.begin(),x.end());
sort(y.begin(),y.en... | 0 |
#include <iostream>
#include <cstdlib>
using namespace std;
typedef struct node {
int key;
struct node *parent;
struct node *left;
struct node *right;
} Tree;
Tree *root, *nil;
void insert(int key);
Tree *findNode(Tree *node, int key);
bool isFindTree(Tree *node, int key);
Tree *findMaximumTree(Tr... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
#define N 600000
#define NIL -1
//array
int key[N];
int parent[N];
int leftc[N];
int rightc[N];
//root
int root=NIL;
//function insert
void insert(int z){
int x,y;
y=NIL;
x=root;
while(x!=NIL){
y=x;
if(ke... | 1 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
bool judge(int x, vector<int> d){
bool ans = true;
while (x > 0){
rep(i, d.size()){
if (x % 10 == d[i]) ans = false;
}
x /= 10;
}
retu... | #include<bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const ll MOD = 1e9 + 7;
#pragma GCC target("avx2")
#prag... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long n,i;
int main()
{
cin >> n;
for(i=111; i<=999; i+=111)
if(i>=n) {
cout<<i<<endl;
break;
}
return 0;
}
| #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 1 |
#include "bits/stdc++.h"
using namespace std;
void solve()
{
string s;
cin >> s;
int k = s.size();
while (s[k - 1] != 'F')
k--;
cout << s.substr(0, k - 1) << endl;
}
int main()
{
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
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... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
struct Node{
int key;
Node *parent, *left, *right;
};
Node *root, *NIL;
void insert(int k){
Node *y = NIL;
Node *x = root;
Node *z;
z = (Node *)malloc(sizeof(Node));
z->key = k;
z->left =... | #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 yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#de... | 0 |
/* / \ (Hello)//JSM//*/
/* /*****\ */
/* Jai Shree Mataji / \ |\| |_| $ |-| K ... | #include <bits/stdc++.h>
using namespace std;
int main(void){
/*
int a, b;
cin >> a >> b ;
//*/
//*
vector<int> vec(3);
cin >> vec.at(0) >> vec.at(1) >> vec.at(2) ;
sort(vec.begin(), vec.end());
//*/
/*
if( a < 6 ){
cout << 0 << endl;
} else if (a ... | 1 |
#include<bits/stdc++.h>
using namespace std;
long long sum[200005];
int main()
{
long long mod=1000000007;
long long n;cin>>n;long long a[n];long long sum=0;
for(long long i=0;i<n;i++)
{
cin>>a[i];
sum+=a[i];
sum=sum%mod;
}
long long pum=sum;long long rum=0;
for(lon... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef string ... | 0 |
#include <bits/stdc++.h>
#define loop2(i, s, n, a) for (int i = int(s); i < int(n); i += a)
#define loop(i, s, n) loop2(i, s, n, 1)
#define rep(i, n) loop(i, 0, n)
#define pb push_back
#define all(in) in.begin(),in.end()
using ll = long long;
using ull = unsigned long long;
using namespace std;
int main(){
int n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n,t;
cin>>n>>t;
int sum=0;
int cur=0;
rep(i,0,n){
int a;
cin>>a;
if(cur<=a){
sum+=t;
}
else{
sum+=a+t-cur;
}
... | 0 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //required
#include <ext/pb_ds/tree_policy.hpp> //required
using namespace __gnu_pbds;
using namespace std;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// find_by_order(k) r... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> p;
typedef unsigned long long i... | 0 |
#include<iostream>
#include<vector>
using namespace std;
typedef unsigned long long int ull;
vector<ull> allPrimes;
void sieve(int n)
{
vector<bool> prime(n+1, true);
for (int p=2; p*p<=n; p++) {
if (prime[p] == true) {
for (int i=p*2; i<=n; i += p)
prime[i] = fal... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int H, W;
int seen[10000][10000];
char S[10000][10000];
vector<pair<ll, ll>> prime_factorize(ll n) { //素因数分解と各素数の個数
vector<pair<ll, ll>> res;
for (ll i = 2; i * i <= n; i++)
{
if (n % i != 0)
{
continue;
... | 1 |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <map>
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if ... | #include <bits/stdc++.h>
#define Int int64_t
using namespace std;
int main() {
constexpr Int INF = 1e18;
int N;
cin >> N;
vector<Int> a(N);
for (int i = 0; i < N; ++i) { cin >> a[i]; }
int skip = 1 + N % 2;
vector<vector<Int>> dp(N + 2, vector<Int>(skip + 1, -INF));
dp[0][0] = 0;
for (int i = 0; i <= N; ++i... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N,M;
cin>>N>>M;
vector<long long> l(M);
vector<long long> r(M);
for(long long i=0;i<M;i++)
cin>>l.at(i)>>r.at(i);
sort(l.begin(),l.end());
sort(r.begin(),r.end());
long long a=r.at(0)-l.at(M-1)+1;
if(a>0)
cout<<a<<endl;
else
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n); for(ll i = 0; i < (ll)n; i++)
int main() {
int n,m; cin >> n >> m;
int l,u; l = 0; u = (int)1e6;
rep(i, m){
int p, q; cin >> p >> q;
if(l < p) l = p;
if(q < u) u = q;
}
cout << max(u -... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1001000100010001000
#define MOD 1000000007
#define EPS 1e-10
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
#define Rep(i, N) for (int i = 1; i < N; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb ... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 1
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=... | 1 |
//kruskal tree
#include <cstdio>
#include <algorithm>
using namespace std;
#define M 100000
int parent[M],a[M],b[M];
pair<int,int>node[M];
int root(int a){return parent[a]==a?a:parent[a]=root(parent[a]);}
int unite(int a,int b){
int x=root(a),y=root(b);
if(x==y)return 0;
parent[x]=y;
return 1;
}
int main(){
int i,... | #include<vector>
#include<iostream>
#include<algorithm>
using namespace std;
#define MAX_V 10000
#define MAX_E 10000
int par[MAX_V];
int rank_[MAX_V];
void init(int V) {
for (int i = 0; i < V; i++) {
par[i] = i;
rank_[i] = 0;
}
}
int root(int x) {
if (par[x] == x) {
return x;
}
return par[x] = root(par[x]... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
string m = to_string(n);
int cnt = 0;
rep(i,m.size()){
cnt += m.at(i) - '0';
}
if(n % cnt == 0)cout << "Yes" <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a = (N % 10);
int b = (N-a)/10%10;
int c = (N-10*b-a)/(10*10)%10;
int d = (N-10*10*c-10*b-a)/(10*10*10)%10;
int e = (N-10*10*10*d-10*10*c-10*b-a)/(10*10*10*10)%10;
int f = (N-10*10*10*10*e-10*10*10*d-10*10*c-10*b-a)/(10*... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
long long int ar=0;
int temp[64];
for(int i=0;i<64;i++){
temp[i]=0;
}
for(int i=0;i<n;i++){
cin>>ar;
int j=0;
while(ar>0){
temp[j]+=ar%2;
ar/=2;
... | #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 mod=1000000007;
const int INF=1001001001... | 0 |
#include<iostream>
main(){
std::string s;
std::cin>>s;
int n=s.size();
std::cout<<s.substr(0,n-8)<<std::endl;
} | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
typedef pair<int,int> P;
const int MOD = 1000000007;
const ll INF = 1e16;
const double EPS = 1e-10;
cons... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll d;
map < ll, ll > mp[20];
ll pw10[20];
ll coef[20];
ll gc[20];
int LEN = 0;
int val[25];
int val0[25];
ll solve(int where, ll need) {
//cout << where << " " << need << endl;
if (where == LEN) {
return (need == 0);
}
if (gc[w... | #include<cstdio>
#include<cmath>
typedef long long LL;
int D;
LL ans=0;
LL solve(int len){
LL now=0,ans=1;
for(int l=0,r=len-1;l<r;++l,--r){
LL dw=(LL)pow(10,l),qaq=((LL)pow(10,r)-dw)/9;
if(now<D){
int wg=(D-now)/dw%10;
now+=qaq*wg;
ans=ans*(10-wg-(l==0));
}else{
int wg=(now-D)/dw%10;
now-=qaq*wg... | 1 |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
inline int gi()
{
char c;int num=0,flg=1;
while((c=getchar())<'0'||c>'9')if(c=='-')flg=-1;
while(c>='0'&&c<='9'){num=num*10+c-48;c=getchar();}
return num*flg;
}
#define N 200005
#define LL long long
#define lc i<<1
#define rc i<<1|1
const L... | #include <bits/stdc++.h>
using namespace std;
int u,v,kq,x[100005],y[100005],deg[100005],n,m,slx;
vector<int> a[100005],ng[100005];
queue<int> q;
void sxtp()
{
for (int i=1;i<=n;++i) if (deg[i]==0) q.push(i);
while (!q.empty())
{
int u=q.front();q.pop();
x[++slx]=u;y[u]=slx;
for (... | 0 |
#include <bits/stdc++.h>
#define err(args...) {}
#ifdef DEBUG
#include "_debug.cpp"
#endif
using namespace std;
using ll = long long;
using ld = long double;
template <typename T> using lim = numeric_limits<T>;
template <typename T> istream& operator>>(istream& is, vector<T>& a) { for(T& x : a) { is >> x; } return is; ... | #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 rep(i, n) for... | 0 |
#include <stdio.h>
int main(void){
int n,i,j,k;
scanf("%d",&n);
int retsu[n];
for (i = 1; i <= n; i++){
k = n - i;
scanf("%d",&retsu[k]);
}
for (j = 0; j < n; j++){
if( j ) printf(" ");
printf("%d",retsu[j]);
}
printf("\n");
return 0;
}
| #include<stdio.h>
int main()
{
int a,b;
while(scanf("%d",&a)!=EOF&&a)
{
int b[10000]={0};
int i,j;
for(i=0;i<a;i++)
{
scanf("%d",&b[i]);
}
printf("%d",b[i-1]);
for(j=i-2;j>=0;j--)
{
printf(" %d",b[j]);
}
printf("\n");
}
return 0;
} | 1 |
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <utility>
using namespace std;
template <class T>
using lp_queue=priority_queue<T, deque<T>, greater<T>>;
using Weight=long long;
static const Weight INF=1LL<<57;
struct Edge {
size_t src, dst;
Weight weight;
Edge() {}
... | #include <stdio.h>
#include <limits.h>
int main(){
int n,m,s,i,j;
scanf("%d%d",&n,&m);
int e[m+1][3],dist[m+1],update=1,k,d[200][200];
//printf("xxx");
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(i==j)d[i][j]=0;
else d[i][j]=INT_MAX;
}
}
for(i=0;i<m;i++){
for(j=0;j<3;j++){
scanf("%d",&e[i][j]);
}
d... | 1 |
#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>
#define del(a,i) memset(a,i,sizeof(a))
#define ll long long
#define inl inline
#define il inl void
#define it inl int
#define ill inl ll
#define re register
#define ri re int
#define rl re ll
#define mid ((l+r)>>1)
#define lowbit(x) (x&(-x))
#define INF 0x3f3f3f3f
using namespace std;
template<c... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.