code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#include<iostream>
using namespace std;
struct Card {
char moji;
int value;
};
void print(struct Card A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (i > 0) cout << " ";
cout << A[i].moji << A[i].value;
}
cout << endl;
}
void Bubble_Sort(struct Card A[], int N) {
int i, j;
for (i = 0; i < N; i++) {
for... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
string s;
cin >> s;
map<char, int> mp;
... | 0 | 38,243,210 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll N=1e5+5;
ll a,b;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>a>>b;
if(a==1)
a+=13;
if(b==1)
b+=13;
if(a>b)
cout<<"Alice";
else if(b>a)
cout<<"Bob";
else
cout<<"Draw";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);++i)
#define fi first
#define se second
#define INF 1000000009
#define lINF 1000000000000000009
typedef long long ll;
int main(){
int m,k;
cin>>m>>k;
if(m==1){
if(k==0)cout<<0<<' '<<0<<' '<<1<<' '<<1<<endl;
else cout<<-1<<end... | 0 | 87,930,859 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
vector<pair<int,int>>dish(5);
R... | #include <bits/stdc++.h>
#define pb push_back
#define REP(i, n) for (signed long long i = 0; i < (n); i++)
#define MOD 1000000007
#define bitcnt(a) (ll) __builtin_popcount((a))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
ll n,all=0;
vector<ll>v;
cin>>n;
REP(i,n){
... | 0 | 51,798,677 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#... | #include <stdio.h>
#include <algorithm>
#include <iostream>
using namespace std;
class Heap{
public:
Heap(){
array = new int[2000000];
n = 0;
}
void insert(int data){
array[n] = data;
int tmp = n;
while(tmp != 0 && array[tmp] > array[(tmp-1)/2]){
std::swap... | 0 | 4,026,646 |
#include <algorithm>
#include <bits/stdc++.h>
#include <iterator>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
int main(void) {
int n;
cin >> n;
vector<int> p(n);
vector<int> q(n);
rep(i, n)... | #include<cstdio>
using namespace std;
int main(void){
int in[100],data,ans[100],cnt,work=0;
int i,j;
for(i=0;i<100;i++){
ans[i]=0;
in[i]=0;
}
for(i=0;i<100;i++){
if(scanf("%d",&data)==EOF) break;
in[data]++;
}
for(i=1;i<100;i++)
if(in[work]<in[i]) work=i;
ans[0]=work;
cnt=0;
for(i=1;i<100;i++){
... | 0 | 94,604,595 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<int>>;
#define MAX 1000000
#define MOD 1000000007
#define INF 100000000000000
int main(){
int N;
cin>>N;
vector<ll> A(N);
bool plus=false;
bool minus=false;
bool zero=false;
ll sum=0;
for(int i=0;i<N;i++){
ci... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#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 pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
const ll mod = 1e11 + 7;
const int maxn = 2e5+5;
#include<atcoder/dsu>
using ... | 0 | 69,824,995 |
#include <cstdio>
int a, b, c;
int cnt[201];
void solve()
{
cnt[a+100]++;
cnt[b+100]++;
cnt[c+100]++;
for (int i = 0; i < 201; i++) {
if (cnt[i] == 1) {
printf("%d\n", i-100);
}
}
}
int main()
{
scanf("%d%d%d", &a, &b, &c);
solve();
return 0;
} | #include <stdio.h>
void triangle(int number)
{
for(int i = 0; i < number; ++i) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if ((a > b) && (a > c)) {
if (a * a == b * b + c * c) {
printf("YES\n");
} else {
printf("NO\n");
}... | 0 | 6,610,873 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main()
{
ll a[] = { 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 };
ll n; cin >> n;
for(ll i = 0 ; i < 32; i++)
{
if((i + 1) == n)
{
cout << a[i] << '... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair< int, int > pii;
typedef pair< pii, int > ppi;
#define fill(a,b) memset(a,b,sizeof(a))
#define all(v) (v).begin(),(v).end()
#define sp(k) cout<<setprecision(k)<<fixed;
#define rep(i,a) for(in... | 0 | 53,966,397 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long x,y,cnt=0;
cin>>x>>y;
for(long long i=x;i<=y;i*=2)
++cnt;
cout<<cnt;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef long int li;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef pair<ll, ll>P;
typedef tuple<double,ll,ll>T;
#define PI 3.14159265358979
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], fin... | 0 | 31,300,707 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int> >;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define brep(n) for(int bit=0;bit<(1<<n);bit++)
#define erep(i,container) for (auto i : container)
#define irep(i, n) for(int i = n-1; i >= (int)0; i--)
#define ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=1e+18;
const int MOD=1e+9+7;
#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 REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end... | 0 | 60,033,313 |
#include<stdio.h>
int main()
{
int a, b, c, s,f, d;
scanf("%d %d %d", &a, &b, &c);
for (s=a;s <= b;s++){
f=c%s;
if(f == 0){
d = d + 1;
}
}
printf("%d\n", d);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios_base:: sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
ll h,w,d;cin>>h>>w>>d;
ll a[h][w];for(ll i=0;i<h;i++)for(ll j=0;j<w;j++)cin>>a[i][j],a[i][j]--;
vector< pair<ll , pair<ll,ll> > >pos[d];
for(ll i=0;i<... | 0 | 68,166,746 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int BIG = 2e9 + 55;
const int maxN = 200 + 5;
int n;
int a[maxN];
int memo[maxN][maxN];
bool calc[maxN][maxN];
int dp(int i, int curH){
if(i == n){
return (curH != a[i]);
}
if(calc[i][curH]){
retur... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <deque>
using namespace std;
#define next '\n'
#define sp " "
#define print(x) cout << (x)
#define println(x) cout << (x) << next
#define stop return(0)... | 0 | 60,312,074 |
#include<iostream>
using namespace std;
int main() {
int train[200000] = { 0 }, junban[200000] = { 0 }, a = 0, n, i;
while (cin >> n) {
if (n == 0) {
for (i = 0; train[i] != 0; i++) {}
junban[a] = train[i - 1];
train[i - 1] = 0;
a++;
}
else {
for (i = 0; train[i] != 0; i++) {}
train[i] = n;
... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 91,602,756 |
#include<bits/stdc++.h>
#define endl "\n"
#define M_PI 3.14159265358979323846
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define fix_prec cout.setf( std::ios::fixed, std:: ios::floatfield ); cout.precision(9);
#define vi vector<int>
#define vvi vector<vector<int... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <cmath>
#include <iomanip>
#include <set>
#include <sstream>
#include <queue>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a... | 0 | 91,820,860 |
#include <bits/stdc++.h>
#define append push_back
using namespace std;
using ll = long long;
const int N = 1e5 + 3;
const int M = 1e6 + 7;
const long long MOD = 1e9 + 7;
const long long INF = 1e18 + 9;
const int SM = 1e3 + 5;
const int logN = 22, BL = 400;
const double EPS = 1e-9, PI = acos(-1);
const int dx[] = {1, 0,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
for (int i = 0... | 0 | 64,539,572 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N;
cin >> N;
int P[N];
ll where[N];
ll ans = 0;
for (int i = 0; i < N; i++) {
cin >> P[i];
P[i]--;
where[P[i]] = i;
}
set<int> Set;
Set.insert(-1);
Set.inse... | 0 | 96,093,684 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll x, y;
cin >> x >> y;
int count = 0;
while(true) {
x *= 2;
count++;
if (x > y) break ;
}
cout... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; } re... | 0 | 41,349,750 |
#include <iostream>
#include <string>
#include <cctype>
using namespace std;
int main(){
string str;
int m, h;
while (1) {
cin >> str;
if (str == "-") {
break;
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> h;
string head = str.substr(0, h);
string tail = str.substr(h... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
void solve(long long W, long long H, long long N, std::vector<long long> x, std::vector<long long> y,
std::vector<long long> a) {
ll minX = 0, minY = 0, maxX = W, maxY = H;
rep(i, N... | 0 | 82,512,711 |
#include <iostream>
#include <vector>
#include<algorithm>
#include<string>
#include<stdio.h>
#include<map>
#include<math.h>
#include<queue>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
const int mod = 1000000007;
con... | #include<cstdio>
#include<iostream>
#include<ctype.h>
#include<string>
using namespace std;
int main(){
int o = 0;
string s;
cin >> s;
for(int i = 0; i <= s.length(); i++){
if(s[i] == 'o'){
o++;
}
}
if(15 - s.length() >= 8 - o){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
return 0;
} | 0 | 7,093,198 |
#include<bits/stdc++.h>
using namespace std;
static const int64_t mod=1000000007;
int main(){
int N,M;
cin>>N>>M;
vector<int>S(N);
for(int i=0;i<N;i++)
cin>>S.at(i);
vector<int>T(M);
for(int i=0;i<M;i++)
cin>>T.at(i);
vector<vector<int>>dp(1+N,vector<int>(1+M,1));
for(int i=1;i<=N;i++){
for(int ... | #include <iostream>
#include <bitset>
#include <fstream>
#include <string>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
#include <cc... | 0 | 100,702,447 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(0);
#define rep(i,n) for (int i=0; i<n;++i)
#define repll(i,n) for (ll i=0; i<n;++i)
typedef long long ll;
using namespace std;
const ll INF = 1e17;
int n;
ll K;
in... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
template <class T>
bool chmax(T &a, const T &b) {
if (... | 0 | 9,518,674 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
const int MOD=1e9+7;
const int INF=1e18;
signed main(){
int N,K;string S;c... | 0 | 58,395,781 |
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
void print() { std::cout << '\n'; }
template <class T>void print(const T &x) {std::cout << x <<'\n';}
template <class T, class... Ar... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main(void){
int n,k;
ll ans = -(1LL<<60);
cin >> n >> k;
vector<ll> a(n),s1(n+1,0),s2(n+1,0);
for(int i = 0;i < n;i++){
cin >> a[i];
s1[i+1] = s1[i] + a[i];
if(a[i] >= 0) s2[i+1] = s2[i] + a[... | 0 | 2,720,919 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repit(it, li) for(auto it=li.begin(); it!=li.end(); it++)
using namespace std;
using ll = long long;
using P = pair<ll,int>;
vector<P> factor(ll n){
map<ll, int> ma;
for(ll i=2; i*i<=n; i++){
while(n%i==0){
ma[i]++;
n/=i;
}
}
... | #include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int D = 50;
ll calc(ll n){
int j = 0;
ll m = 1;
m <<= D;
ll ret = 0;
for(int i = D;i>=2;i... | 0 | 7,369,574 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include <iomanip>
using namespace std;
#define intmax INT_MAX
#define lmax LONG... | #include <bits/stdc++.h>
#define name "bai3"
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define fto(i,a,b) for(int i=a; i<=b; ++i)
#define maxn 100009
#define ll long long
using namespace std;
const int mod=1e9+7;
int n,a[maxn*2],xd[maxn*2];
ll p[maxn];
int ma... | 0 | 89,657,859 |
#include<cstdio>
#include<iostream>
using namespace std;
const int N=100010;
struct tyc{
int to,next;
}e[4*N];
int head[N],n,m,size=0;
int x,y;
int oh,si,oth;
long long ans;
bool p=0;
bool vis[N],color[N];
void add(int x,int y)
{
size++;
e[size].to=y;
e[size].next=head[x];
head[x]=size;
}
void dfs(int x,int fa)
{
... | #include<iostream>
using namespace std;
int main(){
int d, s;
while (cin>>d){
s = 0;
for (int j = 1; j*d < 600; j++){
s = s + d*d*d*j*j;
}
cout << s << endl;
}
return 0;
} | 0 | 50,167,178 |
#include <stdio.h>
int main()
{
char card[20001];
int maze,i,mvc,j,fc,cm,end=0;
while(1){
cm=0;
while(1){
scanf("%c",&card[cm]);
if(card[0]=='\n'){
continue;
}
if(card[0]=='-'){
goto theend;
}
if(card[cm]=='\n'&&cm!=0){
break;
}
cm++;
}
scanf("%... | #include<stdio.h>
#include<string.h>
int main()
{
int i,j,k,count=0;
char s[100],p[100],a;
scanf("%s",s);
scanf("%s",p);
int lens=strlen(s);
int lenp=strlen(p);
for(i=0;i<=lens;i++){
a=s[0];
for(j=0;j<=lens;j++){
s[j]=s[j+1];
}
s[lens-1]=a;
if(s[0]==p[0]){
for(k=0;k<lenp;k+... | 0 | 7,728,092 |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
const long long mod = 1e9+7;
int main() {
int n; cin >> n;
vector<string> s(n);
vector<int> t(n);
for(int i=0; i<n; i++) cin >> s[i] >> t[i];
string x; cin >> x;
int ans = 0;
bool f = false;
for(int i=0; i<n; i++) {
if... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, C, K;
cin >> N >> C >> K;
vector<int> time(N);
rep(i, N) cin >> time[i];
sort(time.begin(), time.end())... | 0 | 82,490,960 |
#include<iostream>
#include<string>
using namespace std;
int main() {
string res = "";
int a, b;
cin >> a >> b;
if (a > b) {
int temp = a;
a = b;
b = temp;
}
for (int i = 0; i < b; i++) {
res += (a + '0');
}
cout << res << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <regex>
#include <vecto... | 0 | 22,940,415 |
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<n;i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin>>N;
int count=0;
while(N>=3){
count++;
N-=3;
if(N-3>=3)continue;
else{
count++;
break;
... | #include <iostream>
#include <iomanip>
using namespace std;
constexpr int MAXT = 2 * 101 * 200, MAXV = 2 * 101;
constexpr double inf = 1e9;
double dp[MAXT][MAXV];
int main(){
cin.tie(0); ios_base::sync_with_stdio(false);
int N; cin >> N;
int T[100], V[100];
for(int i=0; i < N; ++i) cin >> T[i];
for(... | 0 | 26,612,024 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
ll gcd(ll a,ll b){
if (a%b==0) return(b);
else return(gcd(b,a%b));
}
ll lcm(ll a,ll b){
return a*b/gcd(a,b);
}
int main(){
int H,W;
cin >> H >> W;
rep(i,H)rep(j,W){
string... | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <stack>
#include <queue>
#include <bitset>
#include <cassert>
#include <... | 0 | 32,710,218 |
#pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
using namespace std;
typedef l... | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | 0 | 47,794,675 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n; cin >> n;
ll arr[n];
for(ll i = 0; i < n; ++i){
cin >> arr[i];
}
ll ans = 1000, x;
for(ll i = 1; i < n; ++i){
if(arr[i] > arr[i - 1]){
x = ans / arr[i - 1];
ans -= (x * a... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
... | 0 | 41,706,197 |
#include <bits/stdc++.h>
#define endl "\n"
#define pb push_back
#define SZ(x) ((int)(x.size()))
#define FOR(i,s,n) for (ll i = (s); (i) < (n); ++i)
#define FORD(i,s,l) for (ll i = (s); (i) >= l; --i)
#define F first
#define S second
#define TC int __tc; cin >> __tc; FOR(case_num,1,__tc+1)
#define TEST(x,i) ((x)&(1ll<<(... | #include<bits/stdc++.h>
#define ll long long
#define vl vector
#define pb push_back
using namespace std;
int main()
{
ll a,b,i,j,n,k;
cin>>n;
while(n)
{
if(n<100) break;
a=n%10;
if(n%100>=10 && n>100) a=5;
else if(a>5) a-=5;
a+=100;
n-=a;
}
if(n==0... | 0 | 7,592,215 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
typedef long long ll;
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
template <class T, class U> ostream &operator<<(ostream &os,... | #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 | 14,466,481 |
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define all(a) (a).begin(), (a).end()
int main(){
int N, K;
cin >> N >> K;
vector<int> H(N);
for(int i = 0; i < N; i++) cin >> H[i];
int count = 0;
... | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define forn(i, n) for (int (i) = 0; (i) != ... | 0 | 5,049,255 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define r... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
static const int dx[4] = { 0, 1, 0, -1 };
static const int dy[4] = { 1, 0, -1, 0 };
static const char dir[4] = { 'u', 'r', 'd', 'l' };
static const ll INF = 1 << 21;
static const ll MOD = 1e9 + 7;
int ma... | 0 | 4,019,538 |
#include<cstdio>
#include<iostream>
#include<map>
#include<set>
#include<vector>
#include<cstring>
#include<cassert>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<limits>
#include<ctime>
#include<stack>
#include<bits/stdc++.h>
#include<string>
#include<stdlib.h>
#include<stdio.h>
typede... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<pair<int, int>> v1(1e5+1);
vector<pair<int, int>> v2(1e5+1);
for(int i=0; i<n; i++){
int in;
cin>> in;
if(i % 2 == 0){
v1[in].first++;
v1[in].second = in;
}else{
... | 0 | 56,372,013 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL MOD = 1e9 + 7;
const int N = 200000 + 10;
char s[N]; int n;
int lef[N];
int main() {
scanf("%d%s", &n,s+1);
if(s[1] == 'W') return !printf("0\n");
lef[1]=1;
for(int i=2;i<=2*n;i++){
if(s[i]==s[i-1]) lef[i]=1^lef[i-1];
else lef[i]=lef[... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUM... | 0 | 6,944,485 |
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
using namespace std;
int main(){
string s;
while(getline(cin,s),s!="."){
stack<int> a;
for(int i=0;i<s.size();i++){
if(s[i]=='('||s[i]=='['){
a.push(s[i]);
}
else if(s[i]==')'){
if(a... | #include<bits/stdc++.h>
using namespace std;
int minCoins(int coinList[], int n, int value) {
int coins[value+1];
if(value == 0)
return 0;
coins[0] = 0;
for (int i=1; i<=value; i++)
coins[i] = INT_MAX;
for (int i=1; i<=value; i++) {
for (int j=0; j<n; j++)
if (coinList[j] <= i)... | 0 | 6,431,534 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define P pair<int,int>
#define len(s) (int)s.size()
template<class T> inline bool chmin(T &a, T b){
i... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(... | 0 | 8,183,065 |
#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... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF (2e9)
int main() {
ll ans = 0;
ll n, p; cin >> n >> p;
string s; cin >> s;
if(10 % p == 0) {
for(int i = s.length() - 1; i >= 0; i--) {
if((s[i]-'0') % p == 0) ans += i + 1;
}
cout << ans << endl;
return 0;
}... | 0 | 37,356,700 |
#include <iostream>
using namespace std;
int main(){
int a[110],n;
cin >> n;
for(int i = 0; i < n ; i++){
cin >> a[i];
}
int ans = 0;
for(int i = 0; i < n; i++){
int min = i;
for(int j = i; j < n; j++){
if(a[j] < a[min]) min = j;
}
if(i != min){
int tmp = a[i];
a[i] = a... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define hcf __gcd
bool is_prime(ll n){
if(n==2) return true;
if(n%2==0) return false;
for(ll i=3;i*i<=n;i+=2){
if(n%i==0)
return false;
}
return true;
}
int main(void){
ios::sync_with_stdio(0); cin.tie(0);
#i... | 0 | 19,482,016 |
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
int main() {
int W,H,N,x,y,a; cin>>W>>H>>N;
int ans[W][H]={0};
for(int i=0; i<N; i++){
cin>>x>>y>>a;
if(a==1){
for(int j=0; j<x; j++){
for(int k=0; k<H; k++) ans[j][k]=1;
}
}
else if... | 0 | 62,452,962 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main(){
int n;
cin >> n;
map<ll,int> mp;
vector<ll> a(n);
rep(i,n)cin >> a[i];
ll x = -1,y = 0;
sort(a.rbegin(),a.rend());
rep(i,n-1){
if... | #include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9+7
using ll = long long;
using P = pair<int, int>;
using lP = pair<ll, ll>;
using fP = pair<double, doubl... | 0 | 14,717,776 |
#include<bits/stdc++.h>
#include <array>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
using LL = long long;
using ULL = unsigned long long;
void solve() {
int n; cin >> n;
int pp[40000]; rep(i, n) { int p; cin >> p; pp[p-1] = i; }
for (int i = 0; i < n; i++) {
if (i != 0) cout << " ";
cout... | #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 _ << " " <<
#define sz(x) ((int) x.size())
#define pb(x) push_back(x)
#define TRACE(x) cerr << #x << " = " << x << endl
typedef long long ll;
typedef pair<int, int> point;
const int MAXN =... | 0 | 46,059,384 |
const bool DEBUG = 1;
#include <iostream>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <complex>
#include <random>
#include <iomanip>
#include <stdio.h>
#include <sys/time.h>
#include... | #include<bits/stdc++.h>
#define mo 1000000007
using namespace std;
long long read(){
long long xx=0,flagg=1;
char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-')
ch=getchar();
if(ch=='-'){
flagg=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
xx=xx*10+ch-'0';
... | 0 | 10,086,555 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,n) for (int i=0;i<n;i++)
int main(){
int n;
cin >> n;
vector<int> l(n);
vector<int> r(n);
rep(i,n) cin >> l.at(i) >> r.at(i);
int ans=0;
rep(i,n) ans += 1 + r[i] - l[i];
cout << ans << endl;
retu... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for(ll i=(a); i<(b)... | 0 | 41,901,471 |
#include <stdio.h>
int kuadrat(int a, int b)
{
int total = 1;
while(b > 0){
total *= a;
b--;
}
return total;
}
int main()
{
int cases;
scanf("%d", &cases);
long long int arr[cases], total = 1;
int i = 0;
char temp;
do
{
scanf("%lld%c", &arr[i], &temp);... | #include<iostream>
#include<map>
#include<string>
using namespace std;
string lowen(string str)
{
for(int i=0; i<str.size(); i++)
{
if('A'<=str[i] && 'Z'>=str[i])
str[i] += 'a'-'A';
}
return str;
}
int main(void)
{
string str;
int mode = 0;
string modest = "";
string longest = "";
map<string,int> dic;
wh... | 0 | 55,833,442 |
#include <utility>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
const int VALUES = 10000;
int A[VALUES], B[VALUES], C = 0;
while (true)
{
cin >> A[C] >> B[C];
if (A[C] == 0 && B[C] == 0) { goto Exit; }
if (A[C] > B[C]) { swap(A[C], B[C]); }
C... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
const int MAX = 1000000010;
const ll MOD... | 0 | 63,210,983 |
#include <iostream>
#include <iomanip>
using namespace std;
int main (int argc, char **argv) {
long a, b;
cin >> a >> b;
long d, r;
double f;
d = a / b;
r = a % b;
f = (double)a / (double)b;
cout << d << " " << r << " " << fixed << setprecision(5)<< f << endl;
} | #include <algorithm>
#include <iostream>
#include <limits>
#include <math.h>
#include <tuple>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include "string.h"
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <set>
using namespace std;
using intll_t = long long;
int main() {
i... | 0 | 96,422,801 |
#include <bits/stdc++.h>
using namespace std;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL<<60;
ll gcd(ll a, ll... | #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> ;
const int INF = 1e9;
const int MOD = 1000000007;
int main(){
int n;
cin >> n;
vector<string> s(n);
rep(i,n) cin >> s[i];
int A = 0,B = 0;
int AB = 0;
bool ok ... | 0 | 60,273,175 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
#define pb push_back
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define endl '\n'
const ll MOD = 1000000007;
int... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 0 | 98,094,801 |
#include <iostream>
#include <algorithm>
#include <cmath>
#define INF 1000000000
using namespace std;
int ary[5010],fn[80],ff[80],fl[80],fr[80];
int main(){
int N;
while(true){
cin>>N;
if(N==0) break;
for(int i=0;i<N;i++){
cin>>ary[i];
}
int NN=sqrt(N),NNN=(N-1)/NN+1,cnt,hog,hog2;
for(int i=0;i<NNN;i++... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> p;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<int> a(M);
vector<int> b(M);
vector<int> c(M);
for(int i = 0; i < M; i++) {
cin... | 0 | 75,248,407 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
ll a;
unordered_set<ll> st;
rep(i, 4) cin >> a, st.insert(a);
cout << ((st.count(1) && st.count(7) && st.count(9) && st.count(4)) ? "YES"
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector... | 0 | 66,980,438 |
#include <stdio.h>
int main () {
int a[3][3];
int count = 0;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
scanf("%d", &a[i][j]);
}
}
int n, m, b[3][3];
scanf("%d", &n);
for ( int i = 0; i < n; i++) {
scanf("%d", &m);
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if ... | #include <bits/stdc++.h>
int N = 1e6, SZ = 320, INF = 1 << 29;
long long LINF = (1LL << 60), mod = 1e9 + 7;
const long double eps = 1e-8, PI = acos(-1.0);
#define lowbit(x) (x & (-(x)))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<long long, long lo... | 0 | 87,133,938 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
ll cnt[100010];
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
... | #include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <complex>
#include <ctime>
#include <cst... | 0 | 47,930,587 |
#include<iostream>
#include <string>
using namespace std;
int main()
{
int iodd = 0;
int iedge = 0;
int patternsum = 0;
cin >> iodd >> iedge;
if (iodd == 0) {
patternsum = (iedge * (iedge - 1) / 2);
}
else if (iedge == 0) {
patternsum = (iodd * (iodd - 1) / 2);
}
else {
patternsum = (iodd * (iodd - 1) / ... | #include <iostream>
#include <algorithm>
#include <vector>
template <typename Iterator>
auto findMaximumSum (Iterator begin , Iterator end) -> long long
{
long long res = * begin;
auto tmp = res;
for (auto ite = begin + 1; ite != end; ++ ite)
{
tmp += * ite;
res = std::max (res , tmp);
... | 0 | 1,724,345 |
#include <stdio.h>
int main(void) {
int a,b;
scanf("%5d",&a);
scanf("%5d",&b);
if(a>b){
printf("a > b\n",a,b);
}
if(a<b){
printf("a < b\n",a,b);
}
if(a==b){
printf("a == b\n",a,b);
}
} | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <functional>
#include <map>
using namespace std;
using ll = long long int;
int main(){
int N;cin>>N;
vector<int> A(N);
map<int,int> m... | 0 | 40,708,095 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
template<class T> using P = ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdint>
#include <iostream>
#include <iterator>
#include <vector>
#ifndef UTIL_HPP
#define UTIL_HPP
using i64 = ::std::int_fast64_t;
using u64 = ::std::uint_fast64_t;
using i32 = ::std::int_fast32_t;
using u32 = ::std::uint_fast32_t;
namespace tools {
template ... | 0 | 490,366 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i,s,n) for(int i = (s); i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(){
string s;
ll k;
cin >> s >> k;
if(s[0]=='1'){
if(k==1)
cout << s[0] << endl;
... | #include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <utility>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define ye... | 0 | 97,477,752 |
#include <iostream>
#include <queue>
#include <vector>
#include <set>
#include <algorithm>
#include <stdio.h>
inline int in() { int32_t x; scanf("%d", &x); return x ;}
using namespace std;
const int MAX_N = 1e5 + 5;
struct top3
{
int a[4] = {0 , 0 , 0 , 0};
void add(int x)
{
a[3] = x;
sort(a... | #include<cstdio>
#include<cmath>
double getd(double x, double y){
double r = atan2(y, x) * 180 / M_PI;
return r;
}
int main(){
double x1,y1,x2,y2,x3,y3,xp,yp,d1,d2,d3;
double h;
while(scanf("%lf %lf %lf %lf %lf %lf %lf %lf", &x1,&y1,&x2,&y2,&x3,&y3,&xp,&yp) + 1){
x1 -= xp;
x2 -= xp;
x3 -= xp;
y1 -= yp;
y... | 0 | 54,285,356 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string X;
string Y;
cin >> X >> Y;
if(X[0] == Y[2] && X[2] == Y[0]){
if(X[1] == Y[1]){
cout << "YES" << endl;
}
else {
cout <<"NO"<<endl;
}
}
else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int A[300005];
void solve(int L, int lim, int a, int b)
{
if(lim == 0)
return;
a = min(a, lim - b + 1);
for(int i=lim-a+1; i<=lim; i++)
A[i] = L++;
solve(L, lim-a, a, b-1);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL), cout.t... | 0 | 92,783,947 |
#include <iostream>
using namespace std;
int main() {
string n;
cin >> n;
long long sum = 0;
for (const char &c : n) sum += c - '0';
puts(sum % 9 == 0 ? "Yes" : "No");
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int a, b, c, d, e;
vector<int> dishes(5);
rep(i, 5) cin >> dishes[i];
int m = dishes[0] % 10;
int idx = 0;
for(int i = 1; i < 5; i++) {
if(dishes[i] % 10 < m &&... | 0 | 96,053,329 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n + 1);
ll s = 0;
for (int i = 0;... | 0 | 12,555,764 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
int n;
cin>>n;
int x=1;
while(x*(x+1)/2<=n) x++;
int s=x*(x+1)/2-n;
for(int i=1;i<=x;i++){
if(i==s) continue;
cout<<i<<endl;
}
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << " : " <... | 0 | 49,764,104 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define ld long double
#define ff first
#... | #include <bits/stdc++.h>
using namespace std;
signed main () {
string s;
cin >> s;
for (int i = 0; i < int(s.size()); ++i) {
if (s[i] == '1')
cout << '9';
else if (s[i] == '9')
cout << '1';
else
cout << s[i];
}
cout << '\n';
} | 0 | 65,144,388 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll INFL = 1e18;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x / 10) + 1;
}
ll gcd(lon... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool check = false;
while(0<s.size()) {
if(s.size()<5) {
check = true;
break;
}
if(s[4]=='m') {
if(s.size()>7) {
if(s.substr(0,7)=="dreamer" && s[7]=='a') {s = s.substr(5); continue;}
els... | 0 | 17,496,181 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <tuple>
#include <stack>
#include <bitset>
#include <utility>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long... | #include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF=(long long)1E17;
#define i_7 (long long)(1E9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
using namespace st... | 0 | 67,538,775 |
#include <iostream>
#include <algorithm>
using namespace std;
#define repeat(i,n) for (int i = 0; i < (n); ++i)
#define repeat_from(i,m,n) for (int i = m; i < (n); ++i)
#define MAX_S 1000
int dp[2][MAX_S+1];
int main() {
string s1, s2;
getline(cin, s1);
getline(cin, s2);
int *cur = dp[0]; repeat (i,s2.s... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std ;
#define int long long
#define ull unsigned long long int
#define ld long double
#define vi vector<int>
#define vii vector<p... | 0 | 2,483,793 |
#include <bits/stdc++.h>
using namespace std;
const int64_t INF = 1e18;
int main() {
int N, K; cin >> N >> K;
vector<int64_t> A(N);
K--;
for(auto &a : A) cin >> a;
int64_t ans = INF;
for(int bit = 0; bit < (1 << (N - 1)); ++bit) {
if(__builtin_popcount(bit) != K) continue;
int64_... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<string> a... | 0 | 26,248,584 |
#include<stdio.h>
int main(){
char C;
scanf("%c", &C);
if(C != 'z'){
printf("%c", C + 1);
}
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
typedef long long ll;
vector<ll> fac(1000001);
vector<ll> ifac(1000001);
const ll M = pow(10,9)+7;
ll mpow(ll x, ll n){
ll ans = 1;
while(n != 0){
if(n&1) ans = ans*x % M;
x = x*... | 0 | 96,193,822 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main () {
ll n, m;
int a[3][3];
ll i, j, k;
ll ret = 0;
for ( i = 0;i < 3; i++ ) {
for ( j = 0; j < 3; j++ ) {
cin >> a[i][j];
}
}
cin >> n;
vector<int> b(n);
for ( i = 0; i < n; i++ ) {
... | #include <cstdio>
#include <cstdlib>
#include <string>
using namespace std;
int main(){
char str[1000], cmd[7], p[1000];
int a, b, q;
string OUT;
scanf("%s", str);
string STR = str;
scanf("%d", &q);
for(int i = 0; i < q; i++){
scanf("%s %d %d", cmd, &a, &b);
string CMD = cmd;
if(CMD == "replac... | 0 | 2,027,805 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<ll>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF =... | 0 | 71,200,990 |
#include <bits/stdc++.h>
#include <numeric>
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define SORT_INV(c) sort((c).begin(), (c).end(), greater<int>())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
#define LL long long
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n;
cin>>n;
vector<int> c(n-1),s(n-1),f(n-1);
rep(i,n-1) cin>>c[i]>>s[i]>>f[i];
rep(i,n-... | 0 | 83,190,707 |
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
inline ll read()
{
ll x=0,w=1; char c=getchar();
while(c<'0'||c>'9') {if(c=='-') w=-1; c... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | 0 | 18,261,466 |
#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 <bits/stdc++.h>
using namespace std;
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const ll mod = 1000000007;
const ll INF = 1e18;
const ll MAX = 100001;
void solve(){
int k, n;
cin>>k>>n;
vector<int> vec(n);
for(int i = 0; i< n; i++)
cin>>vec[i];
... | 0 | 84,165,072 |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int ll
#define pb push_back
#define setbits(x) __builtin_popcountll(x)
#define endl "\n"
typedef long long ll;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int val,n;
cin>>val>>n;
int ans=0;
while(n--)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pi 3.14159265
#define EPS 1e-8
#define mod 1000000007
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define endl "\n"
const ll INF=(ll)2e18;
long long binpow(long long a, long long b, long long m) {
... | 0 | 57,053,655 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
typedef long long ll;
typedef pair<int, int> pii;
const int MAXN = 100 * 1000 + 17;
ll n, k, a[MAXN], ans, ps[MAXN], ss[MAXN], s[MAXN];
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n... | 0 | 73,084,224 |
#include <cstdio>
bool query(long long x){
printf("? %lld\n",x);
fflush(stdout);
char s[10];
scanf("%s",s);
return s[0]=='Y';
}
int main(){
long long X=1000000000;
for (;!query(X);X/=10);
if (X==1000000000)
for (X=1;!query(X+1);X*=10);
else{
int l=X,r=X*10-1;
for (;l<=r;){
int mid=(l+r)>>1;
if (que... | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
string s; cin>>s;
int o=0,n=s.length();
for (int i = 0; i < n; i++)if(s[i]=='1')o++;
if(o==0 || n-o==0)return cout<<0,0;
cout<<2*min(o, n - o);
} | 0 | 35,357,184 |
#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... ... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include... | 0 | 84,047,480 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=(x);i<(y);++i)
#define mp(a,b) make_pair((a),(b))
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define dump(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define dump(x)
#endif
typedef long lon... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <queue>
#include <sstream>
#include <stack>
#include <time.h>
#include <vector>
#include <complex>
#include <map>
#include <set>
#include <iomanip>
#include <ma... | 0 | 99,494,530 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <stack>
#include <map>
const int MOD = 1e9+7;
#define PI 3.14159265359
typedef long long ll;
using namespace std;
ll dp1[100][4];
ll dp2[100][4];
int stoi(char c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1001001001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
const int MAX = 2000000;
long long fa... | 0 | 46,277,813 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl "\n"
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define int long long i... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,ans=0,flag=0;
int num[101];
int idx;
cin>>n;
for(int i=0;i<n;i++){
cin>>num[i];
}
for(int i=0;i<n;i++){
idx=i;
for(int j=i+1;j<n;j++){
if(num[idx]>num[j]){
flag=1;
idx=j;
}
}
int temp=num[i];
num[i]=num[id... | 0 | 27,755,894 |
#include <iostream>
#include <map>
using namespace std;
int main()
{
int N;
cin >> N;
map<int, int> m;
for (int i = 1; i <= N; i++) {
int tmp;
cin >> tmp;
m[tmp] = i;
}
for(auto itr = m.begin(); itr != m.end(); itr++) {
cout << itr->second << " ";
}
cout << endl;
return 0;
} | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps =... | 0 | 97,284,125 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> VI;
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 _overload3(_1,_2,... | #include <bits/stdc++.h>
#define int long long
using namespace std;
void dfs(vector<set<int>>& g, int u, int cur_comp, vector<int>& components) {
if (components[u] != -1) {
return;
}
components[u] = cur_comp;
for(auto v : g[u]) {
dfs(g, v, cur_comp, components);
}
}
int32_t main() {
... | 0 | 11,959,676 |
#include<bits/stdc++.h>
#include<iomanip>
#define fast {ios_base::sync_with_stdio(false);cin.tie(NULL);}
#define mxn 300007
#define ar array
#define mod 1000000007
#define ld long double
#define pb push_back
#define ar array
#define fi first
#define se second
typedef long long int ll;
using namespace std;
int main(void... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0 ,-1};
signed main(){
int n;
cin >> n;
vector<int> a(n);
int x = 0;
int count = 0;
for (int i = 0; i < n; i++) {
c... | 0 | 57,097,188 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long l... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | 0 | 94,697,781 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
const int INF = 1000000000;
typedef pair<int, int> P;
const int MAX_N = 1000000;
const int MAX_L = 100000000;
const int MAX_SQRT_B = 10000;
typedef int64_t l... | #include <iostream>
using namespace std;
#define MOD 1000000007
int main(int argc, const char * argv[]) {
int S;
cin>>S;
int a=0,a_1=0,a_2=0,a_3=1;
for(int i=2;i<S;++i){
a=a_1+a_3;
a%=MOD;
a_3=a_2;
a_2=a_1;
a_1=a;
}
cout<<a<<endl;
return 0;
} | 0 | 43,648,042 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | #include <iostream>
#include <stack>
using namespace std;
bool issame(char a,char b){
if(a=='(')return b==')';
if(a=='[')return b==']';
}
int main(){
while(1){
char in;
in=cin.peek();
if(in=='.')return 0;
stack<char> sta;
bool iscorrect=true;
while(cin.get(in),in!='.'){
if(cin.e... | 0 | 57,413,755 |
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | 0 | 98,771,087 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<math.h>
#include<iomanip>
#include<algorithm>
#include<string.h>
#include<cctype>
#include<map>
#include<set>
#include<vector>
#include<sstream>
#include<stack>
#include<queue>
using namespace std;
const int MAX_N=10000+5;
int n;
int par[MA... | #include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
int N, M;
int A[1 << 18], B[1 << 18], C[1 << 18], D[1 << 18];
int main() {
cin >> N >> M;
for (int i = 1; i <= N; i++) cin >> A[i] >> B[i];
for (int... | 0 | 68,623,639 |
#include<iostream>
#include<map>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
int N = S.size();
map<char, char> M;
bool transformable = true;
for (int i = 0; i < N; i++) {
if (M.find(S[i]) != M.end() && M[S[i]] != T[i]) { transformable = false; break; }
M[S[i]] = T[i];
}
M.clear... | #include<iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main(void){
int n;
int taro=0,hanako=0;
char string1[101],string2[101];
cin >> n;
for(int i = 0;i<n;i++){
cin >> string1 >> string2;
if(strcmp(string1,string2)==0){
taro++;
hanako... | 0 | 23,900,773 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s,t;
cin >> s >> t;
vector<char> s_sort(s.size()),t_sort(t.size());
for(int i=0; i<s.size(); i++){
s_sort.at(i)=s.at(i);
}
for(int i=0; i<t.size(); i++){
t_sort.at(i)=t.at(i);
}
sort(s_sort.begin(),s_sort... | #include<bits/stdc++.h>
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define of(i,l,r) for(int i=l;i>=r;i--)
#define fe(i,u) for(int i=head[u];i;i=e[i].next)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
inline void open(const char *s)
{
#ifndef ONLINE_JUDGE
char str[20];
sprintf(str,"%s.in",s);
... | 0 | 25,639,234 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e15;
int main(){
ll N; cin >> N;
vector<ll> V(N); for(int i = 0; i < N; i++) cin >> V[i];
sort(V.begin(), V.end());
ll SUM = V[N-1], idx = N-1;
for(int i = 0; i < N-1; i++) SUM-=V[i];
ll ans = SUM;
for... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n, m;
cin >> n >> m;
vector<vector<int>> vec(n + 1, vector<int>(n + 1));
rep(i, m)
{
int a, b;
cin >> a >> b;
vec[a][b] = 1;
vec[b][a] ... | 0 | 83,913,561 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
ll chose2(ll n) {
return n * (n - 1) / 2;
}
int main() {
int n;
cin >> n;
vector<int> as(n);
rep(i, n) cin >> as[i];
rep(i, n) as[i]--;
vector<int> cnt(n);
rep(i, n) cnt[as[i]]++;
l... | #include<cstdio>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<set>
#include<cstring>
#include<map>
using namespace std;
#define int long long int
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#define... | 0 | 32,686,857 |
#include <bits/stdc++.h>
#define rep(i, e, n) for (int i = e; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const ll inf=1000000000007;
int main(){
ll n;
cin >> n;
vector<ll> a(n+1,1);
rep(i,2,n+1){
for(int j=i; j<n+1; j+=i){
a[j]++;
}
}
ll ans=1;
rep(i,2,... | #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 x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
rep(i, 0, x) cin >> a[i];
rep(i, 0, y) cin >> b[i];
rep(i, 0, z) cin ... | 0 | 61,859,138 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> pii;
#define mp(a, b) make_pair(a, b)
#define sqr(s) ((s) * (s))
const int inf = 0x7fffffff / 3.27;
const int maxn = 105;
int i, j, t, n, m, l, r, k, z, y, x;
int a, b;
char f[maxn][maxn];
void calc(int a, int b) {
int i, j;
... | #include <bits/stdc++.h>
#include <limits>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
#define fi(i,n) for( ll i=0 ; i<n ; i++ )
#define f(i, a, b) for( ll i=a ; i<b ; i++ )
#define vi vector<int>
#define pb push_back
#define MOD 1000000007
ll digits(ll n)
{
return floor(log10... | 0 | 75,758,632 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout)... | 0 | 63,910,472 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, l, r) for (int i=(l); i<(r); ++i)
#define RREP(i, r, l) for (int i=(r); i>(l); --i)
#define CASET int _T; cin >> _T; REP(caset, 0, _T)
#define print(x) cout << to_string(x) << '\n'
#define vi vector<int>
#define vb vector<bool>
#define v... | #include<bits/stdc++.h>
using namespace std;
#define ANSWER(x) cout<<x<<endl
#define debug(x) cout<<#x<<": "<<x
typedef pair<int,int> P;
void bfs(int sx,int sy);
int H,W,N,a;
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};
int cheese_x[10];
int cheese_y[10];
char ch[1001][1001];
int al[1001][1001];
int S_x,S_y,hp = 1,d... | 0 | 61,705,343 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.