1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21

#include<bits/stdc++.h>
using namespace std;
long long n,t;
int main(){
	cin>>t;
	long long a[32];
	for(long long i=1;i<=30;i++){
		a[i] = (1<<i) - 1;
	}
	while(t--){
		cin>>n;
		for(long long i=2;i<=30;i++){
			if((double)n/a[i] == n/a[i]){
				cout<<n/a[i]<<endl;
				break;
			}
		}
	}
	
	return 0;
}

1

print(int(input())*2*3.14159265)

1
2
3
4
5
6
7

n,m = map(int , input().split())
a = list(map(int , input().split()))
s = sum(a)
if n>=s:
    print(n-s)
else:
    print(-1)

1
2
3
4

t=int(input())
for i in range(t):
    n=int(input())
    print((int)((n-1)/2))

1
2
3
4
5

s = input()
if '7' in list(s):
	print('Yes')
else:
	print('No')

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29

#include<bits/stdc++.h>
using namespace std;
int main(){
	//freopen("in.txt","r",stdin);
	int t,a,b,c,d;
	cin>>t;
	while(t--){
		cin>>a>>b>>c>>d;
		if(b>=c || d<=0) cout<<-1<<endl;
		else{
			int num=0;
			int cx=c;
			bool me=true;
			while(a>0){
				if(me){
					cx-=b; me^=1;
				}
				else{
					a-=d;me^=1;
				}
				if(cx<=0) {
					cx=c;num++;me=true;
				}
			}
			if(num>10000) cout<<-1<<endl;else cout<<num<<endl;
		}
	}
	return 0;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10

#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<<endl;
	return 0;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18

#include<bits/stdc++.h>
using namespace std;
int t;
int a,b,c,d,x,y,x1,y1,x2,y2;
bool ok;
int main(){
	//freopen("input.txt","r",stdin);
	cin>>t;
	while(t--){
		ok=true;
		cin>>a>>b>>c>>d>>x>>y>>x1>>y1>>x2>>y2;
		if( (a-b>=0 and x-x1<a-b) or (b-a>0 and x2-x<b-a) or (c-d>0 and y-y1<c-d) or (d-c>0 and y2-y<d-c) or 
		(a==b and a!=0 and x1==x and x2==x) or (c==d and c!=0 and y1==y and y2==y) )
		ok = false;
		if(ok) puts("yes"); else puts("no");
	}
	return 0;
}