code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
int count = 0;
for (int i = 0; i <= 9; i++)
for (int j = 0; j <= 9; j++)
for (int k = 0; k <= 9; k++)
for (int l = 0; l <= 9; l++) {
if (i + j + k + l == n) count++;
}
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define _READ freopen("input.txt", "r", stdin);
#define _FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
void solve()
{
int s,w;
cin>>s>>w;
if(w>=s)
cou... | 0 | 27,287,560 |
#include <bits/stdc++.h>
using namespace std;
using Int = long long unsigned int;
int main(){
cin.tie(0); ios::sync_with_stdio(false);
Int n,x,ans=0; cin>>n>>x; n-=x; if(x>n)swap(n,x);
while(1){
if(!(n%x)){ans+=n*3; break;}
else {
Int a=n; ans+=n/x*3*x; n=x; x=a%x;
}
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<long long> L( N + 1 );
L[0] = 2;
L[1] = 1;
for( int i = 2; i <= N; i++ ) {
L[i] = L[i - 1] + L[i - 2];
}
long long ans = L[N];
cout << ans << endl;
} | 0 | 43,655,612 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N;
cin >> N;
vector<int64_t> vec(N);
int64_t sum = 0;
for(int i=0; i<N; i++){
cin >> vec[i];
sum += vec[i];
}
vector<int64_t> d(N);
for(int i=0; i<N-1; i++){
d[i] = vec[i+1] - vec[i];
}
d[N-1] = vec[0] - vec[N-1];
bool fl... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 10;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0) {
break;
}
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int ans = INF;
for (int i = 0; i < n ... | 0 | 100,166,209 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, init, n) for(int i = (int)(init); i < (int)(n); i++)
#define vi vector<int>
#define vl vector<long>
#define vvi vector<vector<int>>
#define vvl vector<vector<long>>
#define pint pair<int, int>
#define plong pair<long, long>
int main() {
string A;
cin... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define pb(a) push_back(a)
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<l... | 0 | 72,383,139 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#in... | #include <iostream>
#include <string>
using namespace std;
int main()
{
int a,b;
cin >> a >> b;
string s[100];
for(int i = 0; i < 100; i++){
for(int j = 0; j < 100; j++){
if(i<50) s[i].push_back('.');
else s[i].push_back('#');
}
}
int cnt = 0;
for(int i = 0; i < 50; i += 2){
if(cnt... | 0 | 97,116,600 |
#include<iostream>
using namespace std;
int main(){
int m, f, r, hasi;
char seiseki[100];
for (int i = 0; i < 100; i++){
cin >> m;
cin >> f;
cin >> r;
if (m == -1 && f == -1 && r == -1){
break;
}
if (m == -1 || f == -1){
seiseki[i] = 'F';
}
else if (m + f >= 80){
seiseki[i] = 'A';
}
else... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.e... | 0 | 82,929,610 |
#include <stdio.h>
int main(){
int angka,ratusan,puluhan,satuan;
scanf("%d", &angka);
ratusan = angka % 100;
puluhan = ratusan % 10;
satuan = puluhan;
puluhan = ratusan / 10;
ratusan = angka / 100;
if (ratusan == 7){
printf("Yes\n");
}
else if(puluhan == 7){
printf("Yes\n");
}
else if(satuan == 7){
printf("Yes\n");
... | #include <iostream>
#include <cmath>
#include <string>
#include <string.h>
#include <cstdlib>
#include <iomanip>
#include <stdio.h>
using namespace std;
int main(){
char s[201],tmp[201];
int m,h;
while(1){
scanf("%s\n",s);
if(strcmp(s,"-")==0)
return 0;
scanf("%d\n",&m);
for(int i=0;i<m;i++)... | 0 | 48,250,311 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
using namespace std;
#define intmax INT_MAX
#define lma... | 0 | 50,206,816 |
#include <iostream>
using namespace std;
int main() {
int a;int x;
cin>>x;
cin>>a;
if (x<a)
{
cout<<"0"<<endl;
}
else
{
cout<<"10"<<endl;
}
return 0;
} | #if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define ld long double
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(... | 0 | 21,240,385 |
#include <bits/stdc++.h>
#define SIS std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define lowbit(x) (x & -x)
#define PI 3.14159265358979323846264338327950L
typedef long long ll;
using namespace std;
const int MAX = 0x7ffffff;
const int N = 100005;
int t;
int n , m , h[N];
void slove()
{
int a , b;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
const int mod = 1e9 + 7;
int main(){
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
... | 0 | 65,925,432 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const int INF = 100000005;
int main() {
int n;
cin >> n;
vector<int> as(n, INF);
vector<int> bs(n - 1);
rep(i, n - 1) { cin >> bs[i]; }
for (int i = n - 2; 0 <= i; i--) {
as[i + 1] = ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
#define ll long long
const int inf = 1000000000;
int main (){
int a,b;
cin >> a >> b;
int n=b-a;
int cunt=0;
for(int i=a;i<=b;i++){
int s= i%10,t=i/10000%10;
int u= i/10%... | 0 | 75,461,980 |
#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
#d... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
using ll=long long;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl "\n"
#define ALL(x) x.begin(),x.end()
#define ALLR(x) x.rbegin(),x.rend()
#define IN... | 0 | 40,183,793 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define int long long
signed main(){
int K,A,B;cin>>K>>A>>B;
int bis=1;
if(K<=A||B-A<=2)cout<<K+1<<endl;
else{
bis=A-1;
K-=(A-1-1);
K-=3;
bis=B;
... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void p(vector<int> A){rep(i,A.size()){cout << A[i] << " ";}cout << "\n";}
int f(int x){
int cnt = 0;
while (x > 0){
x /= 10;
cnt++;
}
return cnt... | 0 | 25,797,515 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define BitRep(i, n) for (int i = 0; i < (int)(1 << n); i++)
#define All(vec) vec.begin(), vec.end()
#define Sum(vec) accumulate(vec.begin(), vec.end(), 0)
#define Sort(vec) sort(vec.begin(), vec.end... | #include <iostream>
#include <vector>
#include <string>
#include <unordered_map>
#include <math.h>
#include <algorithm>
#include <deque>
#include <climits>
using namespace std;
#define ll long long
#define ve vector
#define umap unordered_map
int main() {
int n; cin >> n;
ve<int> a(n);
for(int& i:a) cin>>i;... | 0 | 46,123,167 |
#include <iostream>
int main(){
int b,f,r,v,n;
int x[4][3][10] = {0};
std::cin >> n;
for(int a = 0;a < n;a++){
std::cin >> b >> f >> r >> v;
x[b - 1][f - 1][r - 1] = x[b - 1][f - 1][r - 1] + v;
}
for(int amatukaze = 0;amatukaze < 3;amatukaze++){
for(int kagerou = 0;kagero... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 0 | 65,365,013 |
#include<iostream>
using namespace std;
int printMulti(int i, int j){
printf("%dx%d=%d\n", i, j, i*j);
}
int main(){
for (int k=1; k<10; k++){
for (int l=1; l<10; l++){
printMulti(k, l);
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int X, N;
cin >> X >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) cin >> p.at(i);
for (int i = 0; i <= 50; i++) {
bool flag1 = true;
bool flag2 = true;
for (int j = 0; j < N; j++) {
if (X - i == p.at(j)) {
flag1 = fa... | 0 | 95,692,312 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < int(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;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T &a, const T &b){ if(... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1e9+7;
const int INF=1e9;
const ll LINF=(ll)1e18;
int main(){
int n;
cin>>n;
int a[n],b[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
cin>>b[i];
}
ll gr=0,le=0;
int ans=0;
... | 0 | 12,594,744 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for (ll i = (a); i < (b); i++)
#define REP(i,n) rep(i,0,n)
#define mod (1000000007)
void solve()
{
ll n;cin>>n;
string s;cin>>s;
map<int,int>g;
REP(i,n)g[s[i]]++;
ll ans=1;
REP(i,26)(ans*=g['a'+i]+1)%=mod;
... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<map>
#define ll long long
using namespace std;
int n;
int a[300000];
int MAXN = 2147483647;
map<ll,int> mp;
ll len=0;
void init()
{
scanf("%d",&n);
for (int i=0; i<n; ++i)
scanf("%d",&a[i]);
}
void clearLen(int i)
{
f... | 0 | 70,508,114 |
#include<cstdio>
#include<algorithm>
#include<iterator>
#include<vector>
using namespace std;
int main(void) {
while(1) {
int m,nmin,nmax;
vector<int> p;
scanf("%d%d%d",&m,&nmin,&nmax);
if(!m) break;
for(int i=0; i<m; i++) {
int p_;
scanf("%d",&p_);
... | #include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#include<cmath>
#define REP(i,n) for (int i = 0; (i) < (n); ++ (i))
#define FOR(i,n) for (int i = 1; (i) <= (n); ++ (i))
#define dump(x) cout << #x << " = " << (x) ... | 0 | 34,697,201 |
#include <bits/stdc++.h>
using namespace std;
char c[6];
int main() {
scanf("%s", c);
if (c[2] == c[3] && c[4] == c[5])
printf("Yes\n");
else
printf("No\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
string text, ans = "";
cin >> text;
for (char t : text)
{
if (t == '0')
{
ans += '0';
}
else if (t == '1')
{
ans += '1';
}
else if (t == 'B')
{
i... | 0 | 55,903,596 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
int main(){
ll n;
string s;
cin >> n;
cin >> s;
int len = s.size();
ll r = 0;
ll g = 0;
ll b = 0;
for ( int i = 0; i < len; i++ ){
if ( s[i] == 'R' ) r++;
if ( s[i] == 'G' ) g++;
if ( s... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h,w,m;
cin>>h>>w>>m;
int r[h+1]={0},c[w+1]={0};
set<pair<int,int>>p;
while(m--){
int a,b;
cin>>a>>b;
p.insert({a,b});
r[a]++;
c[b]++;
}
int x=1,y=1;
for(int i=1;i<=h;i++){
if(r[i]>r[x])
x=i;
}
for(int i=1;i<=w;i++){
... | 0 | 16,945,209 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a... | #include<iostream>
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int n, m, a[2009], b[2009];
ll dp[2009][2009], mod=1e9+7;
int main()
{
IO;
cin>>n>>m;
for(int i=1; i<=n; i++)
cin>>a[i];
... | 0 | 89,456,398 |
#include <bits/stdc++.h>
using namespace std;
long long arr[100005],bas[65];
bool b[65];
int main()
{
int n;
scanf("%d",&n);
for (int i=0;i<n;i++)
{
scanf("%lld",&arr[i]);
for (int j=60;j>=0;j--)
{
if (arr[i]&(1LL<<j))
b[j]^=1;
}
}
long long ans=0;
for (int i=0;i<=60;i++)
{
if (b[i])
{
ans+... | #include <bits/stdc++.h>
typedef uint64_t u64;
typedef int64_t i64;
typedef uint32_t u32;
typedef int32_t i32;
#define MAX_NUM (1000000007)
#define PI 3.14159265358979323846
using namespace std;
template <typename T>
static inline void ArrayInput(vector<T>& A) {
for (auto itr = A.begin(); itr < A.end(); ++itr) cin >>... | 0 | 3,482,142 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <s... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
typedef std::string str;
#define sei set<int>
#define sell set<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#de... | 0 | 48,009,115 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long int ll;
typedef pair<int,int> P;
const int INF = 1e9+7;
int main(){
int a,b;
cin >> a >> b;
if(a>8||b>8){
cout << ":(";
}else{
cout << "Yay!";
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T> using v2 = vector<vector<T>>;
template<typename T> inline v2<T> init(int r, int c, const T& t){ return v2<T>(r, vector<T>(c, t)); }
#define F first
#define S second
int n, m;
vector<int> a;
ll lcm(int a, int b){
return (ll)a*b... | 0 | 29,560,953 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define loop(i, a, n) for(int i = (a); i < (n); i++)
#ifdef _DEBUG
#define dd(x) cout << #x << " : " << x << endl
#else
#define dd(x)
#endif
using namespace std;
using ll = int64_t;
int main(){
int n; cin >> n;
ll max_a = -1;
ll ans = 0... | #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 100000000... | 0 | 88,802,341 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m, ans = 0, a;
cin >> n >> m;
for(int i = 1;i <= m;i++){
cin >> a;
ans += a;
}
if(n < ans){
cout << -1;
}else{cout << n - ans;}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ll long long
#define P pair<int,int>
#define fast_io ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
const int MOD = 1000000007;
const int INF = 2002002002;
const ll LLINF = 9009009009009009009;
using namespace std;
int main() {
... | 0 | 39,869,026 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 1; i <= n/2; ++i) {
if (n-i > n/2) {
count++;
}
}
cout << count;
} | #include <iostream>
#include <vector>
#include <bitset>
#include <algorithm>
#include <climits>
using namespace std;
using ll = long long;
int n, k;
ll minValue = LLONG_MAX;
vector<ll> b;
void Calc(int index, int kCount, ll prevHeight, ll value) {
if(kCount == k) {
minValue = min(value, minValue);
r... | 0 | 675,359 |
#include <iostream>
using namespace std;
int n, x;
int loop(int cnt, int sum, int plus) {
if (cnt == 3) {
if (sum == x) {
return 1;
} else {
return 0;
}
}
if (plus > n) {
return 0;
}
return loop(cnt + 1, sum + plus, plus + 1) + loop(cnt, sum, plus + 1);
}
int main()
{
while (cin >> n >> x && (n != 0... | #include <iostream>
using namespace std;
int main()
{
long long k;
scanf("%lld",&k);
printf("50\n");
for (int i=0;i<50;i++)
printf("%lld ",i+k/50+(i>=50-k%50));
} | 0 | 68,379,352 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
int n, x, t;
cin>>n>>x>>t;
int val=0, time=0;
while(val<n){
val += x;
time += t;
}
cout<<time;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
int n=0, max=0;
cin >> s;
for(int i=0; i<3; ++i)
if(s[i] == 'R') {
n++;
max = n;
} else {
n = 0;
}
if(n>max)
cout << n;
else
cout << max;
... | 0 | 17,325,956 |
#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;
void read();
template<typename First, typename... Rest> void read(Firs... | #include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
struct Node{
int k;
int* c;
int p;
};
int main(void){
int n,i,j,id,k,depth;
Node node[100000];
cin>>n;
for(i=0;i<n;i++){
node[i].p=-1;
}
for(i=0;i<n;i++){
cin>>id;
cin>>k;
no... | 0 | 38,815,258 |
#include<stdio.h>
int main(){
long a,b,c,d;
scanf("%ld %ld",&a,&b);
if(1<=a && a<=1000000000 && 1<=b && b<=1000000000){
c = a / b;
d = a % b;
double f = a;
double g = b;
double e = f / g;
printf("%ld %ld %.5lf\n",c,d,e);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
struct edge{
int to,weight;
edge(int to,int weight):to(to),weight(weight){}
};
using Graph = vector<vector<int>> ;
using GraphEdge = vector<... | 0 | 40,919,158 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
vector<ll> sum(500001);
ll sumo=0;
rep(i,500001){
sumo+=i;
sum.at(i)=sumo;
}
string ... | #include <iostream>
#include <vector>
int V, E;
std::vector<std::vector<int>> link_from;
std::vector<int> flag;
void search(int idx) {
if (flag[idx] != 0) {
return;
}
for (auto i : link_from[idx]) {
search(i);
}
flag[idx] = 1;
std::cout << idx << std::endl;
}
int main() {
std... | 0 | 71,170,447 |
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_map>
#include<string>
#include<set>
#include<queue>
#include<deque>
#include<iomanip>
using namespace std;
#define Mohamed_Gad fast()
#define ll long long
#define ull unsigned long long
#define all(v) v.begin(),v.end()
#define endl "\n"
#define ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N;
scanf("%d", &N);
vector<ll> x(N+3);
for (int i = 1; i <= N; i++) scanf("%lld", &x[i]);
ll L;
scanf("%lld", &L);
x[N+1] = x[N]+L;
x[N+2] = x[N]+2*L;
vector<vector<int>> db(N+2, vector<int>(20, 0));
... | 0 | 65,474,744 |
#include <iostream>
#include <string>
using std::string;
using std::cin;
using std::cout;
using std::endl;
string shuffle(string s, int n) {
string left;
string right;
string s1;
left = s.substr(0, n);
right = s.substr(n, s.size());
s1 = right + left;
return s1;
}
int main() {
string a;
int length;
int num;... | #include <bits/stdc++.h>
#include <boost/foreach.hpp>
using namespace std;
#define pi 2*asin(1.0)
#define MAX 10000000
#define MOD 1000000007
#define _GLIBCXX_DEBUG
vector<long> fac(MAX);
vector<long> finv(MAX);
vector<long> inv(MAX);
vector<long> Primelist;
void Prinit(){
long PR=10000001;
vector<long> P(PR,0);
for(lo... | 0 | 94,754,853 |
#include<iostream>
using namespace std;
int main(){
int n,al[26] = {},i;long long ans = 1;char s;
while(cin >> s) al[s-'a']++;
for(i=0;i<26;i++) ans = (ans*(al[i]+1))%1000000007;
ans--;
if(ans<0) ans += 1000000007;
cout << ans << endl;
} | #include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ub upper_bound
#define lb lower_bound
#define isrt insert
#define clr clear
#define rsz resize
#define ff first
#define ss ... | 0 | 31,228,853 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int K, A, B;
cin >> K >> A >> B;
if (A <= (B / K) * K)
cout << "OK" << endl;
else
cout << "NG" << endl;
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define REP(i,a) for (int i = 0;i < (a);++i)
#define FOR(i,a,b) for (int i = (a);i < (b); ++i)
#define FORR(i,a,b) for (int i = (a);i >= (b); --i)
#define ALL(obj) (obj).begin(),(obj).end... | 0 | 95,610,501 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#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(int i=0;i<n;++i)
... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define f first
#define s second
using namespace std;
int a[100001];
int n, k;
int main(){
cin >> n >> k;
for(int i = 1; i <= n; i++)cin >> a[i];
int cnt = 0;
for(int i = 1; i <= n; i++){
int j;
for(j = i; j <= min(n, i+k-1) ; j++)... | 0 | 76,566,572 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
string a = "keyence", b = "ecneyek";
int main() {
string s; cin >> s;
string t = s; reverse(t.begin(), t.end());
int p = 0, q = 0;
while (p<7&&s[p]==a[p... | #include <bits/stdc++.h>
int main(){
int N, K;
std::cin >> N >> K;
std::vector< int > X(N);
std::vector< int > Y(N);
for(int i=0; i<N; i++){
std::cin >> X[i] >> Y[i];
}
long long min = 4e18;
for(int x1=0; x1<N; x1++){
for(int x2=x1+1; x2<N; x2++){
for(int y1=0... | 0 | 92,240,026 |
#include<iostream>
#include<vector>
#include<cmath>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
for(int i=0;i<n;i++)
{
int element;
cin>>element;
}
cout<<ceil(((n-1)*1.0)/(--k));
} | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> island(n);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
island[a].push_back(b);
... | 0 | 10,383,545 |
#include <cstdio>
#include <iostream>
#include <set>
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define fi first
#define se second
using namespace std;
inline char nc()
{
static char buf[100000],*l=buf,*r=buf;
return l==r&&(r=(l=buf)+fread(buf,1,100000,stdin),l==r)?EOF:*l++;
}
template<class T> void read(T ... | #include <bits/stdc++.h>
using namespace std;
struct BIT{
vector<int> data;
void init(int n){
data.assign(n+1, 0);
}
void add(int i, int x){
while(i <= data.size()){
data[i] += x;
i += (i & -i);
}
}
int sum(int i){
int s = 0;
while(... | 0 | 97,974,144 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0 ,-1};
signed main(){
int N;
cin >> N;
vector<vector<P>>ki(N);
for(int i = 0; i < N-1; i++) {
int a,b,c;
cin >> a ... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define USE_LLONG_AS_INT
#ifdef USE_LLONG_AS_INT
#define int long long
#define inf (1ll<<60)
#else
#define inf (1<<30)
#endif
#define rep(i,n) for(int i=0;i<(n);i++)
#define Rep(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a,b) for(int i=(a);i<=(b);i++)
#define rev(i,... | 0 | 33,258,558 |
#include <bits/stdc++.h>
#define int long long
#define rng(i, l, r) for (size_t i = (l); i < (r); ++i)
#define rep(i, n) rng(i, 0, n)
#define gnr(i, l, r) for (size_t i = (r)-1; i >= (l); i--)
#define per(i, b) gnr(i, 0, b)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
... | #include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(long long n);
string upper(string str);
string lower(string str);
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).re... | 0 | 76,475,653 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int N;
cin >> N;
long ans = 0;
long cur = 0;
int t = -1;
int a[N];
for(int i=0; i<N; i++){
cin >> a[i];
while((cur + a[i]) != (cur ^ a[i])){
t++;
cur -= a[t];
}
a... | bool DBG = false;
#include<bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
using bint = boost::multiprecision::cpp_int;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i... | 0 | 87,632,610 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cerr << "[(" << __LINE__ << ") " << (#x) << "]: " << x << endl;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i=0; i<k; i++) {
int x, y;
ci... | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | 0 | 14,393,185 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
#define int ll
main(){
int n;
string s;
int k;
cin >> n >> s >> k;
for(int i=0;i<n;i++){
if(s[i]!=s[k-1]) s[i] = '*';
}
cout << s << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <cmath>
#include <numeric>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define For(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
int fact(int n) {
if (n == 0) return 1;
else ... | 0 | 12,574,248 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
#include <string.h>
#include <set>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L" <... | #include<bits/stdc++.h>
using namespace std;
int n,a[100001],sum=0;
bool cmp(int x,int y){
return x<y;
}
int main(){
scanf("%d",&n);
for (int i=1;i<=n;i++)
scanf("%d",&a[i]);
sort(a+1,a+1+n,cmp);
for(int i=2;i<=n;i++)
if(a[i]==a[i-1]) sum++;
if(sum%2==1) sum++;
printf("%d\n",n-sum);
return 0;
} | 0 | 14,833,371 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
int n;
cin >> n;
vector<string> s(n);
rep(i,n){
string t;
cin >> t;
sort(t.begin(),t.end());
s[i] = t;
}
map<st... | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define mp ... | 0 | 13,833,737 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll N;
int findDigit(ll x, ll y)
{
ll s, t;
s = log10(x) + 1;
t = log10(y) + 1;
return max(s, t);
}
int main()
{
cin >> N;
ll s = sqrt(N);
ll res = N;
for (int i = 1; i <= s; i++)
{
if (N % i == 0)
{
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;
int g[101][101];
int main(){
int n,u,k,v;
cin>>n;
rep(i,n){
cin>>u>>k;
--u;
rep(j,k){
... | 0 | 66,593,525 |
#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<int,int>;
int main() {
int n, d, x;
cin >> n >> d >> x;
int sum = 0;
rep(i, n) {
int a;
cin >> a;
int cnt = 0;
int ans = 0;
while(ans <= d) {
cnt++;
... | #include<iostream>
#include<vector>
#include <cmath>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#define rep(i,n) for (int i= 0;i<(n);++i)
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main()
{
string s ;
cin >> s ;
ll a[4] ;
for(ll i = 0 ; i < 4 ; i++... | 0 | 44,133,379 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <stack>
#include <set>
#include <queue>
#include <algorithm>
#include <deque>
#include <map>
#include <cmath>
#include <type_traits>
using namespace std;
#define INF 1e18
#define int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int gcd(int a, int b) {
if(a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
int main() {
int N;
cin >> N;
vector<int> A(N);
for(int i=0; i<N; i++) cin >> A[i];
i... | 0 | 70,773,836 |
#include<iostream>
using namespace std;
int main(){
int tri[1000][3];
int num = 0;
cin >> num;
for(int i = 0;i<num;i++)
cin >> tri[i][0] >> tri[i][1] >> tri[i][2];
long int a,b,c=0;
for(int i = 0;i<num;i++){
a = tri[i][0]*tri[i][0];
b = tri[i][1]*tri[i][1];
c = tri[i][2]*tri[i][2];
if(a == b+c || b == a+c || c == a + b... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,sum = 0;
cin >> n;
vector<int> data(n);
for (int i = 0; i < n; i++){
cin >> data.at(i);
}
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
if(i == j)break;
sum += data.at(i) * data.a... | 0 | 68,263,460 |
#include <iostream>
using namespace std;
int main() {
int X, A, B;
cin >> X >> A >> B;
const char* result = "dangerous";
if (B <= A) {
result = "delicious";
} else if (B - A <= X) {
result = "safe";
}
cout << result << endl;
return 0;
} | #include <bits/stdc++.h>
#include <vector>
#include <queue>
using namespace std;
int main(){
long long X;
cin >> X;
int target = X % 100;
int max_count = X / 100;
int max_count_5 = min({target / 5, max_count});
int max_count_4 = min({target / 4, max_count});
int max_count_3 = min({target / 3... | 0 | 68,179,008 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string S, T;
cin >> S >> T;
int ans = 0;
rep(i,3) {
if (S... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vec vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define inf ... | 0 | 68,971,270 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int X,Y,x,c;
cin >> X >> Y;
c=Y/2;
x=X+c;
cout << x << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N, a;
cin >> N;
ll ans = 0, h = 0;
for ( int i = 0; i < N; i++ ) {
cin >> a;
if ( a < h+1 ) continue;
if ( a == h+1 ) {
h++;
continue;
}
ans += (a-1) / (h+1... | 0 | 29,386,385 |
#include<bits/stdc++.h>
using namespace std;
int main ()
{
string s,s0,s1,ans="~";
cin>>s>>s1;
s0=s;
if(s.size()<s1.size())
{
cout<<"UNRESTORABLE";
return 0;
}
for(int t=s.size()-s1.size();t>=0;t--)
{
bool ok=1;
for(int i=t;i<t+s1.size();i++)
{
if(s[i]==s1[i-t]||s[i]=='?')
{
... | #include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <map>
#include <queue>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
int main() {
int n;
cin >> n;
string s, t;
cin >> s >> t;
string a... | 0 | 88,848,193 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
#define fore(i,a,b) for(ll i=(ll)(a);i<=(ll)(b);++i)
#define rep(i,n) fore(i,0,(n)-1)
#define rfore(i,a,b) for(ll i=(ll)(b);i>=(ll)(a);--i)
#define rrep(i,n) ... | #include <cstdio>
void printArray(int A[], int N) {
for (int i = 0; i < N; i++) {
if (i != N-1) {
printf("%d ", A[i]);
} else {
printf("%d", A[i]);
}
}
printf("\n");
}
void bubbleSort(int A[], int N) {
int swappedCount = 0;
for (int i = 0; i < N-1; i++... | 0 | 89,732,004 |
#include<cstdio>
int main(){int m,n;for(m=1;m<=9;++m)for(n=1;n<=9;++n)printf("%dx%d=%d\n",m,n,m*n);} | #include <cstdio>
#include <cstdio>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <string.h>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
const int N = 200007;
const int M = 15005;
const int offset = 7500;
const int INF = 0x3f3f3f3f;
const int MOD = 1000000007;
con... | 0 | 97,312,313 |
#include<stdio.h>
#include<stdlib.h>
int main(void){
int a,b;
double c;
scanf("%d",&a);
scanf("%d",&b);
c = (double)a/b;
printf("%d %d %f",a/b,a%b,c);
return 0;} | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#... | 0 | 32,169,118 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N);
int sum = 0;
rep(i, N) {
cin >> A.at(i);
sum += A.at(i);
}
sort(A.begin(), A.end());
if (A.at(N - ... | #pragma GCC optimize("O3")
#pragma GCC optimize("avx2")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <tuple>
#include <math.h>
#include <set>
#include <stack>
#include <bitset>
#include <map>
#include <queue>
#include <ra... | 0 | 8,641,242 |
#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<int, int>;
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 (b<a) {a=b; return 1;} return 0;}
int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int H,W,K;
cin>>H>>W>>K;
vector<vector<char>> c(H,vector<char> (W));
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
cin>>c.at(i).at(j);
}
}
vector<vector<char>> d(H,vector<char> (W));
for... | 0 | 8,343,732 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db long double
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
void dout() { cerr << '\n'; }
template <typename Head, typename... | #include <bits/stdc++.h>
using namespace std;
const int maxn=112345;
typedef pair<int,int> pii;
int n,m,l,r,x,d[maxn],vis[maxn];
vector<pii> G[maxn];
bool dfs(int u,int dep) {
vis[u]=1;
d[u]=dep;
for (int i=0;i<(int)G[u].size();++i) {
int v=G[u][i].first,w=G[u][i].second;
if (vis[v]&&d[u]+w!... | 0 | 25,957,417 |
#include <bits/stdc++.h>
using namespace std;
int mcxi_to_int(string s);
string int_to_mcxi(int n);
int main()
{
int n;
scanf("%d", &n);
while (n--){
string a, b;
cin >> a >> b;
int result = mcxi_to_int(a) + mcxi_to_int(b);
cout << int_to_mcxi(result) << endl;
}
return (0);
}
int mcxi_to_int(string s)
{
i... | #include<iostream>
using namespace std;
int main(){
long long n,i,array[10000],max,min,total=0;
cin >> n;
for(i = 0; i < n; i++){
cin >> array[i];
}
max = array[0];
min = array[0];
for(i = 0; i < n; i++){
if(max < array[i]) max = array[i];
if(min > array[i]) min = arr... | 0 | 6,163,350 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int ui;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef short int si;
typedef unsigned short int usi;
typedef pair <int, int> pii;
#define CASE false
#define TEST false
#define BUFFER true
#define TIME false
#define DEBUG true
#defin... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
using namespace std;
typedef long long lint;
int dp[1111][1111];
void chmin(int& x, const int y) {
x = min(x, y);
}
int main() {
string X, Y;
cin >> X >> Y;
const int N = X.size(), M = Y.size();
const int INF... | 0 | 73,400,743 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const ll INF = 1LL<<60;
int main(){
int x, y;
cin >> x >> y;
int turu,kame;
turu = x * 2;
kame = x * 4;
if(y%2==1)
cout << "No" << endl;
else{
if(y<=kame &... | #include <bits/stdc++.h>
#include <atcoder/dsu>
using namespace std;
#define rep(i,x,y) for(ll i=(x);i<(y);i++)
#define rrep(i,x,y) for(ll i=(ll)(y)-1;i>=(x);i--)
#define all(x) (x).begin(),(x).end()
#define itrout(x) for(int i=0;i<x.size();i++) {cout << x[i] << (i==x.size()-1 ? "\n" : " ");}
#ifdef LOCAL
#define debug... | 0 | 25,439,012 |
#include<bits/stdc++.h>
using namespace std;
#define pai acos(-1)
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mp make_pair
#define pll pair<ll,ll>
#... | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | 0 | 85,592,028 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <numeric>
#define... | #include <iostream>
using namespace std;
int main(void){
for(int i = 0 ; i < 301 ; i++){
int h = 0;
int w = 0;
cin >> h >> w;
if( (h == 0) && (w == 0) ){
break;
}
for(int j = 0 ; j < h ; j++){
for(int k = 0; k < w ; k++){
cout <... | 0 | 79,640,018 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll m,n;
cin>>n>>m;
ll left[m];
ll right[m];
for(int i=0;i<m;i++)
{
cin>>left[i]>>right[i];
}
ll lo =left[0],hi=right[0];
for(int i=1;i<m;i++)
{
if(hi<left[i]||lo>right[i])
{
cout<<"0\n";
return 0;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, K;
cin >> N >> K;
map<ll, ll> a;
for (int i = 0; i < N; i++) {
ll tmp_a, tmp_b;
cin >> tmp_a >> tmp_b;
a[tmp_a] += tmp_b;
}
for (auto num : a) {
K -= num.second;
if (K <... | 0 | 79,689,442 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int N, K; cin >> N >> K;
vector<ll> a(N);
for (int i = 0; i < N; ++i) { cin >> a[i]; }
sort(a.begin(), a.end());
int low = -1, high = N;
int res;
while (high - low != 1) {
int mid = (high + low) / 2;
vector<bool> dp(K, false);
... | #include<iostream>
#include<stdio.h>
using namespace std;
int triangle(int a,int b,int c){
a = a*a;
b = b*b;
c = c*c;
if(a == (b+c)) return 0;
else if(b == (a+c)) return 0;
else if(c == (a+b)) return 0;
else return 1;
}
int main(){
int n;
int a,b,c;
int i = 0;
... | 0 | 1,700,792 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C,K;
cin >> A >> B >> C>> K;
int counter=0;
while(B<=A){
counter++;
B*=2;
}
while(C<=B){
counter++;
C*=2;
}
if(counter<=K){
cout << "Yes";
}else{
cout << "No";
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll table[45];
bool flg[45];
ll fib(int n){
if(n==0)return 1;
else if(n==1)return 1;
else{
if(flg[n])return table[n];
else{
flg[n]=true;
return table[n]=fib(n-1)+fib(n-2);
}
}
}
int main(){... | 0 | 82,695,716 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, a, b, ans = 0;
cin >> n >> m;
vector<vector<bool>> v(n, vector<bool>(n, false));
for (int i = 0; i < m; i++) {
cin >> a >> b;
v.at(a - 1).at(b - 1) = true;
v.at(b - 1).at(a - 1) = true;
}
vector<int> cas... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 0 | 80,819,860 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(long long i = a; i < b; i++)
#define dump(a) for(auto x : a) cout << x << " "; cout << "\n"
#define print(a) cout << a << "\n"
#define debug(x) std::cerr<<#x<<": "<<x<<"\n"
#define debug2(x,y) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<"\n"
#define debug3(x,y,z) std::cerr... | #include<bits/stdc++.h>
using namespace std;
struct xy{
int x;int y;}node,top;
const int dx[2] = {-1,1};
int main(){
int n,m;
cin >> n >> m;
vector<string>s(n);
queue<xy>q;
int cur = 0;
for(int i = 0;i<n;i++) cin >> s[i];
for(int i = 0;i<n;i++)
for(int j = 0;j<m;j++){
if(s[i][j]=='#'){node.x = i;node.y = j;q.push(n... | 0 | 82,076,645 |
#include<bits/stdc++.h>
using namespace std;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) ((a) / gcd(a,b)) * (b)
#define all(x) x.begin(),x.end()
#define ll long long
#define ull unsigned long long
#define VI vector<int>
#define VLL vector<ll>
#define VS vector<string>
#define MPII map<int, int>
#define SET set<int>
#... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
int C;
if (i % 2 == 0){
if (A % 2 == 1){
A--;
}
A = A/2;
B += A;
}
else {
if (B % 2 == 1){
B--;
}
B = B/2;
A += B;... | 0 | 87,808,854 |
#include <bits/stdc++.h>
using namespace std;
int a[1<<20][2];
int ans[1<<20];
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n; cin >> n;
for (int i = 0; i < 1 << n; i++) {
cin >> a[i][0];
a[i][1] = -1;
}
auto relax = [&](int &x, int &y, int x1, int y1) {
if (x < x1) {
y = x;
x = ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, k, d, ans = 0;
cin >> n >> k ;
vector<int> vec(n, 0);
for (int i = 0; i < k; i++){
cin >> d;
vector<int> sna(d, 0);
for (int j = 0; j < d; j++) {
cin >> sna.at(j);
vec.at(sna.at(j)-1)++;
... | 0 | 60,152,382 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n, k;
cin >> n >> k;
ll x[n], y[n], sx[n], sy[n];
for(int i=0; i<n; i++){
cin >> x[i] >> y[i];
sx[i] = x[i];
sy[i] = y[i];
}
sort(sx, sx+n);
sort(sy, sy+n);
ll ans = (sx[n-1] - sx[0]) * (sy[n-1] - sy[0]);
f... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <set>
#include <algorithm>
#include <iomanip>
typedef long long ll;
const ll MOD = 998244353;
const long long INF = 1LL<<60;
const double PI=3.14159265358979323846;
const int NMAX=100005;
using namespace st... | 0 | 93,423,540 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <iomanip>
using namespace std;
int main(){
int A, B;
cin >> A >> B;
int ans = 0;
for(int i = A; i <= B; i++){
string S = to_string(i);
if(S[0] == S[4] && S[1] == S[3]) ans++;
}
cout << ans << end... | #include<bits/stdc++.h>
using namespace std;
#define LL long long int
#define MAXK 200000
int main() {
int N, K, cnt[MAXK + 3];
cin >> N >> K;
memset(cnt, 0, sizeof(cnt));
for (int i = 1; i <= N; i++)
cnt[i%K] += 1;
LL answer = 0;
for (int i = 0; i < K; i++) {
if ((2 * i)%K == 0)... | 0 | 77,709,399 |
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define ld long double
#define vi vector<int>
#define vl vector<ll>
#define v2i vector<vector<int>>
#define v2l vector<vector<ll>>
#define ppi pair<int,int>
#define ppl pair<ll,ll>
#de... | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
const double EPS = 1e-9;
#define INF (1LL<<60)
#define fs first
#define sc second
#define pb push_back
#define int long long
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i = (b-1);i>=a;i--)
#define REP(i,n) FOR(i,0,n)
#defi... | 0 | 44,917,964 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h_1,m_1,h_2,m_2,k;
cin>>h_1>>m_1>>h_2>>m_2>>k;
int time;
time = (h_2-h_1)*60+(m_2-m_1);
cout<<time-k<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
typedef long long ll;
int main(){
ll n,d,a;cin>>n>>d>>a;
queue<pair<ll,ll> > q;
ll cn=0;
vector<pair<ll,ll> > e(n);
rep(i,0,n)cin>>e[i].first>>e[i].second;
sort(e.begin(),e.end());
ll dm=0;
re... | 0 | 5,029,976 |
#include<stdio.h>
int main()
{
char n;
scanf("%c",&n);
printf("%c\n",n+1);
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int x,n;
cin>>x>>n;
vector<int> p(n);
vector<int> y(102,1);
for(int i=0;i<n;i++){
cin>>p[i];
y[p[i]]=0;
}
int a=0;
for(int i=x;i<102;i++){
if(y[i]){
a=i;
break;
}
}
int b=0;
for(int i=x;i>=0;i--){
if(y[i]){
... | 0 | 69,175,762 |
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
int main(){
int N, M; cin >> N >> M;
vector<ll> dp(N... | #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 dp[101][4][2];
int m... | 0 | 34,456,982 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define ll long long
#define ld long double
#define MOD 1000000007
#define nl cout << bl
#define rt ll Q[100005] = {0}
#define mp make_pair
#define test() \
ull t; \
cin >> t; \
while (t--)
#define pb pu... | #include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin >> c;
vector<char> A = {'a','b','c','d','e','f','g','h','i',
'j','k','l','m','n','o','p','q','r',
's','t','u','v','w','x','y','z'};
for(int i = 0; i < 26; i++) {
if(c == A.at(i)) {
cout << A.... | 0 | 61,572,760 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Y... | #include <iostream>
#include <string>
using namespace std;
int H[2000005];
int cnt=1;
void pq_insert(int num){
H[cnt]=num;
int i=cnt;
while(i!=1&&H[i]>H[i/2]){
swap(H[i],H[i/2]);
i=i/2;
}
cnt++;
}
void extract(){
cout<<H[1]<<endl;
H[1]=H[--cnt];
int i=1;
int max_i;
... | 0 | 68,104,018 |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) FOR(i,0,(n))
typedef vector<int> vec;
class CTraveling {
public:
void solve(std::istream& in, std::ostream& out) {
int n;
in >> n;
vector<int> t(n);
vec x(n), y(n)... | #include <bits/stdc++.h>
#include <algorithm>
#include<math.h>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
int main (){
int n, m ;
cin >> n >> m ;
vector<vector<int>> r... | 0 | 2,666,534 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define N 666666
int arr[N];
vector<int> v1,v0;
int a[N],b[N];
map<int,int> mp;
signed main(){
int n,ans=0;
cin>>n;
for(int i=1;i<=n;i++){
scanf("%lld",&a[i]);
b[i]=a[i];
}
sort(b+1,b+1+n);
for(int i=1;i<=n;i++) mp[b[i]]=i;
for(int i=1;i<=n;i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
typedef pair<int,int> Pi;
const... | 0 | 5,787,443 |
#include <algorithm>
#include <iostream>
using namespace std;
const int MOD = 2019;
int main() {
int L, R, m{MOD};
cin >> L >> R;
R = min(R - L, MOD);
L %= MOD;
if (L+R>=MOD) {
cout << 0 << endl;
return 0;
}
for (int i = 0; i < R; ++i)
for (int j = i; j < R; ++j) m = min(m, (L + i) * (L + j + ... | #include <vector>
#include <set>
#include <map>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <iomanip>
using ll = long long;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define outD(fpv) cout << setprecision(... | 0 | 51,251,692 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int x, n;
cin >> x >> n;
if (n == 0) {
cout << x;
return 0;
}
vector<bool> p(100,0);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
p[a-1] = true;
}... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading zero str.erase(0, min(str.find_first_not_of('0'), str.size()-1));
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>... | 0 | 37,569,935 |
#include<bits/stdc++.h>
using namespace std;
using p=pair<int,int>;
#define int long long
#define rep(i,N) for(int i=0;i<N;i++)
signed main(){
int A,B,C,D;
cin>>A>>B>>C>>D;
int ans=min(A,B)+min(C,D);
cout<<ans<<endl;
return 0;
} | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int N; cin >> N;
for (int i = 0; i <= 30; i++) {
for (int j = 0; j <= 30; j++) {
if (i * 4 + j * 7 == N) {
printf("%s\n", "Yes");
return 0;
... | 0 | 34,267,824 |
#include <iostream>
#include <string>
using namespace std;
int const NMAX = 1e5;
int v[1 + NMAX];
int main() {
int n, pos = 1, p, ans = 0;
string A, B;
cin >> A >> B;
if(A.size() < B.size()){
cout << "LESS";
}else if(A.size() > B.size()){
cout << "GREATER";
}else{
if(A < B){
cout << "LESS"... | #include<bits/stdc++.h>
using namespace std;
using ll=long long int;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
string s;
cin>>s;
vector<char>mihon1(s.size());
vector<char>mihon2(s.size());
int now=0;
for(int i=0;i<s.size();i++){
if(now==0){
mihon1[i]='0';
... | 0 | 98,365,336 |
#include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | #include <bits/stdc++.h>
#define uni(x) (x).resize(unique(ALL(x)) - (x).begin())
#define fprint(v) for(auto x : v) cout << x << ' '
#define ALL(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846
#define MP(x, y) make_pair(x, y)
#define SZ(x) int((x).size())
#define PB(x) pus... | 0 | 4,160,501 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 2147483647;
int v[100000];
int main() {
int n;
cin >> n;
for (int i=0; i<n; i++) {
cin >> v[i];
}
map<int, int> e_cnt, o_cnt;
int even_n = 0;
for (int i=0; i<n; i+=2) {
e_cnt[v[i]]++;
even_n++;
}
int odd_n = 0;
for (int ... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
string s;
cin >> s;
int x,y;
cin >> x >> y;
int sx = 0;
int sid = 0;
for(int i = 0;i < s.size();i++){
if(s[i] == 'T')break;
sx++;
sid = i;
}
vector<int> lr;
vector<int> ud;
int sum_lr = sx;
int sum_ud = 0;
bool n... | 0 | 40,537,059 |
#include<iostream>
#include<algorithm>
using namespace std;
const int N=100005;
struct node
{
int val,id;
bool operator<(const node& rhs)const
{
if(val==rhs.val)
return id<rhs.id;
return val>rhs.val;
}
}a[N];
long long ans[N];
int main()
{
ios::sync_with_stdio(false);
int n;
cin>>n;
for(int i=1;i<=n;i++)... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <complex>
using namespace std;
#define Rep(b, e, i) for(int i = b; i <= e; i++)
#define Repr(e, b, i) for(int i = e; i >= b; i--)
#define rep(n, i) Rep(0, n-1, i)
#define repr(n, i) Repr(n-1, 0, i)
#define all(v) (v... | 0 | 42,424,857 |
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <array>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++... | #include <bits/stdc++.h>
#define F first
#define S second
#define int long long
#define inf 1000000000
using namespace std;
signed main(){
int x, y, a, b, c;
cin >> x >> y >> a >> b >> c;
vector<int> p(a), q(b), r(c);
for (int i = 0; i < a; i++){
cin >> p[i];
}
for (int i = 0; i < b; i++... | 0 | 64,539,098 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N,A,B;
cin >> N >> A >>B;
if((N+A-1)/A > B || B>(N-A)+1){
cout << -1 << endl;
return 0;
}
ll loop = 0;
while(N>0){
ll maxB = loop + N;
if(maxB < B +A){
ll exceeded = maxB... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 300005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define F first
#define S second
#define all(x) x... | 0 | 61,084,590 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR( i, m, n ) for( int (i) = (m); (i) < (n); (i)++ )
#define REP( i, n ) FOR( i, 0, n )
#define REPR( i, m ) for( int (i) = (m); (i) >= 0; (i)-- )
#define REPONE( i, n ) FOR( i, 1, n + 1 )
#define ALL( a ) (a).begin... | #include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int N, Num[100005], Max, Min = 987654321, result;
int abs(int num)
{
return num > 0 ? num : -num;
}
int main()
{
scanf("%d", &N);
for(int i = 0; i < N; i++)
{
scanf("%d", &Num[i]);
Max = max(Max, Num[i]);
... | 0 | 25,808,320 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N;
cin >> N;
vector<string> S(N);
for(int i=0;i<N;i++){
cin >> S[i];
}
ll ans =0;
for(int k=(-N+1);k<N;k++){
bool ok = true;
for(int y=0;y<N;y++)for(int x=0;x<N;x++){
if(S[y]... | 0 | 58,345,142 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N;
cin >> N;
ll ans=0;
for(ll i=1;i<=N;i++){
for(ll j=1;j*i<=N;j++){
ans+=j*i;
}
}
cout << ans <<endl;
} | #include <stdio.h>
int main() {
int H1, M1, H2, M2, K;
scanf("%d %d %d %d %d", &H1, &M1, &H2, &M2, &K);
int H = H2 - H1;
int M = M2 - M1;
M += H * 60;
printf("%d\n", M - K);
return 0;
} | 0 | 1,324,746 |
#include <bits/stdc++.h>
const int INF=1e9,MOD=1e9+7;
const long long LINF=1e18;
using namespace std;
#define int long long
signed main(){
int N;cin>>N;
int ans=0;
int mi=1;
int z;cin>>z;ans+=z-1;
for(int i=1;i<N;i++){
int a;cin>>a;
if(a<=mi+1){
mi=max(a,mi);
continue;
}
ans+=(a-1)... | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(){
int A[3][3];
rep(i, 3)rep(j, 3) cin>>A[i][j];
int n;
cin >> n;
int B;
int ok[3][3]={0};
rep(i, n){
cin >> B;
rep(j, 3)rep(k, 3){
... | 0 | 62,845,070 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){i... | #include<bits/stdc++.h>
using namespace std;
int main(void){
string s;
cin>>s;
int judge=0;
int count=0;
if(s[0]=='A') judge++;
for(int i=2;i<s.size()-1;i++){
if(s[i]=='C') count++;
}
if(count==1) judge++;
int count2=0;
for(int i=0;i<s.size();i++){
if('a'<=s[i]&&s... | 0 | 39,916,036 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ll n, m, t, k, a[105];
#define ari for( int i = 0 ; i < n ; i++ ) cin >> a[i];
#define ginp for( int i = 0 ; i < m ; i++ ){ int u, v; cin >> u >> v; adj[u].push_back(v); adj[v].push_back(u);}
#define pb push_back
#define ss seco... | #include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define SORT(a) sort(a.begin(), a.end())
#define REVERSE(a) reverse(a.begin(), a.end())
#define Lower_bound(v, x) d... | 0 | 99,096,612 |
#include <bits/stdc++.h>
#define FOR(i, l, r) for(ll i = l; i < r; i++)
#define rep(i, N) FOR(i, 0, N)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<ll> vl;
const ll MOD = round(1e9+7);
int main() {
ll N; cin >> N;
vi A(N); rep(i,N) cin >> A[i];
s... | #include<iostream>
#include<algorithm>
#include<string.h>
#include<set>
#define MAX_N 50
#define INF 10000
using namespace std;
int d[MAX_N][MAX_N];
int N;
void floyed(int X) {
for (int k = 0; k<X; k++) {
for (int i = 0; i<X; i++) {
for (int j = 0; j<X; j++) {
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
... | 0 | 99,513,382 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.