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;
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
int main()
{
int n,m;cin>>n>>m;
vector<int> a(n);
int i;
rep(i,n)cin>>a[i];
vector<int> rem(n+1,0);
rep(i,n)rem[i+1]=(rem[i]+a[i])%m;
sort(all(rem));
ll ans=0;
int now=rem[0];
... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n,m;
cin >> n >> m;
vector<vector<pair<int,int>>> g(n);
for (int _ = 0; _ < m; _++) {
int x,y,c;
cin >> x >> y >> c;
x--; y--;
g[x].emplace_back(y,c);
g[y].emplace_back(x,-c);
}
vector<long l... | 0 | 100,353,089 |
#include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
char lowCaseAlpha[] = {' ', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
void fast()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int ma... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> t(n), d(n);
for (int i = 0; i < n; i++) {
cin >> t.at(i) >> d.at(i);
}
priority_queue<pair<int, int>> newsushi, oldsushi;
for (int i = 0; i < n; i++) {
newsushi.emplace(d.at(i), t.at(i));
}
int64_t ... | 0 | 32,024,151 |
#include <bits/stdc++.h>
using namespace std;
#define NAME "M - Candies"
#define show(x) cout << (#x) << " is " << (x) << endl
#define ll long long
#define ms(arr,val) memset(arr,val,sizeof(arr))
#define len length()
const int maxn = 1e5;
const int mod = 1e9 + 7;
int dp[101][maxn+1];
int tmp[maxn+1];
int a[101];
void a... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
int t,n,m;
vector<int> par,sz;
int top(int x){
if (par[x] == x) return x;
else{
int pos = top(par[x]);
par[x] = pos;
return pos;
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
par = sz ... | 0 | 20,063,736 |
#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 k,x; cin >> k >> x;
if(500*k>=x) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
int a, b, c;
for(int i = 0; i < n; i++){
cin >> a >> b >> c;
if(a*a == b*b+c*c || b*b == a*a+c*c || c*c == a*a+b*b){
cout << "YES\n";
} else{
cout << "NO\n";
}
}
return 0;... | 0 | 1,125,575 |
#include <iostream>
auto main () -> int
{
for (int x = 1; x <= 9; ++ x)
{
for (int y = 1; y <= 9; ++ y)
{
std::cout << x << 'x' << y << '=' << (x * y) << std::endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define quick \
ios::sync_with_stdio(false); \
cin.tie(0);
#define time cerr << (0.1 * clock()) / CLOCKS_PER_SEC << endl;
#define mod 1000000007
typedef long long ll;
typedef pair<ll, ll> pl;... | 0 | 90,218,636 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vll;
#define fi first
#define print(v) for(ll i:v) cout<<i<<ss
#define se second
#define pb push_back
#define nn "\n"
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a = 0, b = 0;
int h1 = 0, h2 = 0;
cin >> h1;
cin >> h2;
b = abs(h2 - h1);
vector<int> v(n);
for (int i = 2; i < n; ++i) {
int h;
cin >> h;
int cur = min(a + abs(h - h1... | 0 | 22,730,611 |
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
ll n;
cin>>n;
if(n%2==1)
{
cout<<0<<endl;
}
else
{
ll ans=0;
for(ll i=10;i<=n;i*=5)
{
ans+=n/i;
}
cout<<ans<<endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i< i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formin=(b);i>=i##formin;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz... | 0 | 23,731,271 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b)
{
int max = (a > b) ? a : b;
int min = (a > b) ? b : a;
while (max % min)
{
int tmp = max % min;
max = min;
min = tmp;
}
return min;
}
int main()
{
int n, x, ans(0);
cin >> n >> x;
int city[n]... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using n... | 0 | 40,962,461 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
ll mod = 1'000'000'000 + 7;
int main(){
ll N,K; cin >> N >> K;
vector<ll> A(N);
vector<ll> CT(2000+10,0);
rep(i,N){
int x; cin>>x;
A[i]=x;
CT[x]++;
}
ll ans=0;... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define REP(i,x,n) for(int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
const ll mod = 1e9+7;
const ll INF ... | 0 | 100,488,144 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
string s;
cin >> s;
while(s.size()!=0){
if(s.find("eraser")==string::npos){
break;
}
else{
int k=s.find("eraser");
s.erase(k,6);
}
}
while(s.size()!=0){
if(s.find("erase")==string::npos){
... | #include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#de... | 0 | 71,652,647 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define ll long long
static const ll MAX = 10000;
static const ll INFTY = 1e12;
static const ll MOD = 1e9+7;
template<class T> inline bool chmax(T& a, T b)... | #include <iostream>
#include <algorithm>
using namespace std;
void DP(int i, int j, long long dp[101][101], int r[], int c[]){
if(i == j) dp[i][j] = 0;
else if (j - i == 1){
dp[i][j] = r[i] * c[i] * c[j];
} else {
int tmp = i;
dp[i][j] = dp[i][tmp] + dp[tmp+1][j] + r[i] * r[tmp+1] * ... | 0 | 93,680,457 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define INF 100000000
typedef long long ll;
int main(){
ll N,K;
cin>>N>>K;
if(N%K==0)cout<<0;
else cout<<1;
return 0;
} | #include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using hset = unordered_set<T>;
template<class Key, class T> using hmap = unordered_map<Key, T>... | 0 | 93,595,688 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n,m;
cin >> n >> m;
vector<vector<pair<int,int>>> g(n);
for (int _ = 0; _ < m; _++) {
int x,y,c;
cin >> x >> y >> c;
x--; y--;
g[x].emplace_back(y,c);
g[y].emplace_back(x,-c);
}
vector<long l... | #include<bits/stdc++.h>
#define l(i,a,n)for(int i=a;i<n;i++)
#define pb push_back
#define in insert
#define mp make_pair
#define lw(v) sort(v.begin(),v.end());
#define hi(v) sort(v.begin(),v.end(),greater<long long>());
#define all(v) v.begin(),v.end()
#define filein freopen ("input.txt", "r", stdin)
#define fileout fr... | 0 | 11,852,948 |
#include <bits/stdc++.h>
using namespace std;
long long Sum(long long n)
{
return n * (n + 1) / 2;
}
void hawawa()
{
int n;
cin >> n;
int mi = 1, ma = n;
while (mi < ma) {
int mid = (mi + ma) / 2;
if (n <= Sum(mid)) {
ma = mid;
} else {
mi = mid + 1;
}
}
int score = Sum(mi);
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
inline int D()
{
int m ;
cin>>m;
return m ;
}
inline ll lD()
{
ll m ;
cin>>m;
return m ;
}
inline double dD()
{
double m;
cin>>m;
return m;
}
void fast()
{
ios_base :: sync_with_stdio( 0 ) ;
... | 0 | 1,327,228 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | #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 | 74,393,240 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
#define ALL(obj) (obj).begin(), (obj).end();
int main() {
int n,y;
cin>>n>>y;
bool ok=false;
int a,b,c;
for(int i=0;i<=n;i++){
for(int j=0;j<=n;j++){
int k=n-i-j;
if(10000*i+500... | #include <iostream>
using namespace std;
#define loop(i,a,b) for(int i=(a); i<(int)(b); i++)
#define rep(i,b) loop(i,0,b)
int a[100000];
int n,k;
int main(){
while(cin>>n>>k, n|k){
rep(i,n) cin>>a[i];
int ans=0;
rep(i,k) ans+=a[i];
int t=ans;
rep(i,n-k){
t-=a[i]; ... | 0 | 3,015,605 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <cstring>
#include <cctype>
#include <sstream>
#include <set>
#include <map>
#include <queue>
#include <co... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
int main() {
int x, y, z, K;
cin >> x >> y >> z >> K;
vector<Int> a(x), b(y), c(z);
for (i... | 0 | 68,713,459 |
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int main(void)
{
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++ )
{
cin >> a[i];
}
int min = a[0];
int max = a[0];
long sum = a[0];
for(int i = 1; i < n; i++)
{
if( min > a[i] )
{
min = a[i];
}
if( max < a... | #include <stdio.h>
#include <math.h>
int trianglechecker(int x, int y, int z);
int main(void){
int loop,len1,len2,len3,Len1,Len2,Len3;
int f=0;
scanf("%d", &loop);
for(int i=0;i<loop;i++)
{
scanf("%d%d%d", &len1, &len2, &len3);
f=trianglechecker(len1,len2,len3);
if(f == 1)
... | 0 | 29,754,740 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long a,b;
cin>>a>>b;
long long pre=0;
if(a==b)
{
cout<<a<<endl;
return 0;
}
long long c=a;
while((c^(c+1))!=1L && c<b)
{
pre^=c;
c++;
}
if(c!=b)
{
long long d=(b-c)%4;
if(d==0)pre^=b;
else if(d==1)pre^=1;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using stkll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
tem... | 0 | 51,544,300 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (in... | 0 | 47,919,369 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
long long inf=1000000007;
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
int main(){
int x,y... | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}
int lcm(int a,int b){i... | 0 | 97,809,853 |
#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... | #include <iostream>
#include <set>
#include <queue>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
#include <numeric>
#include <functional>
using namespace std;
#define ALL(x) ... | 0 | 62,207,333 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | #include <iostream>
#include <algorithm>
#include <utility>
using namespace std;
typedef long long lint;
int main(){
int W,H;
int px=1,py=1;
cin >> W >> H;
pair<lint,bool> *edge;
edge=new pair<lint,bool>[W+H];
for(lint i=0;i<W+H;i++){
lint L;
cin >> L;
edge[i]=make_pair(L... | 0 | 9,777,589 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <sstream>
using namespace std;
int main(){
while(true){
int N, M, P;
cin >> N >> M >> P;
if(N == 0 && M == 0 && P == 0){
break;
}
int hit;
int sum = 0;
for(int i = 0; i < N; i++){
... | #include <iostream>
#include<algorithm>
#include <string>
using namespace std;
int main(void){
string str, moji, m;
int q = 0;
cin >> str;
cin >> q;
for(int i = 0; i < q; i++){
int a = 0, b = 0;
cin >> moji >> a >> b;
if(moji == "print"){
cout << str.substr... | 0 | 46,440,132 |
#include<bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const int MOD = 1000000007;
#pragma GCC target("avx2")
#p... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define reps(i,a,b) for(int i= a; i < b; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
int h, w;
cin >> h >> w;
vector<string> vec(h... | 0 | 26,801,099 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define pa pair<int,int>
const int Maxn=100010;
const int inf=2147483647;
int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
return x*f;
}
int ... | #include <stdio.h>
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
int m,mi,ma;
scanf ("%d %d %d",&m,&mi,&ma);
while(m){
int ans=0;
int k=0;
vector<int> p(m);
for(int t=0;t<m;t++){
scanf ("%d",&p[t]);
}
for(int t=mi-1;t<ma;t++){
if(k<=(p... | 0 | 17,183,210 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(n); i++)
#define ALL(n) begin(n),end(n)
int main(){
string s,t;
cin>>s;
int i=0;
bool judge=true;
while(t.size()<s.size()){
if(s.substr(i,5)=="dream"){
t+="dream";
i+=5;
if(s.su... | #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;
int dp[100010][2];
signed main()
{... | 0 | 64,710,439 |
#include <iostream>
#include <string>
using namespace std;
int main(void)
{
string s;
cin >> s;
if(s[0]=='Y'&&s[1]=='A'&&s[2]=='K'&&s[3]=='I'){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
ll diff(ll h, ll w, ll x) {
ll res = w * x;
ll s1, s2, s3, s_min, s_max;
s1 = w * x;
s2 = w * ((h - x) / 2);
s3 = w * h - s1 - s2;
s_min = min({s1, s2, s3});
s_max = max({s1, s2, s3});
re... | 0 | 72,874,712 |
#include <iostream>
#include <algorithm>
using namespace std;
double check(double x1, double y1, double x2, double y2, double x3, double y3){
double ab = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
double bc = sqrt((x2 - x3) * (x2 - x3) + (y2 - y3) * (y2 - y3));
double ca = sqrt((x3 - x1) * (x3 - x1) + (y3 ... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, n) for(int i = 1, i##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define PRINT(A) std::cout << (#A) << ":" << (A) << std::endl;
using namespace std;
#define repi(itr, ds) for(auto itr = ds.... | 0 | 40,825,294 |
#include <bits/stdc++.h>
#define repr(i,from,to) for(int (i)=(from);(i)<(to);(i)++)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
const bool debug=false;
#define DEBUG if(debug==true)
#define vprint(x) for(auto a:(x)) cout << x << endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
double pi=acos(-1);
#define ll long long
#d... | 0 | 44,383,703 |
#include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int num[1000]={0};
int a;
while(cin>>a)num[a]++;
int flg=0;
for(int i=100;;i--){
for(int j=0;j<200;j++){
if(num[j]==i){
flg=1;
cout<<j<<endl;
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
for (ll i = 0; i < n; ++i)cin >> a[i];
ll ans = 0;
for (ll bit = 0; bit < 60; ++bit) {
ll zero = 0;
ll one = 0;
for (ll i = 0; i < n; ++i) {
if ((1ll << bit) & a[i]) +... | 0 | 100,211,498 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 0 | 57,864,369 |
#include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
typedef long long ll;
typedef double ld;
ll mod = 1e9 + 7ll;
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 (b<a) { a=b; return 1; } r... | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | 0 | 25,951,545 |
#include<bits/stdc++.h>
using namespace std;
int main (void){
int k,s,ans = 0;
cin >> k >> s;
for(int i = 0;i <= k;i++){
for(int j = 0;j <= k;j++){
if(s-i-j <= k && s-i-j >=0){
ans++;
}
}
}
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int H, W; cin >> H >> W;
vector<string> F(H);
for (int i=0; i<H; i++) cin >> F[i];
vector<vector<int>> L(H, vector<int>(W));
vector<vector<int>> R(H, vector<int>(W));
vector<vector<int>> U(H, vector<int>(W));
vector<vector<int>> D(H, vector<in... | 0 | 71,649,001 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B; cin >> A >> B;
for (int i = 1; i <= 1000; i++) {
int x = i * 0.08;
int y = i * 0.1;
if (x == A && y == B) {
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0, xxx_rep_end = (n); i < xxx_rep_end; ++i)
#define all(x) (x).begin(), (x).end()
template <class T1, class T2>
inline bool chmax(T1 &a, const T2 &b) {
if (a < b) {
... | 0 | 44,580,020 |
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> cst(3);
cin >> cst[0] >> cst[1] >> cst[2];
sort(cst.begin(), cst.end());
cout << cst[2] - cst[0] << endl;
return 0;
} | #include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | 0 | 88,363,465 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
int main(){
int map[20][20];
int n;
int i,l;
int a,b;
int x,y;
for(;;){
cin>>a>>b;
if(a==0&&b==0) break;
memset(map,0,sizeof(map));
cin>>n;
for(i=0;i<n;i++){
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<pair<int,int>>red(n);
vector<pair<int,int>>blue(n);
int a[n],b[n],c[n],d[n];
for(int i=0;i<n;i++){
cin>>a[i]>>b[i];
red[i]={a[i],b[i]};
}
for(int i=0;i<n;i++){
cin>>c[i]>>d[i];
... | 0 | 30,746,531 |
#include <bits/stdc++.h>
#define chmin(a, b) ((a)=min((a), (b)))
#define chmax(a, b) ((a)=max((a), (b)))
#define fs first
#define sc second
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
const ll MOD=1e9+7;
const ll INF=1e18;
int dx[]={1, -1,... | #include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
int main(){
ll a,b,c[1001],k=0,sum=0;
cin >> a>>b;
rep(i,a){
cin >> c[i];
sum+=c[i];
}
rep(i,a){
if(c[i]*4*b>=sum){
k++;
}
... | 0 | 37,929,225 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
i... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if... | 0 | 32,391,673 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N;
cin>>N;
int64_t l=pow(N,0.5);
int64_t ans=0;
for(int64_t i=1;i<=l;i++)
if(N%i==0){
if(2<=N/i-i)
ans+=(N/i-1);
}cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP1(i,n) for(int i=1, i##_len=(n); i<i##_len; ++i)
#define ll long long
static const int MAX = 10000;
static const ll INFTY = 1e12;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; retur... | 0 | 64,018,494 |
#include <iostream>
using namespace std;
int main()
{
int x, y;
int foo;
while(1){
cin >> x >> y;
if(x == 0 && y == 0)break;
if(x > y){
foo = x;
x = y;
y = foo;
}
cout << x << " " << y << "\n";
}
} | #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() {
ll N, A, B;
cin >> N >> A >> B;
int ans = 0;
for (int i = 1; i <= N; ++i) {
int sum = 0;
int M = i;
while (M > 0) {
... | 0 | 36,419,692 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int64_t N;
cin >> N;
cout << (N * (N - 1)) / 2 << endl;
} | #include <iostream>
#include <vector>
#include <cmath>
typedef unsigned long long ll;
using namespace std;
int main(void) {
int ary[5];
for (int i = 0; i < 5; i++) cin >> ary[i];
int max_loss = 0;
int max_loss_idx = 0;
for (int i = 0; i < 5; i++){
if((ary[i] % 10 != 0) && (10 - ary[i] % 10) ... | 0 | 88,441,865 |
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<char> str(19);
for(int i = 0; i < 19; i++){
cin >> str.at(i);
}
str.at(5) = ' ';
str.at(13) = ' ';
for(int i = 0; i < 19; i++){
cout << str.at(i);
}
cout << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
char l[33];
while((cin>>l)&&(l[0]!='#')){
int count=0;
int size=0;
for(int i=0;i<33;i++){
if(l[i]=='\0'){
size = i;
break;
}
}
int hand=-1;
for(int i=0;i<size;i++){
if(l[i]=='y'||l[i]=='u'||l[i]=='i'||l[i]... | 0 | 80,712,592 |
#pragma region header
#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>
#i... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int n;
int k;
int dp[110][110000];
vector<int> a;
int main() {
cin >> n >> k;
a.resize(n+1);
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 0; i <= a[0]; i++) dp[0][i] = 1;
for (int i = 1; i <= n; i++) {
int sum =... | 0 | 70,773,740 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define all(a) (a).begin(), (a).end()
#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++)
const int MOD = 1e9+7;
const ll LINF = 1e18;
con... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const int MOD = 1000000009;
const long long INF = 1LL << 60;
int main() {
int N, M;
cin >> N >> M;
Graph G(N, vector<int>(... | 0 | 10,724,432 |
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using namespace std;
int main() {
fastIO;
vector<int> time(5);
rep(i, 5) cin >> time.at(i);
int sum = 0, diff = 0;
for(auto... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 65,203,649 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const stati... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
const ll LongINF=1e13+7;
const int INF=1e9+7;
const int dx[]={0,1,0,-1};
const int dy[]={1,0,-1,0};
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool ch... | 0 | 5,667,849 |
#include <iostream>
using namespace std;
int main(){
int x,y;
while(cin>>x>>y,!(x==y&&y==0))cout<<(x<y?x:y)<<" "<<(x<y?y:x)<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = int64_t;
using P = pair<ll,ll>;
ll INF = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n,k;
... | 0 | 64,528,665 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long n,i,step=0;
cin >> n;
long a[n];
cin >> a[0];
for(i=1; i<n; i++){
cin >> a[i];
if(a[i] < a[i-1]){
step += a[i-1]-a[i];
a[i] += a[i-1]-a[i];
}
}
cout << step << endl;
} | #include <iostream>
#include <algorithm>
#include <stdio.h>
static const int MAX = 200000;
using namespace std;
void trace(int a[], int n){
for(int i = 0; i < n; i++){
if(i) cout << " ";
cout << a[i];
}
cout << endl;
}
int sort(int a[], int n){
int sw = 0;
for(int i=0; i < n; i++){
int mini = i;
... | 0 | 10,976,720 |
#include <iostream>
#include <vector>
#include <iomanip>
#include <cmath>
#define DEG2EAD 0.01745329251994329576923690768489
std::vector< std::pair<double,double> > Koch_Curve(std::pair <double,double>,std::pair <double,double>,int);
std::vector< std::pair<double,double> > Koch_Curve(std::pair <double,double>,std::pair... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | 0 | 53,501,316 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=mod*mod*3LL;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main()
{
string s, t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.begin(), t.end(), greater<char>());
ll n = min(s.size(), t.size());
rep(i, n){
ll s_n = '0' + s... | 0 | 62,255,893 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll... | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9,MOD = 1e9+7,ohara = 1e6;
const ll LINF = 1e18;
using namespace std;
#define rep(i,n) for(ll (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(ll i=(a);i<(b);i++)
#define rrrep(i,a,b) for(ll i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define... | 0 | 57,570,523 |
#include <cstdio>
#include<iostream>
using namespace std;
typedef long long ll;
char ss[200010];
ll record[10010];
ll res=0;
int main(){
int n,p,k=0,d=1;
scanf("%d%d%s",&n,&p,ss);
if(p==2||p==5){
for(ll i=0;i<n;i++)
if((ss[i]-'0')%p==0)
res+=i+1;
}
else{
r... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL MOD = 1000000007;
#define lcm(x, y) ((x) * (y) / __gcd((x), (y)))
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define debug(x) cout << #x << " : " << x << endl
#define part cout << "----------------------------------\n";
#includ... | 0 | 56,207,401 |
#include<iostream>
using namespace std;
int n, s;
int c = 0;
int i = 0;
int j = 0;
int q = 0;
int sum = 0;
int date[15] = { 0 };
int sub(int start,int n,int x){
if (x == n){
for (int i = 0; i < n; i++){
sum += date[i];
}
if (sum == s){
q++;
}
sum = 0;
return 0;
}
for (int i = start; i < 10;i++){
... | #include <iostream>
#include <string>
using namespace std;
int main(){
while(1){
string x;
int sum = 0;
getline(cin, x);
if(x == "0") break;
for(int i=0;i<x.length();i++){
sum += x[i] - 48;
}
cout<<sum<<endl;
}
return 0;
} | 0 | 32,332,051 |
#include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <iomanip>
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
vector<int> h(n,0);
for(int i = 0; i < n; i++){
cin >> h[i];
}
sort(h.rbegin(), h.... | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define forn(ii,a,b) for(int ii = (int)a ; ii < (int)b ; ii++ )
#define scan(any) for(auto &i:any) cin>>i;
#define debug(x) cerr << #x << " " << x << " -- \n"
#define I__O ... | 0 | 81,435,419 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define PI 3.141592653589793
#define MOD 1000000007
#define ALL(obj) (obj).begin(),(obj).end()
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... | #include <stdio.h>
int main(void)
{
int N,i;
scanf("%d%d", &N, &i);
printf("%d",N-i+1);
return 0;
} | 0 | 93,083,897 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int,int> pii;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<bool> > vvb;
typedef vector<vector<int> > vvi;
typedef map<int, bool> mib;
typedef long long ll;
typedef vector<long ... | 0 | 33,431,549 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(void)
{
int n, a[100], mode = 0;
rep(i, 100) {
a[i] = 0;
}
while (cin >> n)
a[n]++;
rep(i,100) {
if (mode < a[n]) ... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n,m;
vector<int> c;
int dp[50001][20];
void sortt(){
sort(c.begin(),c.end());
reverse(c.begin(),c.end());
}
void ume(){
for(int i=0;i<20;++i){
dp[0][i]=0;
for(int j=1;j<50001;++j){
dp[j][i]=100000;
}
}
}
void toku(){
for(i... | 0 | 21,561,261 |
#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 ll long long
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i, a, b) for (int i = a; i < b; i++)
#define VREP(it, v) for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main () {
int N;
cin >> N;
ll ans = 0;
for (int i = 1; i <= N; i++) {
int A = i, B = N/A;
if (A*B == N) {
ans += B-1;
}
else {
ans += B;
}
}
cout << ans << endl... | 0 | 43,082,908 |
#include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<string, int, int> TU;
typedef tuple<int, int, int> TI;
int main()
{
int a,b,c;
cin >> a >> b >> c;
if... | #include"bits/stdc++.h"
#include<iostream>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main(void) {
int n;
cin >> n;
vector<int>x(n);
for (int i = 0; i < n;i++) {
cin >> x[i];
}
int ans=1000000;
for (int i = 1; i < 100; i++) {
int cost=0;
for (int j = 0; j < n; j++) {
cost += ... | 0 | 26,342,232 |
#include <stdint.h>
#include <iomanip>
#include <iostream>
using namespace std;
int main(void) {
double L;
cin >> L;
cout << setprecision(10) << (L / 3) * (L / 3) * (L / 3) << endl;
return 0;
} | #include<iostream>
#include<string>
#include<vector>
using namespace std;
int main(){
int N,M;
cin>>N>>M;
vector<bool>check(N,0);
vector<int>p(M);
vector<string>S(M);
vector<int>pena(N,0);
for(int i=0;i<=M-1;i++){
cin>>p[i]>>S[i];
}
int ac=0;
int penanum=0;
for(int i=0;i<=M-1;i++){
if(S[i]... | 0 | 80,479,907 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
const double PI=3.14159265358979;
const ll INF= pow(10,18);
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
string abc="abcdefghijklmnopqrst... | #include <bits/stdc++.h>
using namespace std;
int main(){
int x,y;cin >> x >> y;
int ans = -1;
if(x<=y){
if(ans==-1){
ans = y - x;
}else{
ans = min(ans,y-x);
}
}
if(-x<=y){
if(ans==-1){
ans = y + x+1;
}else{
ans = min(ans,y+x+1);
}
}
if(x<=-y){
if(ans==-... | 0 | 56,620,375 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> a(N), X(110000);
for(int i=0; i<N; i++){
cin >> a.at(i);
X.at(a.at(i))++;
X.at(a.at(i)+1)++;
if(a.at(i)!=0){
X.at(a.at(i)-1)++;
}
}
int ans=0;
for(int i: X){
ans=max(ans,i);
... | #include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define M 1000000007
#define ll long long
#define ld long double
#define vi vector<ll>
#define pi pair<ll, ll>
#define vii vector<pi>
#define vvi vector<vi>
#define pb push_back
#define endl "\n"
... | 0 | 28,032,475 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
string s, t;
cin >> s >> t;
cout << t + s << endl;
return 0;
} | #include "bits/stdc++.h"
#include <chrono>
using namespace std;
using namespace std::chrono;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define forn(ii,nn) for (int ii = 0; ii < nn; ++ii)
#define gcd(ade,bde) __gcd(ade,bde)
#define vi vector<int>
#define vll vector<ll>
#define vs vect... | 0 | 21,267,291 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ALL(x) (x).begin(),(x).end()
const int IINF = 1e9;
const LL LINF = 1e18;
const LL MOD = 1e9+7;
int main() {
int a, b;
cin >> a >> b;
int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int n,k;
cin >> n >> k;
vector<int> v(n);
for(int i = 0; i < n; i++) {
cin >> v[i];
}
int r=min(n,k);
int ans=0;
for(int a = 0; a <= r; a++) {
for(int b = 0; a+b <= r ... | 0 | 5,413,733 |
#include<bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int mod=10e8+7;
int getmax(int n,int ar[])
{
vector<int>dp(n,INT_MAX);
int i,j,res,ans1,ans2,ans3;
dp[0]=0;
dp[1]=abs(ar[1]-ar[0]);
for(i=0;i<n;i++)
{
for(j=i+1;j... | #include<bits/stdc++.h>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef long l;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<n;i++)
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
const int INF=1000000... | 0 | 44,362,931 |
#include <iostream>
#include <vector>
int main()
{
int N;
std::cin >> N;
std::vector<int64_t> L(86);
L[0] = 2;
L[1] = 1;
if (N >= 2)
{
for (auto i = 2; i <= N; i++)
{
L[i] = L[i - 1] + L[i - 2];
}
}
std::cout << L[N] << std::endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int H,W;
cin >> H >> W;
vector<string> S(H);
for(int i=0; i<H ; i++)
{
cin >> S.at(i);
}
const vector<int> dx = {0,0,1,-1};
const vector<int> dy = {1,-1,0,0};
int flag = 0;
for(int i=0; i<H; i++)
{
for(int j=0; j<W; j++)
{
... | 0 | 51,325,346 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main(){
int N;
cin >> N;
vector<int> A(N);
for(int i=0; i<N; i++) cin >> A[i];
ll min_cost = INF;
for(int i=-100; i<=100; i++) {
ll cost=0;
for(int j=0; j<N; j++) {
... | #include<iostream>
#include<numeric>
#include<set>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
typedef long long li;
#define chmin(a,b) (a>(b)?a=(b),1:0)
#define abs(n) max((n),-(n))
#define dist(a,b) max((a)-(b),(b)-(a))
#define chmax(a,b) (a<(b)?a=(b),1:0)
#define repa(i,a,n) for(int i=(a)... | 0 | 30,345,127 |
#include <iostream>
using namespace std;
int main() {
while( true ) {
long long int n;
cin >> n;
if ( n == 0 ) break;
char d[256];
for ( long long int i = 0; i < 256; i++ ) {
d[i] = i;
}
for ( long long int i = 0; i < n; i++ ) {
char in, out;
cin >> in >> out;
d[in]... | #include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxn=5e5+5;
const int mod=1e9+7;
inline int read(){
char c=getchar();int t=0,f=1;
while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c)){t=(t<<3)+(t<<1)+(c^48);c=getchar();}
return t*f;
}
int n,sta[maxn],rec[maxn];
char s[maxn];... | 0 | 81,303,023 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
template<class T> inline T... | #include <iostream>
#include <string>
#include <cstdlib>
using namespace std;
bool isMale() {
string result;
cin >> result;
if (result == "Vacant") {
exit(0);
}
return result == "Male";
}
int main() {
int N;
cin >> N;
int left = 0;
int right = N - 1;
cout << 0 << endl;
... | 0 | 51,555,537 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k, d, a;
cin >> n >> k;
vector<bool> A(n, false);
for(int i = 0; i < k; i++){
cin >> d;
for(int j = 0; j < d; j++){
cin >> a;
A.at(a - 1) = true;
}
}
int count = 0;
for(int i = 0; i < n; i++){
if(!A.at(i)) count++... | #include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define pii pair<ll, ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll, ll>
#define mii map<pii, ll>
#define all(a) (a)... | 0 | 91,253,722 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
#include"atcoder/all"
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif
#include <limits.h>
#include <math.h>
#include... | #include <iostream>
using namespace std;
int main()
{
string A, B;
cin >> A >> B;
string result;
if(A.size() > B.size())
{
result = "GREATER";
cout << result << endl;
return 0;
}
else if (A.size() < B.size())
{
result = "LESS";
cout << result << en... | 0 | 90,758,899 |
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
using n... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#d... | 0 | 37,197,897 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
using namespace std;
typedef long long ll;
typedef unsigned i... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef p... | 0 | 97,521,406 |
#include <bits/stdc++.h>
#define REP(i, n) for(int (i)=0;(i)<(n);++(i))
#define REPV(iter, v) for(auto (iter)=(v).begin(); (iter)!=(v).end();++(iter))
#define ALL(v) (v).begin(),(v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main()
{
ll N, K;
cin >> N >> K;
vector<ll> x(N), ... | #include <iostream>
using namespace std;
const long long MOD = 1000000007;
int main() {
long long n, m, result = 0;
cin >> n >> m;
long long x[n], y[m];
for (long long i = 0; i < n; i++) {
cin >> x[i];
}
for (long long i = 0; i < m; i++) {
cin >> y[i];
}
long long left = ... | 0 | 54,922,877 |
#include <bits/stdc++.h>
#define rep(i,N) for(int i = 0; i < N;i++)
#define ALL(a) (a).begin(),(a).end()
#define ll long long int
using namespace std;
const double PI = 3.14159265358979323846;
const ll M = (pow(10, 9) + 7);
ll dig(ll N, ll K) {
ll dig = 0;
while (N) {
dig++;
N /= K;
}
return dig;
}
ll gcd(ll a,... | #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 | 64,589,733 |
#include<stdio.h>
int main()
{
int a,b,temp;
while(scanf("%d%d",&a,&b)!=EOF&&(a||b))
{
temp=0;
if(a>b)
{
temp=a;a=b;b=temp;
}
printf("%d %d\n",a,b);
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
ll s = 0;
rep(i, ... | 0 | 7,807,626 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin()... | #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 | 53,235,726 |
#include <iostream>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
using std::vector;
class Card {
private:
char m_suit;
int m_rank;
public:
Card(char suit, int rank)
: m_suit(suit), m_rank(rank) {}
char suit() const
{
return m_suit;
}
int rank() const
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Map = map<string,ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
ll INF=1LL<<60;
ll MOD=1000000007;
int main(){
ll N;
cin >> N;
vector<ll> A(N,0);
vector<P> B(N);
for(ll i=0;i<N;i++){
... | 0 | 22,344,187 |
#include <stdio.h>
typedef long long lint;
int main() {
lint X, Y;
scanf("%lld%lld", &X, &Y);
if(-((X + Y) % 2) <= X - Y && X - Y <= (X + Y) % 2) printf("Brown");
else printf("Alice");
return 0;
} | #include <bits/stdc++.h>
#include<ext/pb_ds/hash_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#define N 500005
using namespace __gnu_pbds;
using namespace std;
typedef long long LL;
typedef unsigned long long uLL;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
... | 0 | 80,256,976 |
#include <iostream>
using namespace std;
int main(void){
int a, b, c, d;
cin >> a >> b >> c >> d;
int ans = a + b;
int ans1 = c + d;
if(ans > ans1){
cout << "Left" << endl;
}
else if(ans == ans1){
cout << "Balanced" << endl;
}
else {
cout << "Right" << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
ll LCM(ll a,ll b){
return a / GCD(a,b) * b;
}
const int MOD = 1000000007;
int main() {
int n; cin >> n;
string a,b;
for(int i = 0;i... | 0 | 11,857,518 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef vector<int> VI;
typedef pair<int,int> PII;
#define REP(i,n) for(int i=0;i<(n);++i)
#define FOR(i,a,b) for (int i=(a); i<(b); ++i)
#define FORD(i,a,b) for (int i=(a)-1; i>=(b); --i)
#define... | #include<bits/stdc++.h>
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define fst first
#define snd second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define EPS (1e-9)
#define equals(a,b) (fabs((a)-(b))<EPS)
using namespace std;
bool LT(double a,double b) { return !equals(a,b) && a < b... | 0 | 6,601,171 |
#include <iostream>
#include <sstream>
#include <string>
#include <cmath>
#include <array>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <utility>
#include <iomanip>
#include <numeric>
#include <climits>
#include <algorithm>
#include <cstdint>
using namespace... | #include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void ... | 0 | 81,616,700 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string S;
cin >> S;
string t = "keyence";
int cnt = 0;
for (int i = 0; i < 7; i++) {
if (S[i] == t[i]) {
cnt++;
}
}
if (cnt == 7) {
cout << "YES" << endl;
return 0;
... | #include<stdio.h>
#include<algorithm>
#include<string>
#include<iostream>
#include<vector>
#include<queue>
#include<map>
using namespace std;
#define REP(i,n) for(long long int (i)=0;(i) < (n);(i)++)
int n,m;
char from,to,tmp;
int main(){
cin >> n;
while(n){
map<char,char>dict;
REP(i,n){
cin >> ... | 0 | 2,102,193 |
#include<iostream>
using namespace std;
int main(){
int A,B,C,D;
cin>>A>>B>>C>>D;
int ans=0;
if (A>=B){
ans+=B;
}
else ans+=A;
if (C>=D){
ans+=D;
}
else ans+=C;
cout<< ans << endl;
return 0;} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ld> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vector<ll>> vvll;
typedef vector<pair<ll, ll>> vpll;
typedef priority_queue<ll, vector<ll>, greater<ll>> spqll;... | 0 | 12,988,355 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string S,T;
cin >> S >> T;
vector<int>S2(26);
vector<int>T2(26);
for(int i = 0; i < S.size(); i++) {
S2[S[i]-'a']++;
T2[T[i]-'a']++;
}
sort(S2.begin(),S2.end());
sort(T2.begin(),T2.end());
for(int i = 0; i < 26;... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p;
#define ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (... | 0 | 89,467,243 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void){
int a,b,c,d;scanf("%d %d %d %d",&a,&b,&c,&d);
printf("%d\n", min(a,b) + min(c,d));
} | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif
#include<iostream>
#include<string>
#include<algorithm>
#include<vec... | 0 | 49,237,804 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#de... | #include<bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (int i = 1; i <= (int)(n); i++)
#define FORD0(i... | 0 | 99,765,844 |
#include <iostream>
using namespace std;
int main(){
int num,tmp;
cin >> num;
int a[num][3];
for(int i=0; i<num; ++i)
cin >> a[i][0] >> a[i][1] >> a[i][2];
for(int i=0; i<num; ++i){
for(int j=0; j<3; ++j){
for(int k=j+1; k<3; ++k){
if(a[i][j] < a[i][k]){
tmp = a[i][j];
a[i][j] = a[i][k];
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 0 | 32,976,654 |
#include <iostream>
#include <cstdio>
using namespace std;
int main() {
int a[10000];
int n;
int max=-1000000,min=1000000;
long long sum=0;
cin >> n;
if(n==0){
printf("%d %d %d\n", 0, 0, 0);
return 0;
}
for(int i=0; i<n; i++){
cin >> a[i];
sum+=a[i];
if(max<a[i]) max = a[i];
if(min>a[i]) min = a[i];... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
ll lcm(ll x, ll y) { return x / __gcd(x, y) * y; }
ll solve(ll N,ll M,vector<ll> &a){
ll num,ans;
ans=0;
num=1;
while(a[0]%2==0){
... | 0 | 39,719,524 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite)... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 0 | 49,196,028 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define pb push_back
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define ... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <cctype>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <climits>
#include <iomanip>
using namespace std;
int main() {
int n, m,p;
cin >> n >> m;
vector<int> h(n+1);
for (int i = 0; i < n; i++)cin >... | 0 | 6,260,737 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR... | #include<bits/stdc++.h>
#define Imposter ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define ll long long int
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less_equal<ll... | 0 | 70,597,997 |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9+7;
typedef pair<ll,ll> pairs;
vector<pairs> p;
ll gcd(ll A,ll B){
if (A%B==0)return(B);
else return(gcd(B,A%B));
}
ll keta(ll N){
int tmp{};
while... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
map<int, int> A;
int c;
for (int i = 0; i < N; i++)
{
cin >> c;
if (A.count(c))
A.at(c) += 1;
else
{
A[c] = 1;
}
}
int cnt = 0;
vector<i... | 0 | 96,860,912 |
#include <iostream>
using namespace std;
int GCD(int a, int b) {
while (a) {
int tmp = a;
a = b % a;
b = tmp;
}
return b;
}
int main() {
int a, b, k;
cin >> a >> b >> k;
int gcd = GCD(a, b);
int cnt = 0;
for (int i = 1; i <= gcd; ++i) {
if (gcd % i) continue;
cnt++;
if (cnt == k)... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <bitset>
#include <math.h>
typedef long long ll;
typedef unsigned long long ull;
#define vi std::vector<int>
#define vl std::vector<ll>
#define floop(n) for(int i = 0; i < n; ++i)... | 0 | 50,816,449 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main(){
int N; cin >> N;
int ans =0;
rep(i,N) ans += i+1;
cout << ans << endl;
} | #include<bits/stdc++.h>
#include<string>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <stdlib.h>
#include<string>
#define mp make_pair
#define ss second
#define ff first
#define pb push_back
#define io ios_base::sync_with_stdio;cin.tie(0);cout.tie(0)
#define READ freopen("input... | 0 | 99,827,389 |
#include <iostream>
#include <algorithm>
#include <vector>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define ll long long
using namespace std;
int main() {
ll n, m;
cin >> n >> m;
if(n == 1 || m == 1) {
cout << 1 << "\n";
return 0;
}
cout << (n * m + 1) / 2 << "\n";
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main(){
double a,b,r,f;
long long int d;
cin >> a >> b;
d=(long long int)a/(long long int)b;
r=(int)a%(int)b;
f=a/b;
cout << d << " " << r << " ";
printf("%.5f\n",f);
return 0;
} | 0 | 30,177,817 |
#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>
#define cinf(n,x) for(int i=0;i<(n);i++) cin >> x[i];
typedef long long int ll;
using namespace std;
int main(){
while(1){
int h,w; cin >> h >>w;
if(h==0 && w==0)break;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cout << "#";
}
cout << endl;
}
cout << endl;
}
} | 0 | 10,911,679 |
#include <bits/stdc++.h>
#include<string>
typedef long long int ll;
typedef unsigned long long ull;
typedef long double ld;
#define F first
#define S second
#define pb push_back
#define pll pair<ll,ll>
#define pii pair<int,int>
#define len(s) s.length()
#define all(v) v.begin(),v.end()
const ll INF = LONG_MAX;
const in... | # include<iostream>
using namespace std;
int main() {
string str;
int b = 0;
while (1) {
cin >> str;
if (str=="0") break;
for (int i=0;i<str.size();i++) {
int x = str[i] - '0';
b += x;
}
cout << b << endl;
b = 0;
}
return 0;
} | 0 | 4,724,972 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
int N;
scanf("%d",&N);
int ans = 0;
for(int i = 3; i <= N; i+=2){
int tmp = 0;
for... | #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,double>;
int ... | 0 | 97,456,008 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.