Solving 101

Posts

URI problem "1180 - Lowest Number and Position" solution

#include<stdio.h> int main() { int n,i,p,j,min=99999,count=0; scanf("%d",&n); int x[n]; for(i=0; i<n; i++) { scanf("%d",&x[i]); } for(j=0; j<n; j++) { if(min>x[j]) { min=x[j]; p=j; } } printf("Menor valor: %d\n",min); printf("Posicao: %d\n",p); return 0; }

URI problem "1178 - Array fill III" solution

#include<stdio.h> int main() { double x; int n[100],i; scanf("%lf",&x); for(i=0; i<100; i++) { n[i]=x; printf("N[%d] = %.4lf\n",i,x); x=x/2; } return 0; }

URI problem "1177 - Array fill II" solution

#include<stdio.h> int main() { int t,n[1000],i,k=0; scanf("%d",&t); if(t>=2&&t<=50) { for(i=0; i<1000; i++) { if(k==t) k=0; n[i]=k; printf("N[%d] = %d\n",i,k); k++; } } return 0; }

URI problem "1151 - Easy Fibonacci" solution

#include<stdio.h> int main() { int i,f1=0,f2=1,next,n; scanf("%d",&n); for(i=0;i<n-1;i++) { if(i<=1) { next=i; } else { next=f1+f2; f1=f2; f2=next; } printf("%d ",next); } printf("%d\n",next+f1); return 0; }

URI problem "1175 - Array change I" solution

#include<stdio.h> int main() { int i,N[20]; for(i=0; i<20; i++) { scanf("%d",&N[i]); } for( i=0; i<20; i++) { printf("N[%d] = %d\n",i,N[19-i]); } return 0; }

URI problem "1174 - Array Selection I" solution

#include<stdio.h> int main() { int i; double A[100]; for(i=0;i<100;i++) { scanf("%lf",&A[i]); if(A[i]<=10) { printf("A[%d] = %.1lf\n",i,A[i]); } } return 0; }