code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#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 reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
typedef long long ll;
typedef vector<int> vi;
ll mod = 1e9+7;
ll solve() {
int N, a; cin >> N;
vi nums;
rep(i, N) {
cin >> a;
nums.push_back(a);
}
int r... | 0 | 38,980,519 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int N = 1e5+5;
int n, p[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for(int i = 0; i < n; i++) {
int x;
cin >> x;
x--;
p[x] = i;
}
vector<int> a(n), b(n);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1000 + 10;
ll a[N], b[N * N], sum[N];
int x;
bool cmp(ll a, ll b) { return ((a >> x) & 1) > ((b >> x) & 1); }
int main()
{
int n, k;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
{
scanf("%lld", &a[i]);
... | 0 | 55,766,260 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k; cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int g = 1;
while (true) {
int tmp = k + (g - 1) * (k - 1);
if (tmp < n) {
}
else {
break;
}
g++;
}
cout << g << endl;
return... | #include <bits/stdc++.h>
using namespace std;
void input(int& rnMaxNum, int& rnWinPnt)
{
cin >> rnMaxNum >> rnWinPnt;
}
double calcWinRate(int nMaxNum, int nWinPnt)
{
vector<int> vnBorder;
int nBorder = nWinPnt;
vnBorder.push_back( nBorder );
while (nBorder > 1)
{
nBorder = (nBorder + 1) / 2; ... | 0 | 24,164,103 |
#include <iostream>
using namespace std;
int main() {
signed int x, y;
unsigned int W, H, r, hantei;
cin >> W >> H >> x >> y >> r;
signed int top = y + r;
signed int right = x + r;
signed int bottom = y - r;
signed int left = x - r;
if(top > H || right > W || bottom < 0 || left < 0){
cout << "No\n";... | #include<bits/stdc++.h>
using namespace std;
void AC(){cout<<"AC\n";exit(0);}
void WA(){cout<<"WA\n";exit(0);}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin>>s;
if(s[0]!='A'||s[1]=='C'||s[s.size()-1]=='C')WA();
int C=0;
for(int i=1;i<s.size();i++)
{
if(isupper(s[i])&&s[i]!='C')WA();
if... | 0 | 907,424 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int dp[110][5],dp2[110][5];
signed main(){
string N;
int K;
cin>>N>>K;
dp2[0][0]=1;
for(int i=0;i<N.size();i++){
for(int j=0;j<=K;j++){
dp[i+1][j]=dp[i][j]+(N[i]!='0'?dp2[i][j]:0);
dp2[i+1][j]=(N[i]=='0'?dp2[i][j]:0);
}
... | #include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
using namespace std;
using pii = pair<int,int>;
... | 0 | 62,604,071 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using p = pair<int, int>;
#define INF 1001001001
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repX(i, n ,x) for (int i = x; i < (int)(n); i++)
#define repBack(i, n) for (int i = n; i >= 0; i--)
#define dup(x,y) (((x)+(y)-1)/(y))
int mai... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int S1 = s.size(), T1 = t.size();
vector<char> S(S1), T(T1);
for (int i = 0; i < S1; i++) {
S.at(i) = s.at(i);
}
for (int i = 0; i < T1; i++) {
T.at(i) = t.at(i);
}
sort(S.begin(), S.end());
sort(T.beg... | 0 | 25,420,904 |
#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 <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <... | 0 | 95,921,716 |
#include<bits/stdc++.h>
#define ll long long
const int inf = 1e9+7;
const ll INF = 1e18+7;
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
int a,b;
cin >>a>>b;
if(a<=8 && b<= 8){
cout<<"Yay!\n";
}
else
cout<<":(\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1e12
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vpl... | 0 | 91,168,342 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
const int INF = 2147483647;
const ll MOD = 1000000007;
int main() {
int n;
cin >> n;
int table[n-1][3];
rep(i,n-1){
rep(j,3){
cin >> table[i][j];
}
}
vector<int> ans(n);
rep(i,n-1){... | #include <bits/stdc++.h>
using namespace std;
int N, M;
int WA[105000];
bool AC[105000];
void solve() {
cin >> N >> M;
int WAnum = 0;
int ACnum = 0;
for(int i = 1; i <= N; i++) {
WA[i] = 0;
AC[i] = false;
}
while(M--) {
int p;
string S;
cin >> p >> S;
... | 0 | 616,540 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000
#define base10_5 100000
#define base10_6 1000000
#define base10_7 ... | #include <iostream>
#include <vector>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
int main(){
int n,m;
cin >> n;
int r1,r2,r3;
for(int i=0; i<999;i++){
m = n;
r1 = (n%10);
n-=r1;
n/=10;
r2 = (n%10);
n-=r2;
n/=10;
... | 0 | 5,232,367 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <list>
using namespace std;
list<int> lst;
char op[15];
int dd;
int n;
struct Item
{
Item *prev;
Item *next;
int v;
};
Item *head=NULL;
void init()
{
head=new Item();
head->next=head;
head->prev=head;
}
Item * fnd(int d)
{
Item *... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int w,h,n;
cin >> w >> h >>n ;
VI x(n);
VI y(n);
VI a(n);
rep(i,n){
cin >> x[i] >> y[i] >> a[i]... | 0 | 73,348,176 |
#include<iostream>
#include<map>
using namespace std;
main(){
int a,b=0,c=0,n,x=0,max=0;
map< int,int >p;
for(a=0;a++<100;p[a]=0);
while(cin>>n){
if(p[n]==0){
if(b==0||b<n)b=n;
}
p[n]++;
}
for(a=0;a<b;a++){
if(max<p[a]){
max=p[a];
}
}
for(a=0;a<b;a++){
if(max==p[a]){
... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int IsStable(int N, vector<string>Sort_v1, vector<string>Sort_v2){
for (int i = 0; i < N - 1; i++){
for (int j = i + 1; j < N - 1; j++){
for (int a = 0; a < N - 1; a++)
for (int b = a+1; b < N - 1; b++){
if (Sort_v1[i][1] == Sor... | 0 | 83,931,556 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
using namespace std;
void solve(){
int x; cin >> x;
if(x < 1200) cout << "ABC\n";
else cout << "ARC\n";
return;
}
int main(){
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | 0 | 1,635,337 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | #define TEMPLATE_USED
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _o... | 0 | 79,865,514 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n; cin >> n;
double ans;
for (int i=0; i<n; i++) {
double x; string u;
cin >> x >> u;
if (u == "JPY") {
ans += x;
} else {
ans += x * 380000;
}
}
cout << ans << endl;
return 0;
} | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | 0 | 66,215,079 |
#include <iostream>
using namespace std;
int main(){
int temp,i;
i=0;
while(true){
cin>>temp;
if(temp==0)
break;
else
cout<<"Case "<<i+1<<": "<<temp<<endl;
i++;
}
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef unsigned long long li;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
li n;
cin >> n;
vector<li> xs(n);
for (int i = 0; i < n; ++i) {
cin >> xs[i];
}
li xorsum = 0;
for (int i = 0; i < n; ++i) {
xorsum ^= xs... | 0 | 80,532,840 |
#ifdef LOCAL_BUILD
#include "pch.h"
#define DLOG(msg) cout << "#" << __LINE__ << ":" << msg << endl;
#define DLOG_V(var)\
cout << "#" << __LINE__ << ":" << #var << " : " << var << endl;
#else
#include <bits/stdc++.h>
#define DLOG(msg)
#define DLOG_V(var)
#endif
using namespace std;
int main() {
int n;
cin >> n;
... | #include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n, m, ans = 0;
cin>> n>>m;
int sw[n][m];
vector<int> onoff(n);
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
sw[i][j] = 0;
}
}
for(int i=0;i<m;i++){
int k;
cin>>k;
for(int j=0;j<k;j++){
int b;
ci... | 0 | 13,587,206 |
#include<vector>
#include <iostream>
#include<string>
#include <complex>
#include <algorithm>
#include<string>
using namespace std;
int main(){
int n ;
cin >> n;
string x[n];
double u[n];
double bit = 380000.0;
double all = 0;
for(int i = 0; i < n; i++){
cin >> u[i];
cin >> x... | #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>;
ll x = 1e9 + 7;
int main() {
int k;
cin >> k;
vector<ll> x(k+5);
int i = 1, j = 1;
while (j <= k) {
if (j < 10) {
x[j] = j;
j++;
}
else {
i... | 0 | 76,918,413 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n; cin >> n;
long long money=1000; long long stock=0;
int before; cin>>before;
int after;
for (int i=1; i<n; i++){
cin >> after;
if(after>before){
stock = money/before;
money = money%before;
... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N ;
vector<int>t(N+1);
vector<int>x(N+1);
vector<int>y(N+1);
for (int n = 0;n < N;++n) {
cin >> t[n+1] >> x[n+1]>>y[n+1];
}
vector<int>t2(N);
vector<int>x2(N);
vector<int>y2(N);
for (int n = 0; n < N; ++n) {
t2[n] = t[n + 1] - t[n... | 0 | 5,420,174 |
#include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
#define revrep(i,n,g) for (int i = n; i >= g; i--)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int m,k;
cin >> m >> k;
if (m <= 1) {
if (m == 0 && k == 0) {
cout << "0 0" << endl;
} else if... | #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 z = s - x - y;
if (0 <= z && z <= k) {
count++;
}
}
}
cout << c... | 0 | 60,573,794 |
#include <bits/stdc++.h>
#define LL long long
#define PII pair<int,int>
#define PIL pair<int,LL>
#define PLI pair<LL,int>
#define PIII pair<int,PII>
#define PLL pair<LL,LL>
#define PLII pair<LL,PII>
#define VI vector<int>
#define VVI vector<VI>
#define VL vector<LL>
#define VVL vector<VL>
#define VPII vector<PII>
#defi... | #include <stdio.h>
int main(){
int n,k,bank = 1;
scanf("%d" , &n);
scanf("%d" , &k);
for(int i = 0 ; i < n ; i++){
if(bank * 2 > bank + k){
bank += k;
}
else{
bank *= 2;
}
}
printf("%d" , bank);
return 0;
} | 0 | 48,279,681 |
#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... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const long long INF = 1e15;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
ll n,x,m;
cin >> n >> x >> m;
vector<vector<ll>> sum(40,vector<ll>(m));
vector<vector<ll>> doubling(40... | 0 | 77,728,948 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin>>n;
if(n%2==0)
cout<<(n/2-1)<<"\n";
else
cout<<(n/2)<<"\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) for(ll i=(a);i>=(b);... | 0 | 50,576,570 |
#include<bits/stdc++.h>
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
int main() {
int n;
scanf("%d", &n);
n--;
int t = 0, a, b;
;
scanf("%d%d%d", &t, &a, &b);
if ((abs(a - 0) + abs(b - 0) > t)
|| (((abs(a - 0) + abs(b - 0)) & 1) && !(t & 1))
|| (!((abs(a - 0) + abs(b - 0)) &... | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout<<setprecision(x);
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX*0.99
#define int long long
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define yes "Yes"
#define no "No"
#define divs 100000000... | 0 | 34,062,326 |
#include<iostream>
#include<cstdio>
using namespace std;
const int MAXN=300005;
int X[MAXN],Y[MAXN];
struct square
{
int x,y;
}sq[MAXN];
int main()
{
int H,W,M;
scanf("%d%d%d",&H,&W,&M);
int max_x=0,max_y=0;
int u,v;
for(int i=1;i<=M;++i)
{
scanf("%d%d",&u,&v);
++X[u];++Y[v];
sq[i].x=u;
sq[i].y=v;
}
f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807;
const int inINF = 2147483647;
const ll MOD = 100000000... | 0 | 63,824,015 |
#include <string>
#include <cmath>
#include <iostream>
using namespace std;
int main(){
double x1;
double y1;
double x2;
double y2;
double l;
double x;
double y;
cin >> x1;
cin >> y1;
cin >> x2;
cin >> y2;
x = x1 - x2;
y = y1 - y2;
l = x*x + y*y;
cout << fixed << sqrt(l) << endl;
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int... | 0 | 39,456,370 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) x.begin(),x.end()
int const N = 200001;
ll r[N], f[N];
int main(){
ll n, k;
string s;
cin >> n >> k >> s;
if(k == 2 || k == 5){
ll an = 0;
for(int i = 0; i<n; ++i){
if((s[i]-'0') % k == 0){
... | #include <bits/stdc++.h>
#include <complex>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll N,M,H,W,K,Q,A,B,C,L,R;
string ... | 0 | 77,218,100 |
#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;
template<typename T>
using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define ld long double
#defi... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long> x;
long long tmp;
x.push_back(-1e9-3);
for(int i = 0;i<n;i++){
cin >> tmp;
x.push_back(tmp);
}
long l;
cin >> l;
x.push_... | 0 | 20,893,300 |
#include<iostream>
#include<string>
using namespace std;
int main(){
long long a=100000;
int n;
cin>>n;
for(int i=0;i<n;i++){
a*=1.05;
if(a%1000==0)
a-=1000;
a/=1000;
a*=1000;
a+=1000;
}
cout<<a<<endl;
return 0;
} | #include<stdio.h>
int main()
{
int n,k,d,a,i,j,c=0,f[101]={0};
scanf("%d %d",&n,&k);
for(i=0;i<k;i++){
scanf("%d",&d);
for(j=0;j<d;j++){
scanf("%d",&a);
f[a]=1;
}
}
for(i=1;i<=n;i++){
if(f[i]==0) c++;
}
printf("%d\n",c);
return 0;
} | 0 | 91,552,650 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
vector<int> a(4);
a[0] = 0;
for (int i = 1; i <= 3; ++i) cin >> a[i];
sort(a.begin(), a.end());
ll ans = 0;
do {
if (a[0] == 0 || a[3] == 0) continue;
ll tmp;
if ... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long R,G,B,N;cin>>R>>G>>B>>N;
long long ans=0;
for(long long i=0;i*R<=N;i++){
for(long long j=0;j*G+i*R<=N;j++){
if((N-(i*R+j*G))%B==0){
ans++;
}
}
}
cout<<ans<<endl;
return... | 0 | 6,313,186 |
#include <vector>
#include <set>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
using ll = long long;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
inline void yes(bool cond) { cond ? puts("Yes") : puts("No"); }
template<... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
#include <set>
#include <map>
#include <unordered_map>
#include <cassert>
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define fast_io(); std::ios_bas... | 0 | 93,579,790 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, N) for(int i = 0; i < N; i++)
#define rep2(i, N, a, b) for(int i = a; i < N; i += b)
typedef long long ll;
int main(){
int N, K;
cin >> N >> K;
int ans = K;
rep2(i, N, 1, 1){
ans *= (K - 1);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
scanf("%d", &n);
for(int i = 0; i <= n / 4; i++) {
for(int j = 0; j <= n / 7; j++) {
if(4 * i + 7 * j == n) {
printf("Yes\n");
return 0;
}
}
}
printf("No\n");
... | 0 | 70,455,669 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef tuple<ll, ll... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | 0 | 64,186,422 |
#include <iostream>
using namespace std;
int main()
{
int h, w;
while (1) {
cin >> h >> w;
if (!h && !w) break;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cout << "#";
}
cout << '\n';
}
cout << '\n';
... | #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;
const long long MOD = 1000000007;
#define SET(x) memset(x, 0, sizeof(x))
#define SET2d(x,m,n) memset(x, 0, sizeof(x[0][0]) * m * n)
#define SETBOOL(x) memset(x,false,siz... | 0 | 3,254,039 |
#include <bits/stdc++.h>
const long long MOD = 1e9+7;
using namespace std;
#define ll long long
#define ar array
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
string S,T;
cin >> S >> T;
int ans = 0;
for (int i = 0; i < 3; i++) {
if (S[i]==T[i]) ans++;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <limits>
#include <random>
#include <complex>... | 0 | 1,532,193 |
#include <bits/stdc++.h>
using namespace std;
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define REP(i,n) for(ll i=0;i<n;i++)
#define FOR(i,n1,n2) for(ll i=n1;i<n2;i++)
#define bFOR(i,n1,n2) for(ll i=n1;i>=n2;i--)
#define speed_up ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
... | #include<stdio.h>
struct UF{
int u[10001];
void init(int x){
for(int i=0;i<x;i++){
u[i] = i;
}
}
int unite(int x,int y){
x = find(x);
y = find(y);
if(x > y) u[x] = y;
if(y > x) u[y] = x;
}
int find(int x){
if(x != u[x]) u[x] = find(u[x]);
return u[x];
}
};
int main(){... | 0 | 50,662,913 |
#include <iostream>
int main() {
int n, m;
std::cin >> n >> m;
int ans = 1900 * m + (n - m) * 100;
for (int i = 0; i < m; ++i) {
ans *= 2;
}
std::cout << ans << std::endl;
} | #include<cstdio>
int vis[10];
int record[10];
int edge[5][5];
int find = 0;
void dfs(int p,int n){
if(p==n+1){
int ok = 1;
for(int i = 1; i <= 3; i++){
if(edge[record[i]][record[i+1]]==0) ok = 0;
}
find |= ok;
}
else{
for(int i = 1; i <= 4; i++){
... | 0 | 57,328,555 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define debug(a) cout<<a<<endl
#define clr(a) memset(a,0,sizeof(a))
#define clrne(a) memset(a,-1,sizeof(a))
#define clrinf(a) memset(a,0x3f,sizeof(a))
#define clrneinf(a) memset(a,0xc0,sizeof(a))
#define pb(a) push_back(a)
#define maxn 10001
#define mo... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#defin... | 0 | 75,165,240 |
#include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <vector>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,s,n) for(int i = (s);i<(int)(n);i++)
int main(){
int n;
cin >> n;
int k = n/100;
int l = k*111;
if... | #include <fstream>
#include <sstream>
#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <utility>
#include <algorithm>
using namespace std;
vector<string> split(const string &str, char delim){
istringstream iss(str); string tmp; vector<string> res;
while(getline(iss, tm... | 0 | 22,246,084 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()... | #include "bits/stdc++.h"
using namespace std;
void Main() {
int n;
cin >> n;
vector<vector<int>> chars(n, vector<int>(26, 0));
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
for (int j = 0; j < s.size(); ++j) {
chars[i][s[j] - 'a'] += 1;
}
}
string ... | 0 | 43,372,138 |
#include <bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
int dp[111][111],n,L[111],R[111];
int dfs(int l,int r){
if(dp[l][r]!=-1)return dp[l][r];
int res=1e9;
for(int i=l;i<r;i++){
res=min(res,dfs(l,i)+dfs(i+1,r)+L[l]*R[i]*R[r]);
}
return dp[l][r]=res;
}
signed main(){
memset(dp,-1,size... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define eb ... | 0 | 52,149,929 |
#include<bits/stdc++.h>
using namespace std;
using p=pair<int,int>;
#define int long long
#define rep(i,N) for(int i=0;i<N;i++)
signed main(){
int N,ans=0,i=0;
cin>>N;
while(pow(2,i)<=N){
ans=i;
i++;
}
cout<<pow(2,ans)<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | 0 | 24,139,005 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N, X, M, Sum_A = 0;
cin >> N >> X >> M;
if (M > 1) {
vector<long long> A(M+1, 0);
A.at(1) = X;
for (int i = 2; i <= M; i++) {
A.at(i) = (A.at(i-1)*A.at(i-1))%M;
}
int nagasa = 0, hajime = 0;
for (int i = 1; i < M; i... | #include <iostream>
using namespace std;
int dx[2] = { 1, 0 }, dy[2] = { 0, 1 };
int main() {
int H, W;
while(cin >> W >> H, H) {
bool ng[17][17] = { 0 };
int n;
cin >> n;
while(n--) {
int x, y;
cin >> x >> y;
ng[y][x] = true;
}
int dp[17][17] = { 0 };
dp[1][1] = 1;
for(int y = 1; y <= H; y++... | 0 | 15,347,921 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define repn(i, n) for(int i = 1; i <= n; i++)
#define repr(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define lint long long
int main(){
int a, b; cin >> a >> b; ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,x,i,u=0;
cin>>a>>b;
string s;
cin>>s;
x=s.size();
if(x!=(a+b+1) || s[a]!='-' )
{
cout<<"No"<<endl;
return 0;
}
for(i=0;i<x;i++)
{
if(s[i]=='-')
{
u++;
}
}
if(u>1)
{
cout<<"No"<<endl;
return 0;
}
cout<<"Yes"<<endl;
} | 0 | 39,462,911 |
#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... | #include<iostream>
#include<cmath>
using namespace std;
int main()
{
int n;
double x1,y1,x2,y2,x3,y3,x4,y4;
cin >> n;
for( int i = 0; i < n; i++ )
{
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
double px, py, qx, qy;
px = x2 - x1;
py = y2 - y1;
qx =... | 0 | 69,452,085 |
#include <iostream>
#include <vector>
#include <array>
#include <set>
#include <cmath>
#include <string>
#include <sstream>
#include <queue>
#include <list>
#include <stack>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cassert>
#include <bitset>
#include <cctype> ... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9L+7;
int n;
vector<vector<ll>> inp;
vector<vector<ll>> dp;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t=1;
while(t--)
{
ll k;
cin>>n>>k;
ll p[n],c[n];
for(i... | 0 | 33,245,786 |
#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 100000000... | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<cmath>
#include<iomanip>
#include<map>
#include<cstring>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vi vector<int>
#define vivi vector<vi>
const int INF = int(1e9);
typedef long long int ll;
int main(... | 0 | 34,302,063 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i,a,b) for(int i=(a);i<=(b);i++)
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define pcase(z,x) printf("Case %ld: %lld\n",z,x)
#define nw ... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define ALL(v) (v.begin(),v.end())
#define COUT(x) cout<<(x)<<... | 0 | 93,483,887 |
#include<string>
#include<iostream>
#include <algorithm>
#include<vector>
#include<functional>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <numeric>
#include <math.h>
#include <map>
#define ll long long
#define PI 3.14159265358979323846
#define INF 10000000000
#define rep(i,n) for(ll i=0;i<(ll)n;i+... | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 0 | 12,162,215 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string S,T;
cin >> S >> T;
int i,j;
bool exist;
for(i=S.length()-T.length(); i>=0; i--){
exist=1;
for(j=0; j<T.length(); j++){
if(S[i+j]!='?'&&S[i+j]!=T[j]){
exist=0;
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
const int N = 3;
int bingo[N][N];
int a[N][N];
signed main() {
rep(i,N) rep(j,N) cin >> a[i][j];
int n;
cin >> n;
rep(i,n) {
int x; cin >> x;
rep(j,N) {
rep(k,N) {
if(a[j][k] == x) bingo[j][k... | 0 | 43,609,716 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#de... | #include <iostream>
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <math.h>
#include <map>
#include <queue>
#include <string>
using namespace std;
int n,s,m[10];
int f(int n,int s,int m){
if(n==1){
if(s<m)return 1;
else return 0;
}
int t=0;
for(int i=0;i<=s&&i<m;i++)t+=f(n-1,s-i,i);
return t... | 0 | 82,781,465 |
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<map>
#include<tuple>
#define rep(index,num) for(int index=0;index<num;index++)
#define rep1(index,num) for(int index=1;index<=num;index++)
#define sc... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
int main() {
int a, b;
cin >> a >> b;
int ans = -1;
rep(i,1300) {
if(i * 8 / 100 == a && i * 10 / 100 == b) {
ans = i;
break;
}
}
cout << ans << endl;
return 0... | 0 | 92,164,765 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int X,N;
cin >> X >> N;
int minP = 0;
vector<bool> ped(100);
for(int i = 0; i < N; i++){
int p;
cin >> p;
ped[p-1] = true;
}
for(int i = -1; i < 101; i++){
if(i >= 0){
if(ped[i]) continue;
}
if(abs(minP-X) > abs(i+1-X)... | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
#include<map>
#include<iostream>
#include <cstring>
#include <iomanip>
#include <algorithm>
#define forr(i,a,b) for(int i=a;i<=b;i++)
#define F first
#define S second
#define input ios_base::sync_with_stdio(0);cin.tie(0);
const double PI = acos(-1.0);
using namespace ... | 0 | 82,214,628 |
#include <bits/stdc++.h>
#define fi first
#define se second
#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 srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | #include <bits/stdc++.h>
using namespace std;
int main (void) {
int N;
cin >> N;
vector<int> A(N);
for ( int i = 0; i < N; i++ )
cin >> A.at(i);
int ans = 0;
for ( int i = 0; i < N; i++ ) {
for ( int j = i+1; j < N; j++ ) {
ans = max(abs(A.at(i) - A.at(j)), ans);
... | 0 | 1,305,119 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
string S;
cin >> S;
int ans;
for (int i = 1; i < S.size(); i++)
{
int length = (S.size() - i);
if (length % 2 != 0)
{
continue;
}
if (S.... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
int main() {
int n, k; cin >> n >> k;
string s; cin >> s;
V<int> nums;
int cnt = 1;
i... | 0 | 65,612,330 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << ... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
ll gcd(ll a, ll b) {
while (b) {
... | 0 | 24,476,761 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A), b(B);
for (int i = 0; i < A; i++) {
cin >> a.at(i);
}
for (int i = 0; i < B; i++) {
cin >> b.at(i);
}
int ans = 1000000000;
for (int i = 0; i < M; i++) {
int x, y, c;
cin >> x ... | #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... | 0 | 59,656,717 |
#include<iostream>
using namespace std;
int main(){
int H, W;
cin >> H >> W;
while( H != 0 && W != 0){
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
cout << ".#"[j==0 || j == W-1 || i == 0 || i == H-1];
}
cout << endl ;
}
cout << endl;
cin >> H >> W;
}
return 0;
} | #include<iostream>
using namespace std;
int main(){
char a[100000][2];
int n,m;
char in;
while(cin>>n,n){
for(int i=0;i<n;i++){
cin>>a[i][0]>>a[i][1];
}
cin>>m;
for(int i=0;i<m;i++){
cin>>in;
bool flg=true;
for(int j=0;j<n;j++){
if(a[j][0]==in){cout<<a[j][1];flg=false;br... | 0 | 93,051,914 |
#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++)
ll dfs(ll i, ll n) {
if(i*n < 10) return (n-1);
ll base = 0, cur = 0;
while(cur < 10){
cur += i;
base++;
}
cur -= 9;
ll div = n / base... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod ll(1e9+7)
ll exp(ll a,ll b)
{
if(b==0)
return 1;
if(b%2==0)
return exp(a*a%mod,b/2);
return a*exp(a*a%mod,(b-1)/2)%mod;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout... | 0 | 56,708,080 |
#include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repeat(i,s,n) for(int (i)=s; (i)<(n); (i)++)
#define revrep(i,n) for(int (i)=(n)-1;i>=0; i--)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout<<setprecision(s... | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define ssort(a) sort(a.begin(), a.end())
#define INF 1001001001
#define INFll 100100100100100
#define PrintVec(x) for (auto elementPrintVec: x) { cout << elementPrintVec << " "; } cout << endl;
using namespace s... | 0 | 94,912,435 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
long long N;
int main(int argc, char* argv[]){... | #include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<algorithm>
#include<ctime>
#define int long long
using namespace std;
inline int read()
{
int kkk=0,x=1;
char c=getchar();
while((c<'0' || c>'9') && c!='-')
c=getchar();
if(c=='-')
c=getchar(),x=-1... | 0 | 27,370,335 |
#include<bits/stdc++.h>
using namespace std;
int GetDigit(int num){
int digit = 0;
while(num!=0){
num /= 10;
digit++;
}
return digit;
}
int main(){
int N;
cin >> N;
int count=0;
for(int i=1; i<=N; i++){
if(GetDigit(i)%2 ==1){
count++;
}
}
... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll N=1e5+5;
string a,b,c;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>a>>b>>c;
if(a[a.size()-1]==b[0]&&b[b.size()-1]==c[0])
cout<<"YES";
else
cout<<"NO";
return 0;
} | 0 | 44,210,638 |
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
typedef pair<LL, LL... | #include<iostream>
#include<cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;
#define PB push_back
void Input(int*,vector<string>&);
void Bubblesort(int*,vector<string>);
void Selectionsort(int*,vector<string>);
void Output(int*,vector<string>);
vector<string> vstr_bubble;
int main(int... | 0 | 82,135,486 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef pair<int,pii> iii;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef priority_queue<pii, vector<pii>, greater<pii>> fila_prioridade;
typedef priority_queue... | #include <iostream>
#include <algorithm>
using namespace std;
long long N,M;
void input()
{
cin >> N >> M;
}
void solve()
{
if (N >= 2 && M >= 2){
cout << (N-2) * (M-2) << endl;
} else if (N == 1 && M == 1) {
cout << 1 << endl;
} else {
cout << max(N,M) - 2 << endl;
}
}
int m... | 0 | 28,138,693 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef long long ll;
typedef long long ld;
int main() {
ios::sync_with_stdio(0),cin.tie(0);
ll n, a, b,tmp,aux,rta,tmp2;
cin>>n>>a>>b;
tmp = n / (a + b);
aux = n % (a + b);
tmp2 = min(a, aux);
rta = a * tmp + tmp2;
cout<<rta<<endl;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
#define INF __INT32_MAX__
#define LINF __LONG_LONG_MAX__
int main() {
ll N, K;
cin >> N >> K;
vector<pair<int, int>> A(N);
rep(i,... | 0 | 25,042,912 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main()
{
string s;
cin >> s;
int ans = 0;
bool ok = true;
rep(i, 3)
{
if (s[... | #include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <limits>
#include <functional>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <queue>
#define LOG(FMT...) fprintf(stderr, FMT)
using namespace std;
typede... | 0 | 54,526,029 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s;
getline(cin,s);
int a=s.size();
for(int i=0;a>i;i++){
if(s[i] >='A' && s[i] <= 'Z'){
s[i]=s[i]+32;
}
else if(s[i] >='a' && s[i] <= 'z'){
s[i]=s[i]-32;
}
}
cout<<s<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(0);
#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<<" ";new... | 0 | 14,601,244 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int max = 0;
long long temp,sum=0;
for(int i=0;i<n;i++){
cin>>temp;
if(temp>max){
max = temp;
}
else{
sum += max-temp;
}
}
cout<<sum<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string S;cin >> S;
int N = S.size();
if(N==2){
if(S[0]==S[1]){
cout << "1 2" << endl;
}else{
cout << "-1 -1" << endl;
}
return 0;
}
for(int i=0;i<N-2;i++){
char x = S[i],y = S[i+1],z = S[i+2];
i... | 0 | 35,643,451 |
#include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main() {
int n;
cin >> n;
ll a[n + 1], b[n + 1];
ll suma = 0;
ll sumb = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
suma += a[i];
}
for (int i = 1; i <= n; i++) {
cin >> b[i];
s... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#define rep_n(_1, _2, _3, NAME, ...) NAME
#define rep_2(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define rep_3(i, initial, n) for (int(i) = (int)(initial); (i) < (int)(n); ++(i))
#define rep(...) rep_n(__VA_ARGS__, rep_3, rep_2, rep_1)(__VA_ARGS_... | 0 | 15,604,553 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,d,x;
cin>>n>>d>>x;
int total=0;
while(n--)
{
int a;
cin>>a;
int temp=1;
for(int i=1;(i*a+1)<=d;i++)
{
temp++;
}
... | #include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;
#define INF 100000000
typedef long long ll;
int ... | 0 | 2,944,573 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int x3, y3, x4, y4;
int difx, dify;
difx = abs(x1-x2);
dify = abs(y1-y2);
if (x1 > x2){
if (y1 > y2){
x3 = x2 + dify;
y3 = y2 - difx;
x4 = x1... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t 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;
n = m % n;
... | 0 | 28,054,940 |
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <limits>
#include <queue>
#include <iomanip>
#include <set>
template<typename T> bool chmax(T &a,T b){
if(a<b){
a=b;
return true;
}
return false;
}
template<typename T> bool chmin(T &a,T b... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
if(n>399 && n<600)
cout<<"8";
else if(n>599 && n<800)
cout<<"7";
else if(n>799 && n<1000)
cout<<"6";
else if(n>999 && n<1200)
cout<<"5";
else if(n>1199 && n<1400)
cout<<"4";
e... | 0 | 56,092,730 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <string>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <unordered_set>
#include <stack>
#include <queue>
#include <bitset>
#define MOD 1000000007
#define pi 3.14159265358979
using nam... | #include<iostream>
using namespace std;
int main()
{
int i,n,k,c=0,l;
cin>>n>>k;
for(i=0;i<n;i++)
{
cin>>l;
if(l>=k)
{
c++;
}
}
cout<<c<<"\n";
return 0;
} | 0 | 92,898,370 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector< pair< ll,ll> >
#define plli pair< ll,ll >
#define vps vector<... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = (n-1); i >= 0; i--)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL<<60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } ret... | 0 | 20,177,540 |
#include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << (x) << '\n'
#define Int int64_t
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
Int INF = 1e18;
int inf = 1e9;
Int mod = 1e9+7;
int main() {
Int n, l;
cin >> n >> l;
vector<Int> a(n);
for (Int i = 0; i < n; i+... | #include <bits/stdc++.h>
#define REP(i, m, n) for(int (i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class... | 0 | 6,249,448 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int n,k,x,y; cin >> n >> k >> x >> y;
int ans = k<n ? x*k:x*n;
if(k<n) ans += (n-k)*y;
cout << ans << endl;
retu... | #include<bits/stdc++.h>
#define rep(i,n) for(ll i = 0;i < n;++i)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
typedef pair<int,int> P;
const int INF = 1001001001;
const long double PI = (acos(-1));
const int mod = 1e9+7;
const int vx[6] = {0,1,0,-1,1,-1};
const int vy[6] = {1,0,-1,0,1,1};... | 0 | 35,146,237 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b)... | #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 ll INF = (1LL << 31) - 1;
const double pi=acos(-1);
int main(){
ll n,k;
cin >> n >> k;
vector<ll>a(n);
rep(i,n)cin >> a[i];
ll ans=0;
rep(i,n){... | 0 | 49,974,538 |
#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 fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define per(i,a,b) for(ll i=a; i>=b; i--)
#define ... | #include<iostream>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n, v;
cin >> n;
vector<int> ecnt(100001, 0), ocnt(100001, 0);
for (int i = 0; i < n; i++) {
scanf("%d", &v);
if (i... | 0 | 84,154,383 |
#include <iostream>
int main() {
int num1, num2;
std::cin >> num1 >> num2;
if(num1 > num2){
std::cout << "a > b" << std::endl;
}
else if (num1 < num2) {
std::cout << "a < b" << std::endl;
}
else
{
std::cout << "a == b" << std::endl;
}
return 0;
} | #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 100000000... | 0 | 40,005,932 |
#include<algorithm>
#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<cmath>
#include<list>
#include<set>
#include<map>
using namespace std;
long long MOD = 1000000007LL;
const double PI = 3.14159265358979323846;
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -2147483648
#defi... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF=1e+9;
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--)
template<class T>
vector<T> make_v... | 0 | 64,238,866 |
#include <iostream>
#include <vector>
#include <numeric>
#include <climits>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 29,962,753 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
int main(){
long long a,b;
while(cin>>a>>b)
if(abs(a-b)<=1)cout<<"Brown"<<endl;
else cout<<"Alice"<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;cin>>n;
vector<int> a(n);
rep(i,n)cin>>a[i];
int maxi=0,mini=1e9+7,tmp=1e9+7;
rep(i,n)maxi=max(maxi,a[i]);
rep(i,n)if(a... | 0 | 22,748,617 |
#include <bits/stdc++.h>
using namespace std;
int main(){
double a,b,c;
cin>>a>>b>>c;
cout<< ((a/c<=b) ? "Yes":"No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 1000000007;
const ll INF = 1061109567;
const double EPS = 1e-10;
int main(){
int N;
cin>>N;
int C[N],S[N],F[N];
int time[N];
for(int i=0;i<N-1;i++){
cin>>C[i]>>S[i]>>F[i];
time[i]=0;
}
time[N-1]=0... | 0 | 64,504,253 |
#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<ll, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF =... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
using namespace std;
#define pie 3.141592653589793238462643383279
#define int long long
#define mod 10000... | 0 | 55,413,457 |
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>
using namespace std;
int main(){
int n;
cin >> n;
string s;
cin >> s;
int ans=0;
for(int i=0;i<1000;i++){
string t;
if(i>=0 && i<10){
t+="00";
}els... | #include <cstdio>
char c, buf[256];
int main() {
while (scanf("%c", &c) != EOF) {
++buf[c];
}
for (char i = 'A'; i <= 'Z'; ++i) {
buf[i + 'a' - 'A'] += buf[i];
}
for (char i = 'a'; i <= 'z'; ++i) {
printf("%c : %d\n", i, buf[i]);
}
return 0;
} | 0 | 5,618,897 |
#include <iostream>
#include <algorithm>
using namespace std;
void solve() {
string O, E;
char str[101];
cin >> O;
cin >> E;
int i = 0, l;
for (char c: O) {
str[i] = c;
i += 2;
}
str[i] = 0;
i = 1;
for (char c: E) {
str[i] = c;
i += 2;
}
st... | #include <bits/stdc++.h>
using namespace std;
int main(){
int K, A, B;
cin >> K >> A >> B;
bool flag = false;
for(int i = A; i < B+1; i++){
if(i % K == 0){
flag = true;
break;
}
}
if(flag == true){
cout << "OK" << endl;
}else{
cout << "... | 0 | 72,713,121 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
typedef long long ll;
typedef pair<int,int> P;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n,m;
while(cin>>n>>m,n|m)
{
int cnt[11]={0};... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h,w;
cin>>h>>w;
vector<vector<char>>a(h,vector<char>(w));
queue<tuple<int,int,int>>q;
int black=0;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>a[i][j];
if(a[i][j]=='#'){
q.push(make_... | 0 | 61,695,142 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t r,g,b,n,cnt=0;
cin >> r >> g >> b >> n;
for(int i=0;i<=n;i++){
for(int j=0;j<=n;j++){
int k=(n-r*i-g*j)/b;
if(0<=k && k<=n && r*i+g*j+k*b==n)cnt++;
}
}
cout << cnt << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int m;
int nmin;
int nmax;
while (cin >> m >> nmin >> nmax, m != 0) {
vector <int> vec(m);
for (int i = 0; i < m; i++) {
cin >> vec.at(i);
}
int cnt = 0;
for (int j = nmin-1; j <= nmax-1; j++) {
cnt = max(... | 0 | 9,769,540 |
#include <iostream>
using namespace std;
int main(){
int x;
int change[6] = {500, 100, 50, 10, 5, 1};
while( cin >> x, x ){
x = 1000 - x;
int ans = 0;
while( x > 0 ){
ans++;
for(int i=0 ; i < 6 ; i++ ){
if( x >= change[i] ){
x -= change[i];
break;
}
}
}
cout << ans << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define int long long int
int n,m,x,y,par[100005];
vector<int> g[100005];
bool vis[100005];
void bfs(int node){
vis[node] = 1;
queue<int> q;
q.push(1);
while(!q.empty())
{
int u = q.front();
q.pop();
for(auto v:g[u])
{
if(vis[v]) continue;
par[v] = u;
... | 0 | 19,129,986 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
void solve() {
int n, m;
cin >> n >> m;
vector<string> a(n), b(m);
for (auto &i : a) cin >> i;
for (auto &i : b) cin >> i;
for (int i = 0; i < ... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define IO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
const int N = 2e3 + 5, M = 1e5 + 5;
int n, m, a[N], b[N];
ll dp[N][N][3], MOD(1e9 + 7);
ll solve(int i, int j, int men){
if(i == n || ... | 0 | 62,793,102 |
#include <iostream>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string str;
getline(cin, str);
for(int i=str.length()-1; i>=0; --i) {
cout.put(str[i]);
}
cout.put('\n');
return 0;
} | #include<iostream>
#include<algorithm>
int ride2(int n){return n*n;}
using namespace std;
int main(){
int a[3],n;
cin>>n;
while(n--){
for(int i=0;i<3;i++)cin>>a[i];
sort(a,a+3);
if(ride2(a[0])+ride2(a[1])==ride2(a[2]))
cout<<"YES"<<endl;
else cout<<"NO"<<endl;
... | 0 | 83,815,701 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a >... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i=k; i<(ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
const ll MOD = (ll)1e9 + 7;
const ll HIGHINF = ... | 0 | 89,627,320 |
#include <iostream>
using namespace std;
int main() {
string Ans[6] = { "abc","acb","bac","bca","cab","cba" };
string S;
cin >> S;
for (int i = 0; i < 6; i++) if (S == Ans[i]) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define deb(x) cerr << #x <<": " << x << '\n';
#define ios ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
using namespace std;
typedef long double ld;
typedef long long ll;
int main(){
ios;
l... | 0 | 59,249,317 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep2(i, a, b) for(int i = (a); i < (b); i++)
typedef long long ll;
int main() {
int x;
cin >> x;
if (x < 1200) {
cout << "ABC" << endl;
} else {
cout << "ARC" << endl;
}
} | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | 0 | 54,048,263 |
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
#define ind(a) scanf("%d", &a)
#define inlld(a) scanf("%lld", &a)
#define ind2(a, b) scanf("%d%d", &a, &b)
#define inlld2(a, b) scanf("%lld%lld", &a, &b)
#define ind3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define inlld3(a, b, c) scanf("%lld%l... | #include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define endl "\n"
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
int n, m, u, v;
cin >> n >> m;
vector<pair<ll, ll>> studen... | 0 | 3,841,094 |
#include<iostream>
#include<queue>
#include<utility>
using namespace std;
const int INF = 2000000;
char fl[1010][1010];
int d[1010][1010];
int bfs(int sx, int sy, int gx, int gy, int mx, int my) {
typedef pair<int, int>P;
int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
for (int i = 0;i < mx;i++)
for (int j = 0;j <... | #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 | 41,596,507 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
int main(){
int a,b,c;
cin>>a>>b;
c=a+b;
if (a%3==0||b%3==0||c%3==0)
{
cout<<"Possible"<<endl;
}
else
{
cout<<"Impossible"<<endl;
}
} | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int a,b,k;cin >> a >> b >> k;
for(int i = 0; i < k; i++){
if(a%2 != 0) a = a -1;
b += a/2;
a = a/2;
i++;
if(i == k)break;
if(b%2 != 0) b = b -1;
a = a + b/2;
... | 0 | 91,659,575 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | 0 | 22,299,206 |
#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
vector<int> R;
vector<int> C;
vector<vector<int>> dp;
long long int rec(int l,int r){
if(dp[l][r]!=-1) return dp[l][r];
if(abs(r-l)<=1)return 0;
long long int res=10000007;
for(int mid=l+1;mid<r;mid++){
... | #include <iostream>
#include <string>
#include <cstring>
#include <fstream>
#include <random>
#include <cmath>
#include <iomanip>
#include <climits>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <deque>
#include <map>
#include <set>
#include <unordered_set>
#include <queue>
#include ... | 0 | 57,597,454 |
#include <stdio.h>
int main(){
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
if (a < b){
if (a < c){
if (b < c){
printf("%d %d %d\n", a, b, c);
}
else{
printf("%d %d %d\n", a, c, b);
}
}
else{
printf("%d %d %d\n", c, a, b);
}
}
else{
if (b < c){
if (a < c){
printf("%d %d %d\n"... | #include <bits/stdc++.h>
#define FOR(i,l,r) for(size_t i=(l);i<(r);++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
using namespace std;
const ll INF=1ll<<32;
int main(){
ll v,e;
cin>>v>>e;
ll G[v][v];
rep(i,v){
rep(j,v){
G[i][j]=INF;
if(i==j)G[i][j]=0;
}
}
rep(i,e){
... | 0 | 58,541,158 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.