Online Judge
| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 12371 | 陈颖钧 | 汉诺塔的移动次数 | C++ | Wrong Answer | 0 | 1 MS | 260 KB | 225 | 2025-07-10 17:09:59 |
Tests(0/1):
#include<bits/stdc++.h> using namespace std; int n,i; int p(int n){ int sum=0,a=2; while(a<n){ if(n%a==0){ sum++; } } return sum; } int main(){ cin>>n; cout<<n*2+1; }