We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent cddea54 commit 059a6eeCopy full SHA for 059a6ee
BIT/basic.cpp
@@ -0,0 +1,27 @@
1
+#include <bits/stdc++.h>
2
+using namespace std;
3
+typedef long long ll;
4
+const int mod = 1e9 + 7;
5
+const int N = 1e5 + 5;
6
+
7
+void solve(){
8
+ // int n,p;cin>> n>>p;
9
+ // int product=1;
10
+ // for(int i=1;i<=p;i++){
11
+ // product=product*n;
12
+ // }
13
+ // cout << product << endl;
14
15
+ long long int number;
16
+ // 2^31 =2147483648 this value is not print as it is out of range int value;
17
18
+ // so if 2^31-1 value stored then it is worked
19
+ cin >> number;
20
+ cout <<number << endl;
21
+}
22
23
+int main() {
24
+ ios_base::sync_with_stdio(0);
25
+ cin.tie(0);
26
+ solve();
27
0 commit comments