code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll r, d, x;
cin >> r >> d >> x;
ll ans = r * x - d;
for (int i = 0; i < 10; i++)
{
cout << ans << endl;
ans = r * ans - d;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define print(i) cout << i << endl
#define all(i) (i).begin(),(i).end()
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vi;
typedef vector<vector<int> > vii;
typedef vector<... | 0 | 99,256,263 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
int ans = 0;
REP(i,n){
cin >> a[i];
if(i != 0){
ans = g... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
int main() {
int H, W, A, B;
cin >> H >> W >> A >> B;
if (A == 0 && B == 0) {
for (int j = 0; j < H; j++) {
for (int i = 0; i < W; i++) {
cout << 0;
}
cout << endl;
}
return 0;
}
if (A == 0) {
for ... | 0 | 64,520,949 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
using namespace std;
const int MAX_FRAME = 10000;
int makeLinerCongRand(int a, int b, int c, int x) {
return (a * x + b) % c... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <sstream>
#include <math.h>
#include <map>
#include <set>
#include <ios>
#include <iomanip>
using namespace std;
long long par[2001000];
long long ranks[2001000];
long long diff_weight[2001000]={};
void init(l... | 0 | 79,339,619 |
#include <iostream>
#include <vector>
#include <string>
#include <bitset>
#include <cmath>
#include <queue>
#include <iomanip>
#include <algorithm>
#include <stack>
using namespace std;
#define INF 1e18
#define int long long
signed main() {
string s; cin >> s;
string substr4 = s.substr(0, 4);
string substr8... | #include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define mt make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(... | 0 | 89,092,633 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int flag = 1;
if (s.size() + 1 == t.size()) {
for (int i = 0; i < s.size(); i++) {
if (s[i] != t[i]) {
flag = 0;
}
}
}
flag == 1 ? cout << "Yes" : cout <... | #include <bits/stdc++.h>
using namespace std;
#define _USES_MATH_DEFINES
#define x first
#define y second
int main() {
int n; cin >> n;
vector< pair<int, int> > P (n, {0, 0});
for(int i = 0; i < n; i++) {
cin >> P[i].x >> P[i].y;
}
sort(P.begin(), P.end(), [](auto a, auto b) -> int { return ... | 0 | 12,909,510 |
#define DEBUG
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define IOS { ios :: sync_with_stdio(false); cin.tie(0); cout.tie(0); }
#ifdef... | #include <cmath>
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cassert>
#include <deque>
#include <queue>
#include <map>
#include <set>
#define FOR(j,k,n) for (int j = k; j < (int)(n); j++)
#define MAXN 100000000000000000
#define newl printf("\n")
#define test(... | 0 | 93,951,577 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <math.h>
#define PI (3.1415926535898)
int main(void) {
double a, b, C, rad;
double S, L, h;
scanf("%lf %lf %lf", &a, &b, &C);
rad = C * PI / 180.0;
h = b * sin(rad);
S = a * h / 2.0;
L = a + b + sqrt((h * h) + ( (a - b * cos(rad)) * (a - b * cos(rad))))... | #include<iostream>
#include <stdio.h>
#include <math.h>
using namespace std;
bool num[1000000] = { false };
void primNumberCheck(){
num[2] = true;
int i, j, k;
for (i = 3; i <= 1000000; i += 2)
{
k = 0;
for (j = 3; j <= sqrt((double)i); j += 2)
{
if (i%j == 0)
... | 0 | 45,069,728 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(int ... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
#define DFS_WHITE -1
#define DFS_BLACK 1
vector<vi> AdjList;
vi dfs_num;
vi dfs_discover;
int numCC;
int count = 0;
int dfs(int u) {
dfs_num[u] = DFS_BLACK;
... | 0 | 14,755,261 |
#include<bits/stdc++.h>
#define pb push_back
#define pf push_front
using namespace std;
typedef long long int lli;
lli n,k,s,m,t,a,b,l,r,v,h,u,temp1,temp2,x,y,temp,q,d,mod=1e9+7,w,p,c,z;
lli grid[2000][2000],dp[2000][2000];
lli rec(lli i,lli j)
{
if(grid[i][j]==1)
{
dp[i][j]=0;
}
if(i==1&&j==1)
{
dp[i][j]=1;
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, tot = 0;
cin >> n;
map<string, int> prefix;
for (int i = 0; i < n; i++)
{
int val;
string s;
cin >> s >... | 0 | 68,735,996 |
#include<iostream>
using namespace std;
class Dice {
public:
int D1;
int D2;
int D3;
int D4;
int D5;
int D6;
Dice(int d1, int d2, int d3, int d4, int d5, int d6);
void Rotate_E();
void Rotate_N();
void Rotate_S();
void Rotate_W(... | #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 A[N];
int B[N];
for(int i = 0; i < N; i++){
cin >> A[i];
B[i] = A[i];
}
sort(B,B + N);
int max_v =... | 0 | 62,502,097 |
# include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
typedef long long ll;
ll a,b,c,k;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>a>>b>>c>>k;
if(k&1){
cout<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define int long long
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rrep(i,n) for (int i = (int)(n - 1); i >= 0; i--)
#define rep2(i,s,n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#... | 0 | 17,564,819 |
#include <cstdio>
#include <cctype>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
const int BUF = 1000000;
char buf[BUF], *p1, *p2;
inline char getChar() { return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, BUF, stdin), p1 == p2) ? EOF : *p1++; }
inline long long read() {
long long f =... | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<ll,double> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( ... | 0 | 54,822,031 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | #include<bits/stdc++.h>
using namespace std;
#define MAX 1000000007
#define ll long long int
int main(){
int n,m;
cin>>n>>m;
ll s[n],t[m];
for(int i=0;i<n;i++) cin>>s[i];
for(int i=0;i<m;i++) cin>>t[i];
ll dp[3000][3000];
memset(dp,0,sizeof dp);
dp[0][0]=1;
for(int i=0;i<=n;i++){
for(int j=0;j<=m;... | 0 | 51,769,116 |
#include <stdio.h>
int main ()
{
int x, y;
while (1)
{
{scanf("%d%d",&x,&y);
if(x==0&&y==0)
break;}
if(x<y) printf("%d %d\n",x,y);
if(y<x) printf("%d %d\n",y,x);
if(x==y) printf("%d %d\n",x,y);
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define optimize() ios_base:: sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
int main()
{
int n,l;
cin>>n>>l;
string bal[n];
for(int i=0;i<n;i++){
cin>>bal[i];
}
string mn=bal[0];
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j+... | 0 | 73,435,209 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vector<ll>>;
using vvc = vector<vector<char>>;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define repd(i,n) for(ll i = n - 1; i >= 0; i--)
#define all(... | #include<iostream>
using namespace std;
#define rep(i,j) for(i=0;i<j;i++)
int main()
{
int n;
while(cin>>n)
{
int a,b,c,d;
int cnt=0;
rep(a,10)rep(b,10)rep(c,10)rep(d,10)
{
if(a+b+c+d==n)cnt++;
}
cout << cnt<<endl;
}
return 0;
} | 0 | 98,247,244 |
#include<bits/stdc++.h>;
using namespace std;
typedef long long ll;
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
int main(){
#ifdef LOCAL
freopen("in.txt", "r", stdin);
#else
fastIO;
#endif
int n,l;
cin>>n>>l;
vector<string> v(n);
for(int i=0;i<n;i++){
string s;
cin>>s;
v.push_back(s);
}
sort(v.... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#define rep(i, begin, end) ... | 0 | 24,679,914 |
#include <bits/stdc++.h>
using namespace std;
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; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (long long)n; i++)
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vl = vector<ll>;
using vi = vector<int>;
using Graph = vector<vi>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
stri... | 0 | 33,534,912 |
#include <bits/stdc++.h>
using namespace std;
vector<string>v;
vector<int>ansl;
string s;
int ary[100005] = {0};
int main(){
int N,flgL = 0,flgR = 0, prc = 0;
string lu = "lu",ru = "ru", ld = "ld",rd = "rd";
cin >>N;
while(N != 0){
int cnt = 0;
flgL = 0,flgR = 0, prc = 0;
for(int i = 0;i<N;i++){
... | #include <bits/stdc++.h>
#define spc ' '
#define endl '\n'
using namespace std;
string check(string s1, string s2){
string ans = "";
int n1 = s1.size(), n2 = s2.size();
for(int i = 0; i < n1; i++){
for(int j = 0; j < n2; j++){
if(s1[i]==s2[j]){
s2[j] = '?';
... | 0 | 66,931,178 |
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (long long i = 0; i < (n); i++)
const ll INF = 1LL << 60;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
... | #include <bits/stdc++.h>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
private:
... | 0 | 73,014,025 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N; cin>>N;
vector<vector<ll>> S(N,vector<ll>(3,0));
for(ll i=0; i<N; i++){
ll a,b; cin>>a>>b;
S[i][0]=a;
S[i][1]=b;
S[i][2]=a+b;
}
sort(S.begin(), S.end(), [](auto& x, auto& y){return x[2] > y[2];});
ll asum=0,b... | #pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define IO ios_base::sync_with_stdi... | 0 | 17,409,110 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N_MAX = 100002;
int n;
ll L, t;
ll x[N_MAX];
int w[N_MAX];
vector <int> v1, v2;
int ans[N_MAX];
int last1 (int pos)
{
int l = 0, r = (int)v1.size() - 1;
while(l < r)
{
int mid = ((l + r + 1) >> 1);
if(x[v1[mid]] > ... | #include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--)
#define reprev(i,n) reprrev(i,0,n)
#define _GLIBCXX_DEBUG
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a <... | 0 | 54,318,411 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
unordered_map<int, int> mp;
for(int i = 0; i < n; i++) {
int _;
cin >> _;
mp[_]++;
}
int ans = 0;
for(auto m: mp) {
int num = m.first;
int freq = m.second;
if(num > freq) ans += freq;
else ans += freq-num;
}
printf("%d", a... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,a,b) for(ll i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
int main(void){
ll n;
cin >> n;
ll s = 0;
ll e = n;
ll m = ... | 0 | 19,597,042 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_bac... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_map>
#include <set>
#include <deque>
#include <map>
#include<functional>
#define INF 1000000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using n... | 0 | 62,737,724 |
#include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
if (a < 1200)
cout << "ABC" << endl;
else if ( 2800 >a)
cout << "ARC" << endl;
else
cout << "AGC" << endl;
} | #include<stdio.h>
int main(){
int a,b,c;
scanf("%d", &a);
scanf("%d", &b);
scanf("%d", &c);
if(a==b && b==c && c==a){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
} | 0 | 10,812,752 |
#include<bits/stdc++.h>
#define rb(a,b,c) for(int a=b;a<=c;++a)
#define rl(a,b,c) for(int a=b;a>=c;--a)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB push_back
#define II(a,b) make_pair(a,b)
#define FIR first
#define SEC second
#define FREO freopen("check.out","w",stdout)
#define rep(a,b) ... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s, t; cin >> s >> t;
int dp[1001][1001] = {0};
int ls = s.size(), lt = t.size();
for (int i = 0; i <= ls; i++)
dp[i][0] = i;
for (int j = 0; j <= lt; j++)
dp[0][j] = j;
for (int i = 0; i < ls; i++) ... | 0 | 25,024,482 |
#include<iostream>
int main(){
int n;
std::cin >> n;
for (int i = 0; i < n; i++){
float x1, y1, x2, y2, x3, y3, x4, y4;
std::cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
if (((y2 - y1) / (x2 - x1)) == ((y4 - y3) / (x4 - x3)))std::cout << "YES" << std::endl;
else std::cout << "NO" << std::endl;
}
re... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { ... | 0 | 64,684,799 |
#include <bits/stdc++.h>
using namespace std;
#define maxn 100002
#define FOR(i, l, r) for (int i=l; i<=r; ++i)
#define FORD(i, r, l) for (int i=r; i>=l; --i)
#define REP(i, r) for (int i=0; i<(int)r; ++i)
#define REPD(i, r) for (int i=(int)r-1; i>=0; --i)
#define fi first
#define se second
#define mk make_pair
#define... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using vec=vector<ll>;
#define For(i,a,b) for(i=a;i<(ll)b;i++)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define all(v) (v).begin(),(v).end()
#define vsort(v) sort(all(v))
#define endl "\n"
#define pb push_back
... | 0 | 89,491,690 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string o , e;
cin>>o>>e;
string ans;
int index1 =0 , index2 =0;
int len = o.length() + e.length();
for(int i=1;i<=len;i++)
{
if( i%2==1)
{
ans.push_back(o[index1]);
index1++;
} else
... | #include<iostream>
using ll = long long;
using namespace std;
int main()
{
ll a, b;
cin >> a >> b;
if(a == 0){
switch(b % 4){
case 0:
cout << b << endl;
break;
case 1:
cout << 1 << endl;
break;
case 2... | 0 | 89,270,919 |
#include "bits/stdc++.h"
using namespace std;
int main() {
long long N;
cin >> N;
vector<pair<long long, long long> > D(N);
vector<long long> E(N);
vector<long long> COUNT(N, 1);
vector<pair<long long, long long> > ANS;
for (int i = 0; i < N; i++) cin >> D[i].first, D[i].second = i, E[i] = D[i].first;
sort(D.be... | #include <iostream>
#include <string>
using namespace std;
int main(){
string s;
cin >> s;
int ans = s.length()-1;
for(; ; ans--){
if(ans % 2 != 0) continue;
bool isok = true;
for(int i = 0; i < ans/2; i++){
if(s[i] != s[ans/2+i]) isok = false;
}
if(is... | 0 | 51,810,908 |
#include<bits/stdc++.h>
using namespace std;
vector<int> adj[100001];
bool visited[100001];
int ans[100001];
void bfs(){
queue<int> q;
q.push(1);
visited[1] = true;
while(q.size()){
int cur = q.front(); q.pop();
for(auto i : adj[cur]){
if(!visited[i]){
ans[i] ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
const int maxn = 1e5 + 5;
int dp[maxn][21] , a[maxn] , n , L;
int ask (int x , int c)
{
int pos = x;
if (dp[pos][0] == -1) return 1e9;
for (int i = 20 ; i >= 0 ; i--){
... | 0 | 28,053,770 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define ALL(a) (a).begin(),(a).end()
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define ll long long
#define ull unsigned long long
int dx[4] = {1, 0, -1, 0};
int... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX 100001
struct Node{
int num;
struct Node *parent;
struct Node *left_child;
struct Node *right_bro;
};
struct Node node[MAX];
int calc_depth(int num){
if (node[num].parent == NULL){
return 0;
}
return calc_depth(no... | 0 | 97,199,683 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, s1 = 0, s2 = 0, diff = 10007, dif;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
for (int i = 1; i < n; i++)
{
s1 = s2 = 0;
for (int j = 0; j < i; j++)
{
s1 = s1 + a[j];
}
for (int k = i; k ... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int k,s;
int ans = 0;
cin >> k >> s;
for(int i=0;i<=k;i++) {
for(int j=0;j<=k;j++) {
int z=s-i-j;
if(0<=z && z<=k) ans++;
}
}
cout << ans << endl;
return 0;
} | 0 | 46,523,049 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
string s,ss;
cin >> s;
ss = s.subs... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
long a[n + 1];
for (long i = 1; i <= n; i++) cin >> a[i];
if (n % 2 == 0)
{
for (long i = n; i >= 2; i = i - 2) cout << a[i] << ' ';
for (long i = 1; i < n; i = i + 2) cout << a[i] << ' ';
}
else... | 0 | 94,384,662 |
#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
using namespace std;
const int max_n = 10000+2;
long long cnt[111];
long long m,n,a=0,b,W;
const int INF = 1e9+1;
const int mod = 1e9 + 7;
string s1,s2;
long dist[max_n],s[max_n],w[max_... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define int long long
#define float long double
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define endl '\n'
#define pii pair<int, int>
#define min3(a,b,c) min(a, min(b, c))
#define max3(a,b,c) max(a, max(b, c))
#define all(x) x... | 0 | 20,389,433 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
map<int,int> mi,me,md;
set<int> s;
rep(i,n) {
cin >> a[i];
... | #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>;
using Graph = vector<vector<int>>;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
... | 0 | 61,583,383 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
long long a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
sort(a,a+n);
unsigned long long p = 0,q = 0;
for(int i = 1;i < n; i++ ){
if(a[i-1] == a[i]){
p = q;
q = a[i];
... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 2*1e18;
vector<long long> A,Al,Ar;
void regist(vector<long long> D){
A=D;
Al=D;
for(long long i=0;i<((long long)D.size())-1;i++){
Al[i+1]=Al[i]+D[i+1];
}
Ar=D;
for(long long i=((long long)D.size())-2;i>=0;i--){
A... | 0 | 90,468,269 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#define CH(N,A,B) (A<=N&&N<B)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define RREP(i,a,b) for(int i=(b-1);a<=i;i--)
using namespace std;
map<... | #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<ll> a(n+1);
vector<ll> b(n);
rep(i,n+1) cin >> a[i];
rep(i,n) cin >> b[i];
ll ans = 0;
for (int i = 0; i < n; i... | 0 | 40,521,814 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
int main(){
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
rep(r, N+1){
rep(g, N/G+1){
double tmp = (double)(N - R*r - G*g)/B;
if(tmp == (int)tmp ){
if(... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
while(1){
int n,k,b[100100]={},sum=0,sum1=0,ans=0,j=0;
cin>>n>>k;
if(n==0) break;
for(int i=0;i<n;i++){
cin>>b[i];
if(i<k){
sum+=b[i];
}else{
ans=max(ans,sum);
sum=sum-b[j]+b[i];
j++;
}
}
cout<<ans<<endl;
... | 0 | 12,650,859 |
#include <bits/stdc++.h>
#define ll long long
#define INF 1e9
#define pb push_back
#define mp make_pair
#define loop(a,n) for(long long i=a;i<n;i++)
#define vil vector<long long int>
#define vi vector<int>
#define sz(v) v.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
usi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
#define fastio ios_base::syn... | 0 | 69,921,944 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n;
cin>>n;
int sum = 0;
vector<int> l(n),r(n);
rep(i,n){
cin>>l.at(i)>>r.at(i);
sum += r.at(i)-l.at(i)+1;
}
cout<<sum<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
using matrix = vector<vector<uint>>;
template <typename T>
us... | 0 | 79,144,326 |
#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)
#define all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<... | #include "bits/stdc++.h"
using ll = long long;
using namespace std;
const int N = 2e9;
void solveCase() {
string s;
cin >> s;
if(s.length() < 25) {
cout << s;
for(char c = 'a'; c <= 'z'; c++) {
if(s.find(c) == string::npos) {
cout << c;
break;
}
}
... | 0 | 15,389,480 |
#include <iostream>
using namespace std;
int dp[21][50010], c[21];
const int INF = 1e9;
int main(void) {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) cin >> c[i];
for (int i = 0; i < m; i++) {
for (int j = 1; j <= n+1; j++) {
if (!i) dp[i][j] = dp[i][j - c[i]] + 1;
else {
if (j -... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
ll n;
cin >> n;
vector<ll> a(n), b(n);
rep(i, n) cin >> a[i] >> b[i];
ll ans = 0;
for (ll i = n - 1; i >= 0; i--) {
if ((a[i] + ans) % b[i] == 0) continue;
... | 0 | 100,651,097 |
#include <iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if( a % b == 0 )
cout << 0;
else cout << 1;
} | #include <bits/stdc++.h>
#include <cassert>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok?"Yes":"No");
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using ii = pair<int, int>;
using vvi = v... | 0 | 49,010,279 |
#include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp make_pair
#define ... | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep2l(i, s, n) for (ll i = (ll)(s); i ... | 0 | 3,329,210 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vv = vector<vi>;
int main(){
int x,y,a,b,c;
cin>>x>>y>>a>>b>>c;
vi p(a), q(b), r(c);
rep(i,a)cin>>p[i];
rep(i,b)cin>>q[i];
rep(i,c)cin>>r[i];
sort(... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
string s1, s2;
cin >> s1 >> s2;
long long int min = 0;
for (long long int i = 0; i < s1.size(); i++) {
if (s1[i] != s2[i]) min++;
}
cout << min;
return 0;
} | 0 | 78,981,715 |
#include<stdio.h>
int main(){
int h,n;
scanf("%d%d",&h,&n);
int a[n];
int i,j;
int tmp;
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){
h=h-a[i];
}
if(h<=0){
printf("Yes");
}else{
printf("No");
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <climits>
#define DEBUG if(false)
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<int> A(N, 0);
int which_1 = -1;
for(int i = 0; i < N; i++){
cin >> A[i];
if(A[i] == 1){
which_1 = i;
}
}
int K_left = (which... | 0 | 2,537,931 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long S,C;
cin >> S >> C;
if(S * 2 >= C)cout << C/2 <<endl;
else{
cout << S+(C-2*S)/4 <<endl;
}
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long long A, B;
cin >> A >> B;
vector<long long> usea(40, 0), useb(40, 0);
long long t = 1;
long long ans = 0;
long long cnt = 0;
while(B >= t){
long long syo = B / (t * 2);
long long ... | 0 | 25,547,524 |
#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;
typedef vector<ld> vld;
typedef vector<pll> vpl;
typedef vector<vll> vvll;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <map>
using namespace std;
#define INF 1e9
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int gcd(int a, int b) {
if(a % b == 0) {
return b;
}
else {... | 0 | 57,714,250 |
#include <iostream>
using namespace std;
int main() {
int A,B;
cin >> A>> B;
if(A%3==0&&A!=0){
cout <<"Possible"<<endl;
return 0;
}
if(B%3==0&&B!=0){
cout <<"Possible"<<endl;
return 0;
}
if((A+B)%3==0&&(A+B)!=0){
cout <<"Possible"<<endl;
return 0;
}
if(A%3!=0&&B%3!=0&&(A+B)%3!=... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(){
long long H,W;
cin >> H >> W;
long long S = H * W;
long long res=LONG_LONG_MAX;
for(int i=1;i<W;i++){
long long S1 = H*i;
long long ma=S1,mi=S1;
long long S2 = (H/2) * (W... | 0 | 1,038,287 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define rep(i,n,m) for(int i=(n);i<(int)(m);i++)
#define reps(i,n,m) for(int i=(n);i<=(int)(m);i++)
#de... | 0 | 68,599,460 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int numbers[] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin >> k;
cout << numbers[k-1];
} | #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 | 1,345,153 |
#include <stdio.h>
int main(){
int count,i,cc;
char data[33];
while(1){
for(i=0;i<32;i++){
data[i]='0';
}
scanf("%s",data);
if(data[0]=='#') break;
if(data[0]=='q'||data[0]=='w'||data[0]=='e'||data[0]=='r'||data[0]=='t'||data[0]=='a'||data[0]=='s'||data[0]=='g'||data[0]=='z'||data[0]=='x... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#include <iomanip>
#defi... | 0 | 78,867,661 |
#include<bits/stdc++.h>
using namespace std;
#define f(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) f(i,0,n)
#define fd(i,a,b) for(i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define vi vector< int >
#define vl vector< ll >
#define ss second
#define ff first
#define ll long long
#define ull unsigned long long
#... | #include<iostream>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<utility>
#include<algorithm>
#include<cstdio>
#include<iomanip>
#include<queue>
#include<stack>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
const ll inf = 1LL << 60;
int main(){
cin.tie... | 0 | 86,013,761 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
char ch;
cin>>a>>ch>>b;
switch(ch)
{
case '+':
cout<<a+b;
break;
case'-':
cout<<a-b;
break;
}
} | #include<iostream>
#include<vector>
using namespace std;
int main()
{
vector<int> l[101];
int matrix[100][100];
int n;
cin>>n;
for(int i=0;i<n;i++)
{
int u,k;
cin>>u>>k;
for(int j=0;j<k;j++)
{
int tmp;
cin>>tmp;
l[u].push_back(t... | 0 | 100,811,390 |
#include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define forever for (;;)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
template<typena... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vl vector<ll>
#define vi vector<int>
#define pi pair<int,int>
#define pl pair<ll,ll>
#define all(a) a.begin(),a.end()
#define mem(a,x) memset(a,x,sizeof(a))
#define pb push_back
#defi... | 0 | 86,179,456 |
#include<iostream>
#include<vector>
#include<set>
#include<unordered_set>
#include<string>
#include<stack>
#include<algorithm>
#include<limits.h>
#include<stdlib.h>
#include<string.h>
using namespace std;
typedef long long ll;
const ll MAXN = 1e6+1;
ll factor[MAXN];
void slove(){
int n;
cin>>n;
vector<ll> a... | #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:... | 0 | 19,359,150 |
#include <cstdio>
#include <queue>
using namespace std;
#define EMPTY '.'
#define OBSTACLE 'X'
#define INF 0x7fffffff
typedef pair<int, int> Coor;
int h, w, n;
char map[1000][1000];
int cost[1000][1000];
int bfs(Coor start, Coor end) {
queue<Coor> q;
fill((int*)cost, (int*)(((char*)cost)+sizeof(cost)), INF);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int K, S;
cin >> K >> S;
int count = 0;
for (int x = 0; x <= K; x++) {
for (int y = 0; y <= K; y++) {
int num = S - (x + y);
if (0 <= num && num <= K) {
count++;
}
}
}
c... | 0 | 40,452,481 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector< int > a(n);
for (auto& e:a)cin >> e;
ll curr = 1000;
for (int i=0;i+1<n;i++) {
ll s = 0;
if (a[i] < a[i+1]) s=curr/a[i];
curr += ((ll)a[i+1]-a[i])*s;
}
cout << curr << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> 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:... | 0 | 77,668,566 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll res(ll x){
if(x%4==0) return x;
if(x%4==1) return 1;
if(x%4==2) return x+1;
if(x%4==3) return 0;
}
int main() {
ll a,b;
cin >> a >> b;
ll ansa=0,ansb=0;;
ll now=1;
a--;
ansa=re... | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
char s[N];
int a[N], sum[N];
int n, m;
const int mod = 1e9 + 7;
int main() {
scanf("%d %s", &n, s);
m = strlen(s);
int cur = 0;
for (int i = m-1; i >= 0; i --) {
int t = (s[i] == 'B');
if (cur ^ t) a[i] = -1;
else a... | 0 | 51,420,691 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
typedef long long ll;
using namespace std;
const int mod = 1e9 +7;
int main(){
int n;
cin >> n;
vector<ll> a(n);
rep(i,n){
cin >> a[i];
}
ll res = 0;
rep(d, 60){
ll n0 = 0, n1 = 0;
rep(i,n){
i... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, a, b) for (ll i = (a); i < (b); i++)
typedef uint64_t ull;
typedef int64_t ll;
typedef std::pair<ll, ll> PLL;
using namespace std;
signed main() {
bool ok = true;
ll N;
cin>>N;
vector<ll> K(N+1);
vector<ll> L(N+1), R(N+1);... | 0 | 12,900,578 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll h, w;
cin >> h >> w;
ll ans = ((h + 1) / 2) * ((w + 1) / 2) + (h / 2) * (w / 2);
if (h == 1 || w == 1) ans = 1;
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
int main(){
int H,W,M;
cin >> H >> W >> M;
vector<vector<int>> Ah(H,vector<int> (2))... | 0 | 23,321,499 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int a, b, c;
cin >> a >> b >> c;
int maxi = max(a, max(b, c));
cout << 10 * maxi + a + b + c - maxi << "\n";
return 0;
} | #include <bits/stdc++.h>
#define FOR(v, a, b) for(int v = (a); v < (b); ++v)
#define FORE(v, a, b) for(int v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(int v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define ITR(it, c) for(auto it = (... | 0 | 1,847,808 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--... | #include <iostream>
using namespace std;
int a[100][100];
int N,u,k,col;
int main() {
cin >> N;
for(int i=0; i<N; ++i) {
cin >> u >> k;
for(int l=0; l<k; ++l) {
cin >> col;
a[u-1][col-1] = 1;
}
cout << a[i][0];
for(int l=1; l<N; ++l) {
cout << " " << a[i][l];
}
cout << endl;
}
} | 0 | 25,921,537 |
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int main() {
int n, k;
cin >> n >> k;
int ans = 1;
for (int i = 0; i < n; i++) {
if (ans + k * (n - i - 1) < k * (n - i))
ans <<= 1;
else
ans += k;
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main()
{
int h,w,k;
cin>>h>>w>>k;
int x[h*w+1],y[h*w+1];
for(int i=0;i<h;i++)
for(int j=0;j<w;j++)
{
int ch;
cin>>ch;
x[ch]=i;
y[ch]=j;
}
int d[h*w+1];
memset(d,0,sizeof(d)... | 0 | 23,156,481 |
#include<iostream>
using namespace std;
int main(){
int a,N,ans=0;
string S,T;
cin >> S >> T;
for(int i = 0; i < 3; i++){
if(S[i] == T[i]) ans++;
}
cout << ans << endl;
} | #include<bits/stdc++.h>
#define INF (int)1e9
#define EPS 1e-9
#define MOD 1000000007ll
#define PI 3.14159
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define REP(i, a, b) \
for (int i = int(a); i <= int(b); i++)
#define TRvi(c, it) \
for (vi::iterator it = (c).begin(); it != (c).end();... | 0 | 76,825,140 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
vector<pair<string,int>>v;
int n;
cin>>n;
int total_time=0;
for(int i=0;i<n;i++){
string play_list;
int time;
cin>>play_list>>time;
v.push_back(make_pair(play_list,time));
total_time+=time;
}
str... | 0 | 44,792,203 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
ll n, l;
cin >> n >> l;
vector < ll > a(n + 1);
for(int i = 1; i <= n; i++) cin >> a[i];
int j = 0;
for(int i = 1; i < n; i++){
if(a[i] + a[i + 1] >= l) j = i;... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;
typedef pair<ll,ll> pll;
int n;
ll d,a;
ll x[200001],h[200001],s[200002];
pll xh[200001];
int main(){
cin>>n>>d>>a;
re... | 0 | 11,481,235 |
#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<int, int> &a, pair<int, int> &b) {
return atan2(a.second, a.first) < atan2(b.second, b.first);
}
int main ()
{
int n;
cin >> n;
vector<pair<int, int>> a;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
if (x |... | #include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(n);i++)
using namespace std;
typedef long long ll;
const int MOD=1e9+7;
const int MAX = 1000000;
const int INF = 1e9;
const double pi=acos(-1);
int main(){
int n;
cin >>n;
vector<string>s(n);
rep(i,n)cin >> s[i];
ll ans=0;
rep(k,n){
vector<st... | 0 | 39,411,635 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int b;
cin >> a >> b;
if((a+b) % 2 != 0) {
cout << ((a+b) / 2) + 1<< endl;
} else {
cout << (a+b) / 2 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i++)
#define show(x) {for(auto i: x){cout << i << "\t";} cout<<endl;}
#define showm(m) {for(auto i: m){cout << m.x << " ";} cout<<endl;}
typedef long ... | 0 | 67,350,809 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (int)1e9+7
#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 vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pi... | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
const double PI = acos(-1.0);
const long mod = 1000000007;
const long INF = 1e9 + 1;
int main() {
int n,m,x;
cin >> n >> m >> x;
int c... | 0 | 14,791,366 |
#include<bits/stdc++.h>
using namespace std;
#define FastIO ios::sync_with_stdio(false); cin.tie(0);cout.tie(0)
#define ll long long int
#define ull unsigned long long int
#define veci vector<int>
#define vecc vector<char>
#define... | #include<iostream>
#include <cstdio>
#include<cctype>
using namespace std;
int main(){
char ch;
ch = getchar();
while( ch != EOF)
{
if(islower(ch))
ch = toupper(ch);
else
ch = tolower(ch);
cout << ch;
ch = getchar();
}
return 0;
} | 0 | 83,833,028 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K = 0;
cin >> A >> B >> K;
for (int i=0; i < K; i++) {
if (i%2 == 0) {
A /= 2;
B += A;
} else {
B /= 2;
A += B;
}
}
cout << A << ' ' << B << endl;
} | #include <bits/stdc++.h>
#define int long long
#define ci(m) for(int i=0;i<m;i++)
#define cj(m) for(int j=0;j<m;j++)
#define ck(m) for(int k=0;k<m;k++)
#define gcd __gcd
#define endl "\n"
#define pb emplace_back
#define setbits(x) __builtin_popcountll(x)
#define zrobits(... | 0 | 90,609,771 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x;
cin>>x;
(x<1200)?cout<<"ABC":cout<<"ARC";
} | #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... | 0 | 42,617,896 |
#include <iostream>
#include <set>
#include <map>
using namespace std;
int main(){
int n,a,b,c,x;
while(cin >> n >> a >> b >> c >> x && n){
int key[100];
for(int i = 0 ; i < n ; i++) cin >> key[i];
int t = 0 , T = 0;
if(x == key[0]) t++;
while(t < n && ++T <= 10000){
x = (a * x + b) % c;
if(x==key[t])... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const long long mod = 1e9 + 7;
long long phi[N] = {};
bool isp[N] = {};
int n, k;
void init() {
isp[1] = true;
for (int i = 1; i <= k; i++)
phi[i] = i;
for (int i = 2; i <= k; i++)
if (!isp[i]) {
phi[i]--;
... | 0 | 25,468,157 |
#include <iostream>
#include <fstream>
#include <string>
#include <map>
using namespace std;
int main(){
#ifdef DEBUG
ofstream fout("output.txt");
ifstream fin("input.txt");
if(!fout || !fin){
cout << "Can't open the file.\n";
return;
}
#endif
string word;
int max_length;
int max_appear;
string max_string;
... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i<=b;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int,... | 0 | 94,188,931 |
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <b... | #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 | 54,469,106 |
#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... | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | 0 | 46,808,547 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0, xxx_rep_end = (n); i < xxx_rep_end; ++i)
#define all(x) (x).begin(), (x).end()
template <class T1, class T2>
inline bool chmax(T1 &a, const T2 &b) {
if (a < b) {
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 1000000007
#define mod9 1000000009
#define fast ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define mp make_pair
#define pb push_back
#define ct ll t;cin>>t;while(t--)
#define bi begin()
#define ei end... | 0 | 924,293 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n, k;
cin >> n >> k;
cout << (n-2) / (k-1) + 1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int h, w, d;
cin >> h >> w >> d;
map<int, pair<int, int>> a;
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) {
int x;
cin >> x;
a.insert({x, {i, j}});
}
}
vector<ll> memo(h * w + 1);
for (i... | 0 | 8,070,977 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int H, W, A, B;
cin >> H >> W >> A >> B;
vector<vector<bool>> ans(H, vector<bool>(W));
for (int i = 0; i < A; i++) {
for (int j = 0; j < B; j++) ans[j][i] = true;
}
for (int i = A; i < W; i++) {
for (int j = B; j < H; j++) ans[j][i] = tru... | #include<bits/stdc++.h>
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
using namespace std;
using ll = long long;
ll INF = 1LL << 60;
using G = vector<map<int, int>>;
void
dfs(int node, ll count, G &arr, vector<bool> seen, vector<long> &to_K)
{
seen[node] = true;
... | 0 | 30,276,869 |
#include<iostream>
#include<cmath>
using namespace std;
const int M = 2e5;
long long a[M];
long long sum[M];
int main()
{
int n;
while (cin >> n)
{
long long s = 0;
sum[0] = 0;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
sum[i] = sum[i - 1] + a[i];
s += a[i];
}
long long Min = abs(2 * sum[1] - s... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ull = unsigned long long;
ull C(int size, int count) {
ull x = 1;
ull y = 1;
for(int i = 0; i < count; ++i) {
x *= (size - i);
y *= (i + 1);
if(x % y == 0) {
x /= y;
y = 1;
... | 0 | 99,844,101 |
#include<bits/stdc++.h>
using namespace std;
const int N=1e4+5;
int n;
int main()
{
scanf("%d",&n);
int ans=0,l=0,r=0,flag=false;
for(int i=1;i<=n;i++)
{
char s[15];
scanf("%s",s+1);
int m=strlen(s+1);
if(s[1]=='B') l++;
if(s[m]=='A') r++;
if(!(s[1]=='B'&&... | #include <iostream>
#include <string>
#define rep(i, n)for(int i=0; i<n; i++)
using namespace std;
int main(){
int n;
string s;
cin >> n >> s;
int num[1000]{};
rep(i,1000){
string strint = to_string(i);
if(i<10){
strint[2] = strint[0];
strint[0] = strint[1] = ... | 0 | 88,574,872 |
#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
using namespace std;
#define fs first
#define sc second
using P = pair<ll,ll>;
using Pll = pa... | #include <bits/stdc++.h>
#define ll long long
#define rep(i,a,b) for(long long i=a; i<b; i+=1)
#define repr(i,a,b) for(long long i=a; i<=b; i+=1)
#define vec vector<ll>
#define map map<string,int>
#define repa(p,A) for(auto p:A)
#define pb push_back
#define sort(a) sort(a.begin(),a.end())
#define reverse(a) reverse(a.b... | 0 | 98,108,665 |
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef long double lld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
#define MOD 1000000007
int main() {
st... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
int n;
cin >> n;
vector<int> h(n);
rep(i,n) cin >> h[i];
int ans=0;
int active=0;
rep(i,n){
... | 0 | 75,626,461 |
#include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a,int64_t b){return (a%b==0?b:gcd(b, a%b));}
int64_t lcm(int64_t a,int64_t b){return a/gcd(a, b)*b;}
int factorial(int a){int b=1;while(a){b*=a--;}return b;}
bool is_prime(int a){if(a<=1)return false;for(int i=2;(int64_t)i*i<=a;i++){if(a%i==0)return fal... | #include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
bool prime[n+1];
memset(... | 0 | 51,222,409 |
#include<bits/stdc++.h>
#define lli long long int
#define rep(i,n) for(lli i=0; i<n; i++)
#define loop(i, j, n) for(lli i=j; i<n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF = 0x3f3f3f3f;
const long long mod=1e9+7;
const double PI = acos(-1);
using namespace std;
using Graph = vector<vector<lli>>;
usi... | #include <bits/stdc++.h>
#define ll long long
#define ii pair<int, int>
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
#define pi 3.141592653
#define oo 1000000007
#define loo 10000000000000007
#defi... | 0 | 75,330,711 |
#include <iostream>
#include <stack>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> graph[n + 1];
int deg[n + 1] = {}, x[n + 1];
fill(x, x + n + 1, -1);
for (int l, r, d; cin >> l >> r >> d; ) {
graph[l].emplace_ba... | #include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
void solve(int N, int Q, vector<int> t, vector<int> u, vector<int> v)
{
dsu d(N);
for (int i = 0; i < Q; i++)
{
if (t.at(i) == 0)
{
d.merge(u.at(i), v.at(i));
}
else
... | 0 | 10,910,118 |
#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 s,w;
cin >> s >> w;
if(s>w)cout << "safe" << "\n";
else cout << "unsafe" << "\n";
return 0;
} | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int N, M; cin >> N >> M;
vector<ll> X(N), Y(N), Z(N);
REP(i, 0, N) cin >> X[i] >> Y[i] >> Z[i];
ll ans = 0;
... | 0 | 79,832,292 |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#d... | #include <iostream>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <vector>
#include <climits>
#include <queue>
#include <utility>
#include <iomanip>
#include <sstream>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;... | 0 | 5,739,926 |
#include<bits/stdc++.h>
#define MAX 1000000007
using namespace std;
typedef long long LL;
typedef pair<int,int> P;
char s[105];
bool cput(LL x) {
printf("? %lld\n",x);
fflush(stdout);
scanf("%s",s);
return s[0] == 'Y';
}
int main() {
int i,l = 0,r;
bool vis = 1;
for(i = 1000000000; i > 0; i ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | 0 | 85,134,156 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
bool compare(pair<int, int> a, pair<int, int> b)
{
return a.second < b.second;
}
int main()
{
int N, M;
cin >> N >> M;
vector<int> cnt;
cnt.resize(N);
for (int i = 0; i < M; ++i)
{
int a, b;
cin >> a >> b;
--a, --b;
... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9 + 7;
using Graph = V<V<int>>;
Graph g;
V<bool> seen;
int n, m;
int ans = 0, cnt = 0;
void dfs(int v) {
seen[v] = true;
cnt++;
if(c... | 0 | 83,582,930 |
#include <bits/stdc++.h>
using namespace std;
#define name ""
#define ini freopen(name".inp","r",stdin); freopen(name".out","w",stdout)
#define foe(it,c) for (__typeof(c.begin()) it = c.begin(); it != c.end(); it++)
#define long long long
#define db double
#define pii pair <int, int>
#define pll pair <long, long>
#de... | #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 v2(v,n,m,init) vector<vector<i... | 0 | 58,505,252 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int> a(n);
for(int i=0;i<n;i++) cin>>a[i];
if(*min_element(a.begin(),a.end()) != 1) {
cout<<"-1";
return 0;
}
vector<int> p;
int k=1;
for(int i=0;i<n;i++)
{ int j=i;
for( j=i;j<n;j++)
{
if(a[j]==k)
{ k++;
p.push_back(j);
br... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <list>
#include <numeric>
#include <stack>
#include <iomanip>
#include <random>
... | 0 | 26,076,052 |
#include <bits/stdc++.h>
using namespace std;
const int64_t INF=9999999999999999;
int main() {
int A,B,C;
cin>>A>>B>>C;
cout<<(A+B+C)-max({A,B,C})<<endl;
return 0;} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int,int> pi;
#define f first
#define s second
#define FAST ios_base::sync_with_stdio(0); cin.tie(0);
typedef pair<pi,int> pii;
int n;
set <int> coords;
vector <pii> points;
int main() {
FAST
cin >> n;
for (int i =0;i<n;i++) {
int x,y; ... | 0 | 800,462 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fix(n) cout<<fixed<<se... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod2=1000000007;
ll mod=998244353;
ll inf=1000000000000000000;
double pi=2*acos(0);
#de... | 0 | 30,855,904 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i=0; i<n; i++)
int main() {
ll n,k;
cin>>n>>k;
ll a[n];
ll ok=0,temp1=0;
rep(i,n) cin>>a[i];
rep(i,n){
if(temp1<a[i]) ok++,temp1=a[i];
else break;
}
if(k<=ok){
cout<<0<<endl;
return 0;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b... | 0 | 89,055,018 |
#include<iostream>
#include<vector>
using namespace std;
int get_square(int x){
return x*x;
}
int main(){
vector<int> area_anss;
int d;
while(cin>>d){
int area=0;
for(int i=1;i<600/d;i++){
area=area+get_square(i*d)*d;
}
area_anss.push_back(area);
}
for(int i=0;i<area_anss.size();i++){
cout... | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define inputInt(a) int a; cin >> a;
#define inputInt2(a,b) int a; int b; cin >> a >> b;
#define inputInt3(a,b,c) int a; int b; int c; cin >> a >> b >> c;
#define inputLong(a) long a;cin >> a;
#define inputIntArray(a,N) int a[N];for(int i=0;i<N;i++){ci... | 0 | 5,098,094 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <list>
#include <utility>
#include <ctime>
#define INF 1000000000
#define LINF 900000000000000000... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 0 | 58,190,097 |
#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()
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (a + b == 15)
cout << '+';
else if (a * b == 15)
cout << '*';... | #include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME
#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,... | 0 | 85,980,843 |
#include <iostream>
#include <vector>
#include <numeric>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPONE(i, n) for(int i = 1; i < n; i++)
#define ll long long
using namespace std;
int main()
{
int n; cin >> n;
vector<ll> time;
ll t;
REP(i, n) {
cin >> t;
time.push_back(t... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#d... | 0 | 84,921,808 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.