code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define REP(i, n) for(long long i=0; i<n; i++)
#define REPR(i, n) for(long long i=n-1; i>=0; i--)
#define FOR(i, m, n) for(long long i=m; i<=n; i++)
#define FORR(i, m, n) for(long long i=m; i>=n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | 0 | 655,712 |
#include <iostream>
using namespace std;
int main(){
long long n;cin>>n;
long long a[n];
for(int i = 0; n > i; i++)cin>>a[i];
long long ansmn = 2;
long long ansmx = 2;
for(int i = n-1; 0 <= i; i--){
long long tmp = ansmn/a[i]*a[i];
while(ansmn > tmp)tmp+=a[i];
ansmn = tmp;
ansmx = ansmx/a[i]... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int x;
cin >> x;
bool dp[100000 + 1];
fill(dp, dp + 100000 + 1, false);
dp[0] = true;
for (int i = 1; i <= 99; i++) {
dp[i] = false;
}
for (int i = 100; i <= 105; i++) {
dp[i] = true;
... | 0 | 22,086,389 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double Double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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) {
... | #include <bits/stdc++.h>
#define pb push_back
#define pf push_front
#define in insert
#define F first
#define S second
#define sz(a) int (a.size ())
#define mp make_pair
#define GGWP return 0
#define all(a) (a).begin(), (a).end()
#define pii pair<int,int>
#define graph vector <vector <int> >
#define fname ""
typedef lo... | 0 | 75,638,468 |
#include<bits/stdc++.h>
#define ntest 0
using namespace std;
const int mod = 1e9 + 7;
int s;
int dp[2005];
void solve() {
cin >> s;
dp[0] = 1;
for (int i = 3; i <= s; ++i) {
for (int j = 3; j <= i; ++j) dp[i] = (dp[i] + dp[i-j]) % mod;
}
cout << dp[s];
}
int main() {
ios::sync_with_stdio... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
int x;
cin... | 0 | 91,060,695 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char n[15];
for(int i=0;i<12;i++) cin>>n[i];
for(int i=0;i<4;i++) cout<<n[i];
cout<<" ";
for(int i=4;i<12;i++) cout<<n[i];
cout<<'\n';
return 0;
} | #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 mp make_pair
#define pb push_back
#define ins insert
#define pqueue(... | 0 | 56,451,759 |
#include<iostream>
#include<iomanip>
#include<cstdlib>
#include<stdio.h>
#include<time.h>
#include<math.h>
#include<algorithm>
#include<string>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<map>
#define REP(i, N) for(ll i = 0; i < N; ++i)
#define FOR(i, a, b) for... | #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 priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_AS... | 0 | 52,546,128 |
#include<iostream>
#include<string>
#include<vector>
#include<cctype>
int main(void) {
std::string InputS, InputP;
std::cin >> InputS >> InputP;
bool Answer = false;
int count = 0;
while (count < InputS.size()) {
if (InputS[count] == InputP[0]) {
bool flag = false;
for (int i = 0; i < InputP.size(); ++i) {... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | 0 | 30,992,768 |
#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... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
int a[n];
int cnt[101];fill(cnt,cnt+101,0);
for(int i=0;i<n;i++){
cin>>a[i];
cnt[a[i]]++;
}
sort(a,a+n);
bool ok=true;
if(cnt[a[n-1]]==1){
ok=false;
}
else{
if(a[n-1]%2==0){
for(int i=1;i<a[n-1];i++){
... | 0 | 69,565,993 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
ll MOD=1000000007;
ll ReturnDigit(ll n){
int keta=1;
while(n/10!=0){
n /= 10;
keta++;
}
return keta;
}
int main(){
ll n; cin>>n;
ll ans = 100000000000;
for (ll i=1;... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
struct Dice
{
vector<int> faces;
Dice(vector<int>& f)
: faces(f) {}
int top() {
return faces[0];
}
int front() {
return faces[1];
}
int at(int n) {
return faces[n];
}
void rol... | 0 | 87,051,199 |
#include <iostream>
using namespace std;
int dfs(int now, int n, int s) {
if (n == 0 && s == 0) return 1;
if (now < 10) return dfs(now + 1, n, s) + dfs(now + 1, n - 1, s - now);
return 0;
}
int main() {
while (true) {
int n, s;
cin >> n >> s;
if (n == 0 && s == 0) return 0;
int ans = dfs(0, n, s... | #include <bits/stdc++.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define lrep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define lrep2(i,a,n) for(long long i = (long long)(a); i <= (long long)(n); i++)
#define irrep(i,n) for(int i = (in... | 0 | 54,551,940 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | #include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<functional>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<map>
#include<random>
#include<unordered_map>
#incl... | 0 | 21,491,118 |
#include <iostream>
using namespace std;
int main() {
int a,b;
cin>>a>>b;
cout<<(a*b%2?"Odd":"Even")<<endl;
} | #include <iostream>
#include <string>
#include <iomanip>
#include <stdlib.h>
using namespace std;
int main(){
long long n,a[10001];
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n-1;i++){
for(int j=n-1;j>i;j--){
if(a[j]>a[j-1]){
int t=a[j];
a[j]=a[j-1];
... | 0 | 1,371,399 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define ll long long
#define ld long double
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define sz(x) ((int)(x).size())
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
const int INF = 1e9;
co... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES... | 0 | 76,684,701 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int abs(int a,int b){
int c=max(a,b)-min(a,b);
return c;
}
signed main(){
int a,c=0,d=0,x=1;
int q,w;
int b[1000000];
int z=10000000;
cin>>a;
for(int i=0;i<a;i++){
cin>>b[i];
if(i==0) c=b[0];
else d+=b[i];
}
z=abs(c,d);
... | #define _GLIBCXX_DEBUG
#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 fi first
#define se second... | 0 | 67,874,924 |
#include<iterator>
#include<algorithm>
#include<vector>
#include<map>
#include<iostream>
auto main ( ) -> int
{
using namespace std ;
vector < int > ns ;
copy ( istream_iterator < int > { cin } , istream_iterator < int > { } , back_inserter ( ns ) ) ;
map < int , int > table ;
for ( auto n : ns )
... | #include <bits/stdc++.h>
using namespace std ;
typedef long long ll;
typedef string str;
typedef pair<int, int> pii;
typedef vector<int> vint;
typedef vector<double> vdou ;
typedef vector<ll> vll;
typedef vector<vint> vvint;
typedef vector<str> vstr;
typedef pair<ll,ll> pll ;
typedef vector<pii> vpii ;
typedef vector<p... | 0 | 55,258,929 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int a, b, c;
cin >> a >> b >> c;
int ans = min({a+b, b+c, c+a});
cout << ans << endl;
} | #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--)
#define ALL(x) (x).begin(),(x).end... | 0 | 96,290,940 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define sz(a) ll((a).size())
#define all(a) (a).begin(), (a).end()
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPD(i,n) for(int i=(n)-1;i>=0;--i)
#... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define rep1(i, n) for (int i = 1; i < int(n); ++i)
#define repx(i, x, n) for (int i = int(x); i < int(n); ++i)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(n) begin(n), end(n)
#define IN(a, x, b) ((... | 0 | 46,169,074 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<float> a(n);
rep(i, n) cin >> a[i];
float ans;
rep(i, n) ans += 1.0 / a[i];
ans = 1.0 / ans;
cout << fixed << setprecision(15... | #include <iostream>
using namespace std;
int main()
{
int first = 0, second = 0, third = 0;
for (int i = 0; i < 10; i++) {
int n;
cin >> n;
if (n > first) {
third = second;
second = first;
first = n;
}
else if(n > second) {
third = second;
second = n;
}
els... | 0 | 27,795,761 |
using namespace std;
#include<bits/stdc++.h>
#define Ranger159 ios_base::sync_with_stdio(false);
#define PrintLater cin.tie(0);cout.tie(0);
#define ll long long
#define phb push_back
#define break break
#define pob pop_back()
#define continue continue
#define size size
#define insrt insert
#define fir first
#define tru... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 19,533,428 |
#include<bits/stdc++.h>
using namespace std;
#define MAX_N 1
typedef long long ll;
const double pi = 3.141592653589793;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
int main(){
int n;
cin >> n;
for(int i = n; i <= 1111; i++){
int first = i / 100;
int second = i % 100 / 10;
... | #include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
int main() {
ll D;
scanf("%lld", &D);
switch (D) {
case 25:
... | 0 | 97,983,277 |
#include "bits/stdc++.h"
using namespace std;
struct Solver {
Solver() {
ios::sync_with_stdio( false );
}
void solve() {
int N, K;
string S;
cin >> N >> S >> K;
for( int i = 0; i < N; ++i ) {
if( S[i] == S[K-1] ) {
cout << S[i];
}
else {
cout << '*';
}
}
cout << endl;
}
};
int main... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll A;
cin >> A;
string B;
cin >> B;
bool flag = false;
int count = 0;
ll Bdash = 0;
for(int i = 0; i < B.size(); i++) {
if(B[i] == '.') {
flag = true;
} else {
Bdash =... | 0 | 65,074,731 |
#include <iostream>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
string S;
cin >> S;
int count = 0;
char before = S[0];
rep(i, S.size()) {
if (before != S[i]) {
... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long int64;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<29;
const long long INFL = 1e18;
const int MOD = 1000000007;
const int MAX = 210000;
const int MAX_NUM = 999999999;
void so... | 0 | 12,341,182 |
#include<cstdio>
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<functional>
#include<queue>
#include<stack>
#define INF 9999999999
#define EPS 1.0e-6
using namespace std;
typedef long long ll;
typedef pair<int, int>P;
typedef pair<int, P> PP;
int V,E;
ll d[105][105];
void warshall_flo... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <utility>
#include <map>
#define maxn 200005
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int n,a[maxn];
map <int,int> s;
typedef map<int,int> :: iterator Ite... | 0 | 69,989,723 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll x,y;
cin >> x >> y;
ll ans = 0;
if(x>=0 && y>=0){
if(x<=y) ans = abs(y-x);
else { ans = abs(x-y)+2; if(y==0)ans--;}
} else if(x<0 && y<0){
if(x<y) ans = abs(y-x);
else ans = abs(x-y)+2;
} else {
if(x<y) ans = min(abs(y-x)... | #include <iostream>
using namespace std;
void dicemove(int);
typedef struct {
int up;
int back;
int right;
int left;
int front;
int down;
}dicetype;
dicetype dice;
#define FRONT 0
#define BACK 1
#define RIGHT 2
#define LEFT 3
#define CLOCK 4
#define COUNTERCLOCK 5
int main(void){
int qnum;
int up_num;... | 0 | 74,962,917 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define min_3(a,b,c) min(a,min(b,c))
#define max_3(a,b,c) max(a,max(b,c))
#define nout(ans) cout << (ans) << "\n"
#define sout(ans) cout << (ans) << " "
using namespace std;
const double pi = 3.14159265359;
con... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define fi first
#define sc second
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) <... | 0 | 69,872,675 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double lld;
ll MOD = (1e9)+7;
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int kx[] = {+1, +2, -1, -2, +1, +2, -1, -2};
const int ky[] = {+2, +1, +2, +1, -2, -1, -2, -1};
in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;... | 0 | 59,980,754 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> G(H, vector<... | #include <iostream>
using namespace std;
int main() {
string stra,strb;
int x;
bool r=true;
cin >> stra;
cin >> strb;
x= stra.length();
for(int i=0;i<x;i++){
if(stra[i]!=strb[i]){
r=false;
}
}
if(r==true){
cout << "Yes" << endl;
}else if(r==fa... | 0 | 41,908,202 |
#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>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const int INF = 1e9 + 10;
int main() {
int n;
cin >> n;
ll ans = 0;
for (int i = 1; i < n; ++i) {
... | #include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#ifdef hacks
#include <boost/multiprecision/cpp_int.hpp>
#endif
#define p std::pair
#define ll... | 0 | 23,089,875 |
#include <iostream>
#include <bits/stdc++.h>
#include <string>
#include <ctype.h>
#include <algorithm>
#include <cmath>
#include <vector>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define square(x) (x) * (x)
const int INF = 1e9;
using namespace std;
int main() {
int w, h, x,... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int n;
int a[100009]={};
int ans=0;
long long t=0;
int m=0;
cin >> n;
cin >> a[1];
a[0] = 0;
t += abs(a[1]);
for(int i=2; i<=n; i++){
cin >> a[i];
t += abs(a[i]-a[i-1]);
}
a[n+1] = 0;
t += a... | 0 | 50,908,394 |
#include<iostream>
using namespace std;
int main(){
int n[100];
int max[2]={0,-1},min[2]={1000,-1},sum=0;
int m;
while(true){
cin>>m;
if(m==0){
break;
}
max[0]=0;
max[1]=-1;
min[0]=1000;
min[1]=-1;
sum=0;
for(int i=0;i<m;i++){
cin>>n[i];
if(n[i]>max[0]){
max[1]=i;
max[0]=n[i];
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPr(i, n) for(int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for(int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for(int i = (n); i >= (m); --i)
#define MP make... | 0 | 23,175,717 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string str;
cin>>str;
for(int i = 0; i < str.size(); i++)
{
if(str[i]=='1')
{
str[i] = '9';
}
else
{
str[i] = '1';
}
}
cout<<str;
} | #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 sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#define tr(c, i) for (__typeof((c).begin()) i = (c).begi... | 0 | 12,725,163 |
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bi... | #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;
int main() {
ios::sync_with_stdio(fals... | 0 | 14,901,390 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=1e+18;
const int MOD=1e+9+7;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
template<class T>
vector<T> make_v... | #include <bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false); std::cin.tie(NULL);
int n, m;
cin >> n >> m;
vector<vector<int> > parts(m);
for (int i = 0; i < n; i++) {
int days, reward;
cin >> days >> reward;
if (days <= m) {
parts[days - 1].push_back(... | 0 | 49,282,557 |
#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... | #include <stdio.h>
#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>
#incl... | 0 | 45,838,467 |
#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) ... | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | 0 | 91,954,938 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
#define PI 3.141592653
int main(){
int n;
double x_1,y_1,x_2,y_2,x_3,y_3,x_4,y_4,slope_1,slope_2;
sc... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int a[5];
for(int i=1;i<6;i++){
cin>>a[i];
}
sort(a+1,a+6);
for(int i=5;i>0;i--){
if(i==1)cout<<a[i];
else cout<<a[i]<<' ';
}
cout<<endl;
} | 0 | 8,848,919 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn=2e5+1000;
ll n,k,a[maxn],dif[maxn];
int main(){
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
cin>>n;
for(int i=0;i<n;i++) cin>>a[i];
for(int i=1;i<n;i++) dif[i]=a[i]-a[i-1];
ll mo=1000,num=0;
for(int i=i;i<n;i++)... | #include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll x, ll y) {
ll res = 1;
for (ll i = 0; i < y; i++) res = res * x % mod;
... | 0 | 24,638,149 |
#include <bits/stdc++.h>
using namespace std;
vector<int> X[1003];
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL), cout.tie(NULL);
int N;
cin >> N;
int ptr = 0;
while(ptr * (ptr - 1) / 2 < N)
ptr++;
if(ptr * (ptr - 1) / 2 > N)
{
cout << "No\n";
return 0;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector< vector<int> >
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;
int main(){
int N;
cin >> N;
vector<int> A(N + 1), L(N + 1);
... | 0 | 90,436,552 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
ll mini = min(n, m);
ll maxi = max(n, m);
ll ans;
if(mini==1) {
if(maxi==1) ans = 1;
else ans = maxi-2;
}
else ans = (mini-2)*(maxi-2);
cout << ans << "\n";
} | #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++) {
... | 0 | 80,453,069 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, h, w; cin >> n >> h >> w;
int cnt = 0;
for (int i = 0; i < n; i++) {
int x, y; cin >> x >> y;
if (h <= x && w <= y) cnt++;
}
cout << cnt << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <chrono>
#include <ctime>
#include <queue>
#include <math.h>
#include <deque>
#include <stack>
#include <iomanip>
#include <assert.h>
#include <stdio.h>
#... | 0 | 35,537,949 |
#include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<strin... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x ,n) for(int i = x; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
int n;
int a_max = 0;
int a_min = INF... | 0 | 83,597,327 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int l, r;
cin >> l >> r;
const int MOD = 2019;
if (MOD <= r-l+1) {
cout << 0 << endl;
return 0;
}
l %= MOD;
r %= MOD;
i... | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cerr << (#x) << ": " << (x) << endl
#define int long long
const int M = 200009;
int m;
int d[M], c[M];
pair<int, int> digs(int num) {
if(num < 10) return {num, 0};
int ret = 0;
while(num) {
ret += num%10;
num /= 10;
}
pai... | 0 | 31,930,034 |
#include <iostream>
#include <iomanip>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < (int)n; ++i)
#define rrep(i, j, n) for (int i = (int)n - 1; ... | 0 | 89,407,210 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
char a, b, c, d;
a = s.at(0);
b = s.at(1);
c = s.at(2);
d = s.at(3);
if(a == b && b == c && c == d){
cout << "No";
}
else if(a == b && c == d){
cout << "Yes";
}
else if(a == c && b == d){
cout << "Yes";
... | #include<iostream>
#include<algorithm>
using namespace std;
int main() {
char line[36][2],line2[36][2];
int time;
cin >> time;
for (int i = 0; i < time; ++i) {
cin >> line[i][0] >> line[i][1];
line2[i][0] = line[i][0];
line2[i][1] = line[i][1];
}
for (int i = 0; i < time - 1; ++i) {
for (int i2 = time - 1... | 0 | 63,902,392 |
#include<stdio.h>
int main()
{
int N;
scanf("%d", &N);
int A[101], element;
for (element = 0; element <= N - 1; element++)
{
scanf("%d ", &A[element]);
}
int i, j, k, l, m = 0, mini;
for (i = 0; i <= N - 2; i++)
{
l = 0;
mini = i;
for (j = i; j <= N - 1; j++)
{
if (A[j] < A[mini])
{
mini = ... | #include <bits/stdc++.h>
using namespace std;
bool c[200][200];
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
c[a][b] = true;
}
vector<pair<int, int> > v;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
... | 0 | 63,278,371 |
#include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 998244353
#define INF 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <li... | 0 | 74,042,734 |
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=100005;
int n,i,a[N];
ll sum,w,c[N];
int main()
{
scanf("%d",&n);
for(i=1;i<=n;++i)
{
scanf("%d",a+i);
sum+=a[i];
}
if(sum%(1ll*(1+n)*n/2))
{
printf("NO");
return 0;
}
sum/=1ll*(... | #pragma GCC optimize("O2")
#include<bits/stdc++.h>
#define int long long int
#define endl "\n"
#define mod 100000000
using namespace std;
typedef double DB;
void fastio()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
}
bool findix(string s,string t)
{
int j=0;
for(int i=0;i<s.length();++i... | 0 | 89,950,927 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define file_se_input freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define pp long long int
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __bui... | #include <bits/stdc++.h>
#include <stdio.h>
#include <iostream>
#include <stddef.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n; cin >> n;
int arr[n + 1];
for (int i = 1; i <= n; ++i) cin >> arr[i];
bool visited[n + 1];
memset(visited, false, sizeof... | 0 | 14,023,790 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <map>
#include <stack>
#in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
vector<int> f;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
rep(i, N) cin >> A[i];
vector<ll> S(N+1);
S[0] = 0;
rep(i, N) {
S[i+1... | 0 | 73,161,960 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i=0; i<(ll)n; i++)
#define REPR(i, n) for(ll i=(ll)n-1; i>=0; i--)
#define FOR(i, m, n) for(ll i=(ll)m; i<(ll)n; i++)
#define FORR(i, m, n) for(ll i=(ll)m-1; i>=(ll)n; i--)
#define ALL(x) (x).begin(), (x).end()
#define ASC(v) s... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
int F=0;
cin>>N>>M;
vector<long long>vec(N);
vector<bool>ve(N,true);
vector<vector<int>> v(M, vector<int>(2));
for(int X=0;X<N;X++){
cin>>vec.at(X);
}
for(int X=0;X<M;X++){
for(int Y=0;Y<2;Y++){
cin>>v.at(X).at(Y);
}... | 0 | 64,578,787 |
#include <iostream>
#include <vector>
#include <string>
#include <utility>
using namespace std;
typedef struct{
int idx;
char dec;
int num;
}playingCard;
void printVector(const vector<playingCard> &A) {
for(int i = 0; i < A.size(); i++) {
cout << A[i].dec << A[i].num;
... | #include<iostream>
using namespace std;
int main(){
int n;
int home[110];
cin >> n;
for(int i=0;i < n;i++){
cin >> home[i];
}
int ans = 10000000;
for(int p=1;p <= 100;p++){
int vit = 0;
for(int i=0;i < n;i++){
vit += (p-home[i])*(p-home[i]);
}
... | 0 | 6,255,268 |
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 2e5 + 100;
char str[maxn];
int a[maxn];
int dp[(1<<26)];
void print(int x)
{
while(x){
cout<<x%2;
x/=2;
}
cout<<endl;
}
int main()
{
cin>>str;
int L = strlen(str), ans = 0;
for(int i = ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
c... | 0 | 27,573,565 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a) for(int i=0;i<(a);i++)
const ll MOD=1000000007;
int A[101010];
int main(){
int N; cin>>N;
rep(i,N) cin>>A[i];
ll ans=A[0]-1;
int lim=2;
for(int i=1;i<N;i++){
if(A[i]==lim) lim++;
else if(A[i]>lim){
ans+=A[i]/lim... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
string s;
int x, y, f = 0, cnt = 0;
cin >> s >> x >> y;
int n = int(s.size());
vector< vector<int> > d(2);
for (int i = 0; i < n; ++i) switch (s.at(i)) {
case 'F': +... | 0 | 33,553,390 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#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() {
string s; ll k... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
const ll INF = (1ll << 60);
int main() {
ll W, H;
cin >> W >> H;
vi p(W), q(H);
for (ll i = 0; i < W; i++) cin >> p[i];
for (ll i = 0; i < H; i... | 0 | 39,490,661 |
#include <stdio.h>
#include <math.h>
#define PI 3.1415926
int main(){
double a, b, c;
double rad;
double l;
double S, L, h;
scanf("%lf %lf %lf", &a, &b, &c);
rad=c*PI/180.0;
S=a*b*(sin(rad))/2;
l=sqrt(a*a+b*b-2*a*b*cos(rad));
L=a+b+l;
h=S*2/a;
printf("%.6f\n", S);
printf("%.6f\n", L);
printf(... | #include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <complex>
typedef long long int LL;
typedef unsigned long long int ULL;
using namespace std;
int s[2005], t[2005];
const LL M = (LL)1e9 + 7;
LL r_... | 0 | 22,078,898 |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
long long arr[10000007] ;
int main()
{
long long n , sum = 0 , i , j ;
scanf("%lld",&n);
for ( i=1 ; i<=n ; i++)
{
for ( j = i ; j<=n ; j+= i )
{
arr[j]++;
}
}
for (i=1 ; i<=n ; i++)... | #include <bits/stdc++.h>
using namespace std;
long long nCr(const long long n, long long r) {
if (n == 0) { return 0; }
if (r == 0) { return 1; }
if (r == 1) { return n; }
if (n == r) { return 1; }
if (r > n / 2) { r = n / 2; }
long long result = 1;
for (long long i = 1; i <= r; i++) { resul... | 0 | 53,766,626 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";n... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
const long long MOD = 1e9 + 7;
const int MAXH = 1000 + 5;
struct Pos {
int x;
int y;
};
int h, w;
long long dp[MAXH][MAXH];
char board[MAXH][MAXH];
void calc(int x, int y) {
if (x < 1 || y > w) {
retu... | 0 | 75,735,398 |
#include <iostream>
using namespace std;
int main(){
int n;
long int a[5000],sum,ans;
while(1){
cin >> n;
if(n==0) break;
sum=0;
ans=-1000000;
for(int i=0;i<n;i++){
cin >> a[i];
}
for(int i=0;i<n;i++){
sum=0;
for(int j=0;i+j<n;j++){
sum+=a[i+j];
if(ans<sum){
ans=... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int A, B, K;
cin >> A >> B >> K;
int m = A < B ? A : B;
int cdiv = 0;
for (int i = m; true; i--) {
if (A % i == 0 &... | 0 | 30,083,853 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,maxcount=-1,P=0;
cin >> N;
for(int i=0;i<N;i++){
int A=i+1,count=0;
while(A%2==0){
count++;
A/=2;
}
if(maxcount<count){
maxcount=count;
P=i+1;
}
}
cout << P << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
typedef long long lint;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define trep(i, k, n) for (int i = (k); i < (int)(n); ++i)
const int INF =1e7;
typedef pair<int, int> P;
int c[50];
int dp[50001];
int n, m;
int coin(int n)
{
rep(i,n+1){
... | 0 | 53,701,630 |
#include <bits/stdc++.h>
#define REP(i, a, b) for(int i = a; i < b; i++)
#define REP_(i, a, b) for(int i = a; i <= b; i++)
#define sl(n) scanf("%lld", &n);
#define si(n) scanf("%d", &n);
#define RepAll(a) for(auto x: a)
#define cout(ans) cout << ans << endl;
typedef long long ll;
const int mod = 1e9+7;
using namespace... | #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<cstring>
#include<utility>
#include<set>
#include<stack>
#include<complex>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector... | 0 | 46,085,734 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long m;
if (n == 0)
m = 2;
else if (n == 1)
m = 1;
else {
long long a = 2, b = 1;
for (int i = 2; i <= n; i++) {
m = a + b;
a = b;
b = m;
}... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define rrep(i, a, b) for (int i = a; i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
... | 0 | 19,657,968 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i,n) ... | #include <iostream>
#include <cstring>
#include <set>
#include <queue>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <cmath>
using namespace std;
#include <bits/stdc++.h>
using namespace std;
const int N=222222;
int a[N],b[N];
int main() {
int n;
scanf("%d",&n);
for (int i... | 0 | 41,158,617 |
#include <stdio.h>
int main(void) {
int a,b,c,n=0,i;
scanf("%d %d %d",&a,&b,&c);
if(a>=1&&a<=10000&&b>=1&&b<=10000&&c>=1&&c<=10000){
if(a<=b){
for(i=a;i<=b;i++){
if(c%i==0) n++;
}
}
}
printf("%d\n",n);
return 0;
} | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define MAX ((int)1e9 + 5)
#define MAXL ((ll)3e18 + 7)
#define MAX_X ((ll)1e5 + 2)
#define pi (2.0*acos(0))
#define M ((int)1e6 + 7)
#define MOD ((int)1e9 + 7)
#define NN ((int)3e6 + 7)
#define N ((int)1e5 + 5)
#define e... | 0 | 89,835,396 |
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef long double lld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
ll gcd(ll a, ll b){
if (a%b == 0){
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<vector<int>> vec(N,vector<int>(3));
for(int i=0; i<N; i++){
for(int j=1; j<3; j++){
cin >> vec.at(i).at(j);
}
vec.at(i).at(0) = vec.at(i).at(1) + vec.at(i).at(2);
}
sort(vec.rbegin(),vec.rend());
int64_t tak... | 0 | 80,084,400 |
#include <bits/stdc++.h>
#define trace1(a) cout<<#a<<": "<<a<<endl
#define trace2(a,b) cout<<#a<<": "<<a<<" | ", trace1(b)
#define trace3(a,b,c) cout<<#a<<": "<<a<<" | ", trace2(b,c)
#define trace4(a,b,c,d) cout<<#a<<": "<<a<<" | ", trace3(b,c,d)
#define t... | #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 | 39,334,249 |
#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... | #include <bits/stdc++.h>
using namespace std;
using usize = ::std::size_t;
using u64 = ::std::int_least64_t;
static constexpr u64 Inf = ::std::numeric_limits<u64>::max() / 2;
#define mod 1000000007
u64 modinv(u64 a, u64 m) {
u64 b = m, u = 1, v = 0;
while (b) {
u64 t = a / b;
a -= t * b; swap(a,... | 0 | 86,913,097 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep1(i, n) for (ll i = 1; i < n; i++)
using P = pair<ll, ll>;
int main()
{
double w, h, x, y;
cin >> w >> h >> x >> y;
cout << w * h / 2 << " ";
if (x == w / 2 && y == h / 2)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(v) v.begin(), v.end()
int main() {
int N, M;
cin >> N >> M;
vector<int> H(N,0);
vector<int> count_H(N,1);
rep(i, N) cin >> H[i];
rep(i, M) {
int a, b;
... | 0 | 95,714,518 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
using namespace std;
typedef long long ll;
#define rep(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define all(x) x.begin(),x.end... | #include<bits/stdc++.h>
#include<string>
#include<vector>
using namespace std;
typedef pair<int, int>P;
typedef long long ll;
#define rep(i,n)for(ll i=0;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#de... | 0 | 26,538,787 |
#include<bits/stdc++.h>
#define ll long long
#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;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
int main() {
ll n,k; cin >> n >> k;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
deque<int> b;
if (n % 2 == 0) {
for(int i = 0; i < n; i++){
... | 0 | 58,057,203 |
#include <iostream>
int main(){
int a,b;
while(std::cin >> a >> b, (a|b)){
[&a,&b] () -> void { if(a > b){ std::swap(a,b); } } ();
std::cout << a << " " << b << std::endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
vector<int>A(N);
vector<int>cnt(200000);
for(int i = 0; i < N; i++) {
cin >> A[i];
cnt[A[i]-1]++;
}
sort(cnt.begin(),cnt.end());
reverse(cnt.begin(),cnt.end());
int cnt2 = 0;
for(in... | 0 | 93,813,537 |
#include<bits/stdc++.h>
using namespace std;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
# define my_sizeof(type) ((char *)(&type+1)-(char*)(&type))
int main()
{
optimize();
int a,b;
cin>>a>>b;
string s1=to_string(a);
string cpa;
string s2=to_string(... | #include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e18
#define ceill(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp << " " <<
ll mod = 1e9+7;
void ans(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostre... | 0 | 84,531,190 |
#include <bits/stdc++.h>
using namespace std;
int n;
char buf[11451419];
int main() {
while (1) {
fgets(buf, sizeof(buf), stdin);
if (buf[0] == '.') return 0;
stack<char> q;
bool ans = true;
n = strlen(buf);
for (int i=0; i<n; i++) {
char c = buf[i];
if (c == '(' || c == '[') {
... | #include <stdio.h>
#include <algorithm>
using namespace std;
int score;
int use(int money, int coin){
int ans = money / coin;
score += ans;
return ans;
}
int main(){
while (1){
score = 0;
int money;
scanf("%d", &money);
if (money == 0) return 0;
money = 1000 - money;
money -= use(money, 500) * 500;
mo... | 0 | 79,609,322 |
#include <algorithm>
#include <cstdio>
using namespace std ;
typedef long long LL ;
inline LL solve ( LL a , LL b )
{
if ( b%a==0 ) return 2*b-a ;
return solve(b,a%b)+a/b*b*2;
}
int main ()
{
LL n , x ;
scanf("%lld%lld",&n,&x);
if ( 2*x<=n ) printf("%lld\n",n+solve(n-x,x));
else printf("%lld\n",n+solve(x,n-x));
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long... | 0 | 41,017,347 |
#include<iostream>
using namespace std;
int main(){
int num,oturi,m = 0;
while(1){
cin>>num;
if(num==0){
break;
}else{
oturi=1000-num;
m = oturi/500;
m = m+oturi%500/100;
m = m+oturi%500%100/50;
m = m+oturi%500%100%50/10;
m = m+oturi%500%100%50%10/5;
m = m+oturi%500%100%50%10... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,cnt=0;
cin>>n;
for(int i=1;i<n;i++)
{
for(int j=1;j<n;j++)
{
int c=n-(i*j);
if(c<=0)
break;
cnt++;
}
}
cout<<cnt;
return 0;
} | 0 | 80,072,867 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<map>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int N=1e5+10;
int a,b,n,cnt;
ll h,w,ans[10],all;
P res[N*9];
bool ok(int x,int y)
{
return x>1&&x<h&&y>1&&y<w;
}
map<P,int>num;
int main()
{... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
string o,e;
cin >> o >> e;
int n = e.length() + o.length();
int ne = 0, no = 0;
string ans = "";
rep(i,n){
if... | 0 | 7,987,571 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
const long long INF=1LL<<60;
long long dp[n];
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)dp[i]=INF;
dp[0]=0;
for(int i=1;i<n;i+... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int i = n - 1; i < (int)n; --i)
#define FOR(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define RFOR(i, l, r) for (int i = (int)(r); i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(),... | 0 | 98,284,077 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define all(x) (x).begin(), (x).end()
int n, l;
vector <string> s;
int32_t main() {
cin >> n >> l;
for(int i = 0; i < n; ++i) {
string a; cin >> a;
s.pb(a);
}
sort(all(s));
for(auto it:s) cout << it;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leadinz zero str.erase(0, min(str.find_first_not_of('0'), str.size()-1));
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>... | 0 | 76,259,218 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <numeric>
#include <complex>
#include <iomanip>
#include <cassert>
#include <random>
int main() {
int... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int N,A,B,C;
vector<int> L;
int dfs(int a, int b, in... | 0 | 13,961,029 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int sum =0;
int num =N;
while(num>0){
int n = num %10;
sum += n;
num = num/10;
}
if(N%sum == 0){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
string s;
cin >> s;
string t = "";
for (int i = 0; i < 2; i++){
for (int j = 0; j < 2; j++){
string tmp;
if (i == 0){
tmp += 'S';
} else {
tmp += 'W';
}
if (j == 0){
tmp += 'S... | 0 | 43,734,381 |
#include <iostream>
#include<map>
using namespace std;
#define fin(ans) cout << (ans) << '\n'
int main()
{
int A[3];
cin >> A[0] >> A[1] >> A[2];
sort(A,A+3);
fin(A[0]+A[1]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) FOR(i, 0, (n))
#define FOR(i, a, b) for(int i=(a); i<(b); i++)
#define LAR(a, b) ((a)=max((a),(b)))
#define SML(a, b) ((a)=min((a),(b)))
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pair<int, i... | 0 | 85,038,975 |
#include <iostream>
using namespace std;
int main() {
int a, b, c, n;
cin >> n;
for (int i=0;i<n;i++) {
bool ok = false;
cin >> a >> b >> c;
if (a < c && b < c) {
ok = (a*a+b*b == c*c);
} else if (a < b && c < b) {
ok = (a*a+c*c == b*b);
} else {
ok = (b*b+c*c == a*a);
}
c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int h, w;
cin >> h >> w;
vector<string> m(h);
for (int i = 0; i < h; i++) cin >> m[i];
vector<vector<int>> a(h, vector<int>(w));
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (i == 0 && j == 0) {
... | 0 | 69,045,236 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int r, d, s;
cin >> r >> d >> s;
int n = 10;
while(n--) {
s = r * s - d;
cout << s << "\n";
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | 0 | 60,263,389 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<string> w(n);
string first;
cin >> first;
w[0] = first;
string word;
for(int i = 1; i < n; i++){
cin >> w.at(i);
if(w[... | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
int main () {
cout << fixed << setprecision(18);
int n,k;cin>>n>>k;
... | 0 | 87,301,627 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
int N, K;
cin >> N >> K;
vector<int> L;
for (int i = 0; i < N; i++) {
int l;
cin >> l;
L.push_back(l);
}
sort(L.begin(), L.end());
reverse(L.begin(), L.end());
int sum ... | #include<bits/stdc++.h>
using namespace std;
int dp[100000][3];
int main(){
int n;
scanf("%d",&n);
for(int i = 0; i < n; i++)
scanf("%d %d %d",&dp[i][0],&dp[i][1],&dp[i][2]);
for(int i = 1; i < n; i++){
dp[i][0] = max(dp[i-1][1],dp[i-1][2]) + dp[i][0];
dp[i][1] = max(dp[i-1][0],dp[i-1][2]) + dp[i][1];
dp[i]... | 0 | 86,992,371 |
#include<iostream>
#include<queue>
using namespace std;
static const int N=100;
static const int WHITE=0;
static const int GRAY=1;
int n,M[N][N],color[N];
int d[N];
void bfs(int s){
queue<int> q;
for(int i=0;i<n;i++){
d[i]=0;
color[i]=WHITE;
}
color[s]=GRAY;
q.push(s);
int u;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 73,434,691 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
double sum = 0;
double base;
string kind;
cin >> N;
for(int i=0;i<N;i++) {
cin >> base >> kind;
if(kind == "JPY") {
sum += base;
} else {
sum += (base * 380000);
}
}
... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
int main(void){
char buf[16] = { 0 };
int num[4];
char numstr;
int calc[8][3] = {{1,1,1}, {1,1,-1}, {1,-1,1}, {-1,1,1},
{1,-1,-1}, {-1,1,-1}, {-1,-1,1},{-1,-1,-1}};
fgets(buf, sizeof(buf), stdin);
for(int i... | 0 | 4,266,336 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | #include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <set>
#include <cmath>
#include <tuple>
#include <cstring>
#include <map>
#include <iomanip>
#include <ctime>
#include <complex>
#include <cassert>
#include <climits>
using namespace std;
typedef long long ll;
typedef unsigned long lon... | 0 | 14,768,321 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,d[51],x;
long int sum;
cin>>n;
for(int i = 0;i<n;i++)
cin>>d[i];
sum = 0;
for(int i = 0;i<n;i++)
{
for(int j = i+1;j<n;j++)
{
sum += d[i]*d[j];
}
}
cout<<sum;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | 0 | 64,863,569 |
#include <bits
#define rep(i,n) for(int i = 0;i < n;i++)
using namespace std;
typedef long long ll;
int main(){
ll a,b,c,k;
cin>>a>>b>>c>>k;
if(k%2==0)cout<<a-b<<endl;
else cout<<b-a<<endl;
return 0;
} | #include <bits/stdc++.h>
#define ll int64_t
using namespace std;
#include <cstdlib>
#include <math.h>
#include<cstdio>
#include<cstring>
#define FOR(I, A, B) for (ll I = (A); I <= (B); I++)
#define fo(i,n) for(ll i=0;i<n;i++)
#define sz(a) ll((a).size())
#define pb push_back
#define all(c) (c).begin(),(c).end()
#defin... | 0 | 13,500,534 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
template<class TYPE>
struct edge{
TYPE to,cost;
edge(TYPE t,TYPE c){
to = t;
cost = c;
}
};
int main(){
int ... | #pragma GCC optimize("O3")
#pragma GCC target ("avx2")
#define io_init cin.tie(0);ios::sync_with_stdio(0);cout<<setprecision(10)
#include <bits/stdc++.h>
constexpr int INF = 2147483647;
constexpr long long int INF_LL = 9223372036854775807;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
us... | 0 | 9,639,299 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
int energy(vector<int> vec, int p) {
int enesum = 0;
rep(i, vec.size()) enesum += (vec.at(i) - p) * (vec.at(i) - p);
return enesum;
}
int main() {
int N;
cin >> N;
vector<int> X(N);
rep(i, N) cin >> X.at(i);
int a... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | 0 | 59,443,812 |
#include <bits/stdc++.h>
#define s second
#define f first
#define pb push_back
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int W,H,N;
cin >> W >> H >> N... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll A, B, K;
int main() {
cin >> A >> B >> K;
for (int i = 1; i <= K; i++) {
if (i % 2 == 1) {
if... | 0 | 3,004,285 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,m,x[200005],ob[200005];
vector<pair<ll,ll>> adj[200005];
void dfs(ll a)
{
ob[a]=1;
for(auto u: adj[a])
{
if(!ob[u.first])
{
x[u.first]=x[a]+u.second;
dfs(u.first);
}
}
}
int main()
{
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<ll> a(n+1);
vector<ll> b(n);
rep(i,n+1) cin >> a[i];
rep(i,n) cin >> b[i];
ll ans = 0;
for (int i = 0; i < n; i... | 0 | 43,414,601 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int N, prev;
int count = 1;
int ans = 0;
cin >> N;
cin >> prev;
for (int i = 0; i < N - 1; ++i)
{
int now;
cin >> now;
if (now == prev)
{
++count;
}
el... | #include <iostream>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <iomanip>
#include<stdio.h>
#include<math.h>
#include <stdlib.h>
#include <ctype.h>
#include <string.h>
using namespace std;
int main(){
int i=0,n;
int num[6]={0};
int top,front;
for(i=0;i<6;i++){
cin >>num[i];
}
cin ... | 0 | 8,133,548 |
#include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<a+b/2;
return 0;
} | #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
bool kaibun(int i)
{
int a, b, c, d, e;
e = i % 10;
i = (i - e) / 10;
d = i % 10;
i = (i - d) / 10;
c = i % 10;
i = (i - c) / 10;
b = i % 10;
i = (i - b) / 10;
a = i ... | 0 | 58,078,353 |
#include <stdio.h>
int main(void) {
int i, j, a[3], tmp;
scanf("%d %d %d",&a[0],&a[1],&a[2]);
for (i=0; i<2; i++) {
for (j=0; j<2; j++) {
if(a[j] >= a[j+1])
{
tmp = a[j];
a[j] = a[j+1];
a[j+1] = tmp;
}
}
... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(int argc, char *argv[])
{
for(;;) {
int n;
cin >> n;
if(n==0) break;
vector<int> vs;
for(int i = 0; i < n; i++) {
int k;
... | 0 | 73,830,320 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
b[a[i]-1]++;
}
ll sum=0;
for(int i = 0; i < n; i++) {
ll x=0;
for(int j = 1; j <... | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 3000;
int main() {
for (int i = 0; i < MAX_N; i++) {
int x, y;
cin >> x >> y;
if (x == 0 && y == 0) {
break;
} else {
if (x < y) {
cout << x << " " << y << endl;
} else... | 0 | 46,234,489 |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <string.h>
#include <ctype.h>
#include <algorithm>
#include <math.h>
using namespace std;
int main() {
long n,A[110000],sum = 1;
cin >> n;
for(int i = 0; i < n; i++)
cin >> A[i];
for(int i = 0; i < n; i++) {
if(A[i] == 0) {
co... | #include <iostream>
using namespace std;
typedef long long ll;
ll n, a[55], sho[55], ans;
int main(void){
cin >> n;
for(ll i = 0; i < n; i++) cin >> a[i];
while(true){
ll shosum = 0;
for (ll i = 0; i < n; i++){
sho[i] = a[i] / n;
shosum += a[i] / n;
a[i] %... | 0 | 91,281,853 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll;
typedef pair<int,int> pii;
typede... | 0 | 76,654,704 |
#include<bits/stdc++.h>
#define ll long long
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repr(i,a,b) for(int i=a;i>=b;i--)
#define pb(z) push_back(z)
#define ff first
#define ss second
#define pi(a,b) make_pair(a,b)
#define pii pair<ll,ll>
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 2000000000000000000ll
#define fi first
#define sec second
#define... | 0 | 64,972,421 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.