1 solutions
-
0
C :
#include<stdio.h> int n,m,sum; int work(int n,int m) { return n==0 ?(sum=m+1):(sum=work(n-1,m)*2); } int main() { scanf("%d%d",&n,&m); work(n,m); printf("%d",sum); return 0; }
C++ :
#include<iostream> #include<cstdio> using namespace std; int n,m; int move(int,int); int main() { cin>>n>>m; cout<<move(n,m)<<endl; return 0; } int move(int s,int y) { if(s==0) return y+1; return 2*move(s-1,y); }
Pascal :
var n,m:int64; begin readln(n,m); writeln((m+1) shl n); end.
- 1
Information
- ID
- 626
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By