code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <iostream>
#include <unordered_map>
using namespace std;
unordered_map<int, int> h;
int fib(int n);
int fib(int n) {
if (h.count(n) != 0) {
return h[n];
}
int ret;
if (n == 0) {
ret = 1;
}
else if (n == 1) {
ret = 1;
}
else {
ret = fib(n-1) + fib(... | #include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9+7;
typedef long long int lli;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<lli> vlli;
typedef vector<bool> vb;
long long int max(long long int a,long long int b){
if(a>b)
return a;
else
return b;
}
long long int min(l... | 0 | 44,463,921 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
vector<int... | #include <iostream>
#include <stdio.h>
using namespace std;
class Dice{
public:
int value[6];
void roll(char _order) {
switch(_order) {
case 'N':
swap(value[4], value[0]);
swap(value[0], value[1]);
swap(value[1], value[5]);
break;
case 'E':
swap(value[2], value[0]);
s... | 0 | 65,780,902 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
vector<int> N, X;
for(;;){
int n, x;
cin >> n >> x;
if(n == 0 && x == 0) break;
N.push_back(n);
X.push_back(x);
}
for(int i = 0; i < N.size(); i++){
int ans = 0;
int n = N.at(i), x = X.at(i... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main() {
int N;
while(cin >> N, N) {
vector<int> scores;
int score;
for(int i=0; i < N; i++) {
cin >> score;
scores.push_back(score);
}
sort(scores.begin(), scores.end());
int sums = 0;
for(int i=1; i<scores.size()-1;... | 0 | 89,239,328 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <unordered_map>
#include <iomanip>
#include <cmath>
#include <tuple>
using namespace std;
using ll = long long;
#define rep(i, j, n) for(int i = j; i < (int)n; ++i)
#define rrep(i, j, n) for(int i = (int)n - 1; j <= i; -... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 1000000009
#define PI acos(-1)
#d... | 0 | 71,544,544 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 1000005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define F first
#define S second
#define all(x) ... | #include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<vector>
#include<map>
#include<algorithm>
#define MAXN 100010
#define LL long long
using namespace std;
LL d[MAXN],dis[MAXN],siz[MAXN];
int n,cnt;
map<LL,int> mp;
struct Edge{int u,v;}E[MAXN];
int main(){
scanf("%d",&n);
for(int i=1;i<=... | 0 | 37,143,649 |
#include <vector>
#include <iostream>
using namespace std;
#define INF 10000000
int main()
{
unsigned n, m; cin >> n >> m;
vector<int> d(m);
vector<int> dp(n + 1, INF);
for (vector<int>::size_type i = 0; i < m; i++)
{
cin >> d[i];
}
dp[0] = 0;
for (unsigned i = 1; i <= n; i++)
{
for (vector<int>::size_type... | #include <bits/stdc++.h>
#define __Imperial_Lord__ ONLINE_JUDGE
#define _cps CLOCKS_PER_SEC
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define rep(i, l, r) for (long long i = (l); i < (long long)(r); i++)
#define repb(i, r, l) for (long long i = (r); i > (l... | 0 | 32,837,791 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<ll, ll>;
int main()
{
ll n, d, a;
cin >> n >> d >> a;
vector<pint> xh(n);
rep(i, n) cin >> xh[i].first >> xh[i].second;
rep(i, n) xh[i].second = (xh[i].second % a == 0)... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
int g[10][10], ans;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int n, m, x, y; cin >> n >> m;
while(m--) {
cin >> x >> y;
g[x][y]++, ++g[y][x];
}
vector<int> v(n);
for(int i = 0; i < n; i++) v[i] = i + 1;
... | 0 | 82,243,592 |
#include<iostream>
int main(){
int a, b, c;
std::cin >> a >> b >> c;
if(c >= a && c <= b)
std::cout << "Yes" << std::endl;
else
std::cout << "No" << std::endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(),(a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<int,int>
#define priq... | 0 | 12,069,184 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, const char *argv[]) {
int n, m;
cin >> n >> m;
vector<ll> va(n);
for (int i = 0; i < n; ++i) {
cin >> va[i];
}
vector<ll> csum{0};
partial_sum(va.begin(), va.end(), back_inserter(csum));
map<ll, ll> cnts;
for (a... | #include <stdio.h>
#include <string.h>
#include <limits.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
template<class _T> ... | 0 | 88,127,198 |
#include <iostream>
#include <iomanip>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for(ll i=init;i<(n);i++)
ll gcd(ll a, ll b) {
if (b > a)swap(a, b);
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
int ma... | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define int long long
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
int n, m;
cin >> n >> m;
vector<int> a(n), b(... | 0 | 36,043,142 |
#include<iostream>
#include<map>
using namespace std;
int main(){
map<string,int> word;
string s,ss;
int a = 0,b = 0;
while(cin >>s) word[s]++;
for(map<string,int>::iterator it = word.begin(); it!=word.end(); it++){
if(a < it->second){a = it->second;ss = it->first;}
if(b < (it->first).size()){b = (it... | #include <bits/stdc++.h>
#define rr(i, b) for (int i = 0; i < int(b); i++)
#define vi(n, a) vector <int> a(n); rr(i, n) cin >> a[i]
#define pvec(a) rr(i, a.size()) cout << a[i] << " "; cout << endl
#define bug(x) cout << #x << " " << x << endl
#define ll long long
#define vii vector <int>
using namespace std;
void s... | 0 | 3,554,401 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD1 1000000007
#define MOD2 1000000009
#define FOR(a,b) for(ll i=a;i<b;i++)
#define endl "\n"
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
int ans;
int sum = 0;
for (int i = 0; i < s.size(); i+... | #include<bits/stdc++.h>
using namespace std;
#define ms(a,v) memset(a,v,sizeof a)
#define lll long long
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Read freopen("input.txt", "r", stdin)
#define Write ... | 0 | 14,869,380 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
const ll inff = 1000000000000000000;
int main(){
string s, t;
cin >> s >> t... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int INF = 1 << 30;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> dp(n + 1, INF);
rep(i, n) {
auto itr = lower_bound(dp.begin(), dp.end(), a[i]);
*itr = ... | 0 | 61,684,952 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
#include <cmath>
using namespace std;
#define ... | #include<iostream>
using namespace std;
#include<vector>
int main(){
while(1){
int n;
cin>>n;
if(n==0)break;
int ans=0;
int sta=0;
int l=0;
int r=0;
for(int i=0;i<n;i++){
string s;
cin>>s;
if(s=="lu"){
l=1;
}else if(s=="ru"){
r=1;
}else if(... | 0 | 87,100,283 |
#include<stdio.h>
#include<queue>
#include<assert.h>
#include<tuple>
#include<string>
#include<algorithm>
#include<iostream>
#include<map>
#include<string.h>
#include<vector>
#include<math.h>
#include<stdlib.h>
#include<set>
#include<ctype.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef... | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using std::string;
using std::vector;
us... | 0 | 69,596,955 |
#include<iostream>
#include<set>
#include <bitset>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include <cstdio>
#include<algorithm>
#include <sstream>
#include<string>
#include<string.h>
#include <cmath>
#include <iomanip>
#include <string>
#include<list>
#include <limits>
#include <numeric>
#includ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
ll mod=1e9+7;
#define PI 3.1415926535897932385
#define inf 9e18
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
string char_to_str(char c){string tem(1,c);return tem;}
typedef pair<long long, long long> ii;
... | 0 | 54,338,212 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const ll mod = 1e9+7;
const int N = 2e5+5;
void solve(){
int x,xx,y,yy;
cin>>x>>y>>xx>>yy;
int dx = xx-x;
int dy = yy-y;
cout<<xx-dy<<" "<<yy+dx<<" "<<x-dy<<" "<<y+dx<... | #include <iostream>
using namespace std;
int main()
{
int d;
int area;
while (cin >> d) {
area = 0;
for (int i=0; i<(600/d); i++) {
area += i * i * d * d * d;
}
cout << area << endl;
}
return 0;
} | 0 | 10,454,549 |
#include<cstdio>
int main() {
int a,b,c,x,k;
k =0;
scanf ("%d %d %d",&a,&b,&c);
for (int x = a;x <= b;x++){
if (c % x == 0){
k = k + 1;
}
}
printf("%d\n",k);
} | #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;
vector<int> a(n);
int num = 1;
vector<int> b;
rep(i, n)
{
cin >> a[i];
if (a[i] == num)
{
... | 0 | 40,177,420 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
int h,w;
string s[30][30];
signed main(){
cin>>h>>w;
rep(i,h){
rep(j,w){
cin>>s[i][j];
if(s[i][j]=="snuke"){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
constexpr long long mod = 1000000007;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0... | 0 | 98,948,024 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=n;i<=999;i++){
if(i/100==(i/10)%10&&(i/10)%10==i%10){
cout<<i<<endl;
return 0;
}
}
return 0;
} | #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>... | 0 | 40,196,334 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
#define int long long
signed main() {
int n,m;
cin >> n >> m;
priority_queue<int> que;
rep(i,n) {
int a; cin >> a;
que.push(a);
}
while(m--) {
int v = que.top();
que.pop();
v/=2;
que.pu... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()... | 0 | 58,967,701 |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int a1 = 1;
int an = n;
int answer = ((a1 + an)*n)/2;
cout << answer << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define max(a,b) (((a) < (b)) ? (b) : (a))
#define abs(a) (((a) < 0) ? (-(a)) : (a))
int main(void) {
int64_t N,Z,W;
cin >> N >> Z >> W;
vector<int64_t> a(N);
for(int i=0;i<N;i++) {
cin >> a[i];
}
if(N == 1) {
cout << abs(W-a[0]) << "... | 0 | 27,332,109 |
#include <iostream>
#include <vector>
using value_t = std::size_t;
using values_t = std::vector<value_t>;
using dptbl_t = std::vector<std::size_t>;
static const std::size_t INFINITY = (1 << 29);
std::size_t coin_changing(const values_t& C, value_t n)
{
dptbl_t T(n + 1, INFINITY); T[0] = 0;
for (std::size_t ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+10;
ll a[N],prime[N],vis[N];
int n,flag=0,k;
bool isprime[N];
void Prime()
{ memset(isprime,1,sizeof(isprime));
k=0;
prime[1]=0;
for(int i=2;i<N;i++){
if(isprime[i]){
prime[k++]=i;
for(int j=2;i*j<N... | 0 | 32,129,676 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";ne... | 0 | 73,825,843 |
#pragma region header
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cctype>
#include <assert.h>
#include <time.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#i... | #include <iostream>
using namespace std;
int main() {
int a;
scanf("%d",&a);int ar[a],c=1;
for(int i=0;i<a;i++)
scanf("%d",&ar[i]);
for(int i=1;i<a;i++)
ar[i]=min(ar[i],ar[i-1]);
for(int i=1;i<a;i++)
if(ar[i]!=ar[i-1])
++c;
printf("%d",c);
return 0;
} | 0 | 97,234,236 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll,ll> pll;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ub upper_bound
#define lb lower_bound
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define reps(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reps(i,0,n)
#define all(x) (x).begin(),(x).end()
#define INF (1000000001)
#define MOD (1000000007)
#define PI (acos(-1))
int main(){
int N,K;
cin >> N >> K;
int a[100010];
rep(i,N)... | 0 | 5,293,016 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define rep(i, n) REP(i, 0, n)
#define rep... | #define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<map>
#include<stdexcept>
template<typename T>
class union_find{
std::map<T, T> parent;
std::map<T, T> rank;
public:
void add(const T& t){ parent[t] = t; rank[t] = 0; }
const T& find(T t)const{
while (true){
typename std::map<T, T>::const_iterator it = p... | 0 | 54,581,453 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#define REP(i,n) for(int i=0;... | 0 | 27,217,402 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
int x, y;
while(1){
cin >> x >> y;
if (x == 0 && y == 0) break;
if(x < y) printf("%d %d\n", x, y);
else printf("%d %d\n", y, x);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef pair<ii, int> ri3;
#define mp make_pair
#define pb push_back
#define fi first
#define sc second
#define SZ(x) (int)(x).size()
#define ALL(x) begin(x), end(x)
#define... | 0 | 76,632,361 |
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm... | #include <iostream>
#include <cstring>
#include <map>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <list>
#include <numeric>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <math.h>
#include <stack>
#include <climits>
#include <bits... | 0 | 2,619,695 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,D;
cin >> N >> D;
vector<vector<int>> data(N, vector<int>(D));
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
cin >> data.at(i).at(j);
}
}
int d = 0;
int count = 0;
for (int i = 0; i < N-1; i++) {
for (int ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vec vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define inf ... | 0 | 10,862,245 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const double pi = 3.1415926535897932384;
const int INF = 1000000000;
const ll LINF = 1000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijklmnopqrstuvwxyzabc";
const ll MOD = 1000000007;
struct UnionFind... | #include<iostream>
#include<stdio.h>
#include<math.h>
using namespace std;
#define MAX 256
int main(void){
int n;
scanf("%d", &n);
int A[4][3][10] = { 0 };
int b, f, r, v;
for (int i = 0; i < n; i++){
scanf("%d%d%d%d", &b, &f, &r, &v);
A[b - 1][f - 1][r - 1] += v;
}
for (int i = 0; i < 4; i++){
for (int j ... | 0 | 82,428,025 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S,T;
cin>>S>>T;
cout<<T<<S;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
cin >> n;
a = n / 1000;
b = n % 1000 / 100;
c = n % 1000 % 100 / 10;
d = n % 1000 % 100 % 10;
if (a == b) {
if (b == c) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}... | 0 | 64,779,213 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int r;
double d;
cin >> r;
r = (3.14159265359)*r*r;
d = r/(3.14159265359*1);
cout << int(d)+1;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
string s;
int main(){
cin >> s;
int n = s.size();
if(n == 26 && s == "zyxwvutsrqponmlkjihgfedcba"){
cout << -1 << endl;
}else if(n == 26){
string t = s;
next_permutation(s.begi... | 0 | 36,191,963 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<vector<int>> v(100010);
bool used[100010];
int dfs(int p){
used[p] = true;
int x = 0;
for(auto i:v[p]){
if(!used[i]){
x ^= dfs(i) + 1;
}
}
return x;
}
signed main(){
ios::sync_with_stdio(false);... | 0 | 87,209,352 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int k;
string s;
cin >> k >> s;
int size = s.size();
if(size <= k)
{
cout << s << "\n";
} else
{
cout << s.substr(0, k) + "..." << "\n";
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define F first
#define S second
#define pb push_back
#define mp make_pair
const int MOD = 1000000007;
const int N = 1e5 + 18;
int32_t main()
{
ios_base::sync_with_stdio(false); cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.t... | 0 | 78,126,730 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#include<tuple>
#define DIV 1000000007
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
ll N, K; cin >> N >> K;
ll tot = 0,... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
#define ll long long
#define loop(i,n) for(int i=0; i<n; i++)
#define loop1(i,n) for(int i=1; i<=n; i++)
#define loopi(i,s,e) for(int i=s; i < e; i++)
#define loopiRev(i,s,e) for(int i=s; i >= e; i--)
#define PI 3.14159265359
#def... | 0 | 23,968,690 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=5e18;
int main() {
ll a,b,c,d;
cin >> a >> b >> c >> d;
cout << min(a,b)+min(c,d) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define INIT(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[i... | 0 | 34,804,971 |
#include<iostream>
using namespace std;
long long factorial(long long n){
long long int ans;
if(n==0)
ans=1;
else
ans =n*factorial(n-1);
return ans;
}
int main(){
long long n=0;
cin>>n;
long long int ans=1;
ans=factorial(n);
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, c, k;
cin >> n >> c >> k;
int a[n];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
sort(a, a + n);
int i = 0, bus = 0;
while (i < n)
{
int ptr = i + 1;
while (ptr < (i + c) && ptr < n)
... | 0 | 64,777,989 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
int n,m;
cin >> n >> m;
vector<vector<int>>v(m);
for(int i = 0; i < m; i++)
{
int k;
cin >> k;
v[i].resize(k);
for(int j = 0; j < k; j++)
{
cin >> v[i][j];
v[i][j]... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | 0 | 84,701,917 |
#define _LIBCPP_DEBUG 0
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1e9 + 7;
int main(void){
ll N,K; cin>>N>>K;
ll ans = 0;
ans = (N/K) * (N/K) * (N/K);
ll tmp = (N/(K/2))-(N/K);
if(K%2==0) ans += tmp*tmp*tmp;
cout<<ans<<endl;
} | #include <iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
while(1){
int n;
cin >> n;
if(n==0)break;
string s;
int r=0,l=0,sum=0,ans=0;
rep(i,n){
cin >> s;
if(s[0] == 'l'){
if(l) l=0;
else l=1;
}
if(s[0] == 'r'){
if(r) r=0;
else r=1;
... | 0 | 56,195,793 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int> one;
vector<int> zero;
bool counting_one = true;
int cnt = 0;
for (int i=0; i<N; i++) {
if (counting_one) {
if (S[i] == '1') {
cnt++;
} else {
one.push_back(... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vec... | 0 | 56,435,317 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define fr(i,k,n) for (int i = k; i < n; ++i)
#define fri(i,k,n) for (int i = k; i >= n;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
template <typename T>
... | 0 | 40,571,638 |
#include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
int i=... | #include <iostream>
#include <algorithm>
#include <climits>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
using namespace std;
#define rep(i, n) for (int i=0; i<int(n); i++)
#define all(c) (c).begin(), (c).end()
#define MAX_W 1010
#define MAX_H 1010
int H, W, N;
char A[MAX_H][MAX_W];
vector<bool... | 0 | 50,396,599 |
#include<algorithm>
#include<cstdio>
#include<vector>
#define ll long long
using namespace std;
vector<pair<ll, ll>> vt;
vector<pair<ll, ll>>vt1;
int main()
{
ll n;
scanf("%lld", &n);
ll sum = 0;
ll gap = 1234567890;
for (int i = 0; i < n; i++)
{
ll q, w;
scanf("%lld %lld", &q, &w);
sum += q;
if (q < w)
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9+7;
constexpr ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main(int argc, char **argv)
{
ll N; cin >> N;
vector<string> S(N);
REP(i, N) cin >... | 0 | 78,637,367 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define INF 1001001001
#define INFll 100100100100100
#define PrintVec(x) for (auto elementPrintVec: x) { cout << elementPrintVec << " "; } cout << endl;
using namespace std;
using ull = unsigned long long;
using ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 0 | 96,329,280 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
size_t s;
cin >> s;
vector<bool> a(1000000, false);
long long m = 1;
a[s] = true;
long long current = s;
while (true) {
current = (current % 2 == 0) ? (current / 2) : (3 * current + 1);
if (a[current]) {
... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
class DisjointSet{
public :
vector<int> rank,p;
DisjointSet(){}
DisjointSet(int size)
{
rank.resize(size,0);
p.resize(size,0);
for(int i=0;i<size;i++)
makeSet(i);
}
... | 0 | 74,138,284 |
#include <bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<n;++i)
#define repe(i,k,n) for(int i=k;i<=n;++i)
typedef long long in;
using namespace std;
int main()
{
cin.tie(0);cout.tie(0);
ios::sync_with_stdio(false);
in h,w;
cin >> h >> w;
in blo = h*w;
if (h == 1 || w == 1) {
cout << 1;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> v(n);
for(int &e : v)
cin >> e;
vector<int> v2 = v;
sort(v2.rbegin(), v2.rend());
for(int &e : v)
cout << (e == v2[0] ? v2[1] : v2[0]) << '\n';
} | 0 | 23,114,573 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
string sam="abcdefghijklmnopqrstuvwxyz";
vector<int> num(26);
for(int i=0; i<s.size(); i++){
for(int j=0; j<26; j++){
if(s.at(i)==sam.at(j)){
num.at(j)++;
break;
}
}
}
bool judge=true;
for(int i=0; i<26; i++){
if(n... | #include "bits/stdc++.h"
using namespace std;
using ll=long long;
const int MOD=1e9+7;
const int MAX_N=1e5;
ll dp[MAX_N][2];
string L;
ll rec(int k=0,bool tight=true){
if(k==L.length()) return 1;
if(dp[k][tight]!=-1) return dp[k][tight];
else dp[k][tight]=0;
if(tight){
if(L[k]=='1'){
dp[k][ti... | 0 | 70,847,139 |
#include<iostream>
#include<algorithm>
using namespace std;
int main (void)
{
long long int a,b,i;
string s;
cin>>a>>s;
b=(s[0]-'0')*100+(s[2]-'0')*10+s[3]-'0';
a=a*b/100;
cout<<a<<endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#d... | 0 | 94,754,609 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <tuple>
#include <bitset>
#include <cstdio>
#include <cmath>
#include <iomanip... | #include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using... | 0 | 94,060,689 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
#define co(a) cout<<a<<endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) pu... | #include <bits/stdc++.h>
#define dcout cout << fixed << setprecision(15)
#define rep(i, a) for(int i = 0; i < a; i++)
#define arep(i, x) for(auto i : x)
#define all(v) v.begin(), v.end()
#define int long long
#define F first
#define S second
#define VE vector<int>
#define pb(x) push_back(x)
using namespace std;
signed ... | 0 | 6,903,082 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int cnt[101];
fill(cnt,cnt+101,0);
int ans=0,i;
while(cin>>i)
{
cnt[i]++;
ans=max(ans,cnt[i]);
}
for (int i = 0; i < 101; ++i)
{
if(cnt[i]==ans) cout<<i<<endl;
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define irep(i, n) fo... | 0 | 70,556,000 |
#include<iostream>
#include<vector>
using namespace std;
void Change(int x, int y){
int z = y;
y = x;
x = z;
}
vector<int> Subvec(vector<int> X, int p, int l){
vector<int> Y;
for(int i = p; i < p+l; i++) Y.push_back(X[i]);
return Y;
}
vector<int> SelectionSort(vector<int> A, int i){
int N = A.size() - 1;
int j_... | #include <bits/stdc++.h>
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rp(i,n) for (int i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define all_acc(x) (x).begin(), (x).end(), 0LL
#define int long long
#define absSort(v) sort(a.begin(), a.end(), [](int i, int j... | 0 | 36,783,479 |
#include <iostream>
#include <vector>
#include <map>
#include <cstring>
#include <string>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <sstream>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define repp(i,k,n) for... | #include <stdio.h>
#include <string.h>
int main(){
int lg;
scanf ("%d", &lg);
char word[lg+1];
int st1 = 0;
int st2 =lg/2;
int wall = st2-1;
scanf ("%s", word);
if (lg % 2 != 0){
printf ("No\n");
return 0;
}
for (int i=0; i<=wall; i++){
if (word[st1+i] == word[st2+i]){
continue;
}
else {
print... | 0 | 35,349,907 |
#include <algorithm>
#include <iostream>
int main(void) {
int ary[5], i;
for (i = 0; i < 5; i++) {
std::cin >> ary[i];
}
std::sort(ary, ary + 5, std::greater<int>());
for (i = 0; i < 5; i++) {
std::cout << ary[i];
if (i == 4) {
std::cout << std::endl;
} else {
std::cout << " ";
... | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ty... | 0 | 57,356,596 |
#include <iostream>
int main() {
long n, min, max, sum = 0;
bool first = true;
std::cin >> n;
while (std::cin >> n) {
if (first) {
first = false;
min = max = n;
sum += n;
continue;
}
if (n < min) {
min = n;
}
... | #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#include<map>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vec... | 0 | 93,368,982 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
#define INF 2030405060
int main()
{
int n,m;cin>>n>>m;
int i,j,k;
vector<int> s(m);
vector<int> t(m);
vector<int> d(m);
rep(i,m)cin>>s[i]>>t[i]>>d[i];
vector<vector<int>> g... | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define INF 100000000000000
using namespace std;
int main()
{
FAST
ll n,k;
cin>>n>>k;
if(k == n)... | 0 | 75,551,119 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#i... | 0 | 73,926,339 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define mp make_pair
ll mod = 10e9+7;
ll mod2 = 998244353;
int main(){
int n,k;cin>>n>>k;
vector<int> a(n);
re... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
#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)
#define ALL(x) x.begin(),x.end... | 0 | 42,619,022 |
#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() {
cin.tie(0);
ios::sync_with_stdio(... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
struct Edge {
const int from, to;
Edge(int from, int to) : from(from), to(to) {}
};
vector<vector<Edge>> ReadUndirectedGraph(
int n, int m, bool is_one_indexed=false) {
vector<vector<Edge>> graph(n);
for (int i =... | 0 | 46,790,731 |
#include <iostream>
using namespace std;
int main(){
int a=100000,b=0,t;
cin>>t;
for(int k=0;k<t;k++){
b=a*1.05;
b=(b+999)/1000*1000;
a=b;
}
cout<<a<<endl;
} | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#i... | 0 | 15,794,527 |
#include<bits/stdc++.h>
#include<cmath>
#define pb push_back
#define ld long double
#define mp make_pair
#define vl vector<ll>
#define vd vector<double>
#define vld vector<long double>
#define ll long long int
#define pl pair<ll, ll>
#define all(a) a.begin(), a.end()
#define forr(i, n) for(ll i=0; i<n; i++)
#define f... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)... | 0 | 3,801,061 |
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using ll = unsigned long long int;
using namespace std;
bool isdigit(char ch) {
return '0' <= ch && ch <= '9';
}
int main() {
... | #include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD = 1000000007;
const ll INF = 10000000000000;
#define all(v) v.begin(), v.end()
int main(){
string S,T;
cin >> S;
T="keyence";
rep(i,7){
ll j=0,t=0;
... | 0 | 5,858,815 |
# include <bits/stdc++.h>
# define rep(i, n) for(ll i = 0; i < (n); ++i)
# define reps(i, n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(ll i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(ll i=((int)(n)); i>0; --i)
# define ll long long
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((i... | #include <iostream>
#include <cstdio>
constexpr int MAX_SIZE = 250 + 1;
int heap[MAX_SIZE];
int parent(int i) {return i / 2;}
int left(int i) {return 2 * i;}
int right(int i) {return 2 * i + 1;}
int main() {
int n;
std::cin >> n;
for (int i = 1; i <= n; i++) {
std::cin >> heap[i];
}
for(int ... | 0 | 91,363,162 |
#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 <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for(int i=0;i<(n);++i)
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RREP(i, n) for(int i=(int)(n);i>=0;--i)
#define RFOR(i, a, b) for(int i=(int)(a);i>=(int)(b);--i)
#define ALL(a) (a).begin(),(a).end()
#define DUMP(x... | 0 | 30,130,263 |
#include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define itn int
#define fi first
#define se second
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n,m,a;
int dp[1000000]={};
cin>>n>>m;
dp[0]=1;
dp[1]=1;
for(int i=0;i<m;i++){
cin>>a;
dp[a]=-1;
}
for(int i=... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const int MOD = 1000000009;
const long long INF = 1LL << 60;
int main() {
int N;
cin >> N;
vector<int> P(N);
for (int ... | 0 | 4,392,037 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int h,n;
int a;
cin>>h;
cin>>n;
for(int i=0; i<n; i++){
cin>>a;
h=h-a;
}
if(h>0)
cout<<"No";
else
cout<<"Yes";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int a, b;
cin >> a >> b;
if (a > b)
{
for (int i = 0; i < a; i++)
cout << b;
cout << endl;
}
else
{
for (int i = 0; i < b; i++)
cout << a;
cout << endl;
... | 0 | 28,913,217 |
#include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a%b==0) cout<<'0';
else cout<<'1';
} | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | 0 | 2,121,423 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
#include <stack>
#include <queue>
#include <list>
#include <numeric>
#include <fstream>
#include <cassert>
using namespace std;
#define TEST
#ifdef TEST
#define dout... | #include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define INF 0x3f3f3f3f
int map[15][15];
void floyd(int n)
{
for(int k=0;k<=n;k++)
{
for(int i=0;i<=n;i++)
{
for(int j=0;j<=n;j++)
{
map[i][j]=min(map[i][j],map[i][k]+map[k][j]);
}
}
}
}
int main()
{
int n,i,j,a,b,t;
wh... | 0 | 49,958,779 |
#include <climits>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<vector<int>> G(N, vector<int>(N, INT_MAX));
rep(i, N) G[i][i] = 0;
vector<int> A(M);
vector<int> B(M);... | #include <bits/stdc++.h>
#include <set>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 998244353;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for(... | 0 | 70,344,638 |
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
for(int i=0; i<n; i++){
int y, m, d;
cin >> y >> m >> d;
int ans = 0;
ans -= d-1;
if(y%3 == 0){
ans -= 20 * (m-1);
}else{
if(m%2 == 0){
ans -= 20 * (int)((m-1)/2+1);
ans -= 19 * (int)((m-1)/2)... | #include <iostream>
using namespace std;
int main(void){
int d,sum;
while(cin>>d){
sum=0;
for(int i=1 ;d*i <= 600-d;i++){
int f=d*i;
sum += f*f*d;
}
cout<<sum<<endl;
}
return 0;
} | 0 | 4,418,101 |
#include <iostream>
#include <cstdlib>
#include <time.h>
#include <algorithm>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <array>
#include <string>
#include <iomanip>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#includ... | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 0 | 25,653,436 |
#include <iostream>
typedef long long ll;
using namespace std;
int main() {
string s; cin >> s;
ll k; scanf("%lld", &k);
ll ans;
if (s[0] != '1') ans = s[0] - '0';
else {
int cnt = 0;
while (s[0] == '1') {
s = s.substr(1, s.size() - 1);
++cnt;
}
if (cnt >= k) ans = 1;
else ans = s[0] - '0';
}
pri... | #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... | 0 | 72,802,632 |
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+7;
int n , a[N][3] ,f[N][3] ;
int main()
{
cin >> n ;
for(int i=1 ; i<=n ; i++)
{
cin >> a[i][1] >> a[i][2] >> a[i][3];
}
f[1][1]=a[1][1];
f[1][2]=a[1][2];
f[1][3]=a[1][3];
for(int i=2 ; i<=n ; i++)
{
f[i][1... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define PB push_back
#define MP make_pair
#define PII pair<int,int>
#define VI vector<int>
#define VPII vector<PII>
#define X first
#define Y second
#define IOS ios::sync_with_stdio(0);cin.tie(0);
#define IN freopen("in", ... | 0 | 13,333,210 |
#include<bits/stdc++.h>
#define ll long long
#define P pair<int,int>
#define PP pair<P,int>
using namespace std;
int n, m, ans;
vector<vector<int>> g(10);
void dfs(vector<int>v, int x){
if(v.size() == n)ans++;
for(auto i:g[x]){
bool had = false;
for(auto j:v){
if(i == j) had = true;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ... | 0 | 93,293,878 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
ll r,d;
vector<ll> x(11);
cin >> r >> d >> x[0];
for (int i = 0; i <= 10; i++)
{
x[i+1] = r*x[i] - d;
}
f... | #pragma target("avx")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>>;
#define REP(i,b,e) for(ll i=b; i<e; i++)
#define... | 0 | 39,473,478 |
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | #include <bits/stdc++.h>
#define INF 1000000000000000001
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main()
{
ll N, M;
cin >> N >> M;
ll ans = 0;
vector<ll> A(N + 1, 0);
for (ll i = 0; i < N; ++i)
{
ll a;
cin >> a;
A.at(i + 1) = (A.at(i) + a) % M;
}
sort(A.begin(),... | 0 | 89,594,925 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout <... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inl... | 0 | 27,014,614 |
#include <bits/stdc++.h>
#define newl "\n"
using namespace std;
using lli = long long int;
using vvint = vector <vector <int>>;
const int mod = 1e9 + 7;
const int N = 2e5 + 1;
void solve(){
int n,m;
cin >> n >> m;
vector <vector <pair <int,int>>> p(n + 1);
for(int i = 0;i < m;++i){
int P,Y;
cin >> P >> Y;
p[P... | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
... | 0 | 72,142,020 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,... | #include <iostream>
using namespace std;
int main(){
int a,b,c;
int h;
cin>>a>>b>>c;
if(a>b){
h=a;
a=b;
b=h;
}
if(b>c){
h=b;
b=c;
c=h;
}
if(a>c){
h=a;
a=c;
c=h;
}
if(a>b){
h=a;
a=b;
b=h;
}
cout<<a<<' '<<b<<' '<<c<<endl;
} | 0 | 62,690,321 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int n, k;
cin >> n >> k;
vector<bool> sunuke(n, false);
for (int i = 0; i < k; i++)
{
int d;
cin >> d;
int candy;
for (int j = 0; j < d; j++)
{
cin >> candy; candy--;
sunuke[candy] = true;
}
}
int ans = 0;
for (int i = 0; i < n; i+... | #include<bits/stdc++.h>
using namespace std;
#define tpl tuple<int, int, int>
#define mt make_tuple
#define LIM 100000
int n, dp[LIM+5][4], vis[LIM+5][4];
vector<tpl> v;
int f(int pos, int k){
if(pos >= n) return 0;
if(vis[pos][k]) return dp[pos][k];
vis[pos][k] = 1;
int ans;
if(k == 0) ans = ge... | 0 | 7,288,905 |
#include <iostream>
#include <algorithm>
#include<string.h>
using namespace std;
const int maxn = 2e5 + 10;
#define ll long long
ll a[200005];
ll b[200005], c[200005], d[200005], ans;
int upperbound(int l, int r, ll s){
while(l<r){
int m = (l+r)/2;
ll h = b[m] ^ b[s - 1];
if... | #include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#include <cassert>
#pragma war... | 0 | 48,036,006 |
#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 REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
template<class T> inline bool chmax(T& a, T b)... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
usi... | 0 | 43,879,010 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std:... | #include <stdio.h>
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
using std::terminate;
using std::sort;
using std::find;
using std::vector;
template<class T> inline T min(T X, T Y) {
return X < Y ? X : Y;
}
template<class T> inline T ... | 0 | 25,812,855 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int p = x2+(y1-y2);
int q = y2+(x2-x1);
int r = x1+(y1-y2);
int s = y1+(x2-x1);
cout << p << " " << q << " " << r << " " << s << endl;
} | #include<iostream>
using namespace std;
int main(void)
{
int noth,easu,n,i2,x,y,j1;
int road[18][18];
while(1){
cin>>easu>>noth;
if(easu==0&¬h==0)break;
j1=0;
cin>>n;
for(int i=1;i<=easu;i++){
for(int j=1;j<=noth;j++){
road[i][j]=-1;
... | 0 | 31,831,723 |
#include <vector>
#include <list>
#include <map>
#include <unordered_map>
#include <climits>
#include <set>
#include <unordered_set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <ioman... | #include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main()
{
ll N;
cin >> N;
vector<ll> A(N);
vector<ll> B(N);
ll a_sum = 0, b_sum = 0;
for (ll i = 0; i < N; ++i) {
cin >> A.at(i);
a_sum += A.at(i);
}
for (ll i = 0; i < ... | 0 | 50,064,201 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
int main() {
int k;
cin >> k;
queue<long int> q;
for(int i = 1; i <= 9; i++) {
q.push(i);
}
while(k > 1) {
for(int i = -1; i <= 1; i++) {
long int o = q.front() % 10 + i;
... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
#define all(v) v.begin(),v.end()
#define double long double
#define trace1(x) cerr<<#x<<": "<<x<<endl
#define trace2(x, y) cerr<<#x... | 0 | 36,854,421 |
#include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef uint64_t ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
int n, val, k;
cin >> n >> k;
ll acc = 0;
vector<ll> dp = {0};
for(in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll N;
cin >> N;
map<ll,ll> mp;
mp[0] = 1;
ll now = 0;
rep(i, 0, N){
ll a;
cin >> a;
now += a;
mp[now]++;
... | 0 | 28,986,186 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,n) for(int i=0;i<n;i++)
template<typename T>
void chmax(T &a,T b){
if(a<b)a=b;
}
int ans=-1e18,v[5555],c[5555],used[5555];
signed main(){
int n,k;cin>>n>>k;
REP(i,n)cin>>v[i];
REP(i,n)cin>>c[i];
vector<vector<int>>w;
REP(i,n){... | #include <iostream>
#include <string>
#include <stdio.h>
#include <cmath>
#include <cfloat>
#include <algorithm>
#include <functional>
#include <numeric>
#include <vector>
using namespace std;
const double PI=acos(-1);
int main(){
int a, b, m;
cin >> a >> b >> m;
vector<int> aa(a), bb(b);
int am = 99999... | 0 | 17,709,102 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 100000000... | 0 | 77,778,210 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
const int mx=200010;
const ll mod... | #include <iostream>
#include <string>
#include <stack>
using namespace std;
int main( void )
{
string in;
while(getline(cin, in), in[0] != '.') {
stack<char> st;
bool hit = true;
int len = in.size();
for(int i=0; i < len; ++i) {
if(in[i] == '(' || in[i] == '[') {
st.push(in[i]);
}
else if(in[i] =... | 0 | 8,118,273 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_p... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(i,... | 0 | 82,634,445 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0;i < (int)n;i++)
#define repb(i, n) for(int i = (int)n;i >= 0;i--)
#define reps(i, m, n) for(int i = (int)m;i < (int)n;i++)
#define repsb(i, m, n) for(int i = (int)m;i >= (int)n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#defin... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define REP(i, n) for(int i=0; i<=n; i++)
#define repr(i, n) for(int i=n; i>0; i--)
#define REPR(i, n) for(int i=n; i>=0; i--)
#define FOR(i, a, b) for(int i=a; i<b; i++)
#define ALL(v) v.begin(),v.end()
#define pb push_back
#define e... | 0 | 41,687,515 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin >> A >> B;
vector<vector<int>> data(1000, vector<int>(3,0));
for (int i = 0; i < 1000; i++) {
for (int j = 0; j < 3; j++) {
if (j == 0){
data.at(i).at(j) = i+1;
}
else if (j == 1){
data.at(i).at(j) = (i... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | 0 | 59,415,537 |
#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() {
int ... | #include <stdio.h>
int main() {
int t,zero = 0,flag = 0;
scanf("%d",&t);
long long int n,max = 1e18,sum = 1;
for(int i=0;i<t;i++){
scanf("%lld",&n);
n>max ? flag = 1 : flag;
sum *= n;
n==0 ? zero = 1 : max /= n;
}
if(zero ==1){
puts("0");
}
else{
flag==1 ? puts("-1") : printf("%... | 0 | 50,308,442 |
#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 <cctype>
#in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
ll count_dup(string s){
ll a = 0;
for (int i = 0,j=0; i < s.size(); i=j)
{
while (j < s.size() && s[i] == s[j])j++;
a += (j-i)/2;
}
return a;
}
int main()
{
string s;
ll k;
cin >> s >... | 0 | 46,987,952 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | #include <iostream>
#include <algorithm>
using namespace std;
struct Card
{
int num;
char type;
};
void trace(int n, Card c[])
{
for (int i = 0; i < n; ++i)
{
cout << c[i].type << c[i].num;
if (i < n - 1)
{
cout << " ";
}
}
cout << endl;
}
void bubbleSort(int n, Card c[])
{
for (int i = 0; i < n; ++i... | 0 | 38,064,500 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define repr(i, a, n) for (ll i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll l, r;
cin >> l >> r;
int ans = 1e15;
rep(i, l, min(l + ... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
# define M_PI 3.14159265358979323846
const int M=1e9+7;
long long mod(long long x){
return ((x%M + M)%M);
}
long long add(long long a, long long b){
... | 0 | 69,651,179 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double value = v[0];
for (int i = 1; i < n; i++) {
value = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<vector<int>> data(3, vector<int>(3));
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
cin >> data.at(i).at(j);
}
}
int N;
cin >> N;
vector<int> b(N);
for (int i = 0; i < N; i++)
cin >> b.at(i);
for (int i = 0... | 0 | 51,907,066 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.