code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include<bits/stdc++.h>
#define FOR(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define RFOR(i,a,b) for(long long i = (long long)(a); i >= (long long)(b); i--)
#define MIN3(a,b,c) (a)<(b)?((a)<(c)?(a):(c)):((b)<(c)?(b):(c))
#define MAX(a,b) (a)>(b)?(a):(b)
#define MIN2(a,b) (a)<(b)?(a):(b)
using n... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
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);
strin... | 1 | 27,413,697 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(),v.end()
#define UN(v) sort(ALL(v)),v.erase(unique(ALL(v)),v.end())
#define FILL(x,y) memset(x,y,sizeof(x))
#define EACH(v,it) for(__typeof(v.begin()) it=v.begin();it!=v.end();it++)
#define FIO ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define r... | #include <bits/stdc++.h>
const int INF=1e9;
const int MOD=1e9+7;
const long long LINF=1e18;
using namespace std;
typedef pair<int,int> P;
signed main(){
int K;cin>>K;
std::vector<P> e[K];
for(int i=0;i<K;i++){
e[i].push_back(P((i+1)%K,1));
e[i].push_back(P(i*10%K,0));
}
std::vector<int> d(K,INF);
d[... | 1 | 79,650,241 |
#include <iostream>
using namespace std;
int main() {
int house[4][3][10], n, building, floor, address, number;
for (int h = 0; h < 4; h++) {
for (int i = 0; i < 3; i++) {
for (int s = 0; s < 10; s++) {
house[h][i][s] = 0;
}
}
}
cin >> n;
for (... | #include<iostream>
using namespace std;
int main() {
int n, b, f, r, v;
int count[5][4][11] = { 0 };
cin >> n;
for (int i = 0; i < n; i++) {
cin >> b >> f >> r >> v;
count[b][f][r] += v;
}
for (int i = 1; i <= 4; i++)
for (int j = 1; j <= 3; j++) {
for (int k = 1; k <= 10; k++) {
cout << ' ' << count... | 1 | 41,610,695 |
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#incl... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,k,r,s,p;
cin >> n>> k >> r >> s >> p;
string t;
cin >> t;
vector<char> hand;
int point=0;
for(int i=0; i<k; i++){
if(t.at(i) == 'r'){
hand.push_back('p');
point += p;
... | 1 | 80,568,189 |
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<map>
#include<tuple>
#define rep(index,num) for(int index=0;index<num;index++)
#define rep1(index,num) for(int index=1;index<=num;index++)
#define sc... | #include<bits/stdc++.h>
using namespace std;
template<typename T> inline void read(T &x)
{
x=0;char c=getchar();bool flag=false;
while(!isdigit(c)){if(c=='-')flag=true;c=getchar();}
while(isdigit(c)){x=(x<<1)+(x<<3)+(c^48);c=getchar();}
if(flag)x=-x;
}
int n,m,d;
char c[3][3]=
{
"RY",
"GB"
};
in... | 1 | 40,767,423 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | #include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
using namespace std;
int main()
{
ll L, R, t; cin >> L >> R;
vector<int> check(2019,0);
for(ll i=L; i<R; i++){
... | 1 | 72,669,942 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <numeric>
using namespace std;
#define ll long long int
#... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
... | 1 | 16,366,601 |
#include <bits/stdc++.h>
using namespace std;
#define watch(x) cerr << (#x) << ": " << (x) << endl
typedef long long LL;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int ha, ma, hb, mb, k; cin >> ha >> ma >> hb >> mb >> k;
int a = ha*60 + ma, b = hb*60 + mb;
int ans = (b-a) - k;
... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | 1 | 40,721,375 |
#include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define endl '\n'
#define loop(i, m, n) for (ll i = m; i < n; i++)
#define loope(i, m, n) for (ll i = m; i <= n; i++)
#define epool(i, m, n) for (ll i = m; i >= n; i--)
#define mod 1000000007
#define mod2 9982... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const ll INFL = 1e17;
const int MOD = 1e9+7;
vector<ll> fact;
ll m_pow(ll p, ll n){
if(n==0) return 1;
else if(n%2){
ll now = m_pow(p,(n-1)/2);... | 1 | 87,167,921 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<ll, ll>;
const int MAX { 200010 };
const ll MOD { 1000000007 }, oo { 1LL << 62 };
vector<ll> solve(int N, const vector<ll>& xs)
{
map<ll, ll> hs;
for (auto x : xs)
++hs[x];
ll ways = 0;
for (auto p : hs)
{
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define ll long long
int main(){
int n; cin>>n;
ll a[n],s,ans;
map<ll,ll> mp;
rep(i,n) cin>>a[i],mp[a[i]]++;
s=0;
for(auto p:mp) {auto v=p.second;s+=v*(v-1)/2;}
rep(i,n){
ans=s;
ans-=mp[a[i]]*(mp[a... | 1 | 25,197,667 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
string s, t;
int main(void){
cin >> s >> t;
int n = s.size();
rep(i, s.size()){
char r;
r = s[n-1];
s = r+s.substr(0, n-1);
if(s == t){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int i,j,n;
bool ans=false;
string s,t,c;
cin>>s>>t;
n=s.size();
c=s;
for(i=0;i<n;i++)
{
if(c==t)
{
ans=true;
cout<<"Yes"<<endl;
break;
}
else
{
... | 1 | 40,900,413 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n,m;
cin>>n>>m;
int sum=0;
vector<int>arr(n);
for(int i=0; i<n; i++){
cin>>arr[i];
sum+=arr[i];
}
sort(arr.rbegin(),arr.rend());
int cnt=0;
for(int i=0; i<m; i++)
{
if(arr[i]>=ceil(sum/(4.0*m)))
{
cnt++;
}
}
... | #include <bits/stdc++.h>
#define int long long
#define ci(m) for(int i=0;i<m;i++)
#define cj(m) for(int j=0;j<m;j++)
#define ck(m) for(int k=0;k<m;k++)
#define gcd __gcd
#define endl "\n"
#define pb emplace_back
#define setbits(x) __builtin_popcountll(x)
#define zrobits(... | 1 | 56,355,109 |
#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;
cin >> n;
int INF = 1000000;
vector<int> dp(n+1, INF);
dp[0] = 0;
for (int i=1; i<=n; i++) {
int tmp = dp[i-1] + 1;
rep(j, 1... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const stati... | 1 | 48,834,283 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
int main()
{
int N; cin >> N;
vector<int... | #include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<unordered_map>
#include<stack>
#include<string>
#include<iomanip>
#include<algorithm>
#include<functional>
#include<cstring>
#include<utility>
#include<math.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
t... | 1 | 77,643,412 |
#include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1000000007;
int64_t MAX = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
int N, K;
cin >> N >> K;
vector<int> list(N);
for (int i = 0; i < N; i++)
cin >> list[i];
sort(list.begin(), list.end());
reverse(list.be... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define GET_ARRAY_SIZE(a) (sizeof(a)/sizeof(a[0]))
#define LL long long
#define VI vector<int>
#define VL vector<LL>
#define VII vector< vector<int> >
#define VLL vector< vector<LL> >
#define VS vector<string>
#define ... | 1 | 41,256,664 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstring>
#include <functional>
#include <queue>
#include <cmath>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define rep1(i,n) for(int i=1;i<=(int)n;++i)
int N, K;
int Sum[200010];
map<int, int>... | #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)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { ... | 1 | 75,339,062 |
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define se cout << "test ok" << endl;
#define sp << " " <<
using namespace std;
using ll = long long;
using ld = long double;
ll mod = ll(1e9)+7;
ll inf = ll(5e18);
template<typename T1, typename T2> ll ceill(T1 a, T2 b){ return (a+b-1)/b; }
void ans(bool ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n; cin >> n;
ll sum = 0;
ll digit = 0;
for(int i = 0; i < n; i++){
ll a, b; cin >> a >> b;
digit += b;
sum += a * b;
}
cout << digit - 1 + (sum - 1) / 9 << endl;
} | 1 | 45,033,207 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> vec(N+1, vector<int>(3));
vec.at(0).at(0) = 0;
vec.at(0).at(1) = 0;
vec.at(0).at(2) = 0;
for (int i = 0; i < N; i++) {
cin >> vec.at(i+1).at(0) >> vec.at(i+1).at(1) >> vec.at(i+1).at(2);
}
bool can = t... | #include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
#include <numeric>
using namespace std;
int main() {
bool ans = true;
long long int N, t, x, y, t0 = 0, x0 = 0, y0 = 0;
cin >> N;
for (int i = 0; i < N; ... | 1 | 53,659,294 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
cout << a+((float)b*0.5);
} | 1 | 17,910,548 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
using namespace std;
typedef vector<int> vi;
int main(){
string S;
cin >> S;
vector<char> alpha(26);
vi counter(26);
rep(i, 26){
alpha[i] = 'a' + i;
}
rep(... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
stri... | 1 | 35,361,467 |
#include <iostream>
#include <algorithm>
#include <string>
int main(void)
{
int base = 100000;
int n;
std::cin >> n;
for (int i = 0; i < n; i++) {
base = 1.05 * base;
if (base % 1000 != 0) {
base = (base / 1000) * 1000 + 1000;
}
else {
base = (base / 1000) * 1000;
}
}
std::cout << b... | #include <iostream>
using namespace std;
int main()
{
double debt = 100000;
int n;
cin >> n;
while (n--) {
debt *= 1.05;
debt /= 1000;
debt += 0.999;
int t1 = debt;
double t2 = debt - t1;
debt -= t2;
debt *= 1000;
}
cout << (int)debt << '\n';
return 0;
} | 1 | 24,345,980 |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
typedef pair<int,int> P;
int n;
int S[10001],E[10001];
int f[216005];
int main(){
while(scanf("%d",&n),n){
memset(f,0,sizeof(f));
for(int i=0;i<n;i++){
int s1,h1,m1,s2,h2,m2;
... | #include <stdio.h>
#include <string.h>
int main(void){
int n, i, j, flag[86400], time[3] = {3600,60,1}, sum1, sum2, max;
char str[9], c;
while(1){
scanf("%d%*c",&n);
if(!n)
break;
memset(flag,0,sizeof(flag));
for(i = 0;i < n;i++){
j = 0;
while((c = getchar()) != ' ')
str[j++] = c;
str[j] = '\... | 1 | 12,800,088 |
#include<iostream>
using namespace std;
int main(void)
{
int x,a;
cin >> x >> a;
if(x<a) cout << '0';
else cout << "10";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if(A >= B) {
cout << 10 << endl;
}
else {
cout << 0 << endl;
}
} | 1 | 11,595,806 |
#include <stdio.h>
#include <iostream>
#define INFTY 200000000
using namespace std;
int main(void){
int n;
int m[100][100];
int p[101];
scanf("%d", &n);
for(int i = 0; i < n; i++){
scanf("%d", &p[i]);
scanf("%d", &p[i + 1]);
}
for(int i = 0; i < n; i++){
for(int j = 0... | #include <stdio.h>
#include <algorithm>
using namespace std;
int main(){
int n,minimum,tmp;
scanf("%d",&n);
int table[n][n];
int data[n][2];
for(int i=0;i<n;i++){
for(int k=0;k<n;k++)table[i][k] = 0;
scanf("%d %d",&data[i][0],&data[i][1]);
}
for(int i=n-2;i>=0;i--){
for(int k=0;k<=i;k++){
if(i==n-2){
... | 1 | 2,685,926 |
#include <iostream>
int main() {
int n;
while( std::cin >> n ) {
int ans = 0;
for( int a=0; a<10; ++a )
for( int b=0; b<10; ++b )
for( int c=0; c<10; ++c )
for( int d=0; d<10; ++d )
ans += (a+b+c+d==n)?1:0;
std::cout << ans << std::endl;
}
} | #include <stdio.h>
using namespace std;
int main(void) {
int sum;
while (scanf("%d", &sum)+1) {
int count = 0;
int a = 0;
int b = 0;
int c = 0;
int d = 0;
for (a = 0; a <= 9; a++) {
for (b = 0; b <=9; b++) {
for (c = 0; c <= 9; c++) {
for (d = 0; d <= 9; d++) {
... | 1 | 2,924,849 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int c1 = 0, c2 = 0;
for (int i = 0, lim = s.size(); i < lim; i++)
{
if (i % 2 == 0) {
s[i] == '0' ? c2++ : c1++;
}
else {
s[i] == '1' ? c2++ : c1++;
}
}
cout... | #include <bits/stdc++.h>
#include <fstream>
#include<string>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
typedef long double ld;
using namespace std;
using namespace __gnu_pbds;
#define endl "\n"
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
... | 1 | 68,668,492 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<vector<bool>> path(8,vector<bool>(8,false));
int dfs(int v,int n, vector<bool> checked){
int ans = 0;
bool all_visited = true;
for(int i=0;i<n;i++){
if(checked.at(i) == false){
all_visited = false;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int>a(n);
for (int i = 1; i < n; i++)a.at(i) = i;
set<pair<int, int>>ab;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
ab.insert({... | 1 | 12,405,058 |
#include <bits/stdc++.h>
#include <atcoder/dsu>
using namespace std;
using namespace atcoder;
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9+7;
#define REP(i,j,n) for(int i=j;i<n;i++)
#define rep(i,n) REP(i,0,n)
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,q;
cin >> n >> q;
... | #include <iostream>
using namespace std;
const int N= 200001;
int parent[N];
void make_set(int r){
parent[r]=r;
}
int find_set(int r){
if(parent[r]==r){
return r;
}else{
return parent[r]=find_set(parent[r]);
}
}
void union_set(int a, int b){
a= find_set(a);
b=find_set(b);
if(... | 1 | 63,851,747 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
using namespace std;
using ll = long long;
typedef vector<int> vi;
int main(){
string o, e;
cin >> o >> e;
e += "\n";
rep(i, o.size()){
cout << o[i] << e[i];;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
void solve(void)
{
string o, e;
cin >> o >> e;
string ans = "";
rep(i, o.length())
{
ans += o[i];
i... | 1 | 35,443,590 |
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#includ... | #include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <cmath>
#include <stack>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
using namespace std;
bool parallel(double x1, double y1, double x2, double y2){
double vec;
vec = x1*... | 1 | 18,423,766 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n,k;
cin >> n >> k;
vector<long long> a(n);
for(long long i=0;i<n;i++) cin >> a[i];
for(long long i=0;i<k;i++){
vector<long long>b(n+1,0);
for(long long j=0;j<n;j++){
long long l=max(0LL,j-a[j]);
long long r=min(n,j+a[j]+1);
b[l]++;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N+2);
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
while (K--) {
vector<ll> B(N+2, 0);
for (int i = 1; i <= N; i++) {
ll a = max(1LL, i-A[i])... | 1 | 63,039,395 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,maximum;
maximum=0;
cin>>n;
long long ans=0;
vector<int> a(n);
for(int i=0;i<n;i++){
cin>>a.at(i);
}
maximum=a.at(0);
for(int i=0;i<n;i++){
if(maximum>a.at(i)){
ans=ans+maximum-a.at(i);
}
maximum=max(maximum,a.at(i)... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef vector<pii> vpii;
typedef vector<pil> vpil;
typedef vector<pli> vpli;
typedef set<i... | 1 | 97,286,470 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(){
ll N;
cin >> N;
vector<ll> T(N);
for(int i = 0; i < N;... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <vector>
#include <string>
#include <bitset>
#include <queue>
#include <tuple>
#include <regex>
#include <cmath>
#include <map>
#include <cstring>
template<typename T> bool chmax( T &a, const T &b ) { if ( a <= b ) { a = b; return (... | 1 | 17,138,189 |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;... | #include<bits/stdc++.h>
#define N 100001
#define int long long
#define LOG(x) cerr<<#x<<" = "<<x<<endl
#define add_edge(u,v) nxt[++cnt]=head[u],head[u]=cnt,to[cnt]=v
#define open(x) freopen(#x".in","r",stdin),freopen(#x".out","w",stdout)
char ch;bool fs;void re(int& x)
{
while(ch=getchar(),ch<33);
if(ch=='-')fs=1,x=0... | 1 | 96,580,466 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int s;
cin >> s;
long long mod = 1000000007;
vector<vector<long long>> dp(s + 1, vector<long long>(s + 2, 0));
dp[0][0] = 1;
for (int i = 0; i < s; i++) {
for (int j = 0; j < s; j++) {
... | #include<bits/stdc++.h>
#include<string>
#include<cmath>
using namespace std;
#define ll long long int
#define ld long double
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
#define deb(x) cout<< #x << '=' << x <<endl
#define MOD 1000000007
const ... | 1 | 45,500,185 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll N;
string S;
cin >> N >> S;
vector<ll> vec(2 * N);
vec[0] = 0;
rep(i,2 * N -... | #include <bits/stdc++.h>
#define ll long long
#define maxn 200100
#define base 1000000007
using namespace std;
int n,a[maxn];
ll ans=1;
string s;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin>>n;
cin>>s;
a[0] = (s[0]=='W'?0:1);
for (int i=1;i<2*n;i++) a[i] = (s[i]==s[i-1]?1-a[i-1]:a[i-1... | 1 | 21,067,573 |
#include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double>... | #include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <numeric>
#include <algorithm>
using namespace std;
int N, M, P;
int main() {
while(cin >> N >> M >> P, N||M||P){
int sum=0, temp=0;
for(int i=0; i<N; ++i){
int a; cin >> a;
if(i==M-1) temp = ... | 1 | 45,364,493 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> A(n + 1);
rep(i, n) cin >> A.at(i + 1);
int now = 1;
int ans = 0;
while(ans != n && now != 2) {
ans++;
now = A.at(now);
}
if(ans... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int N;
cin>>N;
vector<int>a(N);
vector<int>visit(N+1);
for(int i=0;i<=N-1;i++){
cin>>a[i];
}
int next=1;
int ans=0;
while(1){
if(visit[next]==1){
cout<<-1;
return 0;
}
visit[next]=1;
next=a[next-1];
... | 1 | 93,558,692 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
int main() {
string S, T;
cin >> S >> T;
int N = S.length();
int M = T.length();
for (int i = N - M; i >= 0; i--) {
string s = S.substr(i, M);
bool ok = true;
for (int j = 0; j < M; j++)... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef map<ll,ll>::iterator itll;
typedef long double ld;
typedef map<ll,ll> mapll;
#define con continue
#define pb push_back
#define fi first
#define se second
#define fr front()
#define INF 1000000000000000000
#define all(vl) v... | 1 | 45,225,504 |
#include <bits/stdc++.h>
using namespace std;
void solve(long long N, std::vector<long long> L)
{
sort(L.begin(), L.end());
int res = 0;
for (int i = 0; i < 2 * N; i += 2)
{
res += min(L[i], L[i + 1]);
}
cout << res << endl;
}
int main()
{
long long N;
scanf("%lld", &N);
std:... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 111;
int n;
int a[2*maxn];
bool buf;
int main() {
buf = scanf("%d", &n);
n <<= 1;
for (int i = 1; i <= n; i++) {
buf = scanf("%d", a+i);
}
sort(a+1, a+n+1);
int res = 0;
for (int i = 1; i <= n; i += 2)
res += a[i];
printf("%d\n", res... | 1 | 46,361,791 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,s=0;
string str;
cin>>str;
for(int i=0;i<str.size();i++){
int j=str[i]-48;
s+=j;
}
if(s%9==0)
cout<<"Yes";
else cout<<"No";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, ll> Pil;
string S;
int main() {
cin >> S;
ll sum = 0;
for (int i = 0; i < S.length(); i++) {
sum += S[i] - '0';
}
cout << ((sum % 9 == 0) ? "Yes" : "No") << endl;
return 0;
} | 1 | 50,386,261 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
int main() {
fast_io;
int n;
cin>>n;
cout<<fixed<<endl;
cout<<setprecision(12)<<endl;
double ans;
ans=(double(n)/3)*(double(n)/3)*(double(n)/3);
... | #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()
{
double L;
cin >> L;
double ans = (L / 3.0) * (L / 3.0) * (L / 3.0);
cout << fixed << setprecision(15) << ans << endl;
return 0;
} | 1 | 86,777,368 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll n;
cin >> n;
set<ll> a;
for(int i = 0; i < n; i++)
{
ll tmp;
cin >> tmp;
a.insert(tmp);
}
set<ll>::iterator itr = a.end();
ll x = *--itr;
ll y = 0;
ll border = x/2;
if(... | #include "iostream"
#include "vector"
#include "string"
#include "algorithm"
#include "math.h"
#include "cstring"
#include "stack"
#include "queue"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<int> > mat;
int main()
{
int n;
cin >> n;
vecto... | 1 | 96,005,299 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long X,Y;
cin>>X>>Y;
if(X%Y==0){
cout<<-1<<endl;
return 0;
}
cout<<X*(Y-1)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, char **argv) {
ll x;
ll y;
cin >> x >> y;
ll ans = x % y == 0 ? -1 : x;
cout << ans << endl;
} | 1 | 50,934,061 |
#include<iostream>
#include<bits/stdc++.h>
#include<math.h>
#include<string.h>
using namespace std;
int main(){
int c=0,i,l;
string s,t;
cin>>s;
cin>>t;
l=s.length();
for(i=0;i<l;i++){
if(s[i]!=t[i])
c++;
}
cout<<c;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
string a,b;
cin>>a>>b;
int ans =0;
for(int i=0;i<a.length();i++){
if(a[i]!=b[i])
ans++;
}
cout << ans << endl;
return 0;
} | 1 | 51,744,934 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long N, long long M)
{
for (ll i = M; i >= 1; i--) {
if ((M % 2 == 1 && i % 2 == 1) || (M % 2 == 0 && i % 2 == 0)) {
cout << 1 + ((M - i + 1) / 2) << " " << M + 1 - ((M - i + 1) / 2) << endl;
} else {
... | #include <iostream>
using namespace std;
int n, m;
void solve() {
int second = m & 1 ? m + 1 : m + 2;
int cnt = 1;
int cnt2 = 0;
for (int i=0;i<m;i++) {
if (i < m / 2) {
cout << cnt << " " << (second - cnt) << endl;
cnt++;
} else {
cout << cnt2 + second << " " << (2 * m + 1 - cnt2) << ... | 1 | 10,031,342 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int n; scanf("%d",&n);
vector<int> a(n);
rep(i,n) scanf("%d",&a[i]);
auto b=a;
sort(b.begin(),b.end());
int bad=0;
rep(i,n){
int idx=lower_bound(b.begin(),b.end(),a[i])-b.begin();
if(i%2==0 && idx%2==1) bad++;
... | #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--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define I... | 1 | 32,070,536 |
#include <iostream>
using namespace std;
int main(){
int n, m, p, ans;
while(1){
cin >> n >> m >> p;
if(n == 0 && m == 0 && p == 0) break;
ans = 0;
int a;
for(int i = 1; i <= n; i++){
int x;
cin >> x;
ans += x;
if(i == m) a = x;
}
if(a == 0){
ans = 0;
}else{
ans = ans * (100-p) / a;
... | #include<iostream>
#include<vector>
using namespace std;
int main()
{
int n,m,p;
while(cin>>n>>m>>p && n!=0){
vector<int> V(n+1);
int sum=0;
for(int i=1;i<=n;i++){
cin>>V[i];
sum+=V[i];
}
sum*=100;
if(V[m]==0){
cout<<0<<endl;
}
else{
sum*=(100-p);
sum/=100;
cout<<sum/V[m]<<endl;
}
... | 1 | 35,483,990 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int h,w;cin>>h>>w;
int a[h][w];
rep(i,h)rep(j,w)a[i][j]=0;
int bh[h],bw[w];
rep(i,h)bh[i]=0;
rep(i,w)bw[i]=0;
rep(i,h){
string s;cin>>s;
rep(j,w)if(... | #include <bits/stdc++.h>
using namespace std;
int main (){
int H,W,n;
cin>>H>>W;
n=0;
vector<vector<char>> vec(H,vector<char>(W));
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
cin>>vec.at(i).at(j);
}
}
for(int i=0;i<H;i++){
n=0;
for(int j=0;j<W;j++){
if(vec.at(i).at(j)=='.'){
... | 1 | 54,737,652 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <math.h>
#include <algorithm>
#include <map>
using namespace std;
int main(void){
int n, m; cin >> n >> m;
vector< vector<int> > v(m);
map<int, int> map;
int i = 0;
while (i < m) {
int k;
cin >> k;
int j = 0;... | #include<bits/stdc++.h>
using namespace std;
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.rbegin(), cont.rend()
#define rep(i,n) for(int i=0; i<(n); ++i)
#define rep1(i,n) for(int i=1; i<=(n); ++i)
#define Dcout(a) cout << setprecision(20) << a << endl
#define MP make_pair
#define PB push_back
#de... | 1 | 35,978,362 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
int start = 1900*m+100*(n-m);
int x = pow(2,m);
cout << start * x << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 1 | 58,099,960 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e3+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define il inline
int main... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | 1 | 4,121,546 |
#include <iostream>
#include <string>
#define mod 1000000000+7;
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
string s,t; cin >> s >> t;
int ans{};
for(int i{}; i<s.size(); i++){
if(s[i]==t[i]) ++ans;
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
int main() {
int ans = 0;
string s, t;
cin >> s >> t;
rep(i, 3) {
if (s[i] == t[i]) {
ans++;
}
}
cout << a... | 1 | 73,891,262 |
#include <stdio.h>
#include <math.h>
int n;
int a[100];
int count;
void swap(int *a, int *b) {
int tmp = *a;
*a = *b;
*b = tmp;
}
void selectionsort() {
for (int i = 0; i < n; i ++) {
int mini = i;
for (int j = i; j < n; j ++) {
if (a[j] < a[mini]) {
mini = j;
}
}
if (i != mini) {
swap(&a[i], &... | #include <iostream>
using namespace std;
int select(int *a, int num){
int change=0;
for(int i=0;i<num;i++){
int minj = i;
for(int j=i;j<num;j++){
if(a[minj]>a[j])
minj = j;
}
if(i!=minj)
change++;
swap(a[i],a[minj]);
}
for(i... | 1 | 5,234,895 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
bool is_square(int n)
{
for (int i = 0; i <= n; i++)
{
if (i * i == n)
{
return true;
}
}
return false;
}
int main()
{
ll q, h, s, d;
ll n;
ll ans = 0;
cin >> q >> h >> s >> d >> n;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long Q,H,S,D,N;
cin >> Q >> H >> S >> D >> N;
long long A = min(Q*4, H*2);
A = min(A, S);
if (A*2 >= D){
cout << (N/2)*D + (N % 2)*A << endl;
}
else {
cout << A*N << endl;
}
} | 1 | 30,285,320 |
#include<bits/stdc++.h>
using namespace std;
int basket[200001];
int main()
{
int n, k; cin >> n >> k;
for (int i = 0; i < n; ++i)
{
int a; cin >> a;
basket[a]++;
}
sort(basket, end(basket));
int c = 0;
for (int i = 0; i < 200001; ++i)
if(basket[i])
c++;
c -= k;
if (c <= 0)
{
cout << 0 << endl;
r... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep2(i,s,n) for(int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#define P pair<ll,ll>
#define all(v) v.begin(),v.end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int m... | 1 | 94,093,665 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define rep(i, n) for(ll i = 0; i < n; i++)
... | #include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i = 1; i<n; ++i)
t... | 1 | 71,899,127 |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<numeric>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<q... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <stack>
#include <functional>
#include <queue>
#include <cmath>
#include <set>
#define rep(i,j,k) for(int i=j;i<k;i++)
#define drep(n,m) for(int i=0;i<n;i++)for(int j=0;j<m;j++)
#define Sort(x) sort((x).begin(),(x).... | 1 | 56,622,869 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll l, r;
cin >> l >> r;
r = min(r, l+4038);
int ans = 2018;
for (ll i = l; i <= r; i++) {
for (ll j = i+1; j <= r; j++) {
int ... | #include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
ll l,r;
cin>>l>>r;
if(r-l>=2019)
{
cout<<0<<endl;
}
else
{
ll ans=2020;
for(ll i=l;i<=r;i++)
{
for(ll o=i+1;o<=r;o++)
{
ans=min(ans,((i%2019)*(o%2019))%2019);
}
}
cout<<ans<<endl;
}
} | 1 | 24,987,511 |
#include <iostream>
using namespace std;
int main() {
int i=1,n = 0;
cin >> n;
while(n != 0) {
cout << "Case " << i << ": " << n << endl;
cin >> n;
i++;
}
return 0;
} | #include <stdio.h>
int main(void) {
int x, i;
scanf("%d", &x);
i=0;
do
{
i++;
printf("Case %d: %d\n", i, x);
scanf("%d", &x);
} while (x!=0);
return 0;
} | 1 | 30,550,926 |
#include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) fo... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int n,m;
cin >> n >> m;
vector<vector<int>> rew(m);
for(int i = 0; i < n; i++) {
int a,b;
cin >> a >> b;
if(a>m) continue;
rew[a-1].emplace_back(b);
}
priority... | 1 | 75,338,881 |
#include <iostream>
using namespace std;
void ABC60(void);
void ABC61(void);
void ABC62(void);
void ABC63(void);
void ABC64(void);
void ABC65(void);
void ABC66(void);
void ABC67(void);
void ABC68(void);
void ABC69(void);
int main(void){
ABC60();
}
void ABC60(void){
string a,b,c;
int i,j;
cin >> a >> b >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string a, b, c;
cin >> a >> b >> c;
if (a.back() == b.front() && b.back() == c.front()) cout << "YES" << "\n";
else cout << "NO" << "\n";
} | 1 | 10,750,519 |
#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()
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const ll MOD... | #define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#inclu... | 1 | 43,467,668 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define rep(i, j, n) for (int i = j; i < (int)n; ++i)
constexpr int INF = 0x3f3f3f3f;
int main() {
int n;
cin >> n;
vector<int> cnt(26, INF);
rep... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long n, i, j;
cin >> n;
vector<int> cnt(26, 0);
string t;
cin >> t;
for (i = 0; i < t.size(); i++)
{
cnt.at(t.at(i) - 'a')++;
}
for (i = 1; i < n; i++)
{
string s;
cin >> s;
vector<int> cnt... | 1 | 62,817,863 |
#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 REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,n-1,0)
#define RREPS(i,n) RFOR(i,n,1)
#define int long long
#define mp make_pair
#define ... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <limits.h>
#include <queue>
#include <unordered_map>
#include <sstream>
#include <bitset>
#include <iomanip>
#include <functional>
#include <set>
#include <list>
#define _USE_... | 1 | 60,655,596 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s; cin >> s;
int sn = s.size();
int cnt = 0;
rep(i,sn) {
cnt++;
while (i < sn && s[i] == s[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a >... | 1 | 14,500,737 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
int main(int argc, char* argv[]){
cin.tie(0);... | #include<bits/stdc++.h>
using namespace std;
int main() {
int kazu,size;
cin >> kazu >> size;
vector<string> kekka(kazu);
for(int i=0;i<kazu;i++) {
cin >> kekka.at(i);
}
sort(kekka.begin(),kekka.end());
for(int i=0;i<kazu;i++) {
cout << kekka.at(i);
}
} | 1 | 81,285,128 |
#include <bits/stdc++.h>
const int N = 100005;
int read()
{
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {if (ch == '-') f = -1; ch = getchar();}
while (ch >= '0' && ch <= '9') {x = x * 10 + ch - '0'; ch = getchar();}
return x * f;
}
int a[N],b[N];
int main()
{
int n = read(), L = read(), T... | #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 fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef unsigned lo... | 1 | 29,921,907 |
#include<stdio.h>
int main(){
int genap,ganjil;
scanf("%d %d", &genap, &ganjil);
int tempGenap=0, tempGanjil=0;
if(genap>1){
for(int i=genap-1;i>=1;i--){
tempGenap+=i;
}
}
if(ganjil>1){
for(int i=ganjil-1;i>=1;i--){
tempGanjil+=i;
}
}
printf("%d\n", tempGenap+tempGanjil);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;
cin >> n >> m;
int sum1=0,sum2=0;
for(int i=0; i<n; i++){
sum1+=i;
}
for(int i=0; i<m; i++){
sum2+=i;
}
cout << sum1+sum2;
} | 1 | 60,640,738 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <math.h>
using namespace std;
#define coYES cout << "YES" << endl
#define coNO cout << "NO" << endl
#define coYes cout << "Yes" << endl
#define coNo cout << "No" << endl
#define coyes cout << "yes" << endl
#define cono c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char const *argv[])
{
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
sort(v.begin(), v.end());
ll ans = 0;
for (int i = 0; i < k; ++i)
ans += v[i];
cout << ans;
return 0;
} | 1 | 76,707,002 |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <utility>
#include <iomanip>
#include <set>
using namespace std;
using ll = long long;
#define rep(i,a,b) for(ll i=(a); i<(b); i++)
#define YES cout << "YES" << endl;
#define NO cout... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
signed main() {
#ifdef _DEBUG
#endif
ios::sync_with_stdio(0); cin.tie(0);
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int tx = x2 - x1;
int ... | 1 | 86,612,514 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define loop(i,n) rep(i,0,n)
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
vector<int> a(n),a_cnt(n,0);
loop(i,n)cin >> a[i];
loop(i,n)a_cnt[a[i]]++;
int a_max=*max_element(a.begin(),a.end())... | #include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define inf 0x7f7f7f7f
#define min(x,y) (x<y?x:y)
#define max(x,y) (x>y?x:y)
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
inline char gc(){
static char buf[1000000],*p1=buf,*... | 1 | 85,528,390 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
int n;
int main(void) {
scanf("%d", &n);
vector<string> s(n + 1);
cout << 0 << endl;
cin >> s[0];
if (s[0] == "Vacant") return 0;
int left = 0;
int right = n;
s[n] = s[0... | 1 | 60,108,666 |
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cs... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=9982... | 1 | 25,116,760 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <set>
#include <unordered_set>
#include <bitset>
using namespace std;
using ll = long... | #include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | 1 | 54,276,902 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define pow(x,y) modpow(x,y)
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
template <class T = int>T in(){
T x;
cin >> x;
return (x);
}
signed main(){
cin.... | #include <bits/stdc++.h>
#define rep(i,n); for(int i = 0;i < (n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
long double pi = acos(-1);
const int INF = 1001001001;
int euqlid (int a, int b){
int temp;
temp = a % b;
if(temp == 0)return b;
return euqlid(b,temp);
}
ll conbination(ll a,... | 1 | 36,239,326 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i )
typedef std::pair<int,int> pint;
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
int main(){
int N,M;
cin >> N >> M;
vector<int> list(N+1,true);
rep (i,M){
int tmp;
cin >> tmp;
list[tmp] = ... | #include <bits/stdc++.h>
#define pi 3.14159
#define MOD 1000000007
using namespace std;
int main()
{
long long int i,n,m;
cin>>n>>m;
int a[m];
for(i=0;i<m;i++)
cin>>a[i];
vector<int>ans(n+1,-1);
ans[0]=1;
ans[1]=1;
ans[2]=2;
for(i=0;i<m;i++)
ans[a[i]]=0;
for(i=2;i<=n;i++)
{
if(ans[i]!... | 1 | 324,737 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
#define all(v) v.begin(), ... | #include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <cmath>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <iostream>
#include <random>
#include <map>
#include <iomanip>
#include <stdlib.h>
#inclu... | 1 | 23,070,423 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<long long> L(N+2);
L[0]=2;
L[1]=1;
for(int i=0;i<N+1;i++){
if(i<2){
continue;
}
L[i]=L[i-1]+L[i-2];
}
cout << L[N] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
vector<int64_t> L(86+1);
L[0] = 2;
L[1] = 1;
for (int i=2; i<86+1; i++) L[i] = L[i-1] + L[i-2];
cout << L[n] << endl;
} | 1 | 9,127,416 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N; cin >> N;
ll MAX;
for (ll i = 0; i <= N; i++) {
if (i * (i + 1) / 2 == N) MAX = i;
else if (i * (i + 1) / 2 < N) MAX = i + 1;
else break;
}
for (ll i = MAX; i >= 1; i... | #include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <uno... | 1 | 57,979,080 |
#include <iostream>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <string.h>
#include <algorithm>
#include <vector>
using namespace std;
map<char, int> mymap;
int main(int argc, char const* argv[])
{
mymap['a'] = 0;
mymap['b'] = 0;
mymap['c'] = 0;
mymap['d'] = 0;
myma... | #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 sint(x) cout <<#x<<" = "<<(x... | 1 | 35,272,455 |
#include<iostream>
using namespace std;
int main(){
int a,b,c,d,time;
cin>>time;
for(int abc=0;abc<time;abc++){
cin>>a>>b>>c;
if(a>b){
d=a;
a=b;
b=d;
}
if(b>c){
d=b;
b=c;
c=d;
}
if(a>b){
d=a;
a=b;
b=d;
}
if(a*a+b*b==c*c){
cout<<"YES"<<endl;
}else{
cout<<"NO"<<endl;... | #include <stdio.h>
int main(void)
{
int h[3][1000], n, i, temp;
scanf("%d", &i);
for (n = 0; n < i; n++){
scanf("%d %d %d", &h[0][n], &h[1][n], &h[2][n]);
if (h[0][n]<=h[1][n]){
temp=h[0][n];
h[0][n]=h[1][n];
h[1][n]=temp;
}
if(h[0][n]<=h[2][n]){
temp=h[0][n];
h[0][n]=h[2][n];
h[2][n]=temp;... | 1 | 59,151,743 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define ALL(v) (v).begin(),(v).end()
#define COUT(x) cout<<(x)... | #include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n+2);
a[0] = 0;
a[n+1] = 0;
for(int i = 1; i <= n; i++) cin >> a[i];
int sum = 0;
for(int i = 1; i <= n+1; i++){
sum += abs(a[i]-a[i-1]);
}
for(int i = 1... | 1 | 9,799,125 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
string ans = "No";
if (str.size() >= 4) {
if (str.at(0) == 'Y') {
if (str.at(1) == 'A') {
if (str.at(2) == 'K') {
if (str.at(3) == 'I') {
ans = "Yes";
}
}
}
}
}
... | 1 | 22,691,047 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1000000LL;
int main(){
int n;
while(true){
ll max = -INF, tmp = -INF, d;
cin >> n;
if(n == 0)break;
for(int i = 0; i < n; i++){
cin >> d;
tmp=(tmp+d > d ? tmp+d : d);
if(max<tmp)max=tmp;
}
cou... | #include<iostream>
#include<cmath>
#include<cstdio>
#include<vector>
using namespace std;
double before_degree = 0;;
int main(void){
int n;
while(cin >> n,n != 0){
int ans = 0,tmp;
vector<int> num(5010,0);
for(int i = 0;i < n;i++){
cin >> num[i];
}
vector<int>... | 1 | 80,306,330 |
#include<stdio.h>
int main()
{
int r;
scanf("%d",&r);
int a = r * r;
printf("%d",a);
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
cout<<n*n<<endl;
return 0;
} | 1 | 4,022,579 |
#include <bits/stdc++.h>
#include <vector>
#include <queue>
using namespace std;
int main(){
int N;
cin >> N;
typedef pair<int, int> vals;
priority_queue<vals> que;
int tmp;
for(int i=0; i<N; i++){
cin >> tmp;
vals tmp_val = make_pair(tmp, i);
que.push(tmp_val);
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n),b(n);
rep(i,n) {
cin >> a[i];
b[i] = a[i];
}
sort(b.begin(), b.end());
for (int i = 0; i < n; i++) {
boo... | 1 | 75,901,350 |
#include <bits/stdc++.h>
using namespace std;
#define rep0(n) for (int i = 0; i < (int)(n); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define rep3(i, s, n) for (int i = s; i > (int)(n); i--)
#define ALL(obj) obj.begin(), obj.end()
#define from1(ob... | #include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define P(x) cout << (x) << "\n"
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i)... | 1 | 99,210,532 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
char c[n];int ans =1;
cin>>c[0];
for(int i=1;i<n;i++){cin>>c[i];if(c[i]!=c[i-1])ans++;}cout<<ans;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<char> S(N);
int x=0, y;
for(int i=0; i<N; i++) {
cin >> S[i];
if(S[i] == y && i != 0)
x++;
y = S[i];
}
for(int l=0; l<x; l++) {
S.pop_back();
}
cout << S.size() << endl;
... | 1 | 84,278,686 |
#include <iostream>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long a = n / k;
long long b = (n + (k / 2)) / k;
if (k & 1) {
cout << a * a * a << endl;
} else {
cout << a * a * a + b * b * b << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll tri(ll x) {
return x*x*x;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
if(k % 2 == 1) {
cout << tri(n/k) << "\n";
return 0;
}
else {
cout << tri(n/k) + tri(n/(k/2) - (n/k)) << "\n";
... | 1 | 100,182,691 |
#include <bits/stdc++.h>
using namespace std;
const int N = 107;
#define inf 0x3f3f3f3f
int dis[N][N];
int main()
{
int n;
std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
while(cin >> n , n) {
int v = 0, a, b, c;
for(int i = 0;i < N;i ++) for(int j = 0;j < N;j ++) dis[i][j] = (i ==... | #include<iostream>
#include<algorithm>
using namespace std;
const int INF=1<<21;
int main()
{
int n;
while(cin>>n,n)
{
int m[10][10]={};
for(int i=0;i<10;i++)for(int j=0;j<10;j++)if(i!=j)m[i][j]=INF;
int a,b,w,maxn=0;
for(int i=0;i<n;i++)
{
cin>>a>>b>>w;
m[a][b]=m[b][a]=w;
maxn=max(maxn,max(a,b));... | 1 | 80,839,526 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | #include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
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(a<b) { a=b; return 1; }... | 1 | 61,046,608 |
#include <stdio.h>
typedef long long ll;
int main(void) {
ll i, j, n, now = 0;
scanf("%lld", &n);
for(i = 1; ; ++i) {
now += i;
if(now >= n) {
ll a = now - n;
for(j = 1; j <= i; ++j) if(a != j) printf("%lld\n", j);
return 0;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
int main()
{
ll N;
cin >> N;
ll sum... | 1 | 66,536,824 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
char c;
cin >> c;
cout << char(c + 1) << "\n";
return 0;
} | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#... | 1 | 85,642,133 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int k;
string s;
cin>>k>>s;
int n=s.size();
if(n<=k){
cout<<s<<endl;
}
else{
for(int i=0;i<k;i++){
cout<<s.at(i);
}
cout<<"..."<<endl;
}
} | #include <iostream>
using namespace std;
int main()
{
long int K;
cin >> K;
string palabra;
cin >> palabra;
int lon= palabra.size();
if(lon>K){
for(int i=0; i<K; i++){
cout<<palabra[i];
}
cout<<"...";
}
else{
cout << palabra;
}
retu... | 1 | 80,487,145 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<cstring>
#define ll long long
#define ull unsigned long long
#define ld long double
#define fo2(i,start,end,diff) for(int i=start;i<end;i=i+diff)
#define fo(i,start,end) for(int i=start;start<end... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | 1 | 80,492,614 |
#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#define EPS (1e-... | #include <stdio.h>
#include <string.h>
int main()
{
int A, B;
char S[40];
char T[40];
char U[40];
scanf("%s %s", &S, &T);
scanf("%d %d", &A, &B);
scanf("%s", &U);
if(strcmp(S, U)==0)
{
A--;
printf("%d %d", A, B);
}
else
{
B--;
printf("%d %d", A, B);
}
return 0;
} | 1 | 86,901,109 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
const ll MAX = 1001001;
const ll MOD = 1000000007;
ll k;
vector<ll> a;
ll co(ll n)
{
ll now = n;
rep(i, k)
{... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
int main() {
int K;
cin >> K;
vector<ll> a(K);
rep(i, K) cin >> a[i];
reverse(a.begin(), a.end());
ll L = 2, R = 2;... | 1 | 10,832,273 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n; cin >> n;
vector<int> t(n+1), x(n+1), y(n+1);
rep(i,n) cin >> t[i+1] >> x[i+1] >> y[i+1];
string an... | 1 | 99,031,730 |
#include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
vector<int> b;
... | #include <bits/stdc++.h>
using namespace std;
#define ln '\n'
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for (int i = (a); i <= (int)(b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (int)(b); --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
ty... | 1 | 35,621,068 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.