code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <iostream>
using namespace std;
int main()
{
int n;
int a, b, c;
cin >> n;
if (n == 2){
cin >> a >> b;
if (a > b){
int c = a;
a = b;
b = c;
}
for (int i = 1; i <= a; i++){
if (a % i == 0 && b % i == 0){
cout << i << "\n";
}
}
return 0;
}... | #include<iostream>
using namespace std;
int main() {
int n;
int data[3] = {0, 0, 0};
cin >> n;
for(int i = 0; i < n; i++) {
cin >> data[i];
}
for ( int i = 1; i <= 100000000; i++) {
if ( data[0] % i == 0 && data[1] % i == 0 && data[2] % i == 0 ) {
cout << i << endl;
}
}
return (0)... | 1 |
#include<iostream>
#define INF 5000000
using namespace std;
const int V=120;
int map[V][V]={INF};
int dis[V];
bool used[V];
int dijkstra(int s,int e){
fill(dis,dis+V,INF);
fill(used,used+V,false);
dis[s]=0;
while(true){
int v=-1;
for(int u=0;u<V;u++){
if(!used[u] && (v==-1 || dis[u]<dis[v]))v=u;
}
if(... |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#define ld long do... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, q;
string s;
cin >> n >> q >> s;
s = ' ' + s; // 文字列を1オリジンで考える
n++;
vector<int> dp(n); // sの先頭からi文字目(1<=i<=n)までに含まれるACの数を記録する配列
rep(i, n) {
if (i == 0 || i == 1) dp[i] ==... | #include<bits/stdc++.h>
using namespace std;
const int N=100100;
int a[N],n,f[N][30],L,Q;
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n;
for(int i=1;i<=n;++i)cin>>a[i];
cin>>L>>Q;
for(int i=1;i<=n;++i)f[i][0]=upper_bound(a+1,a+n+1,a[i]+L)-a-1;
for(int i=1;i<=20;++i)
for(int j=1;j<=n;++j)f[... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=5500+5,M=1500,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define il inline
int sx,s... | #include <iostream>
using namespace std;
int main (void) {
int G[101][101] = {0}, sum[101] = {0}, rank[101] = {0};
int a, b, c, d;
int n;
cin >> n;
for(int i = 1; i <= n*(n-1)/2; i++) {
cin >> a >> b >> c >> d;
if(c < d) {
G[a][b] = 0; G[b][a] = 3;
} else if(c == d) {
G[a][b] = 1; ... | 0 |
#include <bits/stdc++.h>
#define fi first
#define se second
const int N = 2020;
const int mod = 1e9 + 7;
using namespace std;
int ans(int res)
{
cout << res << "\n";
exit(0);
}
int main()
{
ios_base::sync_with_stdio(0);
//freopen("input.txt", "r", stdin);
//freopen("output.... | #include <stdio.h>
int main() {
int h,w,n;
scanf("%d", &h);
scanf("%d", &w);
scanf("%d", &n);
int ctr = 0;
int total = 0;
while (n > total){
if(w >= h){
total += w;
ctr++;
}else if(h > w){
total += h;
ctr++;
}
}
printf("%d\n",ctr);
return 0;
}
| 0 |
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
int main() {
string line;
while(cin >> line) {
for(int i = 0; i < line.size(); ++i)
if(line[i] == ',') line[i] = ' ';
istringstream is(line);
... | // 問題: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0034
#include <iostream>
#include <vector>
bool input(std::vector<int> & l, int & v1, int & v2)
{
char comma;
if (!(std::cin >> l[0])) return false;
for (int i = 1; i < 10; i++) {
std::cin >> comma >> l[i];
}
std::cin >> comma >> v1 >> comma >> v2;... | 1 |
#include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
string alphabet = "abcdefghijklmnopqrstuvwxyz";
string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main(){
int k , n;
cin >> k >> n;
if(k % n == 0)cout << 0 << endl;
else cout << 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (int)1e9+7
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>b;--i)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define... | 1 |
#include<bits/stdc++.h>
#define Vsort(a) sort(a.begin(), a.end())
#define Vreverse(a) reverse(a.bigin(), a.end())
#define Srep(n) for(int i = 0; i < (n); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define Lrep(i,a,n) for(int i = (a); i < (n); i++)
#define Brep(n) for(int bit = 0; bit < (1<<n); bit++)
#define v... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
ty... | 0 |
#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll INF=1e15;
const int MAX_N... | //
// main.cpp
// DPu
#include <iostream>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using P=pair<int,int>;
using ll = long long;
ll dp[1<<16]={};
ll cost[1<<16]={};
int main(int argc, const char * argv[]) {
int n;
cin >>n;
ll a[n][n];
rep(i,n) rep(j,n) cin>>a[i][j];
for (in... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mx = 10000007;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
#define ss second
#define ff first
#define pb push_back
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
#define FIO ios_base::s... | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
const int mod=1e9+7;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
string k;
cin>>k;
int d;
cin>>d;
//dp[0][0]=1;
vector< vector<int> >dp(d,vector<int>(2));
dp[0][0]=1;
// dp[0][1]=1;
int n=k.length();
... | 0 |
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
int ans=2e9;
for(int i=0;i<n;i++){
int cnt=0;
while(a[i]%2==0){
cnt++;
a[i]/=2;
}
ans=min(cnt,ans);
}
cout<... | #include <vector>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int m = 1e9;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
m = min(__builtin_ctz(a), m);
}
cout << m << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
typedef long long ll;
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const vector<T... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin>>N>>K;
int X;
X = N-(K-1);
cout<<X<<endl;
}
| 1 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | #include <bits/stdc++.h>
using namespace std;
const int N = 2005;
#define int long long
int gcd(int x, int y) {
return (!y) ? x : gcd(y, x % y);
}
int lcm(int x, int y) {
return x / gcd(x, y) * y;
}
int n, A[N][N], pr[N], cnt;
bitset <100005> isp;
void prework(int tot) {
for(int i = 1; i < 100005; ++ i) isp[i]... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<ll, ll>P;
int main(){
ll N;
cin>>N;
vector<P>Sup;
vector<P>Sdown;
rep(i,N){
string s;
cin>>s;
ll total=0,mini=0;
rep(j,s.size()){
if(s[j]=='('){total++;}
... | #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... | 1 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
void abc_160a();
void abc_161a();
void abc_162a();
void abc_163a();
void abc_164a();
void abc_165a();
void abc_166a();
void abc_167a();
void abc_168a();
void abc_169();
int main()
{
//abc_160a();
//abc_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define ra... | 1 |
#include<stdio.h>
int main(){
int x,y = 0;
scanf("%d", &x);
y = x * x * x;
printf("%d\n", y);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int64_t n;
string s = "";
cin >> n;
while(n!=0)
{
n--;
s += 'a' + n % 26;
n /= 26;
}
reverse(s.begin(), s.end());
cout << s << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 1000000007;
bool check(int a,int b,int c)
{
if((a+b)>c && (c+b)>a && (a+c)>b)
return true;
return false;
}
int main()
{
// freopen("input01.txt", "r", stdin);
// freopen("output01.txt", "w", stdout);
int n;
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
int res=0;
for(int i=0;i<n-2;i++)
{
for(int j=i+1;j<n-1;j++)
{
for(int k=j+1;k<n;k++)
{
... | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << A + B + C - max({A, B, C}) << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll int64_t
#define rep(i,n) for(int64_t i=0;i<n;++i)
#define P pair<ll,ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr int64_t INF=(1ll<<60);
constexpr int64_t mod=1000000007;
constexpr double pi=3.14159265358979323846;
template<type... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define deb(x) cout<< #x << " " << x << "\n";
#define MAX 9223372036854775807
#define MIN -9223372036854775807
#define PI 3.141592653589
#define setbits(n) __builtin_popcountll(n)
const ll mod=1e9+7;
const ... | /**
* @copyright (c) 2020 Daisuke Hashimoto
*/
#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int64_t, int64_t>;
constexpr int64_t kInf = INT64_MAX / 2L;
// std::cout << std::setprecision(20) << 1.1 << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N, M;
cin >> N >> M... | 0 |
#include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--) // [a, b)
#define reprev(i,n) reprrev(i,0,n)
using ll = long long;
using ull = unsigned long long;
template<class T> inline boo... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const ll INF = (ll)1e18;
const int N = 2e5 + 5;
const ll MOD = 1e9+7;
int parent[N];
int gcd(int a, int b) {
if (a == 0)
ret... | 1 |
#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... | #include<bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define Yes cout<<"Yes"<<endl #define No cout<<"No"<<endl
#define yes cout<<"yes"<<endl #define no cout<<"no"<<end... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll n,ans=0,a,b;
int main()
{
cin>>n;
cin>>a;
for(int i=1;i<=n-1;i++)
{
cin>>b;
if(b<a) ans+=a-b;
else a=b;
}
cout<<ans;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n) ;i++)
using namespace std;
using p=pair<int,int>;
typedef long long ll;
int main() {
int n,r;
cin >> n >> r;
int ans=0;
if(n<=9){
ans=r+100*(10-n);
}
else{
ans=r;
}
cout << ans << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << (x) << endl
#define debugArray(x, n) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define pb push_back
#de... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll MOD=1000000007;
int main(void){
int n;
cin>>n;
int ans=0;
int a;
set<int> s;
while(n--){
cin>>a;
auto itr=s.lower_bound(a);
if(a==(*itr)){
ans--;
s.... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
map<int, int> mp;
for(int i = 0; i < n; i++) {
int foo;
cin >> foo;
mp[foo]++;
}
int ans = 0;
for(auto p : mp) {
if(p.second & 1) ans++;
}
c... | 1 |
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
int s[501],q[1001][5];
int main()
{
int i,j,n,m,a,b,c;
while(cin>>a>>b>>c)
{
if(a==0&&b==0&&c==0)break;
cin>>n;
for(i=1;i<=500;i++)s[i]=2;
for(i=1;i<=n;i++)
{
for(j=1;j<=4;j++)
{
cin>>q[i][j];
}
if(q[... | #include<iostream>
#include<cstring>
using namespace std;
int main(){
int n,m,x[10001],y[10001],c;
bool tomo[600][600],party[600][2];
while(true){
memset(tomo,false,sizeof(tomo));
memset(party,false,sizeof(party));
cin>>n;
cin>>m;
c=0;
if(n==0 && m==0){
break;
}
for(int i=0;i<m;i++){
cin>>x[i]... | 0 |
# include<bits/stdc++.h>
using namespace std;
# define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, int> pdi;
typedef pair<ll, ll> pll;
# define S second
# define F first
# define kill(x) return(cout << x << endl, 0)
# define debug(x) cerr<< #x << " : " << x << endl
# define d... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
#define double long double
typedef pair<double, string> P;
bool solve(){
int n;
string name;
int p, a, b, c, d, e, f, s, m;
P data[50];
cin >> n;
if( n == 0 ) return false;
for( int i = 0; i < n; i++ ){
cin >> ... | 0 |
// J'aime
// Chemise Blanche
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
int a, b;
cin >> a >> b;
cout ... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int N, M; cin >> N >> M;
vector<vector<long long>> dp(3*N+1, vector<long long>(N+1, 0));
dp[3*N][0] = 1;
for(int i=3*N;i>0;i--){
for(int j=0;j<=N;j++){
long long m = 1;
for(int k=1;k<=3;k++){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n,r,ans;
int main()
{
scanf("%d%d",&n,&r);
if(n<10){
ans=r+100*(10-n);
printf("%d",ans);
}else{
ans=r;
printf("%d",ans);
}
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
void abc_150a();
void abc_151a();
void abc_152a();
void abc_154a();
void abc_156a();
int main()
{
//abc_150a();
//abc_151a();
//abc_152a();
//abc_154a();
abc_156a();
}
void abc_150a()
{
int K, X;
cin >> K >> X;
if (500 * K >= X) cout <... | 1 |
#include<bits/stdc++.h>
using namespace std;
int n,t,a[505050],tr[505050],ans[505050],lt[505050];
vector<int>q[505050],qq[505050];
void gx(int x,int vl)
{
while(x<=n)
{
tr[x]+=vl;
x+=x&(-x);
}
}
int sm(int x)
{
int rt=0;
while(x>0)
{
rt+=tr[x];
x-=x&(-x);
}
return rt;
}
int main()
{
cin>>n>>t;
for(int... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e5 + 10;
const int MAX_NODE_CNT = MAXN << 6;
int n, m, lst[MAXN];
struct Persistent_Segment_Tree {
#define mid ((l + r) >> 1)
#define ls(_) t[_].ls
#define rs(_) t[_].rs
#define lq(_) t[_].ls, l, mid
#define rq(_) t[_].rs, mid + 1, r... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d,ans;
while(cin >> a >> b >> c >> d){
ans = 0;
ans+=min(a,b);
ans+=min(c,d);
cout << ans << endl;
}
}
| #include<bits/stdc++.h>
using namespace std;
int main()
{
int i,n,a[5],b[5];
n=2;
for(i=0;i<n;i++)
{
cin>>a[i];
}
for(i=0;i<n;i++)
{
cin>>b[i];
}
sort(a,a+n);
sort(b,b+n);
cout<<a[0]+b[0]<<endl;
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
ll x,y;
cin >> x >> y;
ll ans;
// 1回目に符号を反転させる場合
ll A = 1 + y - (-x);
// 最後に符号を反転させる場合
ll B = (-y) - x + 1;
// 最初と最... | #include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitse... | 1 |
#include <iostream>
using namespace std;
int main(void){
int a,b;
cin>>a>>b;
if (a<b){
int tmp =a;
a=b;b=tmp;
}
int ans = a;
a--;
if (a<b){
int tmp =a;
a=b;b=tmp;
}
ans+=a;
cout<<ans;
}
| #include "iostream"
using namespace std;
int main(){
int a; int b;
cin>>a>>b;
if(a==b){
cout<<2*a<<endl;
}
else if(a>b){
cout<<a+(a-1)<<endl;
}
else{
cout<<b+(b-1)<<endl;
}
}
| 1 |
#include <bits/stdc++.h> //万能头文件
using namespace std;
int main()
{
string a;
int pos=0; //记录位置
cin>>a;
a=a+"D"; //为防止最后一个字母是"A",添加一个不是"C"的字母
while(1)
{
pos=a.find("A",pos); //find()函数查找位置
if(pos<0) //如果没找到，返回-1
{
cout<<"No"<<endl; //endl养成好习惯
break; //跳出循环
}
if(a[pos+1]=='C') //判断"... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;cin>>s;
int r=0;
for(int i=1;i<s.size();++i){
if(s[i]=='C'&&s[i-1]=='A'){r=1;break;}
}
cout<<(r?"Yes":"No");
} | 1 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
void abc_160a();
void abc_161a();
void abc_162a();
void abc_163a();
int main()
{
//abc_160a();
//abc_161a();
//abc_162a();
abc_163a();
}
void abc_160a()
{
string S;
cin >> S;
if (S[2] == S[3] && ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using i64 = int64_t;
using ll = long long;
int main() {
string S;
cin >> S;
int count = 0;
rep(i,3){
if(S.at(i) == 'R'){
count ++;
}
}
if(count == 2){
if(S.at(1) == 'S'){
count --;
}
}
co... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef struct _dot{
int x;
int y;
}Dot;
bool Check(vector<Dot> list,int Assumption[]){
for(int i=0;i<list.size();i++){
if(Assumption[list[i].x ] != list[i].y) return false;
}
return true... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
typedef pair<int,int> P;
const int MOD = 1000000007;
const ll INF = 1e10;
const double EPS = 1e-10;
cons... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int int64_t
#define double long double
#define nitro ios_base::sync_with_stdio(false);cin.tie(0);
#define vi vector<int64_t>
#define pub push_back
#define puf push_front
#define pob pop_back
#de... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
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; } return 0; }
const ll INF=1LL<<60;
const int inf=1<<30;
const int ... | 0 |
#include<iostream>
using namespace std;
int a[1000005];
int main(){
int k,i;
cin>>a[0]>>a[1]>>k;
for(i=0;i<k;i++){
a[!(i&1)]+=(a[i&1]>>=1);
}
cout<<a[0]<<" "<<a[1];
return 0;
} | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i =... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
//isPr... | #include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <map>
#include <tuple>
#include <cmath>
#include <cstdio>
#include <cassert>
#include <functional>
#define _LIBCPP_DEBUG 0
using namespace std;
int main(void){
int l,r;
cin >> l >> r;
int mi=2018*2018;
for (int i = l... | 0 |
#include <bits/stdc++.h>
using namespace std;
void solve(){
int n, x, ans=0;
map<int, int> mp;
cin >> n;
while(n--){
cin >> x;
if(!mp[x]){
mp[x]=1;
ans++;
}else mp[x]=0, ans--;
}
cout << ans << endl;
}
int main(){
solve();
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
int n;
cin >> n;
vector<int>a(n);
for(int i=0;i<n;i++){
cin >> a[i];
}
sort(a.begin(),a.end());
int ans=n;
for(int i=1;i<n;i++){
if(a[i-1]==a[i]){
ans-=2;
... | 1 |
#include <iostream>
using namespace std;
int num=0;
int liner_search(int x,int S[],int N){
int n=0;
while(n<N && S[n]!=x){
n++;
}
if(n<N){
++num;
return n;
}
else
return -1;
}
int main(){
int num1;
cin>>num1;
int a[num1];
for(int i=0;i<num1;i++)
cin>>a[i];
int num2;
cin>>num2;
int b[num2];
for... | #include <cstdio>
#include <cstdlib>
#define N 10000
#define Q 500
using namespace std;
int main(){
int *a,*b;
a = new int[N];
b = new int[Q];
int n,q;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf(" %d", &a[i]);
}
scanf("%d",&q);
for(int i=0;i<q;i++){
scanf(" %d", &b[i]);
}
int ans = 0;
for(int i=0;i... | 1 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
#define rep(i,n) for (ll i = 0; i < (ll)(n); ++i)
#define rrep(i,j,n) for(ll i = (ll)(j); i < (ll)(n); i++)
#define mrep(i,n) for (ll i = (ll)(n-1); i > 0; i--)
#define be(v) (v).begin(), (v).end()
#define sc... | 0 |
#include<cstdio>
#include<vector>
#include<algorithm>
#include<utility>
#include<numeric>
#include<iostream>
#include<array>
#include<string>
#include<sstream>
#include<stack>
#include<queue>
#include<list>
#include<functional>
#define _USE_MATH_DEFINES
#include<math.h>
#include<map>
#define SENTINEL 1000000001
#def... | #include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int maxn = 100 + 10;
int n, m, a[maxn];
int main() {
scanf("%d%d", &n, &m);
int cnt = 0;
for(int i = 1;i <= m;i ++) scanf("%d", &a[i]), cnt = cnt + ((a[i] & 1) ? (1) : (0));
if(cnt > 2) puts("Impossible");
else {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int func(int N){// 例: 11221213312, 12, 432, 8
if (N < 10) return N;
return func(N/10) + N % 10;
}
int main()
{
int n;
cin >> n;
int s = func(n);
if (n % s == 0){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for(int i=0; i < s.size()-1; i++) {
if(s.substr(i,2) == "AC"){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | 0 |
// 問題の URL を書いておく
//
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
//#define ENABLE_PRINT
#if defined(ENABLE_PRINT)
#define Print(v) \
do {\
c... | //#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, ... | 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int MAXN=100005;
int n,m;
int head[MAXN];
struct node
{
int from;
int to;
int next;
}edge[MAXN<<1];
int edge_cnt;
void add_edge(int fr,int to)
{
edge[++edge_cnt].from=fr;
edge[edge_cnt].to=to;
edge[edge_cnt].next=head[fr];
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long long N;
cin >> N;
vector<long long> s(N);
long long ans = 0;
for(int i = 0; i < N; i++){
long long a, b;
cin >> a >> b;
ans -= b;
s[i] = a + b;
}
sort(s.begin(), s... | 0 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <string>
#include <queue>
#include <iomanip>
#include <iterator>
#define MOD 1000000007
#define INF 1000000001
using namespace std;
typedef unsigned long long ull;
typedef long long ll... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define MOD 1000000007
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
//dp[i][j][k],i番目の高さで,左... | 1 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>
using namespace std;
type... | #include<cstdio>
#include<vector>
#include<numeric>
using namespace std;
int main()
{
int l[10],v[2];
while(~scanf("%d",l)){
for(int i=1;i<10;i++) scanf(",%d",l+i);
scanf(",%d,%d",v,v+1);
int len=accumulate(l,l+10,0);
vector<int> rail(len);
for(int i=0,cnt=0;i<10;i++){
for(int j=0;j<l[i];j++,cnt++){
... | 1 |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <iomanip>
#include <cassert>
#include <random>
#include <tuple>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2005;
const int mod = 1e9+7;
int fac[N],combi[N][N];
int add(int x,int y) {
int ret = ((x+y)%mod + mod)%mod;
return ret;
}
int mul(int x,int y) {
ll ret = (ll)x*y;
ret%=mod;
return ret;
}
int num[2];
int group[2];
int dp... | 1 |
#include <iostream>
#include <algorithm>
#include <numeric>
const int NUM = 10000;
using namespace std;
int main() {
int n, a[NUM];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cout << *min_element(a, a + n) << " "
<< *max_element(a, a + n) << " "
<< accumulate(a,... | #include<iostream>
#include<cstdio>
using namespace std;
int main(){
long long Min,Max,sum=0,n,m;
scanf("%lld%lld",&n,&Max);
Min=sum=Max;
for(int i=1;i<n;i++){
scanf("%lld",&m);
if(m>Max) Max=m;
if(m<Min) Min=m;
sum+=m;
}
printf("%lld %lld %lld\n",Min,Max,sum);
return 0;
}
| 1 |
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
typedef long long lint;
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(lint (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
const lint MOD =100000... | #include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) ... | 1 |
// F.
#include <iostream>
#include <sstream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
using namespace std;
typedef long long LL;
const int INF = 1 << 30;
int solve(vector<int> x, vector<int> y, vector<string> dir) {
int ans = INF;
int n = (int)x.size();
map<int, set<int>> a, b, v, h;
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i ++)
#define irep(i,n) for (int i = (int)(n) - 1;i >= 0;--i)
#define rep2(i,a,b) for (int i = (int)(a); i < (int)(b); ++i)
using namespace std;
using ll = long long;
using PL = pair<ll,ll>;
using P = pair<int,int>;
constexpr ll INF = 1000000000;
c... | 1 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define fi firs... | 0 |
#include<bits/stdc++.h>
#define rep(i,n)for(ll i=0;i<n;i++)
using namespace std;
typedef long long ll;
int cnt[50];
int main() {
int n, p;
while (scanf("%d%d", &n, &p), n) {
int k = p;
memset(cnt, 0, sizeof(cnt));
for (int i = 0;; i = (i + 1) % n) {
if (k == 1 && cnt[i] == p - 1) {
printf("%d\n", i);
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n,m;
while(cin>>n>>m&&!(n==0&&m==0)){
int scores[1001];
vector<int> comb;
for(int i = 0; i < n; i++){
cin>>scores[i];
}
scores[n]=0;
for(int i = 0; i < n+1; i++){
for(int j = 0; j < n+1; j++){
int ... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
//signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
cout << "2018";
for(int i = 4; i < s.size(); i++) cout << s[i];
cout << "\n... | #include <bits/stdc++.h>
using namespace std;
int main(){
string A;
cin >> A;
cout << 2018 << "/" << 0 << 1 << "/" << A.at(8) << A.at(9) << endl;
} | 1 |
#include <stdio.h>
#include <limits.h>
int main(){
int n,m,s,i,j;
scanf("%d%d",&n,&m);
int e[m+1][3],dist[m+1],update=1,k,d[200][200];
//printf("xxx");
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(i==j)d[i][j]=0;
else d[i][j]=INT_MAX;
}
}
for(i=0;i<m;i++){
for(j=0;j<3;j++){
scanf("%d",&e[i][j]);
}
d... | # define _CRT_SECUREj_NO_WARNINGS 1
# define _USE_MATH_DEFINES
# include <iostream>
# include <numeric>
# include <string>
# include <bitset>
# include <vector>
# include <algorithm>
# include <cstdlib>
# include <cstdio>
# include <cstring>
# include <cstdlib>
# include <iomanip>
# include <queue>
# include <sstream>
... | 1 |
#include<bits/stdc++.h>
using std::cout;
using std::cin;
using std::endl;
std::vector<std::string> split(const std::string &str, char sep)
{
std::vector<std::string> v;
std::stringstream ss(str);
std::string buffer;
while( std::getline(ss, buffer, sep) ) {
v.push_back(buffer);
}
return ... | #include<iostream>
#include<cstdio>
#define eps 10e-9
using namespace std;
int main()
{
int data[10],sum=0;
int v1,v2;
while(scanf("%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d",&data[0],&data[1],&data[2],&data[3],&data[4],&data[5],&data[6],&data[7],&data[8],&data[9],&v1,&v2)!=EOF)
{
sum=data[0];
... | 0 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=6100;
int n,mod,fac[N],inv[N],tot[4][N],invtot[4][N];
int p[N];
inline void add(int &a,int b){a=(a+b)%mod;}
inline void del(int &a,int b){a=(a-b+mod)%mod;}
inline void mul(int &a,int b){a=(a*b)%mod;}
inline int C(int n,int m){return fac[n]*... | #include <bits/stdc++.h>
using namespace std;
typedef long long Int;
typedef pair<Int,Int> PII;
typedef vector<int> VInt;
#define FOR(i, a, b) for(i = (a); i < (b); ++i)
#define RFOR(i, a, b) for(i = (a) - 1; i >= (b); --i)
#define EACH(it, a) for(auto it = (a).begin(); it != (a).end(); ++it)
#define CLEAR(a, b) mem... | 1 |
#include<bits/stdc++.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<string>
using namespace std;
set<string>mo;
int N,k;
bool use[15];
map<string,int>memo;
string n[10];
void g(int m,string a){
if(m==k){
memo[a]=1;
return;
}
for(int i=0;i<N;i++){
... | #include <stdio.h>
#include <stdlib.h>
int n,k,card[10],count;
int check[10001];
// used[i]==1ÈçÎ iÍgÁÄ¢é
// used[i]==1ÈçÎ card[i]ÍgÁÄ¢é
void func(int a[],int now)
{
int i,j,temp,keta=0,flg;
if(now == k){
char str[9];
for(i=0;i<k;i++){
temp=sprintf(str+keta,"%d",a[i]);
keta+=temp;
}... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<string> vec = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
int cnt = 0;
for (string x:vec) {
if (S == x) {
cout << 7 - cnt << endl;
} else {
cnt++;
}
}
... | #include <iostream>
#include <sstream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <cstring>
#include <bitset>
#include <functional>
#include <random>
#define REP(_i,_a,_n) for(int _i=_a;_i<=_n;++_i)
#define PER(_i,_a,_n) for(int _i=_... | 0 |
#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>;
int main() {
int n,ans;
cin >> n;
if (n <= 111) ans = 111;
else if (n <= 222) ans = 222;
else if (n <= 333) ans = 333;
else if (n <= 444) ans = 444;
else if (n <= 555) a... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
class dice {
public:
dice(int* a) {
set(a[0], a[1], a[2], a[3], a[4], a[5]);
}
dice(int& a, int& b, int& c, int& d, int &e, int& f) {
set(a, b, c, d, e, f);
}
void turn(int n) {
if (n < 4)
{
turndice(n);
return;
}
swit... | 0 |
#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;
//// < "D:\D_Download\Visual Studio 2015\Projects\programing_contest_c++\Debug\a.txt" > "D:\D_Downloa... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | 0 |
#include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
#include<map>
#define PRE std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
typedef long long ll;
const int Max = 1e6 + 5;
const int Mod = 1e9 + 7;
ll ls1[Max], ls2[Max],ls3[Max],sum[Max];
int main()
{
PRE;
int n;
ci... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | 1 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll mod = 1e9+7;
int main()
{
int n;
cin>>n;
vector<ll> a(n);
ll s1 = 0, s2 = 0;
for (int i=0; i<n; i++) {
cin>>a[i];
s1 += a[i];
s2 += (a[i] * a[i]);
s1 %= mod;
s2 %= mod;
}
ll res = (... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <utility>
#include <vector>
#include <cmath>
using namespace std;
#define INF 10000001
int main()
{
int a, n;
int maxi, mini;
int i;
long long sum = 0ll;
mini = INF;
maxi = -10000001;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d"... | 0 |
#include<bits/stdc++.h>
#define L long long
#define pb push_back
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define aa first
#define bb second
#define xx aa.aa
#define yy aa.bb
#define zz bb
#define mp make_pair
#define mpp(a,b,c) mp(mp(a,b),c)
using namespace std;
int n;
L p,q;
inline void dfs(L x,L ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,l;
cin>>n;
if(n%3 == 0){
cout<<n/3<<'\n';
}
else{
cout<<n/3<<'\n';
}
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
signed main(void){
string s;
while(getline(cin,s)){
while(s.find("this")==s.npos&&s.find("that")==s.npos&&s.find("the")==s.npos)
for(int i=0;i<(int)s.length();i++){
if(s[i]>'z'||s[i]<'a')continue;
if(s[i]!='z')s[i]++;
else s[i]='a';
}
cout<<s<<endl;
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RA... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define per(i, n) for (int i = (int)(n - 1); i > -1; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void solve()
{
int d, g;
cin >> d >> g;
vector<int> p(d), c(d);
rep(i, d) cin >> p[i] >> c[i];
... | #include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<list>
#include<cstdint>
#include<bits/stdc++.h>
#include<queue>
#include<set>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for(int i = n-1; i >= 0; i--)
#define rep1(i, n) for(... | 0 |
// review
#include <iostream>
using namespace std;
int n, m;
void solve() {
int second = m & 1 ? m + 1 : m + 2;
int cnt = 1;
int cnt2 = 0;
for (int i=0;i<m;i++) {
if (i < m / 2) {
cout << cnt << " " << (second - cnt) << endl;
cnt++;
} else {
cout << cnt2 + second << " " << (2 * m + ... | // skip until line 65
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <istream>
#include <iterator>
#include <sstream>
#include <list>
#include <map>
#include <numeric>
#include <ostream>... | 1 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #include <cstdio>
int h, w, dx[] = {0,0,-1,1}, dy[] = {1,-1,0,0};
long long a, b, ans;
char s[405][405], t;
void dfs(int x, int y){
char t;
((t = s[x][y]) == '#' ? a : b)++;
s[x][y] = 0;
for(int i = 0; i < 4; i++) if((s[x+dx[i]][y+dy[i]] | t) > t) dfs(x+dx[i], y+dy[i]);
}
int main(){
scanf("%d %d\n", &h, &... | 1 |
#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... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i = 0; i < (n) ; ++i)
#define orep(i,n) for(long long i = 1; i <= (n); ++i) // one rep
#define drep(i,n) for(long long i = (n)-1; i >= 0; --i) // down rep
#define srep(i,s,t) for(long long i = (s); i < (t); ++i) // set rep
#define rng(x) (x).begin(),(x)... | #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 ll int64_t
#define _GLIBCXX_DEBUG
int main() {
int n;
cin >> n;
vector<pair<int,int>> a(n);
vector<pair<int,int>> b(n);
rep(i,n)
cin >> a[i].second >> a[i].first;
... | 0 |
#include <stdio.h>
int main () {
int a,b;
int tampung = 1;
scanf("%d", &a);
scanf("%d", &b);
for ( int i = 0 ; i < a; i++) {
if (tampung <= b) {
tampung *= 2;
} else {
tampung += b;
}
}
printf ("%d\n", tampung);
return 0;
} | # include <bits/stdc++.h>
# define sz(x) (int)((x).size())
# define F first
# define S second
# define pb push_back
# define ub upper_bound
# define lb lower_bound
# define all(x) x.begin(), x.end()
# define pqueue priority_queue
# define mset multiset
# define umap unordered_map
# define Speed() ios_base::sync_with_st... | 0 |
#include<iostream>
#include<vector>
#include<utility>
#include<map>
#include<algorithm>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
map<string, int>ma;
string tmp;
for (int i = 0; i < N; i++) {
cin >> tmp;
ma[tmp]++;
}
int M;
cin >> M;
for (int i = 0; i < M; i++) {
cin ... | #define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <list>
#include <algorithm>
#include <functio... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
using lli = long long int;
template <typename T>
vector<T> read_vector(int n) {
vector<T> result(n);
for (auto& a : result) cin >> a;
return result;
}
template <typename T>
vector<T> read_vector() {
int n;
cin >> n;
return ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[214514];
int main() {
ll n;
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
ll ans=0;
if(a[0]!=0)cout<<-1<<endl;
else{
ll cnt=1;
for(int i=1;i<=n;i++){
if(a[i]==a[i-1])cnt++;
else if(a[i]>a[i-1]){
if(a[i]-a[i-1]>1){
cout<<-1<<endl;... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <random>
#include <ctime>
#include <map>
#include <queue>
#include <functional>
using namespace std; using ll=long long; using P=pair<ll,ll>; const int INF=1e9; const ll LNF=1e18;
int main(){
int n; cin>>n;
string s; cin>>s;
bool ok = false;... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1000000010
#define N 2000010
#define P 1000000007
char getc(){char c=getchar();while ((c<'A'||c>'Z')&&(c<'a'||c>'z')&&(c<'0'||c>'9')) c=getchar();return c;}
int gcd(int n,int m){return m==0?n:gcd(m,n%m);}
int read()
{
int x=0,f=1;char c=getc... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define vll vector<ll>
#define vvl vector<vector<long long>>
#define vvi vector<vector<int>>
#define vvb vector<vector<bool>>
#define vb vector<bool>
#define vpli vector<pair<long long, int>>
#define vs vecto... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
const int N = 1e5+34;
int a[N];
void solve() {
int n; scanf("%d", &n);
int s... | 0 |
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <utility>
#include <cstring>
#define NOT_DEFINED 2
#define NORMAL 1
#define IRREGULAR 0
using namespace std;
typedef struct {
int battery;
int motor;
int cable;
bool hasSucceeded;
} Query;
struct IsSuccess {
bool operat... | #include <cstdio>
#include <algorithm>
using namespace std;
int a, b, c, N, i[1000], j[1000], k[1000], r[1000], h[301];
int main(){
while(scanf("%d%d%d", &a, &b, &c), a+b+c){
scanf("%d", &N);
for(int x = 0; x < N; x++){
scanf("%d%d%d%d", i+x, j+x, k+x, r+x);
}
fill(h, h... | 1 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <list>
#include <algorithm>
#include <functional>
#include <sstream>
#include... | #include<bits/stdc++.h>
using namespace std;
using i64 = long;
struct BitVector
{
vector<uint64_t> v;
vector<int> r;
BitVector(){}
void build(){
r.assign((int)v.size() + 1, 0);
for(int i = 0; i < (int)v.size(); ++i)
r[i + 1] = r[i] + __builtin_popcountll(v[i]);
}
bool access(int x){
return... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;cin>>n>>k;
int ans = 0; if (n%k > 0) ans++;
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
if(N % K == 0){
cout << "0" << endl;
}else{
cout << "1" << endl;
}
return 0;
} | 1 |
#include <algorithm>
#include <cstdio>
static const size_t n_max = 200000;
static int S[n_max], L[n_max], R[n_max];
static long long c = 0;
void merge_sort(size_t i, size_t j) {
switch (j - i) {
case 0:
case 1:
break;
case 2:
if (S[i+1] < S[i]) {
c++;
std::swap(S[i], S[i+1]);... | #include <bits/stdc++.h>
#define INF INT_MAX
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(ll i=0; i<n; ++i)
#define FOR(i, s, e) for(ll i=s; i<e; ++i)
#define MOD 1000000007
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if(a>b) {a=b; return true;} return false;}
temp... | 0 |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int k[101];
char s[101];
int main() {
vector<char>v;
for (char c = 'a'; c <= 'z'; c++)v.push_back(c);
for (char c = 'A'; c <= 'Z'; c++)v.push_back(c);
int n;
while (scanf("%d", &n), n) {
rep(i, n)scanf("%d", &k[i]);
scanf("%s", ... | #include <iostream>
#include <string>
using namespace std;
#define KEY_NUM 100
char process_key(char c, int key) {
int num=0;
//cout << "[" << c << "," << key << "," << num << "]";
if ('a' <= c && c <= 'z') {
num = 25 - (int)('z' - c);
}
if ('A' <= c && c <= 'Z') {
num = 51 - ... | 1 |
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <utility>
#include <stack>
#include <queue>
#include <set>
#include <list>
#include <bitset>
#include <array>
using namespace std;
#define fi first
#define s... | #include<bits/stdc++.h>
#define rg register
#define oo 0x7fffffff
#define ll long long
using namespace std;
inline int read()
{
int out=0,fh=1;
char jp=getchar();
while ((jp>'9'||jp<'0')&&jp!='-')
jp=getchar();
if (jp=='-')
{
fh=-1;
jp=getchar();
}
while (jp>='0'&&jp<='9')
{
out=out*10+jp-'0';
... | 1 |
#include <iostream>
#include <bits/stdc++.h>
#include <string>
#include <ctype.h>
#include <algorithm>
#include <cmath>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define square(x) (x) * (x)
#define cube(x) (x) * (x) * (x)
const int INF = 1e9;
using namespace std;
class dice{... | #include <stdio.h>
struct Dice
{
int n[6];
};
Dice InputDice()
{
Dice d;
for(int i = 0; i < 6; ++i)
{
scanf("%d", &d.n[i]);
}
return d;
}
Dice SetDice(int a, int b, int c, int d, int e, int f)
{
Dice dice;
dice.n[0] = a;
dice.n[1] = b;
dice.n[2] = c;
dice.n[3] = d;
dice.n[4] = e;
dice.n[5] = f;
r... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=100001,INF=1<<30;
vector<int> S[MAX],color(MAX,0),odd,even;
void DFS(int u){
int cnt=1;
bool ok=true;
stack<int> ST;
color[u]=1;
ST.push(u);
while(!ST.empty... | #include<bits/stdc++.h>
#define mo 1000000007
using namespace std;
long long read(){
long long xx=0,flagg=1;
char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-')
ch=getchar();
if(ch=='-'){
flagg=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
xx=xx*10+ch-'0';
... | 1 |
#include <bits/stdc++.h>
using namespace std;
// types
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
// macros
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#define ... | #include<bits/stdc++.h>
using namespace std;
namespace FAST_IO
{
template<typename T> void read(T &a)
{
a=0;
int f=1;
char c=getchar();
while(!isdigit(c))
{
if(c=='-')
{
f=-1;
}
c=getchar();
}
while(isdigit(c))
{
a=a*10+c-'0';
c=getchar();
}
a=a*f;
}
template <typename T> v... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main ()
{
int k,x;
cin >> k >> x ;
for(int i=1; i<k*2; i++){
cout << x-k+i << " " << flush;
}
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include "E:\CP\Debugger\debugger.h"
#else
#define debug(x...)
#endif
#define int long long
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define TC int tc; cin>>tc; for(int cn=1; cn<=tc; ++cn)
const int mx = 2e6+2, neg = -1e6, pos = 1e... | 1 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
string s;
cin >> s;
int a = (s[0] - '0');
int b = (s[1] ... | #include<bits/stdc++.h>
using namespace std;
int main(){
string input;
int tmp = 0;
char op[3] = {'+','+','+'};
cin >> input;
for(int bit = 0; bit < (1<< 3); bit++){
tmp = 0;
for(int i = 0;i<3;i++){
if(bit & (1 << i)){
op[i] = '-';
t... | 1 |
// lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
swap(a,b);
swap(a,c);
cout<<a<<" "<<b<<" "<<c;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
//const ll mod=998244353;
const ll inf=1LL<<61;
int main() {
ll n;
string s;
cin >> n >> s;
for(ll j=0;j<4;j++) {
vec a(n);
a[0]=j&1;
a[1]... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<int, int>;
ll GCD(ll a, ll b) { retur... | 1 |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>
using namespace std;
int main()
{
string s;
for (; getline(cin, s); )
{
stringstream... | #include <stdio.h>
int main(void){
int n, a[100], i, j;
char c, s[53] = {"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"};
while(1){
scanf("%d",&n);
if(!n) break;
for(i = 0;i < n;i++)
scanf("%d",&a[i]);
getchar();
for(i = 0;(c = getchar()) != '\n';i++){
for(j = 0;j < 52;j++){
if(s[j] == c... | 0 |
#include <iostream>
#include <string>
#include <cstdio>
using namespace std;
int main(){
string s;
int n;
cin >> n;
getchar();
for (int i = 0; i < n; i++){
getline(cin,s);
while (1){
int index = s.find("Hoshino");
if (index == -1) break;
s.replace(index,7,"Hoshina");
}
cout << s << endl;
}
retu... | #include<iostream>
#include<string>
using namespace std;
int main(){
string S;
cin>>S;
if(S[0]!='A'){
cout<<"WA";
return 0;
}
bool Cflag=0;
if('a'<=S[1]&&S[1]<='z'){
}
else{
cout<<"WA";
return 0;
}
for(size_t i=2;i<=S.length()-2;i++){
if(S[i]=='C'){
if(Cflag=... | 0 |
#define alphanso \
ios_base::sync_with_stdio(0); \
cin.tie(NULL)
#include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
int main()
{
alphanso;
int n, k, i, gcd = 0, x, mx = INT_MIN;
cin >> n >> k;
for (i = 1; i <= n; i++)
{
cin >> x;
gcd = __gcd(gcd, x);
mx = max(mx,... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | 0 |
#include <stdio.h>
int main(){
int n;
scanf("%d", &n);
long long int total = 0;
for (int i = 1; i <= n; i++){
if (i % 3 != 0 && i % 5 != 0){
total += i;
}
}
printf("%lld", total);
} | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | 0 |
#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;
int n,a[1010][1010],h[1000100],dist[1000100];
vector<int>to[1000100];
int encode(int i, int j){
if(i>j)swap(i,j);
return i*n+j;
}
int main(){
cin>>n;
rep(i,n)rep(j,n-1){
... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#include <iostream>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <bitset>
#include <complex>
#include <array>
#include <l... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int,int>;
const long long INF = 1ll << 60;
int main() {
int a,b,c,d;
cin >> a >> b >>c >>d;
int ans = min(a,b) + min(c,d);
cout << ans << endl;
return 0;
}
|
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <unordered_map>
#include <climits>
#include <set>
#include <unordered_set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility... | 0 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using std::cin;
using std::cout;
using std::endl;
struct data_t {
int height;
int width;
int dia;
bool operator<( const data_t& right) const {
if (dia == right.dia) {
return (height < right.height);
}
else {
return ((dia == r... | /*
My heart’s beating faster
I know what I’m after
I’ve been standing here my whole life
Everything I’ve seen twice
Now it’s time I realized
It’s spinning back around now
On this road I’m crawlin’
Save me 'cause I’m fallin’
Now I can’t seem to breathe right
'Cause I keep runnin' runnin' runnin' runnin'
Runnin' runnin... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | #include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000
template <typename T,typename U>
struct compressor{
vector<pair<T,U>> v;
void add(T x,U y){
v.emplace_back(x,y);
}
void compress(bool stable = false){
if(stable){
stabl... | 0 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | #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 a, b;
cin >> a >> b;
if (a < 9 && b < 9) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
vector<vector<pair<int,int>>> G(20);
int main(){
int n;
cin>>n;
rep(i,n){
int a;
cin>>a;
... | #include <bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
if (N == 1){
cout << 1 << endl;
return 0;
}
vector<int>A(N);
vector<vector<vector<int>>> data(N, vector<vector<int>>(N, vector<int>(2)));
for (int i = 0; i < N; i++) {
cin >> A.at(i);
for (int j = 0; j < ... | 1 |
#include <iostream>
using namespace std;
struct Node {
Node *parent;
Node *left;
Node *right;
int key;
};
Node *NIL, *root;
void init() {
root = NIL;
}
void insert(int key) {
Node *y = NIL;
Node *x = root;
while (x != NIL) {
y = x;
if (key < x->key) {
x = ... | #pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
const ll MOD = 1'000'000'007LL; /*998'244'353LL;*/
#define pb push_back
#define mp make_pa... | 0 |
#include <cstdio>
#include <algorithm>
const int N = 6e3+5;
int n, P, f[N][N<<1], ans; void fix(int &x) { x<P?0:x-=P; }
int main()
{
scanf("%d%d", &n, &P), n *= 3, f[0][N] = 1;
for(int i = 0; i < n; ++i) for(int j = -i; j <= i; ++j)
fix(f[i+1][j+1+N]+=f[i][j+N]),
fix(f[i+2][j-1+N]+=f[i][j+N]*(i... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(ll)n;++i)
set<ll> primeFactorization( ll n ){
set<ll> a = {1};
while( n != 1 ){
ll root = (ll)sqrt(n);
for(ll i=2;i<=n;++i){
if( i > root ){
a.insert(n);
n /= n;
break;
}
... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.