Instantly share code, notes, and snippets.

# Joemmanuel Poncejoemmanuel

• Sort options
Created Nov 23, 2013
Solución a Plantas Vs Plantas, por charlyhlms
View plantas-vs-plantas-charlyhlms.cpp
 #include #include using namespace std; int A[1000002]; int pila[1000002]; int cuantos[1000002]; int n; int fin;
Created Oct 8, 2013
View bety-sleepensarethebest.cpp
 #include #include using namespace std; int height, width, movs, opnum, opin; int ops[10], board[105][105], nboard[105][105]; void adjust() {
Created Oct 8, 2013
Solución de subprimos de diego_futbolm
View subprimos-diego_futbolm.cpp
 #include #include #include using namespace std; bool esprimo[100005]; int fact[100005], n; bool es_primo(int n) { int si; si = 1;
Last active Dec 24, 2015
Solución de spleensarethebest a Super Nieves Bros
View supernievesbros-bfs.cpp
 #include #include #include using namespace std; struct coord { int x, y; }np;
Created Sep 30, 2013
Solución de charlyhlms a Super Nieves Bros.
View supernieves-bt.cpp
 #include using namespace std; int vis[102][102]; int color; int n, m; int xf, yf; char mapa[102][102];
Created Sep 30, 2013
Solución de spleensarethebest al concierto del Dr.Lira
View conciertolira.cpp
 #include #include using namespace std; int songs, iniv, maxim; int slist[55], dp[50005][55]; int main() {
Created Sep 17, 2013
View patos.cpp
 #include #include using namespace std; int arr[50]; int n,i,a,b,c; int main() { scanf("%d",&n); for (i=0;i
Last active Dec 23, 2015
View bisiesto.cpp
 #include int main(){ int year,casos; scanf("%ld",&casos); while(casos>0){ scanf("%ld",&year); if (((year % 4)==0) && ((year % 100)!=0 || (year % 400)==0)) printf("S\n"); else printf("N\n");
Created Sep 17, 2013
View amayusculas.cpp
 #include #include int main () { int i=0; char str[500],c; gets(str); while (str[i]) { c=str[i];
Created Sep 17, 2013
View sumas-64.cpp
 #include int main() { long long a,b; long long c; scanf("%lld %lld", &a,&b); c = a+b; printf("%lld", c); }
You can’t perform that action at this time.