code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 1e+8
int main() {
int w = 0;
int n = 0;
while(cin >> w >> n, w) {
int coins[n];
int dp[w*10];
for (int i = 0; i < n; i++) {
cin >> coins[i];
}
dp[0] = 0;
for (int i = 1; i <= w; i++) {
for (int j = 0; j <... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
ll mod(ll A, ll M) {return (A % M + M) % M;}
const ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return t... | 0 | 3,407,986 |
#include <bits/stdc++.h>
using namespace std;
#define rep0(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define ll long long
#define coYes cout << "Yes" << endl
#define coYES cout << "YES" << endl
#define coyes cout << "yes" << endl
#define coNo cout << "No" << endl
#define coNO cout ... | #include<iostream>
using namespace std;
int main()
{
long long n,i,s=1,ma=0;;
cin>>n;
long long m[n];
for(i=0;i<n;i++)
{
cin>>m[i];
}
long long dp[n];
dp[0]=1;
for(i=1;i<n;i++)
{
if(m[i]<=m[i-1])
{
dp[i]=dp[i-1]+1;
}
else
... | 0 | 4,928,661 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
long n;
cin >> n;
vector<long> a(n), b(n);
for (int i=0; i<n; ++i) {
cin >> a.at(i);
}
b=a;
sort(a.begin(), a.end());
for (long i=0; i<n; ++i) {
if (b.at(i)==a.at(a.size()-1)) {
cout << a.at(a.size... | #include "algorithm"
#include "bitset"
#include "cmath"
#include "functional"
#include "iomanip"
#include "iostream"
#include "map"
#include "numeric"
#include "queue"
#include "set"
#include "string"
#include "vector"
#define rep(i, to) for (ll i = 0; i < (to); ++i)
#define rep1(i, to) for (ll i = 1; i <= (to); ++i)
#... | 0 | 39,723,718 |
#include <iostream>
#include <string>
#include <queue>
#include <map>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#define INTINF 2147483647
#define LLINF 9223372036854775807
#define MOD 1000000007
#define rep(i,n) for (int i=0;i<(n);++i)
using namespace std;
using ll... | #include <bits/stdc++.h>
#include <algorithm>
#include <map>
#include <cstdlib>
#include <cmath>
#define _GLIBCXX_DEBUG
#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;
char C[h][w];
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
... | 0 | 79,477,538 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | 0 | 49,297,290 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+233;
int t,n;
int main(){
string s;
cin>>s;
long long ans=0;
for(int i=0;i<s.size();i++){
ans+=s[i]-'0';
if(ans%9==0)ans=0;
}
if(ans%9==0)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | #include<bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define ll long long
#define ss second
#define ff first
#define pll pair<ll,ll>
#define vll vector<ll>
#define mll map<ll,ll>
#define mod 1000000007
#define w(x) ll x; cin>>x; while(x--)
#define ps(x,y) fixed<<setprecision(y)<<x;
#define fo(i, j, k, in) ... | 0 | 35,927,626 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int ... | #include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
using namespace std;
int main(){
string str1,str2;
int n,m;
while(1){
str1="";
str2="";
cin>>str1;
if(str1[0]=='-'){
break;
}
cin>>n;
for(int i=0;i<n;i++){
... | 0 | 4,282,814 |
#include <iostream>
using namespace std;
typedef long long int LLI;
int main()
{
int x, t;
cin >> x >> t;
if( t >= x )
cout << 0;
else cout << x - t;
return 0;
} | #include <iostream>
#include <cmath>
using namespace std;
typedef pair<double, double> P;
double helon(P p1, P p2, P p3)
{
double a = sqrt((p1.first - p2.first) * (p1.first - p2.first) + (p1.second - p2.second) * (p1.second - p2.second));
double b = sqrt((p2.first - p3.first) * (p2.first - p3.first) + (p2.second - p3... | 0 | 37,200,725 |
#include <iostream>
#include <cmath>
using namespace std;
#define ll long long
int main() {
int k, n;
cin >> k >> n;
int a[n];
int ans=0;
for(int i=0; i<n; ++i) {
cin >> a[i];
}
ans = abs(a[n-1]-a[0]);
a[0]+=k;
for(int i=1; i<n; ++i) {
if(ans > abs(a[i-1]-a[i])) {
ans = abs(a[i-1]-a[i]);... | #include <bits/stdc++.h>
using namespace std;
int main(){
int H,W;
cin >> H >> W;
vector<vector<string>> S(H,vector<string>(W));
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
cin >> S.at(i).at(j);
if(S.at(i).at(j)=="snuke"){
char C='A'+j;
cout << C << i+1 << endl;
break;
... | 0 | 57,241,919 |
#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 mah = 0;
int cnt = 0;
rep(i,n){
int h;
cin >> h;
if(h >= mah) cnt++;
mah = max(mah,h);
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
typedef long long ll;
using namespace std;
int main() {
int h,w;
cin >> h >> w;
vector<vector<char>> a(h,vector<char>(w));
vector<vector<bool>> t(h,vector<bool>(w));
... | 0 | 80,124,013 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define LL long long
using namespace std;
LL ans,sum,c,d;
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>d>>c;
sum+=c*d;ans+=c;
}
ans=ans-1+(sum-1)/9;
cout<<ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, N, a;
int u, l;
cin >> X >> N;
vector<int> vec(102);
for (int i = 0; i < 102; i++) {
vec.at(i)=0;
}
for (int i = 1; i < N+1; i++) {
cin >> a;
vec.at(a)=1;
}
if (vec.at(X)==0){
cout << X << endl;
}
else{
for (int ... | 0 | 41,856,506 |
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define range(a) a.begin(), a.end()
#define endl "\n"
#define Yes() cout << "Yes" << endl
#define No() cout << "No" << endl
using ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m; cin >> n >> m;
vector<vector<int>> g(n);
for (int i = 0; i < m; ++i) {
int a, b; cin >> a >> b;
g[a - 1].push_back(b - 1);
g[b - 1].push_back(a - 1);
}
for (auto a : g[0]) {
for (auto b ... | 0 | 72,917,192 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define rep(i,a,n) for(int i=a;i<(int)n;++i)
#define SZ(x) ((int)(x).size())
#define descSort(a) sort(a.begin(),a.end(),std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
int main() {
int n;
cin>>n;
vector<int> l(2*n);
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout<<v<<endl;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th... | 0 | 36,949,261 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define rep(i,a,n) for(int i=a;i<(int)n;++i)
#define SZ(x) ((int)(x).size())
#define descSort(a) sort(a.begin(),a.end(),std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
ll gcd(ll x,ll y){
if(x%y==0)return y;
return gcd(y,x... | #include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
int main(){
ll X,Y,Z,K,i,j,k;scanf("%lld%lld%lld%lld",&X,&Y,&Z,&K);
ll A[X],B[Y],C[Z];
for(i=0;i<X;i++) scanf("%lld",&A[i]);
for(j=0;j<Y;j++) scanf("%lld"... | 0 | 99,981,574 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int x, a;
cin >> x >> a;
int ans = 0;
if (x >= a) {
ans = 10;
}
cout << ans << endl;
} | #include <iostream>
#include <cstdio>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <cctype>
#include <complex>
#include <string>
#include <sstream>
using na... | 0 | 83,762,074 |
#include <iostream>
using namespace std;
typedef struct {
double x;
double y;
} point;
int main() {
point a, b, c, d;
int n;
cin >> n;
while (n--) {
cin >> a.x >> a.y >> b.x >> b.y >> c.x >> c.y >> d.x >> d.y;
point p, q;
p.x = b.x - a.x;
p.y = b.y - a.y;
q.x = d.x - c.x;
q.y = d.y -... | #include <bits/stdc++.h>
using namespace std;
#define loop(i, n) for(int i = 0;i < int(n);i++)
#define rloop(i, n) for(int i = int(n);i >= 0;i--)
#define range(i, a, b) for(int i = int(a);i <= int(b);i++)
#define SZ(c) int(c.size())
#define ALL(c) c.begin(), c.end()
#define RALL(c) c.rbegin(), c.rend()
#define PI acos(... | 0 | 33,043,548 |
#include <iostream>
using namespace std;
#define Max 1000000
int Prime[Max] = {};
int main()
{
for (int i = 2; i < Max; i++)
{
Prime[i] = 1;
}
for (int i = 2; i*i < Max; i++)
{
if (Prime[i] == 1)
{
for (int j = i * 2; j < Max; j += i)
{
Prime[j] = 0;
}
}
}
for (int i = 2; i < Max; i++)
{
... | #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++)
#define MOD 1000000007
using namespace std;
using ll = long long;
typedef vector<int> vi;
signed main() {
int h, w;
cin >> h >> w;
int row = 0, col = 0;
vector<string> grid(h);... | 0 | 33,132,196 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int cnt=0;
int a=0;
int b=0;
int c=0;
for(int i = 0; i < n; i++) {
string s;
cin >> s;
in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()... | 0 | 13,242,846 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string x;
string y;
cin >> x >> y;
if(x.size()==y.size()){
for(int i=0;i<x.size();i++){
cout << x.at(i) <<y.at(i);
}
cout<< endl;
}
else{
for(int i=0;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s;
std::cin >> s;
int n = s.size();
std::vector<int64_t> v(n + 1, 0);
rep(i, n) {
if (s[i] == '<') {
v[i + 1] = v[i] + 1;
}
}
for (int i = n - 1; i >= 0; i--) {
{
... | 0 | 97,471,962 |
#include <iostream>
#include <sstream>
#include <stack>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <queue>
#include <cmath>
#define BEGIN(x) x.begin()
#define END(x) x.end()
#define ALL(x)... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cstdio>
#include<cmath>
#include<map>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
int MOD=1000000007;
signed main(){
int n,k;cin>>n>>k;
v... | 0 | 21,371,749 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
typedef tuple<int, int, int> T;
#define FOR(i,s,x) for(int i=s;i<(int)(x);i++)
#define REP(i,x) FOR(i,0,x)
#define ALL(c) c.begin(), c.end()
#define DUMP( x ) cerr << #x <<... | #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 +... | 0 | 13,388,279 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mod = 1000000007;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
void prvec(vector<ll> vec){
ll n = vec.size();
cout << "---... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod (ll)(1e9+7)
ll vec[(ll)1e5+1][2];
ll dfs(ll s,ll e,vector<ll>*adj,ll flag){
if(vec[s][flag]!=-1) return vec[s][flag];
vec[s][flag] = 1;
for(auto u : adj[s]){
if(u==e) continue;
if(flag) vec[s][flag] = vec[s][fl... | 0 | 439,044 |
#include<bits/stdc++.h>
#define cy cout << "YES" << endl;
#define cn cout << "NO" << endl;
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
int main()
{
long long a,b,c,d,e,f,x,y,n,h=0,k;
cin >> n >> k >> x >> y;
if(n<k)
{
f=n*x;
cout << f << e... | #include <bits/stdc++.h>
#define NREP() for(ll i = 0; i < n; i++)
#define MREP() for(ll j = 0; j < m; j++)
#define REP(i, x, y) for(ll i = x; i < y; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define END(x) cout << x << endl; exit(0);
#define YN(x) x ? cout << "YES" << endl : cout << "... | 0 | 15,448,995 |
#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = std::int_fast64_t;
using std::cout;
using std::cerr;
using std::endl;
using std::cin;
template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,d,a[11][11],i,j,k,count = 0,ans = 0;
double s[50]={0},b[11][11];
cin >> n >> d;
for(i=0; i<n; i++){
for(j=0; j<d; j++){
cin >> a[i][j];
b[i][j]=a[i][j];
}
}
for(i=0; i<n-1; i++){
for(j=i+1; j... | 0 | 73,211,532 |
#include <bits/stdc++.h>
using namespace std;
using ld = long double;
const ld PI = 3.14159265358979;
ld a, b, x;
bool check(ld ang) {
ang = ang * PI / 180.0;
ld s = b / tan(ang);
ld area = b * s / 2.0;
if (s > a) {
ld sf = (s - a) / s;
area -= area * sf * sf;
}
return area * a >= x;
}
int main() {
ios_base:... | #include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int cnt[3];
int main()
{
in... | 0 | 96,449,242 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
cout << s.substr(0, 5) + " " + s.substr(6, 7) + " " + s.substr(14)<< "\n";
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_ROW = 60;
const int MAX_COL = 100005;
struct BitMatrix {
int H, W;
bitset<MAX_COL> val[MAX_ROW];
BitMatrix(int m = 1, int n = 1) : H(m), W(n) {}
inline bitset<MAX_COL>& operator [] (int i) {return val[i];}
};
int GaussJo... | 0 | 82,383,272 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep2(i,a,b) for(ll i=a;i<=b;++i)
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep3(i,a,b) for(ll i=a;i>=b;i--)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pq priority_queue<int>
#define pb push_back
#define eb emplace_back
#d... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
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 main() {
int n;
cin >> n;
long sum = 0;
vector<int> v;
REP(i,n) {
int j;
... | 0 | 24,307,882 |
#include <atcoder/dsu.hpp>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
int main() {
int N, Q;
cin >> N >> Q;
vector<int> t(Q), u(Q), v(Q);
for (int i = 0; i < Q; ++i) {
cin >> t[i] >> u[i] >> v[i];
}
dsu d(N);
for (int i = 0; i < Q; ++i) {
if (t[i] == 0) {
d.merge(... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> sv;
int cnt = 0;
if ( s[0] == '0' ) sv.push_back(0);
for ( int i = 0; i < s.size();) {
... | 0 | 72,050,368 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
int main() {
int ans = 0;
int tmp;
int n, k;
cin >> n >> k;
vector<int> a(n);
REP(i, n) cin >> a[i];
sort(a.begin(), a.... | #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 | 26,067,768 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long a, b, c, k;
cin >> a >> b >> c >> k;
if (k % 2 == 0) {
cout << a - b << '\n';
} else {
cout << b - a << '\n';
}
return 0;
} | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | 0 | 74,091,120 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef long double ld;
typedef pair <ll ,ll> pll;
typedef pair <int ,int> pii;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define print(a) {for (auto iiiiiiiiii : a) cout << iiiiiiiiii << ' '; cout << ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;cin>>n;
vector<int> a(n);
rep(i,n)cin>>a[i];
int maxi=0,mini=1e9+7,tmp=1e9+7;
rep(i,n)maxi=max(maxi,a[i]);
rep(i,n)if(a... | 0 | 19,015,276 |
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
typedef long lon... | #include<bits/stdc++.h>
using namespace std;
#define all(v) ((v).begin()), ((v).end())
#define allr(v) ((v).rbegin()), ((v).rend())
#define sz(v) ((int)((v).size()))
#define rep(i, v) for(int i=0;i<sz(v);++i)
#define lp(i, n) for(int i=0;i<(int)(n);++i)
#define lpi(i, j, n) for(int i=(j);i<(int)(n);++i)
#def... | 0 | 57,594,045 |
#include<iostream>
#include<vector>
#include<cstring>
#include<map>
#include<bitset>
#include<assert.h>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<set>
#include<queue>
#define long long long
using namespace std;
const int N=1e6,mod=1e9+7;
int aa[N+2],bb[N+2];
int main()
{
ios_base::sync_with_stdio... | #include <iostream>
#include <string>
#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>
#include <bitset>
#include... | 0 | 11,603,963 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(){
}
t... | #include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int score = 0;
for(int i = 1; i <= N; i++){
score += i;
if(score >= N){
for(int j = 1; j <= i; j++){
if(score != N + j){
cout << j << endl;
}
... | 0 | 100,742,961 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
const ll C = 1e9+7;
int main() {
int N;
cin >> N;
vector<int> C(N-1), S(N-1), F(N-1);
for(int i=0; i<N-1; i++) cin >> C[i] >> S[i] >> F[i];
for(int i=0; i<N; i++) {
ll t = 0;
for(int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, M;
vector<int> x, s;
int par(int a) {
if (x[a] == a) return a;
return x[a] = par(x[a]);
}
int ans = 1;
void unite(int a, int b) {
int pa = par(a), pb = par(b);
if (pa == pb) return;
s[pa] += s[pb];
x[pb] = pa;
ans = ma... | 0 | 7,206,017 |
#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 <iostream>
#include <string>
#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>
#include <bitset>
#incl... | 0 | 48,674,499 |
#include <cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
int a[200005];
int check[200005] = {};
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
check[a[i]]++;
}
... | #define _GLIBCXX_DEBUG
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
#define int long long
#define rep(i, n) for(long long i = 0; i < (n); i++)
#define sqrt(d) pow((long double) (d), 0.50)
const int INF = 2000000000;
const int large_P = 1000000007;
ll my_pow(ll N, ll a, l... | 0 | 89,050,142 |
#include <iostream>
using namespace std;
int main(void) {
int d;
while (cin >> d) {
int s = 0;
for (int i = 0; i < 600; i += d) {
s += i * i * d;
}
cout << s << endl;
}
} | #include<bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define M 1000000007
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define f first
#define s second
#define b begin
#define e end
#define pb push_back
#define mp make_pair
#define FOR(i,a,b) for(i=a;i<b;i++)
#define RFOR(i,a,b) for(i=a;i>=b;i--)
#de... | 0 | 34,505,812 |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<algorithm>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll x, ll y) {
ll res = 1;
for (ll i = 0; i < y; i++) res = res * x % mod;
return res;
}... | #include <iostream>
#include <cstdio>
#include <string>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <stdlib.h>
#include <string.h>
#include <cmath>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <set>
const long long MOD = 1e9 +... | 0 | 81,454,992 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
string s;
lli a,b,c,t,temp1,temp2,x,y,temp,q,d,k,mod=1e9+7;
long double l;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>l;
long double ans= (l/3)*(l/3)*(l/3);
cout<<fixed<<setprecision(8)<<ans<<endl;
} | #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()
void solve() {
int n, m;
cin >> n >> m;
vector<ii> a(n), b(m);
for (auto &i : a) {
cin >> i.fi >> i.sc;
}
for (auto &j : b) {
cin >> j.... | 0 | 64,138,413 |
#include <cstdio>
using namespace std;
int main (void)
{
int m, f, r, go;
while (scanf("%d %d %d", &m, &f, &r)!= EOF && m!=-1 || f!=-1 || r!=-1){
go = m+f;
if (m == -1 || f == -1 || go < 30)
printf("F\n");
else{
if (go >= 80)
printf("A\n");
else if (go >= 65)
printf("B\n");
else if (go >= 50... | #include <bits/stdc++.h>
#include<iostream>
#include<math.h>
using namespace std;
int main()
{
int64_t A, B, C, K;
int64_t max_val = pow(10, 18);
cin >> A >> B >> C >> K;
int64_t cnt = 0;
if (abs(A - B) > max_val) {
cout << "Unfair" << endl;
return 0;
}
int64_t x = A - B;
... | 0 | 22,100,067 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
vector<int> mt;
for(int i=0;i<10;i++){
int tmp;
cin>>tmp;
mt.push_back(tmp);
}
sort(mt.begin(),mt.end());
for(int i=9;i>=7;i--){
cout<<mt[i]<<endl;
}
return 0;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<iomanip>
#define MOD 1000000007
#define INF 1001001001
#define MIN -1001001001
#define rep(i,k,N) for(int i=k;i<N;i++)
#define MP make_pair
#defin... | 0 | 78,914,277 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define int long long
#define endl "\n"
#define fi first
#define se second
#define fastio ios_base... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
... | 0 | 30,496,745 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define vt vector
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
signed main() {
... | #include <iostream>
using namespace std;
int main(){
int a,b,c,m,i,g,h;
cin>>a>>b>>c;
i=0;
for(m=1;m<=c;m++){
if(c%m==0){
g=m;
if(a<=g && b>=g){
h=i+1;
i=h;
}
}
... | 0 | 71,104,729 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int N,K,R,S,P;
string T;
cin >> N >> K >> R >> S >> P >> T;
int score = 0;
for (int i = 0; i < N; i++) {
if (i < K || T.at(i) != T.at(i-K)){
if (T.at(i) == 'r'){
score += P;
}
else if (T.at(i) == 's'){
score += R... | #include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
typedef int64_t ll;
void solve() {
ll n, m;
cin >> n >> m;
ll gap = m, fs = 1, bs = n, fe, be, flag = 1;
for(ll i = 0; i < m; i++) {
if(flag) {
flag = 0;
fe = fs + gap;
cout << fs << " " << fe << "... | 0 | 59,256,828 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<utility>
#include<cmath>
#include<climits>
#include<queue>
#include<stack>
#include<numeric>
#include<set>
#include<iomanip>
#include<map>
#include<type_traits>
#include<tuple>
using namespace std;
typedef long long ll;
typedef pair<int,i... | #include <iostream>
#include <vector>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
const int kNil = -1;
enum class Color {
kWhite,
kGrey,
kBlack,
};
template <class T>
struct Edge {
using w_type = T;
Edge(int u, int v, w_type w): u(u), v(v), w(w) { }
int u, v;
w_type w;
... | 0 | 57,780,846 |
#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<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
const int N=1e7;
ll v[N+10];
ll a[N+10];
bool compare(string &a, string &b)
{
string f=a+b,c=b+a;
return f<c;
}
int main()
{
ll a,b,c,sum=0;
cin>>a>>b>>c;
vector<ll>v;
fo... | 0 | 3,401,743 |
#include<iostream>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<algorithm>
#include<functional>
#include<vector>
#include<list>
#include<map>
#include<tuple>
#include<cmath>
#include<bitset>
using namespace std;
int main()
{
int N;
int maxi = -100000;
int count = 0;
int ans = 0;
vector<u... | #include<iostream>
#include<cmath>
#include<string>
#include<cctype>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
for(;;){
int x,y;
cin>>x>>y;
if(x==0 && y==0){
break;
}else{
... | 0 | 23,087,811 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e9+7;
const int mxN = 1e5;
ll N, K, h[mxN], dp[mxN];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N >> K;
for(int i = 0; i < N; ++i)
cin >> h[i];
for(int i = 0; i < N; ++i)
dp[i] = inf;
dp[0] = 0;
for(int i = 1; i < N;... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <string>
#include <set>
#include <bitset>
#include <unordered_map>
#include <cmath>
#include <functional>
#include <map>
#include <cstdlib>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using... | 0 | 73,496,753 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vint;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<int>> vvint;
typedef vector<pair<int, int>> vp... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int q; cin >> q;
while(q--){
ll a, b; cin >> a >> b; if(a < b) swap(a,b);
if(a-b == 0) cout << 2*(b-1) << endl;
else if(a-b == 1) cout << 2*(b-1) << endl;
else{
ll k = (ll)sqrt(a*b);
... | 0 | 89,903,846 |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <unordered_set>
#define ll long long int
#define mod 1000000007
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll m, n;
cin >> m >> n;
vector<vector<int>> vec(... | 0 | 89,642,115 |
#include<bits/stdc++.h>
#include<stdio.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define pb push_back
#define arr vector<ll>
#define mem(x,val) memset(x,val,sizeof(x))
#define vp vector<pair<ll,ll>>
#define matrix vector<vecto... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int H, W, D;
cin >> H >> W >> D;
vector<pair<int, int>> pos(H * W + 1);
rep(i, H) rep(j, W)
{
int A;
cin >> A;
pos[A] = make_pair(i + 1, j + 1);
}
vector<in... | 0 | 97,141,391 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N = 0;
cin >> N;
map<string, int> list;
queue<int> que;
vector<string> A(N);
for(int i = 0; i < N; i++) {
cin >> A.at(i);
if(!list.count(A.at(i))) {
list[A.at(i)] = 0;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll= long long;
using vi = vector<int>;
using vl= vector<ll>;
using vs=vector<string>;
ll gcd(ll a, ll b) { if (a == 0) return b; return gcd(b % a, a);}
ll max(ll a, ll b) {if (a > b) return a; else return b;}
ll min(ll a, ll b) {if (a < b) return a; else return b;}
ll... | 0 | 6,511,689 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int IN... | #include <stdio.h>
struct data {int y,m,d;} table[100],*d;
int main(){
int n,i,j,date;
scanf("%d",&n );
for(i=0; i<n; i++) {
d=&table[i];
scanf("%d%d%d",&d->y,&d->m,&d->d);
}
for(i=0; i<n; i++) {
d=&table[i];
date=0;
for(j=d->m;j<=10;j++){
if(j==d->m){
if(d->y%3==0||j%2==1)da... | 0 | 95,077,575 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for(size_t i = (l); i < (r); i = i + 1)
#define REP(i, n) FOR(i, 0, n)
using ll = long long;
template <class T>
inline bool chmin(T& a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool c... | #include <bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int INF = 1e9;
const double PI = acos(-1.0);
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int m, f, r;
while(1) {
cin >> m >> f >> r;
if(m == -1 && f == -1 && r == -1) break;
st... | 0 | 100,615,114 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
int v[n];
vector<int> a[n];
for (int i = 0; i < n; i++)
cin >> v[i];
while (m--)
{
int u, v;
cin >> u >> v;
a[u - 1].push_back(v - 1);
a[v - 1].push_back(u - 1);
}
... | #include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <queue>
#include <queue>
#include <stack>
#include <sstream>
#include <set>
typedef long long ll;
const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};
const... | 0 | 9,118,395 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=100003,INF=1<<30;
int main(){
int N;cin>>N;
int M=(1<<N);
vector<int> A(M),m1(M,0),m2(M,0);
for(int i=0;i<M;i++){
cin>>A[i];
}
for... | #define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#inc... | 0 | 87,183,593 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); ++i)
using ll = long long;
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
long long LCM(long long a, long long b) {
long long g = GCD(a, b);
return a / g * b;
}
int main(){
... | #include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<clas... | 0 | 5,559,460 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
using namespace std;
using lint = int64_t;
int main() {... | #include <iostream>
#include <map>
#include <vector>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <climits>
#include <stack>
#include <queue>
#include <set>
#include <cctype>
#include <bitset>
#include <type_traits>
#include <list>
using namespace std;
#define REP(i, n) for (long ... | 0 | 68,432,951 |
#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = long long;
using std::cout;
using std::endl;
using std::cin;
int main() {
int n; scanf("%d", &n);
std::vector<int> a(n), vec(n + 1, 0);
for(int i = 0; i < n; i++) {
scanf("%d", &a[i]);
vec[a[i]]++;
}
sort(begin(a), end(a));
b... | #include<bits/stdc++.h>
using namespace std;
map<int,pair<int,int>> mp;
long long int c[90005];
int main(){
int h,w,d;
cin >> h >> w >> d;
int a[h+1][w+1];
for(int i=1;i<=h;i++)for(int j=1;j<=w;j++){
cin >> a[i][j];
mp[a[i][j]]=make_pair(i,j);
}
for(int i=d+1;i<=h*w;i++){
... | 0 | 13,935,711 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int cut[20000001];
int n,k;
cin >> n >>k;
for(int i=0;i<n;i++){
int a;
cin >> a;
cut[a-1]++;
}
sort(cut,cut+n);
int ans=0;
for(int i=0;i<n-k;i++){
ans += cut[i];
}
cout << ans << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main(void){
int N;
std::cin >> N;
std::vector<long> A(N + 1);
std::vector<long> B(N);
for (int i = 0; i < N + 1; i++) {
std::cin >> A[i];
}
for (int i = 0; i < N; i++) {
std::cin >> B[i];
}
long result = 0... | 0 | 13,620,975 |
#line 1 "/mnt/c/Users/leafc/dev/compro/lib/template.hpp"
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define ... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define put(i) cout<<fixed<<i<<endl
using namespace std;
using ll = long long;
int main(){
ll l, r; cin >> l >> r;
ll ans = 1e18;
if(r - l >= 2019){
put(0);
return 0;
}
l %= 2019;
r %= 2019;
if(r <= ... | 0 | 35,873,083 |
#include <iostream>
#include <string>
int main(){
std::string s, t;
std::cin >> s >> t;
int count = 0;
if (s[0] == t[0])
{
count++;
}
if (s[1] == t[1])
{
count++;
}
if (s[2] == t[2])
{
count++;
}
std::cout << count << std::endl;
return 0;
} | #include <iostream>
using namespace std;
#define NIL -1
struct Node { int parent, left, right; };
struct Node T[100001];
int D[100001];
void Depth( int u, int p ) {
D[u] = p;
if ( T[u].right != NIL ) {
Depth( T[u].right, p );
}
if ( T[u].left != NIL ) {
Depth( T[u].left, p + 1 );
}
}
void print ( int ... | 0 | 83,905,973 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define rep(i,a,n) for(int i = (a);i < (n);i++)
bool lu,ru,ld,rd;
bool up,down;
void init(){
lu = ru = false;
ld = rd = true;
up = false;
down = true;
}
int go(string s){
if(s == "lu"){
lu = true;
ld = fa... | #include <iostream>
#include <string>
using namespace std;
string reverse_partial(string str, int s, int e) {
string top = s != 0 ? str.substr(0, s - 1) : "";
string head = str.substr(s, e - s + 1);
string tail = str.substr(e + 1, str.size());
string reverse = "";
for (int i=head.size()-1; i >= 0; i... | 0 | 21,905,662 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n=0;
scanf("%d",&n);
ll ans=0;
for (int i=1;i<n;i++){
ans+=(n-1)/i;
}
printf("%lld\n",ans);
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n; i >= a;i--)
#define index_check(i,n) if(i > n-1 || i < 0) continue;
#define LINF 1e18
#define INF 1e9
#define MOD (ll)(1e9+7)
using namespace std;
#define fs first
#define sc second
using P = pai... | 0 | 66,467 |
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP2(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define REP3(i, l, r) for (int i = (l), i##_len = (int)(r); i < i##_len; ++i)
#define GET_MACRO_REP(_1, _2, _3, NAME, ...) NAME
#define REP(...) GET_MACRO_RE... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <li... | 0 | 66,293,576 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
for(int i = 1;i <= 10;++i) {
c = (a * c) - b;
cout << c << endl;
}
} | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<mem... | 0 | 70,842,010 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); i++)
using ll = long long;
int main(){
string s; cin >> s;
int n = s.size();
bool can = true;
rep(i, (n+1)/4){
if(s[i]!=s[(n-3)/2-i] || s[i]!=s[(n+1)/2+i] || s[i]!=s[n-1-i]) can = false;
}
if(can) ... | #include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T&... | 0 | 1,415,864 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
using namespace std;
int main() {
int hour[3];
cin >> hour[0] >> hour[1] >> hour[2];
int ans = 1000;
for (int i = 0; i < 2; i++) {
for (int j = i + 1; j < 3; j++) {
ans = min(ans, hour[i] + hour[j])... | #include <bits/stdc++.h>
using namespace std;
#define rall(x) x.rbegin() , x.rend()
#define all(x) x.begin() , x.end()
#define fi first
#define se second
#define pb push_back
using ll = long long;
using ii = pair <ll , ll>;
void in(ll &x);
const ll N = 2e5 + 10;
#define singleCase
ll n,a[N],ps[N];
map <ll , ll> freq;
v... | 0 | 23,891,029 |
#include <stdio.h>
int main()
{
int N, M;
scanf("%d %d", &N, &M);
N = ((N*N)/2) - (N/2);
M = ((M*M)/2) - (M/2);
printf("%d", N+M);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long int
#define ld long double
#define mod 1000000007LL
#define INF 1000000011
#define INFLL 1000000000000000011LL
#define endl '\n'
#define vi vector<int>
#define vs vector<string>
#define vll vector<long long>
#define vc vector<char>
#define pii ... | 0 | 78,657,060 |
#include<bits/stdc++.h>
using namespace std;
#define outc cout
#define int long long
signed main(){
int a;
int b=0,c=1,d,e=0,f=0,l=0;
cin>>a>>b>>c;
d=max(b,c)-min(b,c);
if(d%2==0) cout<<"Alice";
else cout<<"Borys";
cout<<"\n";} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
string S, T;
cin >> S >> T;
map<char, c... | 0 | 90,348,819 |
#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 int long long
#define pb push_back
#define eb emplace_back
#define mp make_pair
const int MOD=1e9+7;
const int INF=1e15;
signed main(){
int N;cin>>N;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
const ll mod = 1000000007;
int n, m; cin >> n >> m;
vector<int> broken(n + 2, false);
for (int i = 1; i <= m; i++) {
int a; cin >> a;
broken[a] = true;
}
vector<ll> dp(n + 2, 0);
dp[0] = 1;
if (!broken[1]) dp[1] = 1;
for (int... | 0 | 98,960,729 |
#include "bits/stdc++.h"
using namespace std;
#define all(x) x.begin(), x.end()
using i64 = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr i64 LINF = 0x3f3f3f3f3f3f3f3fLL;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int A, B, C;
cin >> A >> B >> C;
cout << (A == B && B == C ? "Yes" : "No") << ... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int n,k;
string s;
cin>>n>>s>>k;
for (int i=0;i<n;i++) {
if (s[i]!=s[k-1]) {
cout<<"*";
} else {
cout<<s[i];
}
}
cout<<endl;
} | 0 | 43,741,657 |
#include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <list>
#include <cstring>
#include <stack>
using namesp... | #include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, char const* argv[]) {
int x;
scanf("%d", &x);
printf(x < 1200 ? "ABC\n" : "ARC\n");
return 0;
} | 0 | 31,147,829 |
#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 drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
#define ii(x) int x; cin >> (x)
#define ii2(x, y) int x, ... | #include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#d... | 0 | 35,139,023 |
#include <cstdio>
const int N=100005;
int fst[N],f[N],tot=0;
struct Edge{
int to,nxt;
}e[N*2];
void addedge(int x,int y){
e[++tot].to=y;e[tot].nxt=fst[x];fst[x]=tot;
}
void dfs(int x,int fa){
for (int i=fst[x];i;i=e[i].nxt){
int y=e[i].to;
if (y!=fa){
dfs(y,x);
f[x]^=f[y]+1;
}
}
}
int main(){
int n;
s... | #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;
vector<string> s(h);
rep(i, h)
cin >> s[i];
vector<vector<vector<int>>> id(h, vector<vector<int>>(w, vector<int>(2)));
vector<vector<int>> hl(h), vl(w)... | 0 | 97,763,830 |
#include <bits/stdc++.h>
using namespace std;
int Max(int &a,int b){return a=max(a,b);}
int LCS(string &a,string &b){
int n = a.size();
int m = b.size();
vector <vector<int> > dp(n+1,vector<int>(m+1));
for(int i=0;i<=n;i++)
for(int j=0;j<=m;j++){
if(i<n && j<m && a[i] == b[j]) Max(dp[i+1][j+1],dp[i][j... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#defi... | 0 | 50,321,175 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using tlll = tuple<ll, ll, ll>;
using Graph = vector<vector<int>>;
const int MOD = 1e9 + 7;
int main() {
int R;
cin >> R;
cout ... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long LL;
typedef pair<int, int> PII;
typede... | 0 | 60,572,945 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | #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) < (n); (i)++)
#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)
#define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--)
#define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--)
const ll ... | 0 | 44,848,566 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
for (int i = 600; i <= 2000; i += 200) {
if (x < i) {
cout << 11 - i / 200 << '\n';
break;
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define Fast_Input ios_base :: sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
#define pb push_back
#define mem(a, b) memset(a, b, sizeof(a))
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds... | 0 | 42,203,704 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main(){
ll n; cin >> n;
string s; cin >> s;
vector<bool> side(2*n);
side[0] = false;
ll t = 0,f = 1;
for(ll i = 1; i < 2*n; i++){
if( s[i-1] != s[i] ){ side[i] = side[i-1]; }
else{ side[i] = !side[i-1];}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main()
{
int n, d;
cin >> n >> d;
vector<vector<int>> x(n, vector<int>(d));
rep(i, n) rep(j,... | 0 | 63,797,145 |
#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a) accumulate(all(a), 0LL)
#define REP(i, n) for(int (i)=0; (i)<(n); (i)++)
#define RREP(i, n) for(int (i)=(n)-... | #include <iostream>
#include <vector>
using namespace std;
int gcd(int a, int b)
{
if (a < b) {
int k = a;
a = b;
b = k;
}
if (b == 0) return a;
return gcd(b, a%b);
}
int p(int n)
{
for (int i = 2; i*i <= n; i++) {
if (n%i == 0) return i;
}
return n;
}
int mai... | 0 | 6,588,024 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int>h(n);
for (int i = 0; i < n; i++)cin >> h.at(i);
ll cur = h.at(0);
ll ans = 1;
for (int i = 1; i < n; i++) {
if (h.at(i) >= cur) {
ans++;
cur = h.at(i);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) >= 0; --(i))
#define rep1(i,n) for(ll (i) = 1; (i) <= (n); ++(i))
#define rrep1(i,n) for(ll (i) = (n); (i) >= 1; --(i))
#define nfor(i,a,b) for(ll (i) = (a); (i) < (b); ++(i))
#... | 0 | 31,371,736 |
#include <vector>
#include <iostream>
#include <functional>
using namespace std;
void topological_sort(vector<vector<int>> G, vector<int>& ans) {
vector<bool> seen(G.size());
function<void(int)> visit;
visit = [&](auto key) {
if (seen[key])
return;
seen[key] = true;
for (... | #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 frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | 0 | 52,488,459 |
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
const int MAX_N = 110;
int judge_num;
int score[MAX_N];
int main()
{
while (cin >> judge_num) {
if (judge_num == 0) break;
for(int i = 0; i < judge_num; ++i) {
cin >> score[i];
... | #include <iostream>
#include <string>
#include <queue>
#include <utility>
#include <algorithm>
#include <numeric>
#include <set>
#include <climits>
#include <map>
#include <cmath>
#include <deque>
#include <numeric>
using namespace std;
long long a[100000];
long long K_sums[100000];
long long cum_sum_positive[100000];
... | 0 | 5,732,147 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
vector<vector<int>> g(n);
for(int i = 0; i < n - 1; ++i) {
int a, b; cin >> a >> b;
a--, b--;
g[a].push_back(b);
g[b].push_back(a);
}
function<int(int, int)> dfs = [&] (int v, int p) {
... | #include<iostream>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<string>
#include<cstring>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<bitset>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typede... | 0 | 60,393,671 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
int main(){
int N, i; cin >> N >> i;
cout << N - i + 1 << endl;
} | #include<bits/stdc++.h>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
double pai=3.141592653589;
int n,x,ans;
for(;;){
scanf("%d %d",&n,&x);
ans=0;
if(n==0) break;
for(int i=1;i<n-1;i++){
for(int j=i+1;j<n;j++){
if(n>=x-i-j ... | 0 | 69,985,121 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vec... | #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... | 0 | 18,282,796 |
#include <bits/stdc++.h>
#include <vector>
#include <math.h>
#include <cmath>
using namespace std;
int main(){
int n,mini=INT_MAX,maxi=INT_MIN,cost = INT_MAX;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
mini= min(mini,a[i]);
maxi = max(maxi,a[i]);
}
for(int i=mini;i<=maxi;i++)
{
i... | #include<iostream>
using namespace std;
#include<stdio.h>
int main()
{
int *A;
int i, H;
scanf("%d", &H);
A = new int[H + 1];
for(i = 1; i <= H; i++) scanf("%d", &A[i]);
for(i = 1; i <= H; i++){
printf("node %d: key = %d, ", i, A[i]);
if(i / 2 > 0){ printf("parent key = %d, ", A[... | 0 | 66,425,834 |
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
ll GCD(ll x, l... | #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 | 84,558,644 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR... | #include <iostream>
#include <string>
#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>
#include <bitset>
#incl... | 0 | 29,682,907 |
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
#include <deque>
#include <queue>
#include <list>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
io... | #include<bits/stdc++.h>
using namespace std;
#define cinsc ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(0);
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOR(i,k,n) for(int64 i=k;i<(int64)n;i++)
#define FORr(i,k,n) for(int64 i=(int64)k;i>=n;i--)
#define FORE... | 0 | 74,108,988 |
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
int main(){
char str[1001];
char word[100][100]={0};
int longest=0;
int check[100]={0};
char *tmp;
int freq=0;
int count=0;
int i,j;
size_t len , prev;
fgets(str , sizeof(str) , stdin);
tmp=str;
for(i=0 ; str[i]!='\0' ;i++){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
int N,K;
cin >> N >> K;
vector<ll> V(N);
rep(i,N){
cin >> V[i];
}
ll ans = 0;
for(int l=0;l<=min(N,K);l++){
... | 0 | 40,910,068 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define ... | #include<bits/stdc++.h>
#include<vector>
#include<algorithm>
using namespace std;
#define lli long long int
#define lb long double
#define pi acos(-1)
#define FindDistance(ax,ay,bx,by) sqrt((ax-bx)*(ax-bx)+(ay-by... | 0 | 76,671,263 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(fals... | #include <bits/stdc++.h>
using namespace std;
#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 pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(x) (int)(x).size()
#define maxs(x,y) x=max(x,y)
#define mins(x... | 0 | 81,087,790 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>=b;--i)
#define fore(i,a) for(auto &i:a)
#define INF INT_MA... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main() {
int n;
cin >> n;
vector<int> t(n+1), x(n+1), y(n+1);
t[0] = 0;
x[0] = 0;
y[0] = 0;
for(int i=1; i<=n; i++) cin >> t[i] >> x[i] >> y[i];
for(int i=1; i<=n; i++) {
int ... | 0 | 38,337,541 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int64_t> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
int64_t ans = 10000000000000000;
for (int tmp = 0; tmp < (1 << N); tmp++) {
bitset<15> s(tmp);
int64_t M = 0;
int C = 0;
int64_t... | #include <iostream>
#include <sstream>
#include <vector>
#include <algorithm>
#include <string>
#include <stdio.h>
#include <math.h>
#include <map>
using namespace std;
vector<string> split(string source, string pattern) {
unsigned i, base = 0;
vector<string> ret;
string buff;
for(i = 0; i < source.size... | 0 | 96,271,751 |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <string.h>
#include <ctype.h>
#include <algorithm>
#include <math.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
int cnt = 0;
while(!(a == b & b == c)) {
if(a <= b & b <= c) {
if(a == b) {
a++; b++; cn... | #include<iostream>
using namespace std;
int main(){
string s,t;
cin>>s>>t;
bool no=false;
if(s[s.size()-1]!=t[0]){
no=true;
}
int n=s.size();
for(int i=0;i<n;i++)
{
no=false;
for(int j=0;j<n;j++)
{
if(s[(j+i)%(s.size())]!=t[j]){
... | 0 | 18,356,668 |
#include <iostream>
using namespace std;
int main(){
int n,i;
cin>>n;
int min=1000000,max=-1000000;
long long int sum=0;
if (n==0){
cout<<"0 0 0"<<endl;
return 0;
}
for (i=0;i<n;i++){
int a;
cin>>a;
if (a<min){
min=a;
}
if (a>max){
max=a;
}
sum+=a;
}
cout<<min<<" "<<max<<" "<<sum<<endl;... | #include <bits/stdc++.h>
#define PI 3.1415926535897932
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int A,B;
cin>>A>>B;
vector<int> check(90000);
for(int i=0;i<90000;i++){
check[i]=i+10000;
string num=to_string(check[i]);
char a_1,a_2,a_4,a_5;
a_1=num[0];
a_2=num[1];
a_4=num[... | 0 | 46,030,877 |
#include <iostream>
using namespace std;
int main(){
int N;
cin>>N;
int x,y;
x = 800 * N;
y = (N / 15) * 200;
cout<<x-y<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=(x);i<(y);++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define show(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define show(x)
#endif
typedef long long int ll;
typedef pair<int,int> pii... | 0 | 4,227,037 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.