atestat-programare

24
Problema 1 #include <iostream> using namespace std; int i,n; int palindrom(int x) { int c,nou=0,cp; cp=x; while(x>0) { c=x%10; x=x/10; nou=nou*10+c; } if(cp==nou) return 1; else return 0; } int main() { cin>>n; for(i=1;i<=n;i++) if(palindrom(i)) cout<<i<<" "; return 0; }

description

bhg

Transcript of atestat-programare

Problema 1#include using namespace std;int i,n;int palindrom(int x){int c,nou=0,cp;cp=x;wile(x>0){c=x!10;x=x"10;nou=nou#10$c;%i&(cp==nou)return 1;else return 0;%int main(){cin>>n;&or(i=1;i&(cp!s==0)nr$$;%g>x;&or(i=1;i>x;o+=1;&or(d=(;d